摘要
为了满足多播业务的实时性要求、提高资源利用率,提出一种新的时延受限最小代价树多播路由算法。该算法基于最小代价多播树的生成方法,对节点之间的时延进行动态修改,寻找满足时延限制的最短路径,可快速找到满足时延约束的多播树。实验结果表明,该算法生成速度快、代价性能良好、能够满足多媒体网络的实时性要求。
A new algorithm for delay- constrained minimum - cost multicast routing directed at ensuring real time requirement and resource usage of multicast tree is proposed. The algorithm is based on an algorithm of creating minimum - cost multicast tree,changes the delays among nodes dynamically, finds shortest path which satisfies delay constraint, and gets delay - constrained minimum - cost tree quickly. A large number of simulations demonstrate that the algorithm has nice creating speed and nice cost performance,and can satisfy the real time requirement of network.
出处
《计算机技术与发展》
2006年第10期5-7,共3页
Computer Technology and Development
关键词
时延约束
多播路由
服务质量
多播树
delay constraint
multicast muting
quality of service
multicast tree
