A New Delay-Constrained Multicast Routing Algorithm Based on Shared Edges  

作　　者：Chunde Yang Xin Zhao 

机构地区：[1]College of Computer Science and Technology, Chongqing University of Posts and Telecommunication, Chongqing, China [2]College of Computer Science and Technology, Chongqing University of Posts and Telecommunication, Chongqing, China Institute of System Theory and Application, Chongqing University of Posts and Telecommunication, Chongqing, China

出　　处：《Communications and Network》2014年第1期43-47,共5页通讯与网络（英文）

摘　　要：In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not satisfy the delay constraint, so we can ensure that all paths be taken into account will meet the limit of delay constraint, then we find the least costly path in order to build a minimum cost multicast tree. Simulation results show that the algorithm is better than ESAMPH algorithm in performance.In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not satisfy the delay constraint, so we can ensure that all paths be taken into account will meet the limit of delay constraint, then we find the least costly path in order to build a minimum cost multicast tree. Simulation results show that the algorithm is better than ESAMPH algorithm in performance.

关 键 词：MULTICAST ROUTING Algorithm SHARED EDGES Quality of Service CONSTRAINT DELAY CONSTRAINT 

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