Abstract
Service differentiation in IP core networks may be supported by dedicated path selection rules. This paper investigates the degree of service distinction achievable when common routing strategies, like ECMP, SWP and WSP, are applied to two traffic classes separately and in different combinations. One traffic class requires low latencies, while the other is considered as best-effort traffic.
A Maple program has been developed that evaluates network performance characteristics, like maximal link utilization, and per-class measures, like mean end-to-end delay and mean number of hops, when paths are computed on demand with traffic demands arriving in arbitrary order. Realistic network topologies may be imported from the publicly available tool BRITE, while link capacities and traffic patterns are chosen randomly (with realistic constraints) in Maple.
Experiments show that a comparable service differentiation may already be achieved with less sophisticated strategy combinations, which apply ECMP to the delay-critical traffic class.
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
Toguyeni, A., Korbaa, O.: Quality of service of Internet service provider networks: State of the art and new trends. In: Proc. of Int. Conference on Transparent Optical Networks (2007)
Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An architecture for differentiated service. IETF RFC 2475 (December 1998)
Braden, R., Clark, D., Shenker, S.: Integrated Services in the Internet Architecture: An Overview. IETF RFC 1633 (June 1994)
LeFaucheur, F., et al.: Multi-Protocol Label Switching (MPLS) Support of Differentiated Services. IETF RFC 3270 (May 2002)
Colitti, W., Steenhaut, K., Nowe, A.: Multi-layer traffic engineering and DiffServ in the next generation Internet. In: Proc. of 3rd Int. Conference on Communication System Software and Middleware (COMSWARE 2007), pp. 591–598 (2007)
Curado, M., Monteiro, E.: A survey of QoS routing algorithms. Trans. Engineering, Computing and Technology (2004)
Alsharif, S., Shahsavari, M.M.: Performance study of MPLS and DS techniques to improve QoS routing for critical applications on IP networks. In: Proc. of SPIE - The International Society for Optical Engineering (2008)
Bryskin, I., Farrel, A.: GMPLS: Architecture and Applications. Morgan Kaufmann Publishers Inc., San Francisco (2005)
Moungla, H., Krief, F.: Service differentiation over GMPLS. In: de Souza, J.N., Dini, P., Lorenz, P. (eds.) ICT 2004. LNCS, vol. 3124, pp. 628–637. Springer, Heidelberg (2004)
Guerin, R., Orda, A., Williams, D.: QoS routing mechanisms and OSPF extensions. In: Proc. of Global Internet Miniconference (1997)
Medina, A., Lakhina, A., Matta, I., Byers, J.W.: BRITE: An approach to universal topology generation. In: Proc. of 9th Int. Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2001), p. 346. IEEE Computer Society, Los Alamitos (2001)
Leduc, G., Abrahamsson, H., Balon, S., Bessler, S., D’Arienzo, M., Delcourt, O., Domingo-Pascual, J., Cerav-Erbas, S., Gojmerac, I., Masip-Bruin, X., Pescapé, A., Quoitin, B., Romano, S.F., Salvatori, E., Skivée, F., Tran, H.T., Uhlig, S., Umit, H.: An open source traffic engineering toolbox. Computer Communications 29, 593–610 (2006)
Fortz, B., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: Proc. of 19th IEEE INFOCOM, Tel Aviv, Israel, vol. 2, pp. 519–528 (2000)
Fortz, B., Rexford, J., Thorup, M.: Traffic engineering with traditional IP routing protocols. IEEE Communications Magazine 40, 118–124 (2002)
Wang, Z.: Internet QoS: Architectures and Mechanisms for Quality of Service. Morgan Kaufmann Publishers Inc., San Francisco (2001)
Raja, S.V.K., Raj, P.H.: Integrated subset split for balancing network utilization and quality of routing. Proc. of World Academy of Science, Engineering and Technology 20, 96–100 (2007)
Crawley, E., Nair, R., Tajagopalan, B., Sandick, H.: A framework for QoS based routing. IETF RFC 2386 (August 1998)
Varela, A., Vazao, T., Arroz, G.: Multi-service routing: A routing proposal for the next generation Internet. In: Boavida, F., Plagemann, T., Stiller, B., Westphal, C., Monteiro, E. (eds.) NETWORKING 2006. LNCS, vol. 3976, pp. 990–1001. Springer, Heidelberg (2006)
Ash, G.: Traffic Engineering and QoS Optimization of Integrated Voice & Data Networks. Morgan Kaufmann Publishers Inc., San Francisco (2007)
Kompella, K., Rekhter, Y.: OSPF Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS). IETF RFC 4203 (October 2005)
Nclakuditi, S., Zhang, Z., David, H.C.D.: On selection of candidate paths for proportional routing. Computer Networks 44, 79–102 (2004)
Medhi, D., Ramasamy, K.: Network Routing: Algorithms, Protocols, and Architectures. Morgan Kaufmann Publishers Inc., San Francisco (2007)
Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications 14(7), 1228–1234 (1996)
Jensen, U.: Vergleich von Traffic Engineering Strategien fuer IP-Netze mit verschiedenen Verkehrsklassen. Diplomarbeit, Fach Informatik, University of Erlangen, Germany (2008)
Maplesoft: Maple 12. Tool for mathematics and modeling, Waterloo, Ontario, Canada (2009), http://www.maplesoft.com/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jensen, U., Heindl, A. (2009). Comparison of Multi-service Routing Strategies for IP Core Networks. In: Al-Begain, K., Fiems, D., Horváth, G. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2009. Lecture Notes in Computer Science, vol 5513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02205-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-02205-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02204-3
Online ISBN: 978-3-642-02205-0
eBook Packages: Computer ScienceComputer Science (R0)