A New Precomputation Scheme for MPLS Traffic Engineering Routing

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.

Original document

The different versions of the original document can be found in:

• http://wpage.unina.it/vittorio.manetti/documents/200ZhaoweiMeng.pdf

• http://link.springer.com/content/pdf/10.1007/11947950_44,

http://dx.doi.org/10.1007/11947950_44 under the license http://www.springer.com/tdm

• https://dblp.uni-trier.de/db/conf/icdcn/icdcn2006.html#MengSM06,

https://link.springer.com/chapter/10.1007%2F11947950_44,

http://wpage.unina.it/vittorio.manetti/documents/200ZhaoweiMeng.pdf,

https://www.researchgate.net/profile/Vittorio_Manetti/publication/220725279_A_New_Precomputation_Scheme_for_MPLS_Traffic_Engineering_Routing/links/0912f50752ac941346000000.pdf,

https://rd.springer.com/chapter/10.1007/11947950_44,

https://academic.microsoft.com/#/detail/1575059480