首页 | 官方网站   微博 | 高级检索  
     

一种基于延时及带宽受限的启发式组播路由算法
引用本文:石坚,董天临,邹玲,贺聿志.一种基于延时及带宽受限的启发式组播路由算法[J].电子学报,2001,29(8):1113-1116.
作者姓名:石坚  董天临  邹玲  贺聿志
作者单位:武汉华中科技大学电子与信息工程系,湖北武汉 430074
基金项目:高等院校骨干教师基金,,
摘    要:在分析了网络中基于延时和带宽受限的组播路由优化问题的基础上,本文提出了一种新的启发式算法,并进行了实验和分析.结果表明文中构造的路由方案成功地解决了当网络中存在多组组播业务时的QoS路由选择问题.此方案不仅保证了带宽、端到端延时,优化了路由树的代价,而且有效地控制了算法的复杂性并可适用于大规模的网络中.

关 键 词:组播路由  带宽  延时  代价  路由树  
文章编号:0372-2112(2001)08-1113-04
收稿时间:2000-09-06

A Heuristic Algorithm for Delay-Bandwidth-Constrained Multicast Routing
SHI Jian,DONG Tian-lin,ZOU Ling,HE Yu-zhi.A Heuristic Algorithm for Delay-Bandwidth-Constrained Multicast Routing[J].Acta Electronica Sinica,2001,29(8):1113-1116.
Authors:SHI Jian  DONG Tian-lin  ZOU Ling  HE Yu-zhi
Affiliation:Dept.of Electronics & Information Eng.,Huazhong Univ.of Sci.& Tech.,Wuhan,Hubei 430074,China
Abstract:On the basis of describing the optimization of multicast routing with delay and bandwidth constrained,the paper presents a new heuristic algorithm.Then some experiments have been given to analyze the performances.The result shows that the routing mechanism in this paper successfully solves the QoS routing problems when many-to-many cast session exists.The scheme not only optimizes the routing tree with guarantee of the bandwidth and end to end delay,but also effectively controls the algorithm complexity which is suitable for large size of network.
Keywords:multicast  bandwidth  delay  cost  routing tree
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号