基于拓扑结构和节点性能的应用层组播算法  

Application Layer Multicast Algorithm Based on Topology Architecture and Peer Performance

作　　者：王新生[1] 张云超[1] 梁平[1] 潘书芹[1] 

机构地区：[1]燕山大学信息科学与工程学院,秦皇岛066004

出　　处：《计算机工程》2010年第15期126-128,共3页Computer Engineering

摘　　要：针对当前应用层组播节点具有异构性和存在传输延迟等问题,提出一种基于拓扑结构和节点性能的应用层组播算法。根据拓扑感知的方法对网络进行分层分簇,在构建组播树时考虑节点的异构性,使高性能的节点接近源节点,低性能的节点接近叶子节点。实验结果表明,该算法能提高组播树的效率,降低端到端的延迟,减小链路压力和控制开销,在大规模节点环境中有效改善组播树的性能。In view of node heterogeneity and large transmission delay problems of current application layer multicast,an application layer multicast algorithm is proposed based on topology architecture and peer performance.Network will be layered and clustered according to the topology-aware approach.It can fully consider node heterogeneity when constructing the multicast tree.The algorithm makes the high performance peer close to the media source and the low performance one close to the leaf,which improves the efficiency of the multicast tree and decreases the delay of peer-to-peer,link stress,link stretch and control overhead.Experimental results show that algorithm can efficiently improve the multicast tree performance on large scale peer conditions.

关 键 词：应用层组播 分簇结构 节点异构性 

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