基于蚁群优化的应用层多播路由算法  

A New Algorithm Based ACO for Routing Problem in Application-Layer Multicast Network

作　　者：洪孙焱[1] 陆正福[1] 申时凯[2] 王武[2] 

机构地区：[1]云南大学数学系,云南昆明650091 [2]昆明学院计算机系,云南昆明650031

出　　处：《广西师范大学学报（自然科学版）》2008年第3期230-233,共4页Journal of Guangxi Normal University:Natural Science Edition

基　　金：国家自然科学基金资助项目(10561009);云南省教育厅自然科学基金资助课题(6Y0070D)

摘　　要：路由问题是应用层多播中最复杂的问题之一。给出了一种基于蚁群优化(ACO)的应用层多播路由算法,可同时得到度均衡和较小直径的多播树。为证实算法在现实网络中的表现,建立了Cernet-Like模型。SHI曾经给出了与目标相同的ICT算法。在Cerne-Like模型上对ICT和ACO算法进行了对比测试,结果表明ACO算法能够得到直径更小且度更均衡的多播路由树。Routing problem is one of the most complex problems in application-layer multicast network. A new ACO algorithm for routing problem in application-layer multicast network is proposed. This algorithm seeks to balance the multicast tree while minimizing the tree diameter. To confirm the performance of the algorithm in real network,a new network model named Cernet-Like is presented. The goal of the algorithm is the same with that designed by SHI. In Cerne-Like model, ICT algorithm and ACO algorithm are tested,and the result indicates that the ACO algorithm can obtain shorter diameter and more balanced multicast routing tree.

关 键 词：蚁群优化 应用层多播 路由算法 OVERLAY NETWORK CERNET 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]