MPLS流量工程最小干扰选路算法研究.PDFVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.17, No.4, April 2006, pp.814−821 DOI: 10.1360/jos170814 Tel/Fax: +86-10 © 2006 by Journal of Softwar e. All rights reserved. ∗ MPLS 流量工程最小干扰选路算法研究 + 郑志梅 , 崔 勇 (清华大学 计算机科学与技术系,北京 100084) Study of Minimum Interference Routing Algorithm for MPLS Traffic Engineering + ZHENG Zhi-Mei , CUI Yong (Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China) + Corresponding author: Phn: +86-10 E-mail: zzm@, cy@ Zheng ZM, Cui Y. Study of minimum interference routing algorithm for MPLS traffic engineering. Journal of Software, 2006,17(4):814−821. /1000-9825/17/814.htm Abstract : Multiprotocol Label Switching (MPLS) enables the deployment of Internet traffic engineering to be sim- ple and efficient by using explicit routing of Label Switching Path (LSP). Hence, the LSP routing algorithm becomes the core and hot topic of traffic engineering. This paper analyzes the key ideas of Minimum Interference Routing Algorithm (MIRA) for LSP routing and then surveys the current improved schemes of MIRA. According to their technical methods, they are classified as reconfirming critical links class, utilizing traffic profile information class, adding admission control class, and solving multiple Quality of Service constraints class. After the key idea is analyzed for each class, their typical algorithms are presented and their advantages, suitable environments and shortcomings with a detailed comprehensive comparison are discussed. The end of the paper points out the future research field for the min- imum inter