基于路径计算单元的光网络故障恢复中的并行流量迁移  

Parallel Traffic Migration of Restoration in PCE-based Optical Networks

作　　者：张引[1] 卢建国 黄善国[1] 李新[1] 张民[1] 赵永利[1] 张杰[1] 顾畹仪[1] 

机构地区：[1]北京邮电大学信息光子学与光通信国家重点实验室,北京100876 [2]内蒙古电力信息通信中心,呼和浩特010020

出　　处：《光子学报》2013年第6期661-667,共7页Acta Photonica Sinica

基　　金：国家重点基础研究发展计划(Nos.2010CB328202;2010CB328204;2012CB315604);国家自然科学基金(No.61271191);国家高技术研究发展计划(No.2012AA011302);教育部新世纪优秀人才支持计划(No.NCET-12-0793);北京市科技新星计划(No.2011065);中央高校基本科研业务专项基金资助

摘　　要：基于路径计算单元的光网络,根据无充足空闲资源用于无需流量迁移状态的恢复光路建立的背景,围绕故障恢复时尽量减少被中断连接的流量迁移过程,对并行的流量迁移过程进行了研究,建立了相应的数学模型,提出了并行流量迁移的实现方法,给出了可以得到并行流量迁移过程中连接新旧光路拆建顺序的启发式算法.文中提出的最小化最大中断连接资源需求数并行流量迁移算法包含依赖关系图分割算法和最小化最大中断连接资源需求数拆建顺序确定算法两大部分.仿真证明了最小化最大中断连接资源需求数并行流量迁移算法相对于普通串行流量迁移算法可以利用较少的额外中断得到迁移时间的大幅缩短.The problem about the parallel traffic migration in recovery of the optical network based on path computation element is studied under the condition that the backup lightpaths cannot be setup using present available resources without traffic migration. A mathematical model is established, and the parallel traffic migration is realized. A heuristic algorithm is provided to obtain the order of restoration in parallel traffic migration, which is composed of dependence graph partition and lightpath sorting by minimizing the max number of the required resource of disrupted connections algorithm. The simulations show that minimizing the max number of the required resource of disrupted connections algorithm can significantly shorten the duration of the traffic migration in recovery with acceptable cost.

关 键 词：流量迁移 光网络 故障恢复 并行 

分 类 号：TN915.5[电子电信—通信与信息系统]