微信服务号

微信订阅号

2025年4月1日 18:04 星期二
首页 > 过刊浏览>2012年第23卷第8期 >2115-2129. DOI:10.3724/SP.J.1001.2012.04133
PDF HTML阅读 XML下载 导出引用 引用提醒
最小割多路径路由算法
作者:
基金项目:

国家自然科学基金(61002011, 90604019); 国家重点基础研究发展计划(973)(2009CB320505); 国家高技术研究发展计划(863)(2011AA01A102); 高等学校博士学科点专项科研基金(200800131019); 中央高校基本科研业务费专项资金(BUPT2011RC0610); 软件开发环境国家重点实验室开放课题(SKLSDE-2009KF-2-08)


Min-Cut Multi-Path Routing Algorithm
Author:
  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [14]
    • |
  • 相似文献 [20]
    • | | |
  • 文章评论
    摘要:

    在最小割理论基础上提出了最小割多路径(min-cut multi-path,简称MCMP)路由算法,为流量请求选取少量关键路径,并在这些路径间均衡流量,在获得方法易实现性的同时能够有效地控制网络瓶颈链路拥塞.通过实际流量数据在北美和欧洲骨干网络中的实验,对比常用的OSPF(open shortest path first)路由算法和模型中的多路径路由算法,MCMP 路由算法可降低拥塞链路负载分别达到41%和20%以上.

    Abstract:

    On the basis of minimum cut theory, the article proposes a min-cut multi-path (MCMP) routing algorithm, which select key paths of small quantity and distribute traffic evenly among the paths. MCMP is apt to implement and control congestion at bottleneck links. With real traffic datasets, experiments are carried on European and North American backbone networks. By comparisons with OSPF (open shortest path first) routing algorithm commonly used in intra-domain network and a multi-path routing algorithm used in optimal model, the maximum link load resulted from MCMP routing algorithm decreases over 41% and 20% separately.

    参考文献
    [1] Fortz B, Thorup M. Internet traffic engineering by optimizing OSPF weights. In: Proc. of the 19th Annual Joint Conf. of the IEEEComputer and Communications Societies (INFOCOM 2000). 2000. 519-528. [doi: 10.1109/INFCOM.2000.832225]
    [2] Sridharan A, Guerin R, Diot C. Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks. In: Proc. ofthe 22nd Annual Joint Conf. of the IEEE Computer and Communications (INFOCOM 2003). 2003. 1167-1177. [doi: 10.1109/INFCOM.2003.1208953]
    [3] Xu DH, Chiang M, Rexford J. DEFT: Distributed exponentially-weighted flow splitting. In: Proc. of the 26th IEEE Int’l Conf. onComputer Communications (INFOCOM 2007). 2007. 71-79. [doi: 10.1109/INFCOM.2007.17]
    [4] Younis O, Fahmy S. Constraint-Based routing in the Internet: Basic principles and recent research. IEEE Trans. onCommunications Surveys and Tutorials, 2003,5(1):2-13. [doi: 10.1109/COMST.2003.5342226]
    [5] Kodialam M, Lakshman TV. Minimum interference routing with applications to MPLS traffic engineering. In: Proc. of the 19thAnnual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM 2000). 2000. 884-893. [doi: 10.1109/INFCOM.2000.832263]
    [6] Li YX, Bai BC, Harms J, Holte R. Multipath oblivious routing for traffic engineering—Stable and robust routing in changing anduncertain environments. In: Proc. of the Int’l Teletraffic Congress (ITC 2007). 2007. 129-140.
    [7] Wang N, Ho KH, Pavlou G, Howarth M. An overview of routing optimization for Internet traffic engineering. IEEE Trans. onCommunications Surveys and Tutorials, 2008,10(1):36-56. [doi: 10.1109/COMST.2008.4483669]
    [8] Altin A, Fortz B, Thorup M, ümit H. Intra-Domain traffic engineering with shortest path routing protocols. 4OR: A QuarterlyJournal of Operations Research, 2009,7(4):301-335. [doi: 10.1007/s10288-009-0113-0]
    [9] Antic M, Maksic N, Knezevic P, Smiljanic A. Two phase load balanced routing using OSPF. IEEE Journal on Selected Areas inCommunications, 2010,28(1):51-59. [doi: 10.1109/JSAC.2010.100106]
    [10] Xu K, Liu HY, Liu JC, Zhang JX. LBMP: Alogarithm-Barrier-Based multipath protocol for Internet traffic management. IEEETrans. on Parallel and Distributed Systems, 2011,22(3):476-488. [doi: 10.1109/TPDS.2010.95]
    [11] Leighton T, Rao S. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal ofthe ACM, 1999,46(6):787-832. [doi: 10.1145/331524.331526]
    [12] Ahuja RK, Magnanti TL, Orlin JB. Network Flows: Theory, Algorithms, and Applications. Beijing: China Machine Press, 2005.
    [13] 6 months of Abilene traffic matrices. http://www.cs.utexas.edu/~yzhang/
    [14] Uhlig S, Quoitin B, Lepropre J, Balon S. Providing public intradomain traffic matrices to the research community. ACMSIGCOMM Computer Communication Review, 2006,36(1):83-86. [doi: 10.1145/1111322.1111341]
    引证文献
引用本文

杨华卫,王洪波,程时端,陈山枝,崔毅东.最小割多路径路由算法.软件学报,2012,23(8):2115-2129

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

京公网安备 11040202500063号