首页 | 本学科首页   官方微博 | 高级检索  
     

一种满足时延和时延抖动约束的多播路由算法
引用本文:姚兰,曾锋,王东. 一种满足时延和时延抖动约束的多播路由算法[J]. 计算机工程与应用, 2006, 42(17): 132-135
作者姓名:姚兰  曾锋  王东
作者单位:湖南大学计算机与通信学院,长沙,410082;湖南大学计算机与通信学院,长沙,410082;湖南大学计算机与通信学院,长沙,410082
基金项目:国家高技术研究发展计划(863计划)
摘    要:多播路由已有广泛的应用,但对于实时多播应用,多播路由的同时必须提供QoS保证。为此,论文研究带有时延和时延抖动约束的多播路由问题,通过对Dijkstra最短路径算法的扩展,提出一个快速有效的满足时延和时延抖动约束的多播路由算法EDDVCMR。实验结果表明,对解决带有时延和时延抖动约束的多播路由问题,该算法与DVMA算法相比,有高出7%的求解成功率,同时,算法执行的CPU时间减少36%。

关 键 词:多播路由  时延约束  时延抖动约束  服务质量
文章编号:1002-8331-(2006)17-0132-04
收稿时间:2005-09-01
修稿时间:2005-09-01

An Efficient Algorithm for Multicast Routing under Delay and Delay Variation Constraints
Yao Lan,Zeng Feng,Wang Dong. An Efficient Algorithm for Multicast Routing under Delay and Delay Variation Constraints[J]. Computer Engineering and Applications, 2006, 42(17): 132-135
Authors:Yao Lan  Zeng Feng  Wang Dong
Affiliation:College of Computer and Telecommunication,Hunan University,Changsha 410082
Abstract:Multicasting is widely used in various applications. But to real-time applications,the quality of service must be guaranteed in muhicast routing.This paper introduces the concept of multicast routing under delay and delay variation constraints,and then presents a muhicast routing algorithm EDDVMR to find a routing plan with delay and delay variation constraints.This algorithm is based on extended Dijkstra shortest path algorithm,and has a low complexity which is near to the complexity of Dijkstra shortest path algorithm.Experiment results show that comparing to DVMA,the succeed rate to solve this problem is 7% higher than that generated by DVMA,and the CPU time decreases 36%.
Keywords:muhicast routing  delay constraint  delay variation constraint  Quality of Server
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号