Routing on Shortest Pair of Disjoint Paths with Bandwidth Guaranteed

QoS routing and multipath routing have been receiving much attention respectively in network communication. However, the research combining those two kinds of routing is rare. This paper integrated the ideas of QoS and multipath, and presented the problem of Shortest Pair of Disjoint Paths with Bandwidth Guaranteed. We proved it to be NP-Complete, and then proposed a heuristic algorithm. The analysis indicates that our algorithm shows good performance and it can produce optimal solutions in most cases.

[1]  Raphael Rom,et al.  Analysis of multi-path routing , 1999, TNET.

[2]  Split Multipath Routing with Maximally Disjoint Paths , 2001 .

[3]  Zhigang Cao,et al.  Quality of Service Routing: Problems and Solutions , 2003 .

[4]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[5]  Stavros G. Kolliopoulos.  Minimum-cost single-source 2-splittable flow , 2005, Inf. Process. Lett..

[6]  Chung-Lun Li,et al.  The complexity of finding two disjoint paths with min-max objective function , 1989, Discret. Appl. Math..

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

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

[9]  Greg N. Frederickson,et al.  An Optimal Algorithm for Selection in a Min-Heap , 1993, Inf. Comput..

[10]  Diao Xing-chun.  Heuristic Algorithm for Shortest Path Problem with Nonlinear Constraints , 2004 .

[11]  Cem Ersoy,et al.  Admission Control for Multicast Routing with Quality of Service in Ad Hoc Networks , 2005, ISCIS.

[12]  Xinhua Zhuang,et al.  Modified Widest Disjoint Paths Algorithm for Multipath Routing , 2007, NPC.

[13]  Charu C. Aggarwal,et al.  On multiroute maximum flows in networks , 2002, Networks.

[14]  Ramaswamy Chandrasekaran,et al.  Multiroute flows: Cut-trees and realizability , 2005, Discret. Optim..

[15]  Liu Zhong-kan.  A Delay Constraint Minimum Cost Routing Algorithm for Satellite Time-Varying Network , 2006 .

[16]  Deepinder P. Sidhu,et al.  Finding disjoint paths in networks , 1991, SIGCOMM '91.

[17]  Y. L. Chen,et al.  Finding the k Quickset Simple Paths in a Network , 1994, Inf. Process. Lett..

[18]  Sung-Ju Lee,et al.  Split multipath routing with maximally disjoint paths in ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[19]  Lu Xi-cheng.  Maximally Reliable Pathset Selection for Multipath Routing in MANET , 2006 .

[20]  Tan Guo.  An Overview of Network Routing Algorithm and QoS Management Strategy , 2003 .

[21]  Arunabha Sen,et al.  On multipath routing using widest pair of disjoint paths , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[22]  Srihari Nelakuditi,et al.  On selection of candidate paths for proportional routing , 2004, Comput. Networks.

[23]  Rod J. Fretwell,et al.  MFMP: Max Flow Multipath Routing Algorithm , 2008, 2008 Second UKSIM European Symposium on Computer Modeling and Simulation.

[24]  Cem Ersoy,et al.  Ad hoc quality of service multicast routing , 2005, Comput. Commun..