一种新的动态QoS多播路由启发式算法 |
| |
引用本文: | 高玲玲,李伟生. 一种新的动态QoS多播路由启发式算法[J]. 北京邮电大学学报, 2006, 29(21): 98-101 |
| |
作者姓名: | 高玲玲 李伟生 |
| |
作者单位: | 北京交通大学 计算机与信息技术学院,北京 100044 |
| |
摘 要: | 为了满足多播业务的实时性要求、提高网络资源利用率,提出一种新的时延受限动态多播路由算法。该算法充分考虑路径时延对多播树总代价的影响,利用前k条最短路径方法和路径选择函数来生成多播树。算法可以在满足时延约束的情况下,快速地找到性能较好的多播树,同时可以根据网络节点的加入或退出请求来更新多播树,实现对多播树的动态维护。实验结果表明,该算法代价性能良好、能够满足多媒体网络的实时性要求。
|
关 键 词: | 时延约束 多播路由 服务质量 动态 |
收稿时间: | 2006-01-05 |
A New Dynamic QoS Multicast Routing Heuristic Algorithm |
| |
Affiliation: | Department of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China |
| |
Abstract: | A new algorithm for dynamic delay-constrained multicast routing directed at ensuring real time requirement of multicast tree and for efficiency of network resource using is proposed. The algorithm takes into account of the influence of path delay to tree cost and makes use of the method finding the k shortest paths and the function of selecting path to create multicast tree. When the delay constraint is satisfied, the algorithm will get the low cost tree quickly and can update multicast tree based on adding/deleting requirements of nodes. A large number of simulations demonstrate that the algorithm has nice cost performance and can satisfy the real time requirement of network. |
| |
Keywords: | delay constraint multicast routing quality of service dynamic |
|
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 |
|
点击此处可从《北京邮电大学学报》下载全文 |