scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: A novel real-time routing protocol with load distribution (RTLD) that ensures high packet throughput with minimized packet overhead and prolongs the lifetime of WSN.

107 citations

Proceedings ArticleDOI
01 Jan 1988
TL;DR: In this article, it was shown that any routing scheme for general n-vertex networks that achieves a stretch factor k ≥ 1 must use a total of O(n1+1/2k+4) bits of routing information in the networks.
Abstract: Two conflicting goals play a crucial role in the design of routing schemes for communication networks. A routing scheme should use as short as possible paths for routing messages in the network, while keeping the routing information stored in the processors' local memory as succinct as possible. The efficiency of a routing scheme is measured in terms of its stretch factor - the maximum ratio between the length of a route computed by the scheme and that of a shortest path connecting the same pair of vertices.Most previous work has concentrated on finding good routing schemes (with a small fixed stretch factor) for special classes of network topologies. In this work we study the problem for general networks, and look at the entire range of possible stretch factors. The results exhibit a tradeoff between the efficiency of a routing scheme and its space requirements. We present almost tight upper and lower bounds for this tradeoff. Specifically, we prove that any routing scheme for general n-vertex networks that achieves a stretch factor k ≥ 1 must use a total of O(n1+1/2k+4) bits of routing information in the networks. This lower bound is complemented by a family H(k) of hierarchical routing schemes (for every fixed k ≥ 1), which guarantee a stretch factor of O(k), require storing a total of O(n1+1/k) bits of routing information in the network and name the vertices with O(log2n)-bit names.

106 citations

Patent
14 Jul 1976
TL;DR: In this article, the authors propose a method of building-up a routing address consisting of routing words associated with the switching nodes and via which the transmission of information packets is effected in accordance with the routing address contained in each packet, and for their storage in the region of a called subscriber.
Abstract: In a digital telecommunication network containing bearer channels between switching nodes, the method of building-up a routing address consisting of routing words that are associated with the switching nodes and via which the transmission of information packets is effected in accordance with the routing address contained in each packet, and for their storage in the region of a called subscriber, dispatching a build-up packet from the first calling subscriber which contains the location-independent call number of the called second subscriber, each switching node retransmitting to other switching nodes connected to it at least the first of several successively received build-up packets having the same call number and whose routing address does not exceed a specific length and adding to each build-up packet retransmitted a routing word associated with the bearer channel connected to it and forming a part of the travel path of the build-up packet, the called subscriber designated by the call number or the switching node connected directly to the called subscriber receiving at least one build-up packet intended for it and storing ar least one of the routing addresses built-up by the build-up packet received.

106 citations

Book ChapterDOI
06 Jun 2001
TL;DR: In this paper, the authors propose a hybrid approach that uses both globally exchanged link state metrics and locally collected path state metrics for proportioning traffic among the selected paths, and compare the performance of their approach with that of global optimal proportioning and show that the proposed approach yields near-optimal performance using only a few paths.
Abstract: Multipath routing schemes distribute traffic among multiple paths instead of routing all the traffic along a single path. Two key questions that arise in multipath routing are how many paths are needed and how to select these paths. Clearly, the number and the quality of the paths selected dictate the performance of a multipath routing scheme. We address these issues in the context of the proportional routing paradigm where the traffic is proportioned among a few "good" paths instead of routing it all along the "best" path. We propose a hybrid approach that uses both globally exchanged link state metrics -- to identify a set of good paths, and locally collected path state metrics -- for proportioning traffic among the selected paths. We compare the performance of our approach with that of global optimal proportioning and show that the proposed approach yields near-optimal performance using only a few paths. We also demonstrate that the proposed scheme yields much higher throughput with much smaller overhead compared to other schemes based on link state updates.

106 citations

Proceedings ArticleDOI
12 Jun 2007
TL;DR: This paper examines BGP routing data from all routers in the Abilene backbone for six months and correlates them with a catalog of all known disruptions to its nodes and links, and proposes using network-wide analysis of routing information to diagnose and detect network disruptions.
Abstract: To maintain high availability in the face of changing network conditions, network operators must quickly detect, identify, and react to events that cause network disruptions. One way to accomplish this goal is to monitor routing dynamics, by analyzing routing update streams collected from routers. Existing monitoring approaches typically treat streams of routing updates from different routers as independent signals, and report only the "loud" events (i.e., events that involve large volume of routing messages). In this paper, we examine BGP routing data from all routers in the Abilene backbone for six months and correlate them with a catalog of all known disruptions to its nodes and links. We find that many important events are not loud enough to be detected from a single stream. Instead, they become detectable only when multiple BGP update streams are simultaneously examined. This is because routing updates exhibit network-wide dependencies.This paper proposes using network-wide analysis of routing information to diagnose (i.e., detect and identify) network disruptions. To detect network disruptions, we apply a multivariate analysis technique on dynamic routing information, (i.e., update traffic from all the Abilene routers) and find that this technique can detect every reported disruption to nodes and links within the network with a low rate of false alarms. To identify the type of disruption, we jointly analyze both the network-wide static configuration and details in the dynamic routing updates; we find that our method can correctly explain the scenario that caused the disruption. Although much work remains to make network-wide analysis of routing data operationally practical, our results illustrate the importance and potential of such an approach.

106 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
82% related
Server
79.5K papers, 1.4M citations
82% related
Wireless ad hoc network
49K papers, 1.1M citations
81% related
Wireless network
122.5K papers, 2.1M citations
80% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202327
202268
20214
20204
201912
201833