Topic
Equal-cost multi-path routing
About: Equal-cost multi-path routing is a research topic. Over the lifetime, 10472 publications have been published within this topic receiving 249362 citations.
Papers published on a yearly basis
Papers
More filters
06 Jan 2003
TL;DR: Experiments demonstrate that adding link breakage prediction to DSR can significantly reduce the total number of dropped data packets and the proactive route maintenance does not cause significant increase in average packet latency and average route length.
Abstract: Most existing on-demand mobile ad hoc network routing protocols continue using a route until a link breaks. During the route reconstruction, packets can be dropped, which will cause significant throughput degradation. In this paper, we add a link breakage prediction algorithm to the dynamic source routing (DSR) protocol. The mobile node uses signal power strength from the received packets to predict the link breakage time, and sends a warning to the source node of the packet if the link is soon-to-be-broken. The source node can perform a pro-active route rebuild to avoid disconnection. Experiments demonstrate that adding link breakage prediction to DSR can significantly reduce the total number of dropped data packets (by at least 20%). The tradeoff is an increase in the number of control messages by at most 33.5%. We also found that the proactive route maintenance does not cause significant increase in average packet latency and average route length. Enhanced route cache maintenance based on the link status can further reduce the number of dropped packets.
69 citations
17 Jun 2015
TL;DR: In this article, the authors propose a simple approach to realize the vision of a flexible, high-performance fabric: the network should expose every possible path, allowing a controller or edge device maximum choice.
Abstract: An emerging architecture for software-defined data centers andWANs is the network fabric, where complex application-sensitive functions are factored out, leaving the network itself to provide a simple, robust high-performance data delivery abstraction. This requires performing route optimization, in real time and across a diverse choice of paths. A large variety of techniques have been proposed to provide path diversity for network fabrics. But, running up against the constraint of forwarding table size, these proposals are topology-dependent, complex, and still only provide limited path choice which (we show) can impact performance.We propose a simple approach to realize the vision of a flexible, high-performance fabric: the network should expose every possible path, allowing a controller or edge device maximum choice. To this end, we observe that source routing can be encoded and processed compactly into a single field, even in large networks, with OpenFlow 1.3. We show that, in addition to the expected decrease in required forwarding table size, source routing supports optimal throughput performance, in some cases significantly higher than some past proposals. We thus believe source routing offers a clean abstraction and efficient implementation for future network fabrics.
69 citations
11 Dec 2006
TL;DR: A new path metric called Bottleneck Link Capacity (BLC) is proposed which accounts for the link quality, the interference among links, and the traffic load on the links and a routing protocol called Capacity-Aware Routing (CAR) is developed which makes use of BLC as the routing metric.
Abstract: Employing multiple channels in wireless multi-hop networks is regarded as an effective approach to increasing network capacity. However, existing routing protocols may not be able to properly utilize the advantages of multiple channels in such networks. In this paper, we focus on IEEE 802.11-based wireless mesh networks with stationary nodes, such as wireless backhaul networks and community wireless networks. We propose a new path metric called Bottleneck Link Capacity (BLC) which accounts for the link quality, the interference among links, and the traffic load on the links. Then, we develop a routing protocol called Capacity-Aware Routing (CAR) which makes use of BLC as the routing metric. Finally, we evaluate the performance of BLC via simulations. The results show that our path metric outperforms others in terms of system throughput and end-to-end delay.
69 citations
01 Apr 1997
TL;DR: Under restricted architectural assumptions, a new lower bound for detailed routing is computed and it is shown that the detailed router typically requires no more than two extra routing tracks above this computed limit.
Abstract: We present results which show that a separate global and detailed routing strategy can be competitive with a combined routing process. Under restricted architectural assumptions, we compute a new lower bound for detailed routing and show that our detailed router typically requires no more than two extra routing tracks above this computed limit. Also, experimental results show that the Mapping Anomaly presented in [20], which suggests that separated routing may yield arbitrarily poor results in certain instances, is a concern only if nets are restricted to a single track domain. Finally, to motivate future work, we show the latest two-step routing results that we have achieved with the VPR global router and SEGA detailed router tools on the largest CBL benchmark circuits.
69 citations
TL;DR: This work builds upon recent results on the effect of node mobility on the performance of available routing strategies and proposes a protocol framework that exploits the usually different mobility rates of the nodes by adapting the routing strategy during execution.
69 citations