Proceedings ArticleDOI
Finding disjoint paths in networks
Deepinder P. Sidhu,Raj Nair,Shukri Abdallah +2 more
- Vol. 21, Iss: 4, pp 43-51
About:
This article is published in ACM Special Interest Group on Data Communication.The article was published on 1991-08-01. It has received 156 citations till now. The article focuses on the topics: Disjoint sets.read more
Citations
More filters
Proceedings ArticleDOI
On-demand multipath distance vector routing in ad hoc networks
Mahesh K. Marina,Samir R. Das +1 more
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%.
Proceedings ArticleDOI
Split multipath routing with maximally disjoint paths in ad hoc networks
Sung-Ju Lee,Mario Gerla +1 more
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.
Journal ArticleDOI
Ad hoc on-demand multipath distance vector routing
Mahesh K. Marina,Samir R. Das +1 more
TL;DR: AOMDV as discussed by the authors is an on-demand, multipath distance vector routing protocol for mobile ad hoc networks, which guarantees loop freedom and disjointness of alternate paths.
Proceedings ArticleDOI
On the impact of alternate path routing for load balancing in mobile ad hoc networks
TL;DR: The impact of route coupling on APR's delay performance in ad-hoc networks is demonstrated and it is found that route coupling is so severe in single channel networks that APR provides only negligible improvements in quality of service.
Journal ArticleDOI
Ad hoc on-demand multipath distance vector routing
Mahesh K. Marina,Samir R. Das +1 more
TL;DR: Performance comparison of AOMDV with AODV using ns-2 simulations under varying node speeds shows that AomDV provides a factor of two improvement in delay and about 20% reduction in routing overhead, while having similar packet delivery fraction.
References
More filters
Journal ArticleDOI
A quick method for finding shortest pairs of disjoint paths
J. W. Suurballe,Robert E. Tarjan +1 more
TL;DR: This paper considers the problem of finding, for each possible sink vertex v, a pair of edge-disjoint paths from s to v of minimum total edge cost, and gives an implementation of Suurballe's algorithm that runs in O(m log(1+ m/n)n) time and O( m) space.
Journal ArticleDOI
Disjoint paths in a network
TL;DR: An algorithm and related theory is described for a general number K of node-disjoint paths with minimum total length, which applies shortest path labeling algorithms familiar in the literature.
Journal ArticleDOI
A k shortest path algorithm for adaptive routing in communications networks
TL;DR: An efficient and flexible algorithm is presented for finding a k shortest loopless path with distinct initial links from one node to each other node, showing it to offer a substantial improvement over applying known algorithms to the problem.
Proceedings ArticleDOI
The Multi-Tree Approach To Reliability In Distributed Networks
Alon Itai,Michael Rodeh +1 more
TL;DR: A communication protocol which uses k rooted spanning trees having the property that for every vertex v the paths from v to the root are edge-disjoint and a linear algorithm to find two such trees in a 2 edge-connected graph is described.