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: This article has elaborated the basic concept of Opportunistic routing, different areas in which it has been claimed to be beneficial, some protocols their metrics and their drawbacks.

67 citations

Proceedings ArticleDOI
16 Aug 1993
TL;DR: An adaptive deadlock-free routing agorithm for n-dimensional meshes by using the SP routing, which uses shortest paths and is fully-adaptive, so messages can be routed via any of the shortest paths from the source to the destination.
Abstract: We present three protocols defin ing the relationship between messages and the chan nel resources requested: request-then-hold, requestthen wait, and request-then-relinquish. Based on the three protocols, we develop an adaptive deadlockfree routing algorithm called the SP routing. The SP routing uses shortest paths and is fully-adaptive, so messages can be routed via any of the shortest paths from the source to the destination. Since it is a minimal or shortest routing, the SP routing guar antees the freedom of livelocks. The SP routing is not limited to a specific network topology. The main requirement for an applicable network topology is that there exists a deterministic, minimal, deadlock-free routing algorithm. Most ex isting network topologies are equipped with such an algorithm. In this paper, we present an adaptive deadlock-free routing agorithm for n-dimensional meshes by using the SP routing. The hardware re quired by the SP routing uses only one extra virtual channel as compared to the deterministic routing.

67 citations

Proceedings ArticleDOI
25 Nov 2001
TL;DR: Distributed routing techniques to decrease the capacity efficiency gap between centralized routing and 1+1 routing of mesh-restored lightpaths are proposed and a retry scheme facilitated by crankback routing extensions to CR-LDP/RSVP-TE to reduce lightpath blocking is proposed.
Abstract: A mesh-restored lightpath in an optical network has a primary route and a diversely routed backup route. The wavelength channels on the primary route of a mesh-restored lightpath are dedicated for that lightpath whereas the wavelength channels on the backup route are shared among different mesh-restored lightpaths. Wavelength channels are shared in a way that ensures restoration of all lightpaths affected by any single link failure. In the centralized scenario, complete knowledge of the network state allows determination of the sharability of a backup channel during path computation. This information is not available in the distributed scenario. Use of 1+1 routing algorithms for mesh-restored lightpaths leads to inefficient capacity sharing. We propose distributed routing techniques to decrease the capacity efficiency gap between centralized routing and 1+1 routing of mesh-restored lightpaths. The algorithm uses information about the number of available and (shared) backup channels in a link, which can be disseminated through traffic engineering extensions to OSPF. A sharing database at each OXC maintains information about the lightpaths whose primary or backup paths traverse that OXC. The approach involves distributed determination of the sharability of a link on the backup path during path signaling using the sharing database at each OXC on the backup path. This, combined with a retry scheme facilitated by crankback routing extensions to CR-LDP/RSVP-TE to reduce lightpath blocking, leads to capacity efficient distributed routing of mesh-restored lightpaths.

67 citations

Journal ArticleDOI
TL;DR: The core ideas of this research paper will guide the researchers to further research in the field of UWSN routing protocols based on node mobility by comparing the proposed routing protocols through architectural parameters and performance characteristics parameters.

67 citations

Journal ArticleDOI
TL;DR: The theoretical background for the design of deadlock-free adaptive multicast routing algorithms for wormhole networks is developed, developing conditions to verify that an adaptive multicasts routing algorithm is deadlocked-free, even when there are cyclic dependencies between channels.
Abstract: A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks, proposed by the author (1991, 1993), supplies sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. Also, two design methodologies were proposed. Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. A tree-like routing scheme is not suitable for hardware-supported multicast in wormhole networks because it produces many headers for each message, drastically increasing the probability of a message being blocked. A path-based multicast routing model was proposed by Lin and Ni (1991) for multicomputers with 2D-mesh and hypercube topologies. In this model, messages are not replicated at intermediate nodes. This paper develops the theoretical background for the design of deadlock-free adaptive multicast routing algorithms. This theory is valid for wormhole networks using the path-based routing model. It is also valid when messages with a single destination and multiple destinations are mixed together. The new channel dependencies produced by messages with several destinations are studied. Also, two theorems are proposed, developing conditions to verify that an adaptive multicast routing algorithm is deadlock-free, even when there are cyclic dependencies between channels. As an example, the multicast routing algorithms of Lin and Ni are extended, so that they can take advantage of the alternative paths offered by the network. >

67 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