Finding a Path Subject to Many Additive QoS Constraints

A fundamental problem in quality-of-service (QoS) routing is to find a path between a source-destination node pair that satisfies two or more end-to-end QoS constraints. We model this problem using a graph with n vertices and m edges with K additive QoS parameters associated with each edge, for any constant Kges2. This problem is known to be NP-hard. Fully polynomial time approximation schemes (FPTAS) for the case of K=2 have been reported in the literature. We concentrate on the general case and make the following contributions. 1) We present a very simple (Km+nlogn) time K-approximation algorithm that can be used in hop-by-hop routing protocols. 2) We present an FPTAS for one optimization version of the QoS routing problem with a time complexity of O(m(n/epsi)K-1). 3) We present an FPTAS for another optimization version of the QoS routing problem with a time complexity of O(nlogn+m(H/epsi)K-1) when there exists an H-hop path satisfying all QoS constraints. When K is reduced to 2, our results compare favorably with existing algorithms. The results of this paper hold for both directed and undirected graphs. For ease of presentation, undirected graph is used

[1]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[2]  Sartaj Sahni,et al.  General Techniques for Combinatorial Approximation , 1977, Oper. Res..

[3]  Jeffrey M. Jaffe,et al.  Algorithms for finding paths with multiple constraints , 1984, Networks.

[4]  Arthur Warburton,et al.  Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..

[5]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[6]  HassinRefael.  Approximation Schemes for the Restricted Shortest Path Problem , 1992 .

[7]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[8]  Christian Huitema,et al.  Routing in the Internet , 1995 .

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

[10]  Peter Steenkiste,et al.  Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .

[11]  Klara Nahrstedt,et al.  On finding multi-constrained paths , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[12]  Christian Huitema,et al.  Routing in the Internet (2nd ed.) , 1999 .

[13]  Ariel Orda.  Routing with end-to-end QoS guarantees in broadband networks , 1999, TNET.

[14]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

[15]  Christian Huitema,et al.  An Architecture for Residential Internet Telephony Service , 1999, IEEE Internet Comput..

[16]  Qos Ip.  Quality of Service in Multiservice IP Networks , 2000, Lecture Notes in Computer Science.

[17]  Guoliang Xue,et al.  Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees , 2000, Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086).

[18]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

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

[20]  Danny Raz,et al.  A simple efficient approximation scheme for the restricted shortest path problem , 2001, Oper. Res. Lett..

[21]  Alpár Jüttner,et al.  Lagrange relaxation based method for the QoS routing problem , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[22]  Ashish Goel,et al.  Efficient computation of delay-sensitive routes from one source to all destinations , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[23]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[24]  Xin Yuan.  Heuristic algorithms for multiconstrained quality-of-service routing , 2002, IEEE/ACM Trans. Netw..

[25]  Funda Ergün,et al.  An improved FPTAS for Restricted Shortest Path , 2002, Inf. Process. Lett..

[26]  Ariel Orda,et al.  Precomputation schemes for QoS routing , 2003, TNET.

[27]  Arunabha Sen,et al.  Routing with many additive QoS constraints , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[28]  Marco Ajmone Marsan,et al.  Quality of Service in Multiservice IP Networks , 2003, Lecture Notes in Computer Science.

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

[30]  Fan Chung Graham,et al.  On disjoint path pairs with wavelength continuity constraint in WDM networks , 2004, IEEE INFOCOM 2004.

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

[32]  Bo Li,et al.  Dynamic routing and wavelength assignment in the presence of wavelength conversion for all-optical networks , 2005, IEEE/ACM Transactions on Networking.