A Study of Bandwidth Guaranteed Routing Algorithms for Traffic Engineering

  • Phuong-Thanh Cao ThaiEmail author
  • Hung Tran Cong
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 457)


Due to the fast growths of computer networks, traffic engineering (TE) which tries to satisfy both quality of services and resource utilization requirements is an important research area. Among TE mechanisms, routing algorithm – a strategy to select paths for traffic – plays a crucial role and there have been many TE routing proposals. This paper gives a thorough study of these algorithms by presenting their key ideas and mathematical descriptions, and then by various experiments so to analyse their performances with different metrics. The paper also discusses the trend of routing algorithms and future research directions.


bandwidth guaranteed routing traffic engineering 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kar, K., Kodialam, M., Lakshman, T.: Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications. IEEE Journal on Selected Areas in Communications 18(12), 2566–2579 (2000)CrossRefGoogle Scholar
  2. 2.
    Even, S., Itai, A., Shamir, A.: On the complexity of time table and multi-commodity flow problems. In: Proceeding SFCS 1975 Proceedings of the 16th Annual Symposium on Foundations of Computer Science, pp. 184–193. IEEE (1975)Google Scholar
  3. 3.
    Guerin, R.A., Orda, A., Williams, D.: QoS routing mechanisms and OSPF extensions. In: Global Telecommunications Conference, GLOBECOM 1997, vol. 3, pp. 1903–1908. IEEE (1997)Google Scholar
  4. 4.
    Kotti, A., Hamza, R., Bouleimen, K.: Bandwidth constrained routing algorithm for MPLS traffic engineering. In: International Conference on Networking and Services (ICNS 2007), Athens, Greece, p. 20 (2007)Google Scholar
  5. 5.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: Theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs (1993)zbMATHGoogle Scholar
  6. 6.
    Wang, B., Su, X., Chen, C.: A new bandwidth guaranteed routing algorithm for MPLS traffic engineering. In: Conference Proceedings of 2002 IEEE International Conference on Communications, ICC 2002 (Cat. No.02CH37333), pp. 1001–1005 (2002)Google Scholar
  7. 7.
    Boutaba, R., Szeto, W., Iraqi, Y.: DORA: efficient routing for MPLS traffic engineering. Journal of Network and Systems Management 10, 309–325 (2002), doi:10.1023/A:1019810526535CrossRefGoogle Scholar
  8. 8.
    Alidadi, A., Mahdavi, M., Hashmi, M.R.: A new low-complexity QoS routing algorithm for MPLS traffic engineering. In: 2009 IEEE 9th Malaysia International Conference on Communications (MICC), Kuala Lumpur, Malaysia, pp. 205–210 (2009)Google Scholar
  9. 9.
    Oommen, B.J., Misra, S., Granmo, O.: Routing Bandwidth-Guaranteed paths in MPLS traffic engineering: A multiple race track learning approach. IEEE Transactions on Computers 56(7), 959–976 (2007)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Lin, N., Lv, W.-F., Yang, T.: Paths optimal ordering algorithm based on MPLS traffic engineering. In: 2009 Ninth International Conference on Hybrid Intelligent Systems, Shenyang, China, pp. 492–495 (2009)Google Scholar
  11. 11.
    Issariyakul, T., Hossain, E.: Introduction to network simulator NS2. Springer, New York (2011)Google Scholar
  12. 12.
    Novák, V., Adamec, P., Šmrha, P., Verich, J.: CESNET2 IP/MPLS backbone network design and deployment in 2008 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Saigon UniversityHo Chi Minh CityVietnam
  2. 2.Post & Telecommunications Institute of TechnologyHo Chi Minh CityVietnam

Personalised recommendations