华东师范大学学报(自然科学版) ›› 2008, Vol. 2008 ›› Issue (1): 75-82.

• 计算机科学 • 上一篇    下一篇

非对称P2P模型及资源定位算法研究

杨 静， 贺 樑， 顾君忠
  

  1. 华东师范大学 计算机科学技术系，上海 200062
  • 收稿日期:2007-04-28 修回日期:2007-09-05 出版日期:2008-01-25 发布日期:2008-01-25
  • 通讯作者: 贺樑

Dissymmetrical P2P topology and resource locating algorithm (Chinese)

YANG Jing, HE Liang, GU Junzhong
  

  1. Department of Computer Science,East China Normal University,Shanghai 200062,China
  • Received:2007-04-28 Revised:2007-09-05 Online:2008-01-25 Published:2008-01-25

PDF

487

摘要： 针对现有的结构化纯P2P拓扑在资源共享类应用中存在的拓扑不稳定及开销随规模递增的问题，提出“节点对称性”的考察角度，给出一种基于非对称K-叉树的结构化纯P2P拓扑DSKTree，并给出基于DSKTree的资源定位算法.通过性能分析表明，DSKTree可优化定位开销，并降低规模增大情况下对结构化纯P2P系统性能的影响.

关键词: P2P, 非对称性, 资源定位, P2P, 非对称性, 资源定位

Abstract: The paper proposed a dissymmetrical and pure P2P topology based on K-arytree architecture named DSKTree with the view of ”node symmetrical characteristic”. It can solve the unstable and linearly increasing scale problem in resource sharing application using pure P2P topology. It also designed resource locating algorithm in DSKTree topology. The performance analyses showed that it can optimize the cost of locating and lower the influence to performance while the scale of the system increases.

Key words: dissymmetrical, resource locating, peertopeer, dissymmetrical, resource locating

中图分类号: