基于蚁群算法的QoS多播路由优化策略  

STRATEGY OF QOS MULTICAST ROUTING OPTIMIZING BASED ON ANT COLONY ALGORITHMS

作　　者：崔明义[1] 张新祥[1] 苏白云[1] 张瑞[1] 

机构地区：[1]河南财经学院计算机科学系,河南郑州450002

出　　处：《计算机应用与软件》2007年第10期50-52,共3页Computer Applications and Software

基　　金：河南省自然科学基金(0411013800;0411014500);河南省高校杰出科研人才创新工程项目(2004KYCX014)的资助

摘　　要：对QoS多播路由和约束最小Steiner多播树进行了分析,提出了基于蚁群算法搜索约束最小Steiner多播树的ACMC算法,并与DDMC算法进行了实验比较。结果表明,在同样环境和多播组规模的条件下,ACMC算法花费的网络代价小于DDMC算法,从而验证了ACMC算法的有效性和可行性。Along with the fast development of network multimedia technology, QoS multicast routing is becoming one of the focus problems that draws people＇s attention. QoS multicast routing and min-restriction Steiner multicast tree are analyzed. Based on ant colony algorithms ,AC- MC algorithms are presented, by which min-restriction Steiner multicast tree is searched, ACMC is compared with DDMC. The experimental result indicates that in same condition and multicast scale. ACMC network costs less than DDMC Validity and feasibility of ACMC are proved.

关 键 词：QOS多播路由 Steiner多播树 蚁群算法 DDMC算法 ACMC算法 

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