Routing with many additive QoS constraints

A fundamental problem in QoS routing is to find a path between a specified source-destination node pair that satisfies a set of end-to-end quality of service constraints. We study this problem in a communication system where there are multiple additive quality of service parameters associated with each link. It is well-known that the multi-constrained path selection problem (MCPS) is NP-complete. In this paper, we present a fully polynomial time approximation scheme for an optimization version of the MCPS problem. This means that for any given /spl epsi/ > 0, we can compute, in time bounded by a polynomial of the input size of the problem and in 1//spl epsi/, a solution whose cost is at most (1 + /spl epsi/) of that of the optimal solution.

[1]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

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

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

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

[7]  Jon Crowcroft,et al.  Bandwidth-delay based routing algorithms , 1995, Proceedings of GLOBECOM '95.

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

[9]  Douglas S. Reeves,et al.  A distributed algorithm for delay-constrained unicast routing , 1997, Proceedings of INFOCOM '97.

[10]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[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]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[13]  Funda Ergün,et al.  QoS routing with performance-dependent costs , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[15]  Marwan Krunz,et al.  A randomized algorithm for finding a path subject to multiple QoS requirements , 2001, Comput. Networks.

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

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

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

[19]  G. Xue,et al.  Quality of service routing: heuristics and approximation schemes with a comparative evaluation , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).