A novel network planning algorithm with fixed alternate routing for MPLS traffic engineering

Pin Han Ho, Xiaohong Jiang, Susumu Horiguchi, Jańos Tapolcai

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper solves the problem of path selection for connection-oriented MPLS-based mesh networks. A novel network planning algorithm, called Capacity-Balanced Alternate Routing (C-BAR), is proposed. For C-BAR, alternate paths between each ingressegress pair are defined at the network planning stage according to the network topology and the potential traffic load and location of each ingress-egress pair, so that the routing of label switched paths (LSPs) can take the most advantage of the load-balancing characteristic of the alternate paths. Both analytical and simulation-based studies are conducted to examine the proposed approach. The results show that the C-BAR algorithm can significantly improve the performance in blocking probability by spreading potential traffic load into the whole network compared with the other reported connection-oriented routing schemes.

Original languageEnglish
Pages (from-to)165-186
Number of pages22
JournalDynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms
Volume13
Issue number1
Publication statusPublished - Dec 28 2006

Keywords

  • Blocking probability
  • Fixed alternate routing
  • Wavelength division multiplexing

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A novel network planning algorithm with fixed alternate routing for MPLS traffic engineering'. Together they form a unique fingerprint.

  • Cite this