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
Proceedings Article
16 Apr 2008
TL;DR: A fitted bed sheet and a method of making the sheet from a rectangular blank of sheet material are disclosed.
Abstract: Internet routing protocols (BGP, OSPF, RIP) have traditionally favored responsiveness over consistency. A router applies a received update immediately to its forwarding table before propagating the update to other routers, including those that potentially depend upon the outcome of the update. Responsiveness comes at the cost of routing loops and blackholes--a router A thinks its route to a destination is via B but B disagrees. By favoring responsiveness (a liveness property) over consistency (a safety property), Internet routing has lost both. Our position is that consistent state in a distributed system makes its behavior more predictable and securable. To this end, we present consensus routing, a consistency-first approach that cleanly separates safety and liveness using two logically distinct modes of packet delivery: a stable mode where a route is adopted only after all dependent routers have agreed upon it, and a transient mode that heuristically forwards the small fraction of packets that encounter failed links. Somewhat surprisingly, we find that consensus routing improves overall availability when used in conjunction with existing transient mode heuristics such as backup paths, deflections, or detouring. Experiments on the Internet's AS-level topology show that consensus routing eliminates nearly all transient disconnectivity in BGP.

136 citations

Journal ArticleDOI
TL;DR: Two dynamic multilayer routing policies implemented in the photonic MPLS router developed by NTT for IP+optical generalized MPLS networks are presented and it is observed that p is the key factor in choosing the most appropriate routing policy.
Abstract: This article presents two dynamic multilayer routing policies implemented in the photonic MPLS router developed by NTT for IP+optical generalized MPLS networks. According to IP traffic requests, wavelength paths called lambda label switched paths are set up and released in a distributed manner based on GMPLS routing and signaling protocols. Both dynamic routing policies first try to allocate a newly requested electrical path to an existing optical path that directly connects the source and destination nodes. If such a path is not available, the two policies employ different procedures. Policy 1 tries to find available existing optical paths with two or more hops that connect the source and destination nodes. Policy 2 tries to establish a new one-hop optical path between source and destination nodes. The performances of the two routing policies are evaluated. Simulation results suggest that policy 2 outperforms policy 1 if p is large, where p is the number of packet-switching-capable ports; the reverse is true only if p is small. We observe that p is the key factor in choosing the most appropriate routing policy. We also describe items that need to be standardized in the IETF to effectively achieve multilayer traffic engineering.

135 citations

Proceedings ArticleDOI
18 Jun 2007
TL;DR: A new metric EAX is defined that captures the expected number of any-path transmissions needed to successfully deliver a packet between two nodes under opportunistic routing and develops a candidate selection and prioritization method corresponding to an ideal opportunist routing scheme.
Abstract: Traditional routing schemes select the best path for each destination and forward a packet to the corresponding next hop. While such best-path routing schemes are considered well-suited for networks with reliable point-to-point links, they are not necessarily ideal for wireless networks with lossy broadcast links. Consequently, opportunistic routing schemes that exploit the broadcast nature of wireless transmissions and dynamically select a next-hop per-packet based on loss conditions at that instant are being actively explored. It is generally accepted that opportunistic routing performs substantially better than best-path routing for wireless mesh networks. In this paper, we analyze the efficacy of opportunistic routing. We define a new metric EAX that captures the expected number of any-path transmissions needed to successfully deliver a packet between two nodes under opportunistic routing. Based on EAX, we develop a candidate selection and prioritization method corresponding to an ideal opportunistic routing scheme. We then conduct an off-line comparison of best-path routing and opportunistic routing using our EAX metric and MIT Roofnet trace. We observe that while opportunistic routing offers better performance than best- path routing, the gain is not as high as commonly believed.

135 citations

Journal ArticleDOI
01 Nov 2005
TL;DR: A reactive location routing algorithm that uses cluster-based flooding for Vehicular Ad-hoc Networks (VANET) and Dynamic Source Routing (DSR) in terms of average Route Discovery (RD) time, End-to-End Delay (EED), Routing Load, Routing Overhead, overhead, and Delivery Ratio is presented.
Abstract: This paper presents a reactive location routing algorithm that uses cluster-based flooding for Vehicular Ad-hoc Networks (VANET). We compare both position-based and non-position-based routing strategies in typical urban and motorway traffic scenarios. A microscopic traffic model, developed in OPNET, is used to evaluate the performance of the Location Routing Algorithm with Cluster-Based Flooding (LORA_CBF), Ad-Hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR) in terms of average Route Discovery (RD) time, End-to-End Delay (EED), Routing Load, Routing Overhead, Overhead, and Delivery Ratio.

135 citations

Proceedings ArticleDOI
01 Nov 2006
TL;DR: Evaluating the performance of three well-known and widely investigated MANET routing protocols in the presence of bursty self-similar traffic indicates that DSR routing protocol performs well with bursty traffic models compared to AODV and OLSR in terms of delivery ratio, throughput and end-to-end delay.
Abstract: A number of measurement studies have convincingly demonstrated that network traffic can exhibit a noticeable self-similar nature, which has a considerable impact on queuing performance. However, many routing protocols developed for MANETs over the past few years have been primarily designed and analyzed under the assumptions of either CBR or Poisson traffic models, which are inherently unable to capture traffic self-similarity. It is crucial to re-examine the performance properties of MANETs in the context of more realistic traffic models before practical implementation show their potential performance limitations. In an effort towards this end, this paper evaluates the performance of three well-known and widely investigated MANET routing protocols, notably DSR, AODV and OLSR, in the presence of the bursty self-similar traffic. Different performance aspects are investigated including, delivery ratio, routing overhead, throughput and end-to-end delay. Our simulation results indicate that DSR routing protocol performs well with bursty traffic models compared to AODV and OLSR in terms of delivery ratio, throughput and end-to-end delay. On the other hand, OLSR performed poorly in the presence of self-similar traffic at high mobility especially in terms of data packet delivery ratio, routing overhead and delay. As for AODV routing protocol, the results show an average performance, yet a remarkably low and stable end-to-end delay.

135 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