适用于应用层多播的建树算法的设计  

Design of Tree-building up Algorithm to the Application-level Multicasting

作　　者：李婧晖[1] 

机构地区：[1]四川教育学院计算机科学系,成都611130

出　　处：《四川教育学院学报》2010年第3期114-116,共3页Journal of Sichuan College of Education

摘　　要：设计一个新的建树算法,该算法适用于应用层多播。考虑到应用层上两点间代价的不对称性和实时性要求,设计出一种基于源端的多播树建立方法,以保证组内每个成员都能及时收到组内其它任何一个成员发送的报文。多播组的成员通过测量应用层的点到点的瓶颈带宽和往返时延获得链路代价,并分别以自己为根节点建立多播树,以便在报文转发时确定最优路径。Aiming at application-level multicasting,a new algorithm for the building up of multicast tree is proposed.Considering the asymmetry of the link cost between two ends and the real-time demand,a construction method of multicast tree making the source as root is designed.This method of constructing multicast tree can insure that every member in the multicasting group is able to receive the message from any other member.The link cost between two nodes can be obtained on application-level by measuring the bottleneck bandwidth and delay of two nodes.On the basis of this,every member can build up a multicast tree in which the node itself is the root so that a best path can be computed while the message is forwarded.

关 键 词：应用层多播 拓扑管理 建树算法 瓶颈带宽 往返时延 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]