基于节点能力度的P2P流媒体资源调度算法  

P2P Streaming Media Resource Scheduling Algorithm Based on Peer Capability

作　　者：潘向辉[1] 陈亚军[1] 吴学毅[1] PAN Xianghui;CHEN Yajun;WU Xueyi(Department of Information Science,Xi'an University of Technology,Xi'an 710048,China)

机构地区：[1]西安理工大学信息科学系,西安710048

出　　处：《计算机工程》2019年第5期226-231,共6页Computer Engineering

基　　金：国家自然科学基金(61671374)

摘　　要：传统流媒体网络因流媒体数据量较大的特点,使服务器的负载重、主干网压力大,从而导致网络吞吐量降低。为此,提出P2P流媒体资源调度算法。通过引入节点能力度和数据块优先级概念,构建多层管理流媒体系统模型。在此基础上,给出多源节点协同调度算法。实验结果表明,与基于数据块优先级的资源调度算法、先来先服务算法相比,该算法能有效缩短系统启动时延,提高播放连续度。Due to the large amount of streaming media data,the traditional streaming media network has a heavy load on the server and a large pressure on the backbone network,so that the network throughput is low.Therefore,a P2P streaming media resource scheduling algorithm is proposed.The concept of peer capability and data block priority is introduced to build a multi-layer management streaming media system model.On this basis,a multi-source node collaborative scheduling algorithm is given.Experimental results show that compared with Resource Dispatch Based on Data Priority(RDDP) algorithm and First Come First Served(FCFS) algorithm,the algorithm can effectively reduce the system startup delay and improve the playback continuity.

关 键 词：节点能力度 资源节点 数据段优先级 媒体码率 贡献因子 

分 类 号：TP37[自动化与计算机技术—计算机系统结构]