This paper presents an algorithm that constructs delay-bounded trees.The routing tree has a near optimal network cost under the delay bound constraint.

• 该文提出了一种基于实时应用的组播路由算法,该算法以较低的通信代价建立满足时延界限的接近最优的组播树。