摘要
针对现有P2P流媒体调度策略在确定数据块的调度优先权以及节点服务能力时存在的不足,提出了一种以数据块的紧迫度和稀缺度为基础的调度优先权的计算方法,以及提出了邻居节点的服务能力的计算方法,经过仿真试验证明可知该策略能有效的解决现有算法的不足,使流媒体启动延迟较小、播放流畅,且能使流媒体系统负载均衡。
Focus on the shortage of existing P2P streaming media scheduling algorithm in acquire priority of data block and peers service ability, introduced a scheduling algorithm base on urgency and scarcity degree of data block, and a algorithmic method to calculate service ability of neighbor peers that can compensates the shortage effective, reduce start delay of streaming media and make the playing fluent, can also keep the load balance of streaming media systems.
出处
《计算机与数字工程》
2011年第8期32-35,38,共5页
Computer & Digital Engineering
基金
广州大学学生课外学术科技创新重点扶持项目(编号:C22301)
广州大学华软软件学院科研立项(编号:200926)资助
关键词
P2P流媒体
优先权
服务能力
数据调度
P2P streaming media, priority, service ability, data scheduling