ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지

M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering

  • Hong, Daniel W. (Operation Support System Lab., KT) ;
  • Hong, Choong-Seon (Department of Computer Engineering, Kyung Hee University) ;
  • Lee, Gil-Haeng (Broadband Convergence Network Research Division, ETRI)
  • Received : 2004.08.26
  • Published : 2005.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

Keywords

References

  1. Requirements for Traffic Engineering Over MPLS, RFC 2702 Awduche, D.;Malcolm, J.;Agogbua, J.;O`Dell, M.
  2. Proc. of 2nd Global Internet Miniconference (Joint with Globecom’97) QoS Routing Mechanisms and OSPF Extension Guerin, R.;Orda, Ariel;Williams, D.
  3. MPLS Technology and Applications Davie, B.;Rekhter, Y.
  4. Proc. of IEEE GLOBECOM’97 QoS Routing Mechanism and OSPF Extensions Guerin, R.;Orda, A.;Williams, D.
  5. IEEE Network v.14 no.2 RATES: A Server for MPLS Traffic Engineering Aukia, P.;Kodianlam, M.;Koppol, P.V.;Lakeshman, T.V.;Sarin, H.;Suter, B.
  6. Web ProForum Tutorials Int’l Eng. Consortium, A Comparison of Multiprotocol Label Switching (MPLS) Traffic-Engineering Initiatives
  7. Using Constraint-Based Routing to Deliver New Services Nortel Network
  8. Proc. of IEEE Int’l Conf. on Network Protocol On Path Selection for Traffic with Bandwidth Guarantees Ma, Q.;Steenkiste, P.
  9. Proc. of IEEE ICNP On Path Selection for tra.c with Bandwidth Guarantees Ma, Q.;Steenkiste, P.
  10. Proc. of INFOCOM Minimum Interference Routing with Applications to MPLS Traffic Engineering Kodialam, M.;Lakshman, T.V.
  11. IEEE JSAC v.14 no.7 QoS Routing for Supporting Multimedia Applications Wang, Z.;Crowcroft, J.
  12. Proc. of IEEE Int’l Conf. on Network Protocols On Path Selection for Traffic with Bandwidth Gurantees Qingming Ma, P.S.
  13. Computer Commun. and Networks Explicit Routing Algorithms for Internet Traffic Engineering Yufei Wang;Zheng Wang
  14. A Framework for QoS-based Routing in the InternetI, IETF RFC2386 Crawley, E.;Nair, R.;Sandick, H.
  15. IEEE J. on Selected Areas in Comm. v.14 no.7 Quality of Service Routing for Supporting Multimedia Applications Wang, Z.;Crowcroft, J.
  16. Int’l J. of Network and Systems Management, Special Issue on Traffic Eng. and Management v.10 no.3 DORA: Efficient Routing Algorithm for MPLS Traffic Engineering Boutaba, R.;Szeto, W.;Iraqi, Y.
  17. ETRI J. v.26 no.1 Scalable Quasi-Dynamic-Provisioning-Based Admission Control Mechanism in Differentiated Service Networks Rhee, Woo-Seop;Lee, Jun-Hwa;Yu, Jea-Hoon;Kim, Sang-Ha
  18. ETRI J. v.26 no.3 Streaming Media and Multimedia Conferencing Traffic Analysis Using Payload Examination Kang, Hun-Jeong;Kim, Myung-Sup;Hong, James W.
  19. IEEE Network v.13 no.2 Internet QoS: A Big Picture Xiao, X.;Ni, L.
  20. Proc. of IEEE ICCCN99 Explicit Routing Algorithms for Internet Traffic Engineering Wang, Y.;Wang, Z.
  21. Notes on Path Computation in Constraint-Based Routing;Internet-Draft Kompella, K.;Awduche, D.O.
  22. Proc. of IEEE Globecom’98 Generalised Analysis of a QoS-Aware Routing Algorithm Andrew, L.L.H.;Kusuma, A.A.N.A.
  23. Proc. of IEEE GLOBECOM 2001 no.1 Evaluation of Routing Algorithms and Network Topologies for MPLS Traffic Engineering Satoshi Kamei;Takumi Kimura
  24. A Framework for QoS-Based Routing in the Internet, RFC 2386 Crawley, E.;Nair, R.;Rajagopalan, B.;Sandick, H.
  25. Traffic Engineering & QoS Methods for IP-, ATM-, & TDM-Based Multiservice Networks, Internet-Draft Ash, G.R.
  26. IEEE Network v.14 no.2 Traffic Engineering with MPLS in the Internet Xiao, X.;Hanan, A.;Bailey, B.