基于多条件约束的ASON动态组播路由算法  

A dynamic multicast routing algorithm based on multi-constraint in ASON

作　　者：吴启武[1] 王文君 王建萍[2] 林琳[3] 

机构地区：[1]武警工程大学通信工程系,陕西西安710086 [2]北京科技大学计算机与通信工程学院,北京100083 [3]中国电信科学技术研究院无线移动通信国家重点实验室,北京100191

出　　处：《光电子．激光》2012年第1期98-105,共8页Journal of Optoelectronics·Laser

基　　金：国家自然科学基金(60872047);武警工程大学基础研究基金(WJY201112)

摘　　要：在将自动交换光网络(ASON)建模成着色多重图的基础上采用综合成本策略,设计了一种新的最小综合成本路径计算算法,并结合组播成员的动态变化特性提出一种满足多条件约束的动态组播路由(DMRMC)算法,使组播路由和波长分配在同一过程内完成,且尽可能使组播树的综合总成本最小,同时局部优化波长转换次数、分光次数和不同波长的使用数量。仿真实验表明,本文算法有效可行,与采用单成本策略的组播算法相比,其取得了更低的综合成本和更好的连接阻塞性能。By constructing a colored multigraph model for automatically switched optical network（ASON） and using the strategy of comprehensive cost,a new algorithm of minimal comprehensive cost path is proposed.And combining the dynamic characteristics of group members,a dynamic multicast routing algorithm with multi-constraint（DMRMC） is presented.The proposed algorithm not only can finish multicast routing and wavelength assignment in one process,but also tries to make the comprehensive cost of multicast tree to be the least.Meanwhile,the number of wavelength conversions,the number of light-splittings and the number of wavelengths are optimized locally.Through simulation and analysis,it is proved that the proposed algorithm is effectively feasible,and achieves lower comprehensive cost and better blocking probability,compared with other algorithms which use the strategy of single cost.

关 键 词：自动交换光网络(ASON) 波分复用(WDM) 着色多重图 多约束(MC) 动态组播路由(DMR) 

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