P2P流媒体中的多发送端选择算法  

Algorithm for Multiple Sender Selection in P2P Streaming

作　　者：李泽平[1,2] 卢显良[1] 李梁[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,四川成都610054 [2]贵州大学理学院,贵州贵阳550025

出　　处：《电子学报》2010年第9期2199-2204,共6页Acta Electronica Sinica

基　　金：国家自然科学基金(No.10771042;No.70661001);贵州省自然科学基金(No.2003-3069);电子科技大学青年科技基金(No.L08010601JX0808)

摘　　要：在多对单P2P流模式下,如何选择多个发送端,并为其最优地分配发送速率和数据是一个难题.为此,提出了一种新的多发送端选择和最优速率及数据分配算法(MSRDA).首先把待解决的问题模型化为线性最优化问题,然后给出了求解最优化问题的算法.不同于已有的算法只按链路的丢包率来选择发送端,MSRDA根据到各发送端链路的丢包率与链路的可用带宽比升序排序来选择多发送端,并最优地分配发送速率和数据.理论分析和仿真实验结果表明:在不同的网络条件下MSRDA能有效地减少聚合带宽的丢包率,并具有自适应性,优于现有同类算法.In P2P media streaming with the pattern of multiple senders and single receiver,it is still a challenge to select multiple senders and optimally allocate streaming rate and media data among multiple senders.To cope with the problem,a new solution（MSRDA） is proposed.Firstly,the problem is modelled as a linear optimization problem,and then the MSRDA algorithm is presented.The MSRDA selects senders according to the sort ascending of selected path′s ratios of packet loss probability to available bandwidth,which is distinct from existing algorithms which select paths only by the packet loss probability of selected paths.Theory analysis and simulation results using NS2 show that the proposed algorithm can effectively reduce the packet loss probability of aggregated bandwidth,dynamically adapt to network fluctuation and achieve a better performance than the related works with different parameters.

关 键 词：对等网络(P2P) 流媒体 速率分配 数据分配 

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