摘要
文章利用遗传算法安排光网络中预定组播业务的计算顺序,提出了优化业务顺序的分层图算法和点着色算法,并与按时间顺序安排业务的算法进行了比较。仿真表明,优化排序后,资源优化效果明显。在波长数的优化上,分层图算法比点着色算法性能更好。在分层图算法中,业务放置顺序的优化对组播树总链路数的减少也有一定帮助。
In this article, we have proposed the layered graph algorithm and vertex coloring algorithm for optimized traffic sequence, which use genetic algorithm to arrange the calculation order of the scheduled muhicast traffic in optical networks and compared them with the algorithm that arranges traffics in temporal sequence. Simulations show that the resource optimization effect after sequence optimization is evident and the layered graph algorithm outperforms the vertex coloring algorithm for the optimization of the number of the wavelengths. Besides, in layered graph algorithm, optimized traffic arrangement sequence also helps reduce the total link number of the multicast tree.
出处
《光通信研究》
北大核心
2006年第4期4-6,30,共4页
Study on Optical Communications
基金
国家自然科学基金资助项目(60302026
60372096)
国家"八六三计划"资助项目(2005AA122310)
关键词
预定组播业务
遗传算法
光网络
分层图
点着色
scheduled multicast traffic
genetic algorithm
optical network
layered graph
vertex coloring