Abstract
In this paper, an off-line traffic engineering algorithm is presented that optimizes the single-path routing of Label Switched Paths in a Differentiated Services IP domain by means of explicit, Multi-Protocol Label Switching controlled nonshortest paths. This algorithm allows traffic engineering up to 2500 traffic trunks in flat networks with sizes up to 150 nodes while supporting protection, pre-emption, quality-of-service, oversubscription, and resource class affinity. The algorithm with proper extensions can be applied to hierarchical networks, thus increasing the scalability properties for network size with a factor of about 50. First the single-area algorithm is detailed, then the concept and implementation of hierarchy is introduced for inter-area traffic engineering. These topics are illustrated with simulation results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, An architecture for differentiated services, RFC 2475, informational, December 1998.
D. O. Awduche, A. Chiu, A. Elwalid, I. Widjaja, and X. Xiao, Overview and Principles of Internet Traffic Engineering, RFC 3272, informational, May 2002.
E. Rosen, A. Viswanathan, and R. Callon, Multiprotocol label switching architecture, RFC 3031, standards track, January.
D. Medhi, Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks, IEEE/ACM Transactions on Networking, December 1995.
T. Marosits, S. Molnar, and G. Fodor, Supporting all service classes in ATM: A novel traffic control framework, Informatica (Slovenia), Vol.23, No.3, 1999.
K. Murakami and H. S. Kim, Comparative study on restoration schemes of survivable ATM networks, Proc. IEEE INFOCOM 1997, Kobe, Japan, April 7-11, 1997.
Y. Xiong and L. Mason, Restoration strategies and spare capacity requirements in self-healing ATM networks, IEEE/ACM Transactions on Networking, February 1999.
R. Guerin, A. Orda, and D. Williams, QoS routing mechanisms and OSPF extensions, Proc. Second Global Internet Miniconference, November 1997.
M. S. Kodlalam and T. V. Lakshman, Minimum interference routing with applications to MPLS traffic engineering, INFOCOM (2), pp. 884-893, 2000.
S. Suri, M. Waldvogel, and P. R. Warkhede, Profile-based routing: A new framework for MPLS traffic engineering, Quality of Future Internet Services, Lecture Notes in Computer Science 2156, Springer Verlag, pp. 138-157, September 2001.
Y. Wang and Z. Wang, Explicit routing algorithms for internet traffic engineering, Proc. Eighth Computer Communications and Networks, Boston, Massachusetts, October 1999.
Z. Liu, Y. Sun, and X. Xue, A static routing algorithm used in the Internet traffic engineering, Proc Seventh Asian-Pacific Conference on Circuits and Systems (IEEE, APCCAS), Tianjin, China, December 2000.
R. Boubata, W. Szeto, and Y. Iraqi, DORA: Efficient routing for MPLS traffic engineering, Journal of Network and Systems Management, Vol.10, No.3, pp. 309-325, September 2002.
J. Jiang and S. Papavassiliou, Providing end-to-end quality-of-service with optimal least weight routing in next-generation multiservice high-speed networks, Journal of Network and Systems Management, Vol.10, No.3, pp. 281-308, September 2002.
J. Heinanen, T. Finland, and F. Baker, Cisco Systems, W. Weiss, Lucent Technologies, J. Wroclawski, MIT LCS, Assured forwarding PHB Group, RFC 2597, standards track, June 1999.
G. Armitage, B. Carpenter, A. Casati, J. Crowcroft, J. Halpern, B. Kumar, and J. Schnizlein, A delay bound alternative revision of RFC 2598, RFC 3248, informational, March 2002.
X. Xiao, A. Hannan, B. Bailey, and L. Ni, Traffic Engineering with MPLS in the Internet, IEEE Network, March/April 2000.
S. Van den Bosch, F. Poppe, and G. Petit, Single-path traffic-engineering with explicit routes in a flat differentiated services network, Proc. International Conference on Communications (ICC), Helsinki, Finland, June 2001.
F. Poppe, S. Van den Bosch, P. de La Vallée Poussin, H. Van Hove, and H. De Neve, G. Petit, Choosing the objectives for traffic engineering in IP backbone networks based on quality-of-service requirements, QoFIS 2000, Berlin, Germany, September 2000.
T. Li and H. Smit, IS-IS extensions for Traffic Engineering, work in progress.
D. Katz, D. Yeung, and K. Kompella, Traffic Engineering Extensions to OSPF Version 2, work in progress.
F. Le Faucheur, L. Wu, B. Davie, S. Davari, P. Vaananen, R. Krishnan, P. Cheval, and J. Heinanen, Multi-Protocol Label Switching (MPLS) support of differentiated services, RFC 3270, standards track, May 2002.
D. Awduche, J. Malcolm, J. Agogbua, M. E'Dell, and J. McManus, Requirements for traffic engineering over MPLS, RFC 2702, informational, September 1999.
J. Y. Yen, Finding the k shortest loopless paths in a network, Management Science, Vol.17, No.11, pp. 712-716, July 1971.
S. Van den Bosch, P. de La Vallée Poussin, G. Van Hoey, H. De Neve, and G. Petit, Study of scalability properties of two LP-Based algorithms for traffic engineering in a flat differentiated services network, IEEE Workshop on High Performance Switching and Routing, May 29-31, Dallas, Texas pp. 180-184, 2001.
ILOG CPLEX 7.0 User's Manual, pp. 159-161, 2000.
J. Moy, OSPF standardization report, RFC 2329, informational, April 1998.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Degrande, N., Van Hoey, G., de La Vallée Poussin, P. et al. Inter-Area Traffic Engineering in a Differentiated Services Network. Journal of Network and Systems Management 11, 427–445 (2003). https://doi.org/10.1023/B:JONS.0000005472.61905.ca
Issue Date:
DOI: https://doi.org/10.1023/B:JONS.0000005472.61905.ca