一种P2P流媒体数据传输任务分派算法  

Data assignment of P2P media streaming

作　　者：杨薇薇[1] 黄年松[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2005年第5期26-28,共3页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(60273075).

摘　　要：定义了P2P流媒体数据传输的数学模型,提出了一种具有最小缓冲延迟的P2P流媒体数据传输任务分派算法MBADP2P,算法考虑已分派/待分派资源块情况、当前网络中各节点可提供的出口带宽和各资源块实际产生的缓冲延迟,将待分派资源块动态测试分派到相关节点,计算出具有最小缓冲延迟的传输分派方案.算法可根据网络环境的变化动态调整任务分派方案,更适合于实际的应用环境.测试结果显示,在非特定假设情况下,该算法的缓冲延迟小于其他已知的任务分派算法.A model of P2P media data assignment was defined, an optimal media data assignment algorithm MBDA P2P (Minimum Buffering Delay media data Assignment algorithm) was proposed, which results in minimum buffering delay in the consequent streaming session. Considering assigned and remaining segments, bandwidth of peers and actual delay of previous segment, the algorithm could assign a segment to certain peer, estimate its buffering delay and calculate out an optimal assignment result. The algorithm is suitable for the applied environment owing to its dynamic adjustment of the task assignment according to the changes of network. The result shows that the buffering delay of MBDA P2P are smaller than other known task assignment algorithms.

关 键 词：对等网络 流媒体 任务分派 缓冲延迟 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]