mpls 流量工程最小干扰选路算法研究 - semantic scholar.pdfVIP

下载本文档

3
0
约 8页
2017-09-03 发布于天津
举报
版权申诉

mpls 流量工程最小干扰选路算法研究 - semantic scholar.pdf

1、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

mpls 流量工程最小干扰选路算法研究 - semantic scholar

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 interf