基于多拓扑路由的无拥塞快速业务迁移算法

doi:10.11772/j.issn.1001-9081.2015.07.1809

计算机应用 ›› 2015, Vol. 35 ›› Issue (7): 1809-1814.DOI: 10.11772/j.issn.1001-9081.2015.07.1809

基于多拓扑路由的无拥塞快速业务迁移算法

罗龙, 虞红芳, 罗寿西

电子科技大学光纤传感与通信教育部重点实验室, 成都 611731

收稿日期:2015-01-19 修回日期:2015-03-12 出版日期:2015-07-10 发布日期:2015-07-17
通讯作者: 龙(1989-),女,四川成都人,硕士研究生,主要研究方向:网络路由、软件定义网络,longvslong@gmail.com
作者简介:罗虞红芳(1975-),女,浙江萧山人,教授,博士,主要研究方向:网络(及功能)虚拟化、云计算、网络生存性; 罗寿西(1988-),男,四川泸州人,博士研究生,主要研究方向:网络虚拟化、云计算、软件定义网络。
基金资助:
国家自然科学基金资助项目(61271171);国家973计划项目(2013CB329103)。

Congestion avoidance and fast traffic migration based on multi-topology routing

LUO Long, YU Hongfang, LUO Shouxi

Key Laboratory of Optical Fiber Sensing and Communications Education Ministry of China, University of Electronic Science and Technology of China, Chengdu Sichuan 611731, China

Received:2015-01-19 Revised:2015-03-12 Online:2015-07-10 Published:2015-07-17

摘要/Abstract

摘要：

针对IP网络更新引发的业务迁移中潜在的链路拥塞问题,提出一种基于多拓扑路由的无拥塞快速业务迁移(CAFTM-MTR)算法。首先,考虑链路容量约束以及源节点迁移的时序特征,为源节点安排一种无拥塞的迁移顺序;然后,为减少迁移完成时间,基于业务的顺序无关性改进算法,每次批量迁移多个顺序无关的业务。利用多个典型拓扑与Waxman拓扑对提出的算法进行了仿真实验,与不考虑迁移顺序的业务迁移(NonCAFTM-MTR)方法相比,该算法将拥塞避免成功率从20%~60%提高至100%,同时得到8步以内的迁移顺序;此外,该算法具有对动态流量的适应性,能适应5%~284%的业务流量增长。仿真结果表明,CAFTM-MTR算法能够提高避免拥塞风险的成功率并快速地迁移业务。

关键词: 无拥塞, 快速业务迁移, 多拓扑路由

Abstract:

For the potential link congestion problem during traffic migration caused by IP network updates, a Congestion Avoidance and Fast Traffic Migration based on Multi-Topology Routing (CAFTM-MTR) algorithm was proposed. Firstly, the link capacity constraints and the timing characteristic of source node traffic migration were considered, and a congestion avoidance migration sequence that each moves one source node was gotten. Secondly, to shorten the migration finishing time, the algorithm was improved based on the sequence independence of traffics to make each batch move multiple sequence independent traffics. By using typical topologies and Waxman topologies to validate the proposed algorithm, the proposed algorithm improved the success rate of avoiding congestion from 20%-60% to 100% in the comparison experiments with Non-Congestion Avoidance and Fast Traffic Migration based on MTR (NonCAFTM-MTR) method, and obtained less than 8-round migration sequence. In addition, the proposed algorithm had an adaptability of dynamic traffic and was able to accommodate the traffic growth ranging from 5% to 284%. The simulation results show that CAFTM-MTR algorithm can effectively improve the success rate of congestion avoidance, and meanwhile make the traffic migration fast.

Key words: congestion avoidance, fast traffic migration, Multi-Topology Routing (MTR)

中图分类号:

TP393.01

罗龙, 虞红芳, 罗寿西. 基于多拓扑路由的无拥塞快速业务迁移算法[J]. 计算机应用, 2015, 35(7): 1809-1814.

LUO Long, YU Hongfang, LUO Shouxi. Congestion avoidance and fast traffic migration based on multi-topology routing[J]. Journal of Computer Applications, 2015, 35(7): 1809-1814.

参考文献

