基于图着色模型的弹性光网络频谱分配算法  

Spectrum allocation algorithm for elastic optical networks based on graph coloring model

作　　者：葛瑞林 江亮 陈铭毓 沈建华[1] GE Ruilin;JIANG Liang;CHEN Mingyu;SHEN Jianhua(School of communication and Information Engineering,Nanjing University of Posts and Telecommunications,Nanjin 210003,China)

机构地区：[1]南京邮电大学通信与信息工程学院,南京210003

出　　处：《光通信技术》2023年第2期59-63,共5页Optical Communication Technology

摘　　要：为了有效降低弹性光网络的频谱碎片程序和阻塞率,提出一种基于图着色模型的弹性光网络频谱分配算法。首先,对弹性光网络建立图着色模型,将频谱分配问题转化为带权值的图上色问题,然后提出了2种改进的上色算法(链式搜索法和改进的贪心算法)。仿真结果表明:与度最大着色算法相比,改进的2种上色算法能更好地优化频谱资源并降低平均链路阻塞率。In order to effectively reduce frequency spectrum fragmentation and blocking probability in elastic optical networks, a spectrum allocation algorithm based on graph coloring model is proposed. Firstly, a graph coloring model is established for elastic optical networks, and the spectrum allocation problem is transformed into a graph coloring problem with weights. Then, two improved coloring algorithms(chain search method and improved greedy algorithm) are proposed. The simulation results show that compared with the degree maximum coloring algorithm, the two improved coloring algorithms can better optimize the spectrum resources and reduce the average blocking probability.

关 键 词：弹性光网络 频谱分配 图着色模型 贪心算法 算法设计 

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