Topic
Geographic routing
About: Geographic routing is a research topic. Over the lifetime, 11687 publications have been published within this topic receiving 302224 citations.
Papers published on a yearly basis
Papers
More filters
••
06 Jun 1994TL;DR: The authors present a study on multicast routing algorithms for the self-routing multistage networks based on the use of the cube concept which consists of a group of outlets reachable in one pass through the network.
Abstract: The authors present a study on multicast routing algorithms for the self-routing multistage networks. This work is based on the use of the cube concept which consists of a group of outlets reachable in one pass through the network. A multicast connection is decomposed into associated cubes such that each cube can be self-routed through the network. The context of this work is a recursive scheme for multistage network where the outlets are fed back to the inlets through external links. Three routing algorithms are proposed. The emphasis is on evaluating the performance of those algorithms in terms of two metrics. Extensive results from analysis and simulations are given to derive insights into the performance of the proposed routing algorithms. >
74 citations
••
TL;DR: Evaluation results for several different tapologies and message distributions show that the new routing algorithms are able to increase throughput for random traffic by a factor of up to 4 with respect to the original up*/down* algorithm, also reducing latency significantly.
Abstract: Networks of workstations are rapidly emerging as a cost-effective alternative to parallel computers. Switch-based interconnects with irregular topology allow the wiring flexibility, scalability, and incremental expansion capability required in this environment. However, the irregularity also makes routing and deadlock avoidance on such systems quite complicated. In current proposals, many messages are routed following nonminimal paths, increasing latency and wasting resources. In this paper, we propose two general methodologies for the design of adaptive routing algorithms for networks with irregular topology. Routing algorithms designed according to these methodologies allow messages to follow minimal paths in most cases, reducing message latency and increasing network throughput. As an example of application, we propose two adaptive routing algorithms for ANI (previously known as Autonet). They can be implemented either by duplicating physical channels or by splitting each physical channel into two virtual channels. In the former case, the implementation does not require a new switch design. It only requires changing the routing tables and adding links in parallel with existing ones, taking advantage of spare switch ports. In the latter case, a new switch design is required, but the network topology is not changed. Evaluation results for several different tapologies and message distributions show that the new routing algorithms are able to increase throughput for random traffic by a factor of up to 4 with respect to the original up*/down* algorithm, also reducing latency significantly. For other message distributions, throughput is increased more than seven times. We also show that most of the improvement comes from the use of minimal routing.
74 citations
••
01 Dec 2010
TL;DR: The conducted investigation shows that the proposed infrastructure-assisted routing approach achieves its objectives, and reduces the routing overhead compared to other greedy position-based geo-routing protocols.
Abstract: Cooperative vehicular systems require the design of reliable and efficient multi-hop networking protocols to achieve their foreseen benefits. Although many geo-routing protocols have been proposed in the literature, few contributions have analysed the benefits that road side infrastructure units could provide to successfully route data from source to destination. In this context, this paper proposes a novel infrastructure-assisted routing approach designed to improve the end-to-end performance, range and operation of multi-hop vehicular communications by exploiting the reliable interconnection of infrastructure units. The conducted investigation shows that the proposed infrastructure-assisted routing approach achieves its objectives, and reduces the routing overhead compared to other greedy position-based geo-routing protocols. Finally, the paper shows that to obtain the maximum benefits from the proposed infrastructure-assisted routing approach, optimal infrastructure deployment strategies must be further investigated.
74 citations
••
TL;DR: A new adaptive routing algorithm built upon the widely studied back-pressure algorithm is developed by decouple the routing and scheduling components of the algorithm by designing a probabilistic routing table that is used to route packets to per-destination queues.
Abstract: Back-pressure-based adaptive routing algorithms where each packet is routed along a possibly different path have been extensively studied in the literature. However, such algorithms typically result in poor delay performance and involve high implementation complexity. In this paper, we develop a new adaptive routing algorithm built upon the widely studied back-pressure algorithm. We decouple the routing and scheduling components of the algorithm by designing a probabilistic routing table that is used to route packets to per-destination queues. The scheduling decisions in the case of wireless networks are made using counters called shadow queues. The results are also extended to the case of networks that employ simple forms of network coding. In that case, our algorithm provides a low-complexity solution to optimally exploit the routing-coding tradeoff.
74 citations
••
01 May 2007TL;DR: This work presents a distributed landmark selection algorithm that does not rely on global clock synchronization, and a companion local greedy landmark-based routing scheme that guarantees packet delivery in the continuous domain and works with asymmetric links.
Abstract: We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm that does not rely on global clock synchronization, and a companion local greedy landmark-based routing scheme. We assume no node location information, and that each node can communicate with some of its geographic neighbors. Each node is named by its hop count distances to a small number of nearby landmarks. Greedy routing at a node is performed to equalize its vector of landmark distances to that of the destination. This is done by following the shortest path to the landmark that maximizes the ratio of its distances to the source and the destination. In addition, we propose a method to alleviate the difficulty in routing to destinations near the boundaries by virtually expanding the network boundaries. The greedy routing, when combined with our landmark selection scheme, has a provable bounded path stretch relative to the best path possible, and guarantees packet delivery in the continuous domain. In the discrete domain, our simulations show that the landmark selection scheme is effective, and the companion routing scheme performs well under realistic settings. Both the landmark selection and greedy routing assumes no specific communication model and works with asymmetric links. Although some of the analysis are non-trivial, the algorithms are simple, flexible and cost-effective enough to warrant a real-world deployment.
74 citations