| 一种新的基于Dijkstra算法的QoS组播树启发式算法 |
| |
| 引用本文： | 李秉智,李智.一种新的基于Dijkstra算法的QoS组播树启发式算法[J].重庆邮电学院学报(自然科学版),2006,18(1):115-118. |
| |
| 作者姓名： | 李秉智 李智 |
| |
| 作者单位： | 重庆邮电学院,重庆400065 |
| |
| 摘 要： | 基于Dijkstra算法和MCP_IA算法，提出了一种耗费受限的最短时延路径算法（CCLDA），并将其应用于时延和时延差异受限的算法（DDVCA），并给出了算法实现的伪代码，不仅满足了时延和时延差异限制，而且降低了最终所得的组播树的耗费，更能满足现实需要。
|
| 关 键 词： | 端到端时延 时延差异 组播树 |
| 文章编号： | 1004-5694（2006）01-0115-04 |
| 收稿时间： | 2005-07-17 |
A new QoS multicast tree heuristic algorithm based on Dijkstra algorithm |
| |
| LI Bing-zhi, LI Zhi.A new QoS multicast tree heuristic algorithm based on Dijkstra algorithm[J].Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition),2006,18(1):115-118. |
| |
| Authors: | LI Bing-zhi LI Zhi |
| |
| Institution: | Chongqing University of Posts and Telecommunications, Chongqing 400065, P. R. China |
| |
| Abstract: | This paper puts forward the CCLDA(Cost Constrained Least Delay Algorithm) based on Dijkstra Algorithm and MCP_IA,and then applies it to the DDVCA(Delay and Delay variation Constrained Algorithm) and gives code about the algorithm which is more situble for applications) so as not only to satisfy the delay and delay variation constraint but also to reduce the multicast tree cost. |
| |
| Keywords: | end to end delay delay variation multicast tree |
| 本文献已被 CNKI 维普 等数据库收录！ |
