Multi-path Constraint-based Routing Algorithms for MPLS Traffic Engineering 


Vol. 29,  No. 5, pp. 508-519, May  2004


PDF
  Abstract

This paper proposed two multi-path constraint-based routing algorithms for Internet traffic engineering using MPLS. In normal constraint-based shortest path first (CSPF) routing algorithm, there is a high probability that it cannot find the required path through networks for a large bandwidth constraint that is one of the most important constraints for traffic engineering. The proposed algorithms can divide the bandwidth constraint into two or more sub-constraints and find a constrained path for each sub-constraint, if there is no single path satisfying the whole constraint. Extensive simulations show that they enhance the success probability of path setup and the utilization of network resources.

  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]

J. Lee and B. Kim, "Multi-path Constraint-based Routing Algorithms for MPLS Traffic Engineering," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 5, pp. 508-519, 2004. DOI: .

[ACM Style]

Jae-Young Lee and Byung-Chul Kim. 2004. Multi-path Constraint-based Routing Algorithms for MPLS Traffic Engineering. The Journal of Korean Institute of Communications and Information Sciences, 29, 5, (2004), 508-519. DOI: .

[KICS Style]

Jae-Young Lee and Byung-Chul Kim, "Multi-path Constraint-based Routing Algorithms for MPLS Traffic Engineering," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 5, pp. 508-519, 5. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880