Capacity-Balanced Alternate Routing For MPLS Traffic Engineering

  • Authors:
  • Pin-Han Ho;Hussein T. Mouftah

  • Affiliations:
  • -;-

  • Venue:
  • ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper solves the problem of path selection for connection-oriented MPLS-based mesh networks with a special focus on implementation issues in middle-sized networks, such as Metropolitan-Area Networks (MANs). A novel network planning algorithm, called Capacity-Balanced Alternate Routing (C-BAR), is proposed. For C-BAR, alternate paths between each ingress-egress pair are defined at a network planning stage according to thenetwork topology and potential traffic load and location of each ingress-egress pair so that load-balancing can be achieved in routing label switched paths (LSPs). Both analytical and simulation-based studies have been 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 to the whole network compared with the other reported connection-oriented routing schemes.