上海交通大学学报

上海交通大学学报（自然版）

• 自动化技术、计算机技术 • 上一篇    下一篇

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

纪其进   

  1. (苏州大学 计算机科学与技术学院， 苏州 215006)
  • 收稿日期:2009-06-15 修回日期:1900-01-01 出版日期:2010-03-30 发布日期:2010-03-30

A Novel Optimal Data Scheduling Approach to P2P Content Distribution

JI Qijin   

  1. (School of Computer Science and Technology, Soochow University, Suzhou 215006, China)
  • Received:2009-06-15 Revised:1900-01-01 Online:2010-03-30 Published:2010-03-30

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

关键词: P2P系统, 内容分发, 数据调度, 并行机调度模型

Abstract: 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.

中图分类号: