A hint-based file locating & routing mechanism was proposed to improve the performance of peer-to-peer file sharing systems. The framework was based on the Freenet document routing model with file location hints to enhance the performance of file searching and downloading. Experiment shows that the proposed mechanism improves the system performance by saving disk space, as well as reduces file ...

in the case of hazardous materials management, selected routes for carrying hazardous materials (i.e.,hazmat) have significant effects on locating hazmat distribution centers. since, risk and cost are usuallyconsidered as two main attributes to determine the best routes, optimized locations are sequentially outlineddepending on selected routes. in the present paper, two different approaches of ...

A capacitated location-routing problem (CLRP) is one of the new areas of research in distribution management. It consists of two problems; locating of facilities and routing of the vehicle with a specific capacity. The purpose of the CLRP is to open a set of stores, allocate customers to established deposits, and then design vehicle tours in order to minimize the total cost. In this paper, a ne...

Querying a PDMS means either flooding the network with messages to all peers or taking advantage of a routing mechanism to reformulate a query only on the best peers selected according to some given criteria. As reformulations may lead to semantic approximations, we deem that such approximations can be exploited for locating the semantically best directions to forward a query to. In this paper,...

Adaptive Routing is the progression of locating a clear path from a source point to a destination point across a network of nodes that could amend at any point. Mostly, Adaptive Routing algorithms make sure that data packets can move from one point in the network to another, even if one or more nodes in between are unavailable. To overcome the poor delay performance and complexities arise while...

This paper presents three broad classes of network architecture that support discovery of information sources. Relevant concepts such as query routing and the extraction, propagation, and retrieval of metadata are deened. Based on these concepts, diierent models of locating and querying relevant information sources are presented. Finally, we estimate several important characteristics of these m...

We introduce the Partitioning-Hub-Location-Routing Problem (PHLRP), a hub location problem involving graph partitioning and routing features. The PHLRP consists of partitioning a given network into sub-networks, locating at least one hub in each sub-network and routing the traffic within the network at minimum cost. This problem finds applications in deployment of an Internet Routing Protocol c...

To promise low energy consumption for wireless sensor network routing, a number of routing protocols have been published. A novel routing protocol called BeamStar was proposed in [6]. In BeamStar, each base station uses a directional antenna with power control to assist locating sensors. It shifts the burden of network control and management from resource-limited sensors to resource-abundant an...

This paper considers the problem of locating and forwarding network traffic to any one of a set of distributed servers or service points—primarily in the context of mobile ad hoc networks. The advantages of providing such a capability in mobile networks through the use of anycast routing techniques at the network layer are discussed. The results of a simulation study are highlighted to demonstr...

One of the main issues of Mobile IPv6 is handover latency that causes service disruption time. Although plenty of proposals significantly reduce the service disruption time, they suffer from redundant routing that causes packet misordering and bandwidth consumption during the process of interdomain handover. In this paper, we propose a new scheme that minimizes the redundant routing during the ...