一种时延受限的最优时延抖动路由算法

研究多播端到端时延受限条件下的最优时延抖动问题，提出一种有效的多播路由算法。通过修改源节点到目的节点的路径，使时延较小的目的节点获得尽可能大的时延值，时延较大的目的节点获得尽可能小的时延值。仿真结果表明，该算法能获得较小的时延抖动。

Optimal Delay Variation Routing Algorithm with Delay Bounded

This paper researches the problem of minimization of delay variation under the multicast end-to-end delay bounded and presents an efficient multicast routing algorithm.By altering the paths from the source node to the destinations,the nodes whose delay are smaller than the average achieves a new delay as big as possible and the nodes whose delay are above the average achieves a new delay as small as possible.Simulation results show that this algorithm can achieve a smaller delay variation.