一种新的P2P内容分发优化数据调度方法

A Novel Optimal Data Scheduling Approach to P2P Content Distribution

为了在P2P内容分发系统的可用结点间合理分配数据请求,设计了一种基于并行机调度模型的优化内容分发数据调度算法.仿真结果表明,在典型的数据块选择方法条件下,该算法相比常用的随机结点选择数据调度方法可以进一步提高系统吐吞能力,同时减轻源服务器的负载.

Data scheduling in peer-to-peer content distribution system considers how peers select partners for interesting data.A novel optimal content distribution data scheduling algorithm based on the parallel machine scheduling model was designed to assign the chunk requests among the known neighbor peers in a balanced way.The simulation results show that the proposed algorithm can further improve the system throughput and mitigate the load of original content server with typical chunk selection methods comparing with the data scheduling scheme selecting neighbor peers randomly.