Multi-constrained Shortest Disjoint Paths for Reliable QoS Routing

Finding link-disjoint or node-disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi-constrained link-disjoint path pair problem. Based on this, we propose the link-disjoint optimal multi-constrained paths algorithm (LIDOMPA), to find the shortest link-disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure-aware non-dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node-disjoint optimal multi-constrained paths algorithm (NODOMPA) for the multi-constrained node-disjoint path pair problem.

[1]  Wei Kuang Lai,et al.  Fast reroute with pre-established bypass tunnel in MPLS , 2008, Comput. Commun..

[2]  Guoliang Xue,et al.  Constrained shortest link-disjoint paths selection: a network programming based approach , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.

[3]  Ariel Orda,et al.  QoS routing: the precomputation perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Yuchun Guo,et al.  Link‐disjoint paths for reliable QoS routing , 2003, Int. J. Commun. Syst..

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

[6]  Ming Gong,et al.  Link-Disjoint Shortest-Delay Path-Pair Computation Algorithms for Shared Mesh Restoration Networks , 2007, 2007 12th IEEE Symposium on Computers and Communications.

[7]  Cai Lu,et al.  A Novel Shared Segment Protection Algorithm for Multicast Sessions in Mesh WDM Networks , 2006 .

[8]  Hong Shen,et al.  An Improved Approximation Algorithm for Computing Disjoint QoS Paths , 2006, International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06).

[9]  Piet Van Mieghem,et al.  TAMCRA: a tunable accuracy multiple constraints routing algorithm , 2000, Comput. Commun..

[10]  Piet Van Mieghem,et al.  On the complexity of QoS routing , 2003, Comput. Commun..

[11]  Zhang Pin.  Researches on the problem of link disjoint paths pair with QoS constraints , 2006 .

[12]  Piet Van Mieghem,et al.  Hop-by-hop quality of service routing , 2001, Comput. Networks.

[13]  Chunming Qiao,et al.  On the complexity of and algorithms for finding the shortest path with a disjoint counterpart , 2006, TNET.

[14]  P. V. Mieghem,et al.  PATHS IN THE SIMPLE RANDOM GRAPH AND THE WAXMAN GRAPH , 2001, Probability in the Engineering and Informational Sciences.

[15]  Ariel Orda,et al.  Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[16]  Piet Van Mieghem,et al.  Concepts of exact QoS routing algorithms , 2004, IEEE/ACM Transactions on Networking.

[17]  Béla Bollobás,et al.  Random Graphs , 1985 .

[18]  Renata Teixeira,et al.  General Terms Measurement , 2022 .

[19]  Piet Van Mieghem,et al.  The impact of correlated link weights on QoS routing , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).