An Approach to Find Maximal Disjoint Paths with Reliability and Delay Constraints

Recently, multipaths solutions have been proposed to improve the quality-of-service (QoS) in communication networks (CN). Peng and Shen algorithm (PSA) was proposed to generate lamdaDP/DC – the maximum edge-disjoint-path-set with minimal cost subject to a delay constraint, for lamda≤2. This paper introduces a different and equally important problem, lamdaDP/DR, to obtain the maximal edge-disjoint-path-set with maximum reliability subject to a given delay constraint, for lambda≤1. lamdaDP/DR is applicable to time critical applications that require non-compromised time delay while demanding maximum system reliability.  In this paper we show how lamdaDP/DR is different from lamdaDP/DC, and propose an approximate algorithm similar to the Lagrange-relaxation based PSA to solve the problem. Our simulations on three randomly generated CNs show that our polynomial time algorithm produced lamdaDP/DR with comparable optimality to that obtained using the NP-hard brute-force approach.

[1]  S. Kami Makki,et al.  Multiconstrained QoS Routing: A Norm Approach , 2007, IEEE Transactions on Computers.

[2]  Sartaj Sahni,et al.  Two techniques for fast computation of constrained shortest paths , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[3]  Hong Shen,et al.  A New Approximation Algorithm for Computing 2-Restricted Disjoint Paths , 2007, IEICE Trans. Inf. Syst..

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

[5]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 2003, J. Comput. Syst. Sci..

[7]  Panagiotis Papadimitratos,et al.  Path set selection in mobile ad hoc networks , 2002, MobiHoc '02.

[8]  Suresh Rai,et al.  A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network , 2008, 2008 14th IEEE Pacific Rim International Symposium on Dependable Computing.

[9]  Sieteng Soh,et al.  A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities , 1991 .

[10]  Jonathan Cole Smith,et al.  Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations , 2008, INFORMS J. Comput..

[11]  A. Orda,et al.  A comparison of exact and ε-approximation algorithms for constrained routing , 2005 .

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

[13]  April K. Andreas,et al.  Exact Algorithms for Robust k-Path Routing Problems , 2005 .

[14]  Marwan Krunz,et al.  Routing multimedia traffic with QoS guarantees , 2003, IEEE Trans. Multim..

[15]  Jonathan Cole Smith,et al.  Branch-and-price-and-cut algorithms for solving the reliable h-paths problem , 2008, J. Glob. Optim..

[16]  Ariel Orda,et al.  Efficient algorithms for computing disjoint QoS paths , 2004, IEEE INFOCOM 2004.

[17]  Anukool Lakhina,et al.  BRITE: Universal Topology Generation from a User''s Perspective , 2001 .

[18]  Guoliang Xue,et al.  Minimum-cost QoS multicast and unicast routing in communication networks , 2003, IEEE Trans. Commun..

[19]  Guoliang Xue,et al.  Multiconstrained QoS Routing: Greedy is Good , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[20]  G. Xue,et al.  Polynomial time approximation algorithms for multi-constrained QoS routing , 2008, TNET.

[21]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[22]  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).

[23]  Piet Van Mieghem,et al.  A Comparison of Exact and epsilon-Approximation Algorithms for Constrained Routing , 2006, Networking.

[24]  Arunabha Sen,et al.  Finding a Path Subject to Many Additive QoS Constraints , 2007, IEEE/ACM Transactions on Networking.

[25]  Choong Seon Hong,et al.  Multi-Constrained QoS Geographic Routing for Heterogeneous Traffic in Sensor Networks , 2008, 2008 5th IEEE Consumer Communications and Networking Conference.

[26]  G. Manimaran,et al.  Reliability constrained routing in QoS networks , 2005, IEEE/ACM Transactions on Networking.

[27]  Yuguang Fang,et al.  Multiconstrained QoS multipath routing in wireless sensor networks , 2008, Wirel. Networks.

[28]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[29]  Stefano Bistarelli,et al.  A Formal and Practical Framework for Constraint-Based Routing , 2008, Seventh International Conference on Networking (icn 2008).

[30]  Sartaj Sahni,et al.  Approximation algorithms for multiconstrained quality-of-service routing , 2006, IEEE Transactions on Computers.

[31]  A. Agarwal,et al.  Routing reliability analysis of segmented backup paths in mobile ad hoc networks , 2005, 2005 IEEE International Conference on Personal Wireless Communications, 2005. ICPWC 2005..