Dissymmetrical P2P topology and resource locating algorithm (Chinese)
-
摘要: 针对现有的结构化纯P2P拓扑在资源共享类应用中存在的拓扑不稳定及开销随规模递增的问题，提出“节点对称性”的考察角度，给出一种基于非对称K-叉树的结构化纯P2P拓扑DSKTree，并给出基于DSKTree的资源定位算法.通过性能分析表明，DSKTree可优化定位开销，并降低规模增大情况下对结构化纯P2P系统性能的影响.Abstract: The paper proposed a dissymmetrical and pure P2P topology based on K-arytree 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:
- peertopeerdissymmetricalresource locating /
-
点击查看大图
计量
- 文章访问数: 2940
- HTML全文浏览量: 9
- PDF下载量: 343
- 被引次数: 0
下载: