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

一种延时约束费用最小分布式动态组播路由算法
引用本文:王征应,石冰心,刘伟.一种延时约束费用最小分布式动态组播路由算法[J].软件学报,2001,12(1):1-10.
作者姓名:王征应  石冰心  刘伟
作者单位:华中科技大学 电子信息工程系,
基金项目:This project is supported by the National ‘Ninth-Five’ Sci-Tech Key P roject of China under Grant No.96-743-01-04-02 (“九五”国家重点科技攻关项目 ).
摘    要:多媒体应用一般包含多个组播成员,它消耗大量的网络资源且有严格的端端延时约束.针对这个问题,提出了一种延时约束费用最小的分布式动态组播路由启发算法DDDDCLCMR(distributeddynamicdelay-constrainedleast-costmulticastroutingalgorithm).在DDDDCLCMR算法中,组播源点很少或根本不参与路由计算;即使组播成员发生改变,组播树变化也很小,算法扩展性好.实验结果表明,无论组播成员改变与否,DDDCLCMR算法都能获得满足延时约束且费用很低的组播树.

关 键 词:服务质量  组播  动态路由  分布式算法  启发式

A Distributed Dynamic Delay-Constrained Lea st-Cost Multicast Routing Heuristic
WANG Zheng-ying,SHI Bing-xin and LIU Wei.A Distributed Dynamic Delay-Constrained Lea st-Cost Multicast Routing Heuristic[J].Journal of Software,2001,12(1):1-10.
Authors:WANG Zheng-ying  SHI Bing-xin and LIU Wei
Abstract:Many new distributed multimedia applications involve dynamic multiple participan ts, have stringent end-to-end delay requirement and consume large amount of ne twork resources. In this paper, a new DDDCLCMR (distributed dynamic delay-const rained least-cost multicast routing algorithm) is proposed to support these app lications. DDDCLCMR scales well because the source of the multicast tree needs o nly limited computation or may even not be involved in the route computation. Wh en group membership changes, the existing multicast tree is perturbed as little as possible. Simulation results show that DDDCLCMR performs very well in terms o f delay and cost for both static and dynamic multicast groups, compared with the best multicast algorithms known.
Keywords:QoS  multicast  dynamic routin g  distributed algorithm  heuristic
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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