微信服务号

微信订阅号

2025年3月24日 17:57 星期一
首页 > 过刊浏览>2006年第17卷第4期 >814-821
PDF HTML阅读 XML下载 导出引用 引用提醒
MPLS流量工程最小干扰选路算法研究
作者:
基金项目:

(Supported by the National Natural Science Foundation of China under Grant No.60403035 (国家自然科学基金)


Study of Minimum Interference Routing Algorithm for MPLS Traffic Engineering
Author:
  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [35]
    • |
  • 相似文献 [20]
    • |
  • 引证文献
    • | |
  • 文章评论
    摘要:

    多协议标记交换(multiprotocol label switching,简称MPLS)技术运用显式的标记交换路径(label switching path,简称LSP),使得互联网上流量工程的部署变得简单和高效.因此,LSP选路算法成为MPLS流量工程中的核心和热点问题.深入剖析了LSP选路算法中的最小干扰选路算法(minimum interference routing algorithm,简称MIRA)的关键思想,综述了对MIRA的各种改进方案,并依据其实现方案将现有主要最小干扰选路算法分为4类:关键链路的重新定位类、利用流量特征信息类、增加准入控制类和解决多服务质量受限类.在分析每类算法核心思想的基础上,阐述了各类的典型算法,讨论了每种算法的优点和适用环境,剖析了其中存在的主要问题,并对它们进行了综合对比.最后指出了最小干扰选路算法进一步的研究方向.

    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 algorithmbecomes the core and hot topic of traffic engineering. This paper analyzes the key ideas of Minimum InterferenceRouting Algorithm (MIRA) for LSP routing and then surveys the current improved schemes of MIRA. According totheir technical methods, they are classified as reconfirming critical links class, utilizing traffic profile informationclass, 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 interference routing problem.

    参考文献
    [1]Xiao XP,Hannan A,Bailey B,Ni LM.Traffic engineering with MPLS in the Internet.IEEE Network,2001,14(2):28-33.
    [2]Awduche D,Chiu A,Elwalid A,Widjaja I,Xiao X.Overview and principles of Internet traffic engineering.RFC3272,2002.
    [3]Lagoa CM,Che H,Movsichoff BA.Adaptive control algorithms for decentralized optimal traffic engineering in the Internet.IEEE/ACM Trans.on Networking,2004,12(3):415-428.
    [4]Swallow G.MPLS advantages for traffic engineering.IEEE Communications Magazine,1999,37(12):54-57.
    [5]Awduche D,Malcolm J,Agogbua J,O'Dell M,McManus J.Requirements for traffic engineering over MPLS.RFC2702,1999.
    [6]Mitra D,Wang Q.Stochastic traffic engineering for demand uncertainty and risk-aware network revenue management.IEEE/ACM Trans.on Networking,2005,13(2):221-233.
    [7]Fortz B,Thorup M.Internet traffic engineering by optimizing OSPF weights.In:Proc.of the 19th Annual Joint Conf.of the IEEE Computer and Communications Societies (INFOCOM 2000).2000.519-528.
    [8]Crawley E,Nair R,Jajagopalan B,Sandick H.A framework for QoS-based routing in the Internet.RFC2386,1998.
    [9]Apostolopoulos G,Kama S,Williams D,Guerin R,Orda A,Przygienda T.QoS routing mechanisms and OSPF extensions.RFC 2676,1999.
    [10]Khan JA,Alnuweiri HM.A fuzzy constraint-based routing algorithm for traffic engineering.In:Proc.of the IEEE Global Telecommunication Conf.2004 (GLOBECOM 2004).2004,3:1366-1372.
    [11]Kodialam M,Lakshman TV.Minimum interference routing with applications to MPLS traffic engineering.In:Proc.of the 19th Annual Joint Conf.of the IEEE Computer and Communications Societies (INFOCOM 2000).2000,2:884-893.
    [12]Kar K,Kodialam M,Lakshman TV.MPLS traffic engineering using enhanced minimum interference routing:An approach based on lexicographic max-flow.In:Proc.of the 8th Int'l Workshop on Quality of Service (IWQoS 2000).2000.105-114.
    [13]Chen SG,Nahrstedt K.Distrbuted QoS routing with imprecise state information.In:Proc.of the 7th Int'l Conf.on Computer Communications and Networks (ICCCN 1998).1998.614-621.
    [14]Tang J,Siew CK,Feng G.Parallel LSPs for constraint-based routing and load balancing in MPLS networks.IEE Proc.on Communications,2005,152(1):6-12.
    [15]Cui Y,Wu JP,Xu K,Xu MW.Research on Internetwork QoS routing algorithms:A survey.Journal of Software,2002,13(11):2065-2075 (in Chinese with English abstract).http://www.jos.org.cn/1000-9825/13/2065.htm
    [16]Wang SX,Philip B,Chen CL.A new bandwidth guaranteed routing algorithm for MPLS traffic engineering.In:Proc.of the IEEE Int'l Conf.on Communications (ICC 2002).2002,2:1001-1005.
    [17]Ahuja RK,Magnanti TL,Orlin JB.Network Flows:Theory,Algorithms,and Applications.Prentice Hall,1993.
    [18]Iliadis I,Bauer D.A new class of online minimum interference routing algorithms.In:Proc.of the NETWORKING 2002.LNCS 2345,2002.959-971.
    [19]Figueiredo GB,da Fonseca NLS,Monteiro JAS.A minimum interference routing algorithm.In:IEEE Int'l Conf.on Communications (ICC 2004).2004,4:1942-1947.
    [20]Kumar D,Kuri J,Kumar A.Routing guaranteed bandwidth virtual paths with simultaneous maximization of additional flows.In:IEEE Int'l Conf.on Communications (ICC 2003).2003,3:1759-1764.
    [21]Szeto W,Boutaba R,Iraqi Y.Dynamic online routing algorithm for MPLS traffic engineering.In:Proc.of the NETWORKING 2002.LNCS 2345,2002.936-946.
    [22]Bagula AB,Botha M,Krzesinski AE.Online traffic engineering:the least interference optimization algorithm.In:IEEE Int'l Conf.on Communications (ICC 2004).2004,2:1232-1236.
    [23]Bagula AB.Online traffic engineering:A hybrid IGP+MPLS routing approach.In:Proc.of the 5th Quality of Future Internet Services Conf.,QoFIS 2004.LNCS 3266,2004.134-143.
    [24]Yang Y,Zhang L,Muppala JK.Bandwidth-Delay constrained routing algorithms.Computer Networks,2003,42(4):503-520.
    [25]Suri S,Waldvogel M,Bauer D,Warkhede PR.Profile-Based routing and traffic engineering.Computer Communications,2003,26(4):351-365.
    [26]Capone A,Fratta L,Martignon F.Virtual flow deviation:Dynamic routing of bandwidth guaranteed connections.In:QoS-IP 2003.2003.592-605.
    [27]Gopalan K,Chiueh TC,Lin YJ.Load balancing routing with bandwidth-delay guarantees.IEEE Communications Magazine,2004,42:108-113.
    [28]Capone A,Martigno F.Analysis of dynamic QoS routing algorithms for MPLS networks.In:IEEE Int'l Conf.on Communications.2004,2:1192-1196.
    [29]Tan SW,Lee SW,Vaillaint B.Non-Greedy minimum interference routing algorithm for bandwidth-guaranteed flows.Computer Communications,2002,25(17):1640-1652.
    [30]Banerjee G,Sidhu D.Comparative analysis of path computation techniques for MPLS traffic engineering.ELSEVIER Computer Networks,2002,40:149-165.
    [31]Retvari G,Biro JJ,Cinkler T,Henk T.A precomputation scheme for minimum interference routing:The least-critical-path-first algorithm.In:Proc.of the 24th IEEE Int'l Conf.on Computer Communications (INFOCOM 2005).2005.260-268.
    [32]Walkowiak K.Survivable online routing for MPLS traffic engineering.LNCS 3266,Springer-Verlag,2004.288-297.
    [33]Sun FT,Shayman M.Minimum interference algorithm for integrated topology control and routing in wireless optical backbone networks.In:IEEE Int'l Conf.on Communications.2004,27(1):4232-4237.
    [34]Tapolcai J,Fodor P,Retvari G,Maliosz M,Cinkler T.Class-Based minimum interference routing for traffic engineering in optical networks.In:Next Generation Internet Networks.2005.31-38.
    [15]崔勇,吴建平,徐恪,徐明伟.互联网络服务质量路由算法研究综述.软件学报,2002,13(11):2065-2075.http://www.jos.org.cn/ 1000-9825/13/2065.htm
    引证文献
引用本文

郑志梅,崔勇. MPLS流量工程最小干扰选路算法研究.软件学报,2006,17(4):814-821

复制
分享
文章指标
  • 点击次数:7033
  • 下载次数: 7703
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2005-06-21
  • 最后修改日期:2005-10-08
文章二维码
友情链接:中国科学院软件研究所中国计算机学会中国科学院国家自然科学基金委员会CCF数字图书馆Int'l J of Softw Info计算机系统应用
您是第19728452位访问者
版权所有：中国科学院软件研究所 京ICP备05046678号-3
地址：北京市海淀区中关村南四街4号,邮政编码：100190
电话：010-62562563 传真：010-62562533 Email：jos@iscas.ac.cn
技术支持：北京勤云科技发展有限公司

京公网安备 11040202500063号