[1] PONGPAIBOOL P, DOVERSPIKE R, ROUGHAN M, et al. Handling IP traffic surges via optical layer reconfiguration [C]// OFC 2002: Proceedings of the 2002 Optical Fiber Communication Conference and Exhibit. Piscataway: IEEE, 2002: 427-428.
[2] MARKOPOULOU A, IANNACCONE G, BHATTACHARYYA S, et al. Characterization of failures in an operational IP backbone network [J]. IEEE/ACM Transactions on Networking, 2008, 16(4): 749-762.
[3] PEI D, WANG L, MASSEY D, et al. A study of packet delivery performance during routing convergence [C]// Proceedings of the 2003 International Conference on Dependable Systems and Networks. Piscataway: IEEE, 2003: 183-192.
[4] FRANCOIS P, BONAVENTURE O. Avoiding transient loops during the convergence of link-state routing protocols [J]. IEEE/ACM Transactions on Networking, 2007, 15(6): 1280-1292.
[5] CLAD F, MÉRINDOL P, PANSIOT J J, et al. Graceful conver-gence in link-state IP networks: a lightweight algorithm ensuring minimal operational impact [J]. IEEE/ACM Transactions on Networking, 2014, 22(1): 300-312.
[6] PSENAK P, MIRTORABI S, ROY A, et al. Multi-Topology (MT) routing in OSPF [EB/OL]. [2014-12-20]. http://www.rfc-base.org/rfc-4915.html.
[7] JIA B. A study on multi-topology routing technology for fast recovery of IP networks [D]. Chengdu: University of Electronic Science and Technology of China, 2010.(贾冰.多拓扑路由技术应用于IP网络快速恢复的研究[D].成都:电子科技大学,2010.)
[8] YANG H. Traffic engineering for IP networks based on multi-topology routing [D]. Chengdu: University of Electronic Science and Technology of China, 2013.(杨嬛.基于多拓扑路由的IP网络流量工程研究[D].成都:电子科技大学,2013.)
[9] KUANG K, WANG S, WANG X. Discussion on the combination of loop-free alternates and maximally redundant trees for IP networks fast reroute [C]// Proceedings of the 2014 IEEE International Conference on Communications. Piscataway: IEEE, 2014: 1131-1136.
[10] SPRING N, MAHAJAN R, WETHERALL D. Measuring ISP topologies with Rocketfuel [J]. IEEE/ACM Transactions on Networking, 2004, 12(1): 2-6.
[11] ZHANG M, YI C, LIU B, et al. GreenTE: power-aware traffic engineering [C]// Proceedings of the 2010 18th IEEE International Conference on Network Protocols. Piscataway: IEEE, 2010: 21-30.
[12] WANG X, RAN M. Link weights migration without congestion in IP networks [C]// Proceedings of the 2014 23rd International Conference on Computer Communication and Networks. Piscataway: IEEE, 2014: 1-6.

[1]	邓伟健陈曦. 基于时变资源的容器化虚拟网络映射算法[J]. 计算机应用, 0, (): 0-0.
[2]	董文涛, 李卓, 陈昕. 基于联邦学习的在线短视频内容分发策略[J]. 计算机应用, 2021, 41(6): 1551-1556.
[3]	陈维兴, 刘清涛, 孙习习, 陈斌. 机坪感知网络的快速收敛平均一致性时间同步算法[J]. 计算机应用, 2020, 40(11): 3407-3412.
[4]	王明芬. 软件定义无线局域网的切换接入机制[J]. 计算机应用, 2020, 40(9): 2706-2711.
[5]	韩俊樱, 张振宇, 孔德仕. 移动群智感知中面向用户区域的分布式多任务分配方法[J]. 计算机应用, 2020, 40(2): 358-362.
[6]	樊琦, 李卓, 陈昕. 基于边缘计算的分支神经网络模型推断延迟优化[J]. 计算机应用, 2020, 40(2): 342-346.
[7]	吴三柱, 李鹏, 吴三斌. 移动无线传感器网络中抑制病毒传播模型[J]. 计算机应用, 2020, 40(1): 129-135.
[8]	袁培燕, 蔡云云. 移动边缘计算中一种贪心策略的内容卸载方案[J]. 计算机应用, 2019, 39(9): 2664-2668.
[9]	杨正清, 周朝荣, 袁姝. 移动群智感知系统中基于离散布谷鸟搜索算法的任务分配[J]. 计算机应用, 2019, 39(9): 2778-2783.
[10]	辛营营, 刘晓娟, 方春林, 罗欢. 信息中心网络内数据重传算法的优化[J]. 计算机应用, 2019, 39(3): 829-833.
[11]	宋子晖, 李卓, 陈昕. 基于压缩感知的移动群智感知任务分发机制[J]. 计算机应用, 2019, 39(1): 15-21.
[12]	汪明, 许亮, 何小敏. 无线传感器网络精度优选RSSI协作定位算法[J]. 计算机应用, 2018, 38(7): 1981-1988.
[13]	李安超, 陈桂芬. 基于奇偶轮成簇和双簇首的非均匀分簇协议[J]. 计算机应用, 2018, 38(7): 1995-2000.
[14]	赵焜松, 余敦辉, 张万山. 软件众包任务发布优先级计算方法[J]. 计算机应用, 2018, 38(7): 2032-2036.
[15]	赵焜松余敦辉张万山. 软件众包任务发布优先级计算方法研究[J]. 计算机应用, 0, (): 0-0.

基于多拓扑路由的无拥塞快速业务迁移算法

Congestion avoidance and fast traffic migration based on multi-topology routing

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics