基于遗传模拟退火算法的多约束QOS组播路由优化算法  

AN OPTIMIZATION ALGORITHM FOR MULTIPLE CONSTRAINED QOS MULTICAST ROUTING BASED ON GENETIC AND SIMULATED ANNEALING ALGORITHM

作　　者：屈志毅[1] 文雪飞[1] 范志明[1] 苏振明[1] 

机构地区：[1]兰州大学信息科学与工程学院,甘肃兰州730000

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

摘　　要：组播路由问题在计算机网络中是著名的Steiner树问题,是NP完全问题。通过考虑组播通信服务质量需求与网络资源约束,研究了基于服务质量的组播路由选择算法问题,首次提出了一个基于遗传算法和模拟退火算法的多约束组播路由优化算法,该算法在满足带宽、延时、延时抖动及包丢失率约束条件下寻找代价最小的组播树。The multicast routing problem in computer networks is also known as the famous Steiner tree problem which has shown to be NP-complete. Considering QoS requirements and network resource constraints,a QoS-based multicast routing algorithm is designed and implemented. An optimization algorithm for multiple constrained QoS multicast routing based on Genetic and Simulated Annealing Algorithm is presented,which can construct a multicast routing tree that meets the QoS requirements. The algorithm can find the least-cost multicasting tree with the bandwidth, delay jitter and packed loss-constrained.

关 键 词：QOS 组播路由 遗传算法 模拟退火算法 

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