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

基于多拓扑路由无拥塞快速业务迁移算法 　　摘要：针对IP网络更新引发的业务迁移中潜在的链路拥塞问题，提出一种基于多拓扑路由的无拥塞快速业务迁移（CAFTMMTR）算法。首先，考虑链路容量约束以及源节点迁移的时序特征，为源节点安排一种无拥塞的迁移顺序；然后，为减少迁移完成时间，基于业务的顺序无关性改进算法，使得每次批量迁移多个顺序无关的业务。利用多个典型拓扑与Waxman拓扑对提出的算法进行了仿真实验，与不考虑迁移顺序的业务迁移（NonCAFTMMTR）方法相比，该算法将拥塞避免成功率从20%～60%提高至100%，同时得到8步以内的迁移顺序；此外，该算法具有对动态流量的适应性，能适应5%～284%的业务流量增长。仿真结果表明，CAFTMMTR算法能够提高避免拥塞风险的成功率并快速地迁移业务。 　　关键词：无拥塞；快速业务迁移；优化模型；多拓扑路由 　　中图分类号： TP393.01 文献标志码：A 　　Abstract： For the potential link congestion problem during traffic migration caused by IP network updates， a Congestion Avoidance and Fast Traffic Migration based on MultiTopology Routing （CAFTMMTR） 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 NonCongestion Avoidance and Fast Traffic Migration based on MTR （NonCAFTMMTR） method， and obtained less than 8round 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 CAFTMMTR algorithm can effectively improve the success rate of congestion avoidance， and meanwhile make the traffic migration fast. 　　Key words： congestion avoidance； fast traffic migration； optimization model； MultiTopology Routing （MTR） 　　0 引言 　　近年来，随着电视广播、IP语音或视频以及在线游戏等因特网实时媒体服务的日益普及，IP核心网络面临快速且翻倍的流量增长，根据贝尔实验室预测，到2017年，仅互联网视频一项，流量将增长逾6倍，这些快速增长的新兴业务给IP网络运营商提出了更高的运营水平要求。为了应对这些挑战，网络服务提供商通常会频繁地更新网络，例如，更换硬件、升级软件、更新配置[1-2]等。 　　IP网络更