基于模拟退火法的组播路由算法(英文)  

Multicast Routing Based on the Simulated Annealing

作　　者：黄林[1,2] 杜学武[2] 

机构地区：[1]中国计量学院数学系,杭州310018 [2]大连理工大学数学系,大连116023

出　　处：《工程数学学报》2010年第5期911-917,共7页Chinese Journal of Engineering Mathematics

基　　金：The Top Youth Teachers of the Universities in Henan Province.

摘　　要：本文提出了一种基于模拟退火算法的延时约束最小代价组播路由算法(SADLMA)。首先,本算法使用Dijkstra第K最短路算法建立了从源节点到每个目的节点的候选集。然后生成了相应的邻居结构。当温度下降时,根据接收概率从邻居结构里把新解选择出来,并且代替旧解。仿真试验表明本算法对实际网络是有效的。Based on the simulated annealing,we propose an efficient algorithm for generating a low-cost multicast routing with delay constraints.The algorithm starts with a backup-paths-set from the source node to each destination node by using the Dijkstra shortest path algorithm, and then generates the corresponding neighborhood structure.When temperature decreasing,a new solution is selected from the neighborhood structures according to the acceptance probability and replace the old solution.The simulation shows that our algorithm is efficient for some actual networks.

关 键 词：组播 模拟退火法 延时约束 

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