基于时延约束的快速低代价组播路由算法  

Fast Low-cost Multicast Routing Algorithm Based on Delay-constrained

作　　者：孙光明[1] 王硕 李伟生[1] 

机构地区：[1]北京交通大学计算机与信息技术学院,北京100004 [2]河北交通学院计算机教研室,石家庄050091

出　　处：《计算机工程》2010年第13期117-119,共3页Computer Engineering

摘　　要：低代价最短路径树是一种广泛使用的组播树,通常不能满足实时多媒体应用中信息从源端到目的端传输的时延限制。针对该问题,提出基于时延约束的快速低代价组播路由算法,利用代价构建满足时延约束的初始树,将不满足时延约束的路径用最小时延路径代替。仿真结果表明,相比时延约束最短路径树算法,该算法的计算时间更少,组播树的总代价更低。Low-cost shortest path tree is a widely used multicast tree,but often cannot meet the demand of delay constraint from source to destination end during information transmission in real-time multimedia application.Aiming at this problem,this paper presents a fast low-cost multicast routing algorithm based on delay-constrained.It uses cost to construct initial tree satisfied delay-constrained,and the path unsatisfied delay-constrained is substitute for minimum delay path.Simulation results show that this algorithm has less computation time and low multicast tree total cost than Delay-Constrained Shortest Path tree（DCSP） algorithm.

关 键 词：快速低代价最短路径树 时延约束最短路径树 组播树 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]