Lagrange relaxation based method for the QoS routing problem

In this paper a practically efficient QoS routing method is presented, which provides a solution to the delay constrained least cost routing problem. The algorithm uses the concept of aggregated costs and provides an efficient method to find the optimal multiplier based on Lagrange relaxation. This method is proven to be polynomial and it is also efficient in practice. The benefit of this method is that it also gives a lower bound on the theoretical optimal solution along with the result. The difference between the lower bound and the cost of the found path is very small proving the good quality of the result. Moreover, by further relaxing the optimality of paths, an easy way is provided to control the trade-off between the running time of the algorithm and the quality of the found paths. We present a comprehensive numerical evaluation of the algorithm, by comparing it to a wide range of QoS routing algorithms proposed in the literature. It is shown that the performance of the proposed polynomial time algorithm is close to the optimal solution computed by an exponential algorithm.

[1]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[2]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[3]  Roch Guérin,et al.  Implementation and performance measurements of QoS routing extensions to OSPF , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

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

[6]  Roch Guérin,et al.  Efficient Support of Delay and Rate Guarantees in an Internet , 1996, SIGCOMM.

[7]  P. Van Mieghem,et al.  A multiple quality of service routing algorithm for PNNI , 1998 .

[8]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[9]  Douglas S. Reeves,et al.  A distributed algorithm for delay-constrained unicast routing , 2000, TNET.

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

[11]  Scott Shenker,et al.  Specification of Guaranteed Quality of Service , 1997, RFC.

[12]  Norio Shiratori,et al.  Routing with multiple QoS requirements for supporting multimedia applications , 1998, Telecommun. Syst..

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

[14]  Ron Widyono.  The Design and Evaluation of Routing Algorithms for Real-time Channels , 1994 .

[15]  F. Nemeth,et al.  Nonrate-proportional weighting of generalized processor sharing schedulers , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[16]  Tomasz Radzik.  Fractional Combinatorial Optimization , 1998 .

[17]  Duan-Shin Lee,et al.  ATM Routing Algorithms with Multiple QOS Requirements for Multimedia Internetworking (Special Issue on Multimedia on Demand) , 1996 .

[18]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[19]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

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

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

[22]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[23]  Stefan Savage,et al.  The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.

[24]  Leonidas Georgiadis,et al.  Efficient support of delay and rate guarantees in an internet , 1996, SIGCOMM 1996.

[25]  Liang Guo,et al.  Search space reduction in QoS routing , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[26]  Yuval Shavitt,et al.  Optimal partition of QoS requirements with discrete cost functions , 2000, IEEE J. Sel. Areas Commun..

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

[28]  Ariel Orda,et al.  QoS routing in networks with uncertain parameters , 1998, IEEE/ACM Trans. Netw..

[29]  Gregory Gutin,et al.  An approximate algorithm for combinatorial optimization problems with two parameters , 1995, Australas. J Comb..

[30]  Kenji Ishida,et al.  A delay-constrained least-cost path routing protocol and the synthesis method , 1998, Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236).