论文部分内容阅读
摘要实时多媒体应用要求组播接收者在一定的时延限制之内收到组播信息,这就对组播路由提出了新的要求。该文提出了一种基于实时应用的组播路由算法,该算法以较低的通信代价建立满足时延界限的接近最优的组播树。最后简要讨论了组播接收者的动态改变时如何重建组播树的问题。
Abstract Real-time multimedia applications require that multicast receivers receive multicast information within a certain delay limit, which poses new requirements for multicast routing. This paper presents a multicast routing algorithm based on real-time application, which establishes a near-optimal multicast tree that meets the delay limit at a low communication cost. Finally, the issue of how to reconstruct the multicast tree when the dynamic changes of multicast receivers is briefly discussed.