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 ArticleDOI
01 Jan 2005
TL;DR: Simulation results show that the energy-saving performance of the minimum-energy routing protocols can be significantly improved when they are implemented together with the proposed C-MAC protocol and can be further enhanced when the initial path is selected using the cooperation characteristics of the network.
Abstract: Cooperative diversity techniques exploit the spatial characteristics of the network to create transmit-diversity, in which the same information can be forwarded through multiple paths towards a single destination or a set of destination nodes. In this paper, we study the integration of cooperative diversity into wireless routing protocols by developing distributed cooperative MAC (C-MAC) and routing protocols. The proposed protocols employ efficient relay selection-coordination and power allocation techniques to maximize the cooperation benefits in the network. Simulation results show that the energy-saving performance of the minimum-energy routing protocols can be significantly improved when they are implemented together with the proposed C-MAC protocol (%50). We also show that the performance of the C-MAC protocol can be further enhanced when the initial path is selected using the cooperation characteristics of the network (%11 more energy-savings compared to the previous case, i.e., C-MAC with minimum-energy routing)

95 citations

Journal ArticleDOI
TL;DR: This article proves that given a unit disk graph and the angles between adjacent edges, it is NP-hard to find a valid embedding in the plane such that neighboring nodes are within distance 1 from each other and non-neighboring nodes are at least distance 2 away and proposes a practical anchor-free embedding scheme by solving a linear program.
Abstract: Location information is useful both for network organization and for sensor data integrity. In this article, we study the anchor-free 2D localization problem by using local angle measurements. We prove that given a unit disk graph and the angles between adjacent edges, it is NP-hard to find a valid embedding in the plane such that neighboring nodes are within distance 1 from each other and non-neighboring nodes are at least distance √2/2 away. Despite the negative results, however, we can find a planar spanner of a unit disk graph by using only local angles. The planar spanner can be used to generate a set of virtual coordinates that enable efficient and local routing schemes such as geographical routing or approximate shortest path routing. We also proposed a practical anchor-free embedding scheme by solving a linear program. We show by simulation that it gives both a good local embedding, with neighboring nodes embedded close and non-neighboring nodes far away, and a satisfactory global view such that geographical routing and approximate shortest path routing on the embedded graph are almost identical to those on the original (true) embedding.

95 citations

Patent
12 Nov 2002
TL;DR: In this paper, a backup routing processor solicits routes from peer routing systems in response to a failure and generates a backup route prefix table from the routes received from PRSs, and compares prefixes of routes in the backup routing database with prefixes in the prefix table.
Abstract: A routing system provides for transparent routing system failover by checkpointing route prefixes during normal operation by maintaining a route prefix table. After failure of a primary routing processor, routing with peer routing systems is synchronized through the use of this prefix table. The prefix table is managed by the primary routing processor and is accessible by a backup routing processor at least after failure of the primary routing processor. Upon the detection of a failure, a backup routing processor solicits routes from peer routing systems in response to the failure and generates a backup routing database from the routes received from peer routing systems. The backup routing processor also compares prefixes of routes in the backup routing database with prefixes in the prefix table, and sends route withdraw messages to the peer routing systems for routes having prefixes listed in the prefix table and not identified in the backup routing database.

94 citations

Patent
31 May 2000
TL;DR: The Simple Path Vector Protocol (SPV) as discussed by the authors extends the prior art Border Gateway Protocol by adding a new attribute to the routing messages sent by an edge router to its peers in the different systems.
Abstract: Routing information is exchanged between edge routers in different autonomous systems that independently define their routing policies. A Simple Path Vector Protocol extends the prior art Border Gateway Protocol in a manner that is guaranteed to converge by adding a new attribute to the routing messages sent by an edge router to its peers in the different systems. This attribute is a path history, which is dynamically computed at each router as the routing path to a particular destination is changed. The path history attribute is sent in a routing message by a router to its peers together with the sending router's path to that destination. By observing the dynamic path history that is computed at a router as a received routing message from a peer router that contains a history attribute is processed, a cycle can be identified in the newly computed history and associated with a policy conflict at that receiving router's associated autonomous system. A path whose history contains a cycle is automatically suppressed as a permitted path to that destination.

94 citations

ReportDOI
01 May 2019
TL;DR: This document specifies the forwarding behavior to allow instantiating SR over the MPLS dataplane.
Abstract: Segment Routing (SR) leverages the source routing paradigm. A node steers a packet through a controlled set of instructions, called segments, by prepending the packet with an SR header. In the MPLS dataplane, the SR header is instantiated through a label stack. This document specifies the forwarding behavior to allow instantiating SR over the MPLS dataplane.

94 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