A new precomputation scheme for MPLS traffic engineering routing

  • Authors:
  • Zhaowei Meng;Jinshu Su;Vittorio Manetti

  • Affiliations:
  • School of Computer, National University of Defense Technology, Changsha, P.R. China;School of Computer, National University of Defense Technology, Changsha, P.R. China;COMICS Lab, Dipartimento di Informatica e Sistemistica, Universit‘a di Napoli Federico II, Napoli, Italy

  • Venue:
  • ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new precomputation algorithm for Multi Protocol Label Switching (MPLS) traffic engineering routing. The prior MPLS routing algorithms try to minimize the interference between different source-destination pairs by circumventing the critical links. But the process of identifying critical links is very computationally expensive. The main contribution of this paper is a new precomputation approach of route selection considering the interference. The proposed algorithm reduces online computing complexity through efficient precomputation. From the simulation results, the proposed algorithm outperforms prior algorithms in terms of efficiency and complexity.