Proceedings Article10.1109/INFCOM.1998.662958
Loop-free multipath routing using generalized diffusing computations
W.T. Zaumen,J.J. Garcia-Luna-Aceves +1 more
- 29 Mar 1998
- Vol. 3, pp 1408-1417
112
TL;DR: A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or Internet are presented, validated, and analyzed.
read more
Abstract: A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or Internet are presented, validated, and analyzed. According to this algorithm, which is called DASM (diffusing algorithm for shortest multipath), each router maintains a set of entries for each destination in its routing table, and each such entry consists of a set of tuples specifying the next router and distance in a loop-free path to the destination. DASM guarantees instantaneous loop freedom of multipath routing tables by means of a generalization of Dijkstra and Scholten's diffusing computations. With generalized diffusing computations, a node in a directed acyclic graph (DAG) defined for a given destination has multiple next nodes in the DAG and is able to modify the DAG without creating a directed loop. DASM is shown to be loop-free at every instant, and its average performance is analyzed by simulation and compared against an ideal link-state algorithm and the diffusing update algorithm (DUAL).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On-demand multipath distance vector routing in ad hoc networks
Mahesh K. Marina,Samir R. Das +1 more
- 01 Nov 2001
TL;DR: Performance comparison of AOMDV with AODV is able to achieve a remarkable improvement in the end-to-end delay-often more than a factor of two, and is also able to reduce routing overheads by about 20%.
1.6K
Split multipath routing with maximally disjoint paths in ad hoc networks
Sung-Ju Lee,Mario Gerla +1 more
- 11 Jun 2001
TL;DR: This work proposes an on-demand routing scheme called split multipath routing (SMR) that establishes and utilizes multiple routes of maximally disjoint paths and uses a per-packet allocation scheme to distribute data packets into multiple paths of active sessions.
1.4K
A framework for reliable routing in mobile ad hoc networks
Zhenqiang Ye,Srikanth V. Krishnamurthy,Satish K. Tripathi +2 more
- 09 Jul 2003
TL;DR: A modified version of the popular AODV protocol that allows us to discover multiple node-disjoint paths from a source to a destination and shows that the probability of establishing a reliable path between a random source and destination pair increases considerably even with a low percentage of reliable nodes.
A simple approximation to minimum-delay routing
Srinivas Vutukury,J.J. Garcia-Luna-Aceves +1 more
- 30 Aug 1999
TL;DR: This work presents a "near-optimal" routing framework that offers delays comparable to those of optimal routing and that is as flexible and responsive as single-path routing protocols proposed to date.
Exploiting path diversity in the link layer in wireless ad hoc networks
Shweta Jain,Samir R. Das +1 more
- 13 Jun 2005
TL;DR: An anycast mechanism at the link layer for wireless ad hoc networks that chooses the best next hop to forward packets when multiple next hop choices are available and performs significantly better than 802.11 in terms of packet delivery.
References
OSPF Version 2
J. Moy
- 01 Apr 1998
TL;DR: This memo documents version 2 of the OSPF protocol, a link-state routing protocol designed to be run internal to a single Autonomous System.
Termination detection for diffusing computations
TL;DR: This invention relates to an electronically rotatable antenna which includes several radially arranged Yagi antennae having a common drive element.
904
Distributed network protocols
TL;DR: A series of known and new protocols for connectivity test, shortest path, and path updating are described and validated and extended to networks with changing topology.
485
Patent
Method and apparatus for routing communications among computer networks
Leonard Bosack
- 29 Jan 1988
TL;DR: In this article, the authors propose an improved method and apparatus for routing data transmissions among computer networks, in which the computer networks are interconnected with a series of gateway circuits and each gateway identifies all destination computers to which it is connected and identifies the path or paths to each destination computer.
322
A Failsafe Distributed Routing Protocol
P. Merlin,Adrian Segall +1 more
TL;DR: The algorithm can be employed in message as well as circuit switching networks, uses distributed computation, provides routing tables that are loop-free for each destination at all times, adapts to changes in network flows, and is completely failsafe.
Related Papers (5)
[...]
J. Moy
- 01 Apr 1998
Srinivas Vutukury,J.J. Garcia-Luna-Aceves +1 more
- 30 Aug 1999
Sung-Ju Lee,Mario Gerla +1 more
- 11 Jun 2001
Deepinder P. Sidhu,Raj Nair,Shukri Abdallah +2 more
- 01 Aug 1991
C.E. Perkins,E.M. Royer +1 more
- 25 Feb 1999