采用蚁群算法解决光网络中动态及分布式RWA问题的方法  

Ant Colony Algorithm—Distributed Strategy for Solving RWA Problem in Optical WDM Network

作　　者：郑滟雷[1] 顾畹仪[1] 连伟华[1] 黄善国[1] 

机构地区：[1]北京邮电大学光通信与光波技术教育部重点实验室,北京100876

出　　处：《北京理工大学学报》2009年第12期1104-1109,共6页Transactions of Beijing Institute of Technology

基　　金：国家自然科学基金资助项目(60702005);国家"八六三"计划项目(2009AA01Z218);国家教育部长江学者与创新团队发展计划项目(IRT0609)

摘　　要：为了在大规模节点网络中提高路由与波长分配(RWA)算法的性能指标,解决集中式计算方式与网络资源实时变化之间的矛盾问题,提出了一种基于动态业务模型下的分布式蚁群算法.该方法在波长连续的前提下,尝试利用蚂蚁找食的天然特性,由单只蚂蚁一次性的完成路由和波长分配任务,算法在两个具备不同规则的拓扑结构上进行了仿真.通过算法分析和仿真结果表明,基于分布式的策略可以更好地完成光路的选择,可降低光网络中的呼叫阻塞率,有利于提高网络资源的利用率.To improve the performance parameters in routing and wavelength assignment（RWA） and solve the contradiction between the style of central computation and network resources dynamic changes,a distributed ant colony algorithm is proposed under the dynamic traffic model.In the case of the wavelength continuity constraint,this method,with the natures of ant forging,dispatches the routing selection and wavelength assignment on single ant during its movement synchronously.The effectiveness of this RWA is verified through the simulation on two different topology networks.Algorithm is analyzed and simulation results are given,which showed that blocking probability can be significantly reduced and wavelength resource can be more efficiently used by this algorithm.

关 键 词：路由与波长分配 蚁群算法 波分复用 光网络 信息素 

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