Dynamic online QoS routing schemes: Performance and bounds

Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label Forwarding. However, no extensive performance evaluation and comparison is available in the literature.In this paper, after a short review of the major dynamic QoS routing schemes, we analyze and compare their performance referring to several networks scenarios. In order to set an absolute evaluation of the performance quality we have obtained the ideal performance of any routing scheme using a novel and flexible mathematical programming model that assumes the knowledge of arrival times and duration of the connections offered to the network.This model is based on an extension of the maximum multi-commodity flow problem. Being an integer linear programming model, its complexity is quite high and its evaluation is constrained to networks of limited size. To overcome the computational complexity we have defined an approximate model, based on the multi-class Erlang formula and the minimum multi-commodity cut problem, that provides an upper bound to the routing scheme performance.The performance presented in the paper, evaluated by measuring the connection rejection probability, shows that the schemes considered reach, in several scenarios, the ideal performance, showing that no much gain is left for alternate new schemes.

[1]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[2]  José-Luis Marzo,et al.  QoS online routing and MPLS multilevel protection: a survey , 2003, IEEE Commun. Mag..

[3]  A. A. Nilsson,et al.  On multi-rate Erlang-B computations , 1999 .

[4]  Laurie Cuthbert,et al.  EQUIVALENT CAPACITY FOR ON/OFF SOURCES IN ATM , 1994 .

[5]  Igor Faynberg,et al.  An architectural framework for support of quality of service in packet networks , 2003, IEEE Commun. Mag..

[6]  Lou Berger,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Signaling Functional Description , 2003, RFC.

[7]  Murali S. Kodialam,et al.  Minimum interference routing with applications to MPLS traffic engineering , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[9]  Kin K. Leung,et al.  An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates , 1995, TNET.

[10]  Koushik Kar,et al.  Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications , 2000, IEEE Journal on Selected Areas in Communications.

[11]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[12]  Yuval Rabani,et al.  An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..

[13]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[14]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

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

[16]  Vijay Srinivasan,et al.  RSVP-TE: Extensions to RSVP for LSP Tunnels , 2001, RFC.

[17]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

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

[19]  Jean-François P. Labourdette,et al.  Blocking probabilities in multitraffic loss systems: insensitivity, asymptotic behavior, and approximations , 1992, IEEE Trans. Commun..

[20]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[21]  Ayan Banerjee,et al.  Generalized multiprotocol label switching: an overview of signaling enhancements and recovery techniques , 2001, IEEE Commun. Mag..

[22]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[23]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[24]  Bin Wang,et al.  A new bandwidth guaranteed routing algorithm for MPLS traffic engineering , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[25]  Luigi Fratta,et al.  Dynamic Routing of Bandwidth Guaranteed Connections in MPLS Networks , 2003, Int. J. Wirel. Opt. Commun..

[26]  Subhash Suri,et al.  Profile-based routing and traffic engineering , 2003, Comput. Commun..