基于图着色及小区选择思想的波长分配算法  

An Optical Transport Network Wavelength-Assignment Algorithm based on Graph-Coloring and Mobile Network Cell Select Strategy

作　　者：毕晓雪 陈赟昌[2] BI Xiao-xue;CHEN Yun-chang(Wuhan Research Institute of Posts & Telecommunications, Wuhan 430074, China;FiberHome Telecommunication Technologies Co.,Ltd., Wuhan 430074, China)

机构地区：[1]武汉邮电科学研究院,武汉430074 [2]烽火通信科技股份有限公司,武汉430074

出　　处：《光通信研究》2019年第4期14-18,60,共6页Study on Optical Communications

基　　金：国家科技重大专项子课题资助项目(2017ZX03001016-005)

摘　　要：针对光传送网络(OTN)中路由及波长分配(RWA)问题中的波长分配子问题,文章提出了一种图着色与移动通信网络中移动台寻找服务小区策略相结合的启发式算法,给出了算法实现的流程图以及相应的伪代码,并对波长分配子问题中所涉及的关键性指标进行了实验对比分析。实验结果表明,该算法在保证链路使用中继数量最少和波长一致的条件下,使网络进行波长分配时的失败率最高可下降4%,且全网使用的波长和中继盘的增加量在0.5%以内,满足了工程实践的需求。In this paper, we present a heuristic algorithm based on graph-coloring and strategy of mobile station selecting serving cell to solve the wavelength-assignment problem which is a sub-problem of Routing and Wavelength Assignment(RWA) problem in Optical Transport Network(OTN). We provide the process diagram, pseudo-code and designe the parameters to show the performance compared with other wavelength assignment algorithms. The experimental results show that the failure rate of wavelength assignment would reduce about 4%, and the increases of wavelength and regenerator are just 0.5%, which are under the constrain of wavelength-continuity and minimal number of wavelength and optical regenerators. This algorithm satisfies the application of network construct.

关 键 词：光传送网络 波长分配算法 中继算法 小区选择 路由及波长分配问题 

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