一个快速的时延有界低代价多播路由算法

基于ＱｏＳ的多播路由算法需要在满足每个个体ＱｏＳ需求的同时，又能高效管理网络资源，提出了一种满足端端时延限制的低代价多播路由算法。算法使用一个修改的Ｓｔｅｉｎｅｒ树近似算法先构建时延有界的低代价多播树，再通过最小时延路径与其它尚不在多播树的且结点相连。

A FAST ROUTING ALGORITHM FOR DELAY-CONSTRAINED LOW-COST MULTICAST

QoS-based multicast routing algorithms are required to satisfy the QoS requirements of each individual application and to manage network resource efficiently. A new heuristic algorithm is presented for constructing low-cost multicast tree with end-to-end delay constraints. It first constructs a constrained low-cost multicast tree using a modified Steiner tree heuristic, and then connects the rest group members which are not on the constrained multicast tree using least delay paths. The simulation results show that its per formance compares well with other known delayconstrained heuristics. Moreover, the algorithm does not suffer from high complexity common to most delay-constrained heuristics.