| 一种基于链路优化的时延约束组播路由算法 |
| |
| 引用本文： | 王珩,孙亚民. 一种基于链路优化的时延约束组播路由算法[J]. 南京理工大学学报(自然科学版), 2004, 28(1): 80-84 |
| |
| 作者姓名： | 王珩 孙亚民 |
| |
| 作者单位： | 南京理工大学计算机科学与技术系,江苏,南京,210094 |
| |
| 摘 要： | 研究具有时延约束的最小代价组播路由问题，提出一种基于链路优化的组播路由算法求解该问题。算法从最小时延树开始，不断地用低代价链路代替树中高代价链路，以求得满足条件的组播树。仿真实验结果表明，该算法能根据组播应用对时延的要求，快速、有效地构造最优组播树，具有较低的时延。
|
| 关 键 词： | 组播路由 时延约束 QoS 链路优化 Steiner树 |
| 文章编号： | 1005-9830(2004)01-0080-05 |
| 修稿时间： | 2002-12-01 |
A Delay-constrained Multicast Routing Algorithm Based on Link Optimizing |
| |
| WANG Heng,SUN Ya-min. A Delay-constrained Multicast Routing Algorithm Based on Link Optimizing[J]. Journal of Nanjing University of Science and Technology(Nature Science), 2004, 28(1): 80-84 |
| |
| Authors: | WANG Heng SUN Ya-min |
| |
| Abstract: | Delay-constrained least-cost multicast routing problem is studied, and a multicast routing algorithm based on link optimizing is proposed to solve the problem. The algorithm begins from a least-delay tree, then iteratively replaces expensive tree links with cheaper links, and gets final multieast tree satisfying delay constraint. The simulated results show that the proposed algorithm performs better in terms of delay and running time against existing heuristics algorithm, and constructs optimal delay-constrained multicast tree efficiently. |
| |
| Keywords: | multicast routing delay constraint quality-of-service link optimizing Steiner tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
