Skip to main content
SpringerLink
Log in

A coarse-grained differentiated routing algorithm in multi-protocol label switching traffic engineering

  • Published:
Journal of Central South University of Technology Aims and scope Submit manuscript

Abstract

A new coarse-grained differentiated least interference routing algorithm (CDLI) with DiffServ-Aware was presented. This algorithm is composed of off-line and on-line stages, taking into account both real-time traffic and best-effort traffic. Off-line stage is to determine the shortest path set disjointed path (DP) database for real-time traffic, and to identify link critical value by traffic profile information of real-time traffic and DP database. On-line stage is at first to select route in the DP database for real-time traffic, if there is no path to meet the needs, the dynamic routing will be operated. On-line routing algorithm chooses the relatively short path for real-time traffic to meet their bandwidth requirements, and for best-effort traffic it chooses a lighter load path. The simulation results show that compared with the dynamic online routing algorithm (DORA) and constrained shortest path first (CSPF) algorithm, the new algorithm can significantly improve network throughput and reduce the average path length of real-time traffic. This guarantees quality of service (QoS) of real-time traffic while improving the utilization of network resources.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. IETF RFC 2702. Requirements for traffic engineering over MPLS [S].

  2. BARAKOVIC J, BAJRIC H, HUSIC A. QoS design issues and traffic engineering in next generation IP/MPLS network [C]// IEEE Telecommunications. Piscataway: Institute of Electrical and Electronics Engineers Computer Society, 2007: 203–210.

  3. IETF RFC 3272. Overview and principles of internet traffic engineering [S].

  4. YOU B S, SEOK S J, YOUM S K, KIM K H, KANG C H. Traffic engineering using a heuristic multi-path routing strategy in MPLS network [C]// Proceedings of 2006 Asia-Pacific Conference on Communication. Busan, 2006: 926–932.

  5. JACOBS P, DAVIE B. Technical challenges in the delivery of interprovider QoS [J]. IEEE Communication Magazine, 2005, 43(6): 112–118.

    Article  Google Scholar 

  6. PASIAS V, KARRAS DA, PAPADEMETRIOU RC. A framework for traffic engineering and routing in survivable multi-service high bit rates optical networks [C]// Proceedings of Multimedia Signal Processing and Communications. Zagreb: Croatian Society Electronics in Marine, 2006: 353–357.

  7. HONG D W, HONG C S, LEE G H. A scalable CSPF routing scheme with multiple QoS constraints for MPLS traffic engineering [J]. ETRI Journal, 2005, 27(6): 733–746.

    Article  MathSciNet  Google Scholar 

  8. ZHENG Zhi-mei, CUI Yong. Study of minimum interference routing algorithm for MPLS traffic engineering [J]. Journal of Software, 2006, 17(4): 814–821. (in Chinese)

    Article  MATH  Google Scholar 

  9. KODIALAM M, LAKSHMAN T V. Minimum interference routing with applications to MPLS traffic engineering [C]// Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies. Piscataway: IEEE, 2000: 884–893.

    Google Scholar 

  10. HENDING K, LOSERT T, HUBER W, JANDL M. Interference minimizing bandwidth guaranteed on-line routing algorithm for traffic engineering [C]// Proceedings of the 12th IEEE International Conference on Networks. Singapore, 2004: 497–503.

  11. SZETO W, BOUTABA R, IRAQI Y. Dynamic online routing algorithm for MPLS traffic engineering [C]// Proceedings of the Networking 2002. Berlin Heidelberg: Springer-Verlag, 2002: 936–946.

    Google Scholar 

  12. SURI S, WALDVOGEL M, WARKHEDE P R. Profile-based routing: A new framework for MPLS traffic engineering [C]// Proceedings of the Second International Workshop on Quality of Future Internet Services. Berlin, 2001: 138–157.

  13. ZHENG Zhi-mei, CUI Yong. A least interference path algorithm for MPLS traffic engineering [J]. Chinese Journal of Computers, 2007, 30(6): 934–944. (in Chinese)

    Google Scholar 

  14. ILIADIS I, BAUER D. A new class of online minimum interference routing algorithm [C]// Proceedings of the Networking 2002. Berlin: Springer-Verlag, 2002: 959–971.

    Google Scholar 

  15. TRAN C H, NGUYEN H T, NGUYEN D T, HEA W J, TEA K, SUNG H K, WOO J Y. Advanced routing algorithms and load balancing on MPLS [C]// Proceedings of IEEE Advanced Communication Technology. New York: Institute of Electrical and Electronics Engineers, 2007: 1886–1891.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Information Science and Engineering, Northeastern University, Shenyang, 110004, China

    Li Du  (杜荔), Jun-xiang Yu  (于军相) & Xiao-jing Wang  (王晓静)

Authors
  1. Li Du  (杜荔)
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun-xiang Yu  (于军相)
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiao-jing Wang  (王晓静)
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Li Du  (杜荔).

Additional information

Foundation item: Project(2003AA781011) supported by the National High-Tech Research and Development of Program of China; Project(20072022) supported by Science and Technology Foundation of Liaoning Province, China

Rights and permissions

Reprints and permissions

About this article

Cite this article

Du, L., Yu, Jx. & Wang, Xj. A coarse-grained differentiated routing algorithm in multi-protocol label switching traffic engineering. J. Cent. South Univ. Technol. 17, 1258–1263 (2010). https://doi.org/10.1007/s11771-010-0629-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11771-010-0629-7

Key words

Search

Navigation