Abstract
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 has been obtained by simulation. From the comparison of the schemes considered it turns out that the Virtual Flow Deviation routing algorithm performs best and it almost reaches, in several scenarios, the ideal performance showing that no much gain is left for alternate new schemes.
This work has been partially supported under the grant of MURST Tango project.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lu, H.-L., Faynberg, I.: An Architectural Framework for Support of Quality of Service in Packet Networks. IEEE Communications Magazine 41(6), 98–105 (2003)
Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol Label Switching Architecture. IETF RFC 3031 (January 2001)
Berger, L. (ed.): Generalized Multi-Protocol Label Switching (GMPLS) Signaling Functional Description. IETF RFC 3471 (January 2003)
Banerjee, A., Drake, L., Lang, L., Turner, B., Awduche, D., Berger, L., Kompella, K., Rekhter, Y.: Generalized Multiprotocol Label Switching: an Overview of Signaling Enhancements and Recovery Techniques. IEEE Communications Magazine 39(7), 144–151 (2001)
Chen, S., Nahrstedt, K.: An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions. IEEE Network 12(6), 64–79 (1998)
Marzo, J.L., Calle, E., Scoglio, C., Anjali, T.: QoS Online Routing and MPLS MultilevelProtection: A Survey. IEEE Communications Magazine 41(10), 126–132 (2003)
Wang, B., Su, X., Chen, C.L.P.: A New Bandwidth Guaranteed Routing Algorithm for MPLS Traffic Engineering. In: IEEE International Conference on Communications, ICC 2002, vol. 2, pp. 1001–1005 (2002)
Wang, Z., Crowcroft, J.: QoS Routing for Supporting Resource Reservation. IEEE Journal on Selected Areas in Communications (September 1996)
Orda, A.: Routing with End to End QoS Guarantees in Broadband Networks. In: IEEE INFOCOM 1998 (March 1998)
Awerbuch, B., et al.: Throughput Competitive On Line Routing. In: 34th Annual Symp. Foundations of Computer Science, Palo Alto, CA (November 1993)
Suri, S., Waldvogel, M., Bauer, D., Warkhede, P.R.: Profile-Based Routing and Traffing Engineering. Computer Communications 26(4), 351–365 (2003)
Capone, A., Fratta, L., Martignon, F.: Dynamic Online QoS Routing Schemes: Performance and Bounds. Submitted to Computer Communications
Awduche, D.O., Berger, L., Gan, D., Li, T., Srinivasan, V., Swallow, G.: RSVP-TE: Extensions to RSVP for LSP Tunnels. IETF RFC 3209 (December 2001)
Guerin, R., Williams, D., Orda, A.: QoS Routing Mechanisms and OSPF Extensions. In: Proceedings of Globecom (1997)
Kodialam, M.S., Lakshman, T.V.: Minimum Interference Routing with Applications to MPLS Traffic Engineering. In: Proceedings of INFOCOM, pp. 884–893 (2000)
Kar, K., Kodialam, M., Lakshman, T.V.: Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications. IEEE Journal on Selected Areas in Communications 18(12) (December 2000)
Capone, A., Fratta, L., Martignon, F.: Dynamic Routing of Bandwidth Guaranteed Connections in MPLS Networks. International Journal on Wireless and Optical Communications 1(1), 75–86 (2003)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)
ILOG CPLEX, Available at http://www.ilog.com/products/cplex/
Labourdette, J.F.P., Hart, G.W.: Blocking probabilities in multitraffic loss systems: insensitivity, asymptotic behavior, and approximations. IEEE Trans. on Communications 40, 1355–1366 (1992)
Leighton, T., Rao, S.: Multicommodity Max-Flow Min-Cut Theorems and their Use in Designing Approximation Algorithms. Journal of the ACM 46(6) (November 1999)
Aumann, Y., Rabani, Y.: An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. SIAM Journal on Computing 27(1), 291–301 (1998)
Guerin, R., Ahmadi, H., Naghshineh, M.: Equivalent capacity and its application to bandwidth allocation in high speed networks. IEEE Journal on Selected Areas in Communications, 968–981 (September 1991)
Schormans, J.A., Pitts, J., Williams, K., Cuthbert, L.: Equivalent capacity for on/off sources in ATM. Electronic Letters 30(21), 1740–1741 (1994)
Fratta, L., Gerla, M., Kleinrock, L.: The Flow Deviation Method: An Approach to Store-and-forward Network Design. Networks 3, 97–133 (1973)
Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1987)
Kaufman, J.S.: Blocking in a Shared Resource Environment. IEEE Transactions on Communications 29(10), 1474–1481 (1981)
Nilsson, A.A., Perry, M., Gersht, A., Iversen, V.B.: On Multi-rate Erlang-B Computations. In: 16th International Teletraffic Congress, ITC 16, pp. 1051–1060. Elsevier Science, Amsterdam (1999)
Choudhury, G.L., Leung, K.K., Whitt, W.: An Inversion Algorithm to Compute Blocking Probabilities in Loss Networks with State-Dependent Rates. IEEE/ACM Transactions on Networking 3(5), 585–601 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Capone, A., Fratta, L., Martignon, F. (2005). On the Performance of Dynamic Online QoS Routing Schemes. In: Ajmone Marsan, M., Bianchi, G., Listanti, M., Meo, M. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2004. Lecture Notes in Computer Science, vol 3375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30573-6_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-30573-6_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24557-5
Online ISBN: 978-3-540-30573-6
eBook Packages: Computer ScienceComputer Science (R0)