基于覆盖图优化的多播路由算法  

Multicast routing algorithm based on overlay optimization

作　　者：陈良彬[1] 李强[1] 陈路[1] 

机构地区：[1]空军第一航空学院基础部,河南信阳464000

出　　处：《计算机工程与设计》2010年第23期4953-4956,5035,共5页Computer Engineering and Design

摘　　要：在P2P网络中,传统的多播路由算法是基于覆盖图的优化的,这些算法存在着覆盖图的结构在全局上不是最优的、资源的利用率较低的缺点,同时叶子结点不能贡献任何带宽给多播树中的其他结点。设计了一种基于覆盖图优化的多播路由算法AOO,它在覆盖图优化的基础上,利用历史连接信息,使参与多播的结点能够使用最近的邻居来保证流媒体服务的质量,在多播组成员之间来均衡负载,从而提高P2P网络的全局资源的利用率。仿真实验表明,该算法能够有效地提高P2P网络的性能。The traditional multicast routing algorithms are based on overlay optimization in which exists have some shortcomings in the P2P network.The structure of overlay is not globally optimal,and its utilization of resources is very low.Simultaneously,all leaf nodes can not contribute any bandwidth to other nodes in multicast trees.A multicast routing algorithm based on overlay optimization（AOO） is proposed.It make full advantage of saved historical connection information,which make the nodes participating in multicast can use their nearest neighboring nodes to guarantee the quality of streaming service.The algorithm can balance the load among the multicast group members to improve global resource utilization of P2P network.The simulation results of the AOO algorithm show that it can efficiently improve the performance of the P2P network.

关 键 词：P2P网络 覆盖图优化 连接表 延迟 资源利用率 

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