An algorithm for the shortest pairs of arc-disjoint paths problem

Multipath Routing plays an important role in satellite network and computer communication network. It can increase the reliability of a network, avoid congestion and reduce the probability of dropped packets. The algorithm for finding shortest pairs of arc-disjoint paths is an important part of the multipath routing. In this paper, we first introduce the algorithm for the shortest pairs of arc-disjoint paths problem (SADPP) in networks which contain one sink with one source or several sources, then, we discuss the case in which we need to find the pairs of paths between any vertex and the sink. Finally, we present a method when the network is time-dependent.

[1]  J. W. Suurballe.  Disjoint paths in a network , 1974, Networks.

[2]  Adrian Kosowski,et al.  The maximum edge-disjoint paths problem in complete graphs , 2008, Theor. Comput. Sci..

[3]  Kenneth Steiglitz,et al.  A new derivation of Frisch's algorithm for calculating vertex-pair connectivity , 1971 .

[4]  I. Frisch.  An Algorithm for Vertex-pair Connectivity , 1967 .

[5]  Tan Guo.  Shortest Path Algorithm in Time-Dependent Networks , 2002 .

[6]  Zhi Chen,et al.  Finding Arc and Vertex-Disjoint Paths in Networks , 2009, 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing.

[7]  Zhang Jun.  Min Max-time Flow Problem in Capacitated Dynamic Networks , 2010 .

[8]  Nachum Shacham,et al.  A distributed algorithm for finding shortest pairs of disjoint paths , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[9]  Ozgur Sinanoglu,et al.  An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks , 2010, IEEE Transactions on Computers.

[10]  Laurent Coupry,et al.  A Simple Linear Algorithm for the Edge-Disjoint (s, t)-Paths Problem in Undirected Planar Graphs , 1997, Inf. Process. Lett..

[11]  Wen Liu,et al.  Delay-Constrained Multicast Routing Using the Noisy Chaotic Neural Networks , 2009, IEEE Transactions on Computers.

[12]  Gao Daqi,et al.  Improvement and Analysis of Widest Disjoint Paths Algorithm for Proportional Routing , 2007 .

[13]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[14]  Deepinder P. Sidhu,et al.  Finding disjoint paths in networks , 1991, Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication.