An Efficient MPLS Routing System for Supporting QoS and Best-Effort Services 


Vol. 28,  No. 1, pp. 71-79, Jan.  2003


PDF
  Abstract

As the traffic grows rapidly in the Internet, the QoS guarantee of the flows and the traffic engineering problems have become very important issues. MPLS has more advantages to solve the problems than existing IP routing because of its use of multiple paths between the source and destination pairs Particularly, the availability of Constraint-based Shortest Path First(CSPF) algorithm and explicit route in MPLS made the problem referred above to be solved efficiently. However, the CSPF algorithm has the characteristic of selecting the shortest path of all paths which meet the traffics' QoS constraints Therefore, even though there are alternative paths to route traffic, alternate QoS paths may not be found and best-effort traffic will be dropped during congestion period In this paper, we present the network resource optimization method related to the traffic engineering by using load balancing through routing in MPLS network.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Jeon, S. Kim, Y. Shin, J. Lee, H. Kim, "An Efficient MPLS Routing System for Supporting QoS and Best-Effort Services," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 1, pp. 71-79, 2003. DOI: .

[ACM Style]

HahnEarl Jeon, Sung-Dae Kim, Yong-chul Shin, Jaiyong Lee, and Hyung-Taek Kim. 2003. An Efficient MPLS Routing System for Supporting QoS and Best-Effort Services. The Journal of Korean Institute of Communications and Information Sciences, 28, 1, (2003), 71-79. DOI: .

[KICS Style]

HahnEarl Jeon, Sung-Dae Kim, Yong-chul Shin, Jaiyong Lee, Hyung-Taek Kim, "An Efficient MPLS Routing System for Supporting QoS and Best-Effort Services," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 1, pp. 71-79, 1. 2003.