一种多约束的应用层组播路由算法

由于IP多播在应用上的困难。应用层网络作为多播服务平台逐步被人们认可。针对实时多媒体应用对带宽需求和时延约束的特性，提出了一种新的构造应用层最小直径多播树的启发式算法PCT，该算法结合深度可调的广度优先搜索策略，根据带宽和时延的策略函数选择既满足要求又节约网络资源的路径。实验表明该算法能够有效地降低多播树的直径，减少多播树时延并具有广泛的适应性。

A Multi-constrained Application-layer Multicast Routing Algorithm

Due to the difficulties in application of IP multicast, the application-layer network is being increasingly recognized as a general muhicast service infrastructure. Aiming at the require in bandwidth and delay constrains, a new heuristic algorithm based application-layer multicast is put forward to build a minimum delay diameter muhicast tree, which combining the breadth-first search with the adjustable depth selects the path that saves network resources without violating the constraints by the strategy function of bandwidth and delay . The results of the simulated experiments show that PCT could reduce diameter and delay of multicast tree and has an extensive adaptability.