基于拉格朗日松弛法的时延约束组播路由算法  

Lagrange Relaxation-Based Method for Delay-Constrained Multicast Routing

作　　者：马建平[1] 孙强[1] 

机构地区：[1]华东师范大学计算机科学与技术系,上海200062

出　　处：《计算机技术与发展》2006年第11期128-130,共3页Computer Technology and Development

摘　　要：通过对时延约束组播路由网络模型的分析,提出了一种基于拉格朗日松弛法的时延约束的低代价组播路由算法(LR-DLMR)。由于封闭图对原网络的多播不可达问题,该算法并没有构建原网络的封闭图,从而有效利用了链路中间节点信息。仿真实验结果表明本算法具有良好的稳定性,有较低的代价和时延。By analyzing network model of delay - constrained multicast muting, Lagrange relaxation - based method for delay - constrained lest - cost multicast muting （LR - DLMR） is presnted. Because closure - graph has a problem for the original graph, the multicast tree is produced by LR - DLMR wihout constructing closure - graph. Simulations dermonstrante that performance of the algorithro is steady,cost and delay of multicast tree are both lower.

关 键 词：组播路由 时延约束 STEINER树 拉格朗日松弛 

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