| 基于拉格朗日松弛法的时延约束组播路由算法 |
| |
| 引用本文： | 马建平,孙强. 基于拉格朗日松弛法的时延约束组播路由算法[J]. 微机发展, 2006, 16(11): 128-130 |
| |
| 作者姓名： | 马建平 孙强 |
| |
| 作者单位： | 华东师范大学计算机科学与技术系 上海200062 |
| |
| 摘 要： | 通过对时延约束组播路由网络模型的分析,提出了一种基于拉格朗日松弛法的时延约束的低代价组播路由算法(LR-DLMR)。由于封闭图对原网络的多播不可达问题,该算法并没有构建原网络的封闭图,从而有效利用了链路中间节点信息。仿真实验结果表明本算法具有良好的稳定性,有较低的代价和时延。
|
| 关 键 词： | 组播路由 时延约束 Steiner树 拉格朗日松弛 |
| 文章编号： | 1673-629X(2006)11-0128-03 |
| 修稿时间： | 2006-02-28 |
Lagrange Relaxation-Based Method for Delay-Constrained Multicast Routing |
| |
| MA Jian-ping,SUN Qiang. Lagrange Relaxation-Based Method for Delay-Constrained Multicast Routing[J]. Microcomputer Development, 2006, 16(11): 128-130 |
| |
| Authors: | MA Jian-ping SUN Qiang |
| |
| Abstract: | By analyzing network model of delay-constrained multicast routing,Lagrange relaxation-based method for delay-constrained lest-cost multicast routing(LR-DLMR) is presented.Because closure-graph has a problem for the original graph,the multicast tree is produced by LR-DLMR without constructing closure-graph.Simulations demonstrate that performance of the algorithm is steady,cost and delay of multicast tree are both lower. |
| |
| Keywords: | multicast routing delay-constrained Steiner tree Lagrange relaxation |
| 本文献已被 CNKI 等数据库收录！ |
