| P2P结构与搜索机制研究 |
| |
| 引用本文： | 幸冬梅,朱洪.P2P结构与搜索机制研究[J].计算机工程与科学,2007,29(10):108-111. |
| |
| 作者姓名： | 幸冬梅 朱洪 |
| |
| 作者单位： | 1. 复旦大学计算机科学与工程系,上海,200433
2. 南昌大学数学系,江西,南昌,330047 |
| |
| 摘 要： | P2P系统的研究现在较多集中在对非集中式系统的结构及搜索策略上。本文构造了基于语义的一种混合P2P系统,并且给出了各种常规的操作算法。本文首先引入了d-树的概念,并将Racke树的思想引入了P2P查寻操作中,简单分析了各种操作的最坏时间复杂度。
|
| 关 键 词： | P2P Racke树 a-balanced 结点加入 结点离开 P-结点 |
| 文章编号： | 1007-130X（2007）10-0108-04 |
| 修稿时间： | 2007-03-29 |
A Study of the P2P Structure and Its Search Strategies |
| |
| XING Dong-mei,ZHU Hong.A Study of the P2P Structure and Its Search Strategies[J].Computer Engineering & Science,2007,29(10):108-111. |
| |
| Authors: | XING Dong-mei ZHU Hong |
| |
| Affiliation: | 1. Department of Computer Science and Engineering,Fudan University,Shanghai 200433; 2. Department of Mathematics,Nanchang University,Nanchang 330047 ,China |
| |
| Abstract: | The study of the P2P system focuses mostly on its structure and search strategies.This paper constructs a hybrid P2P system,and designs all sorts of routine algorithms.Our contribution is that we first introduce the notion of bounded d-tree and adopts Racke tree in the P2P lookup operation.We also simply analyse the worst time complexity of all sorts of operations. |
| |
| Keywords: | P2P Racke tree a-balanced node join node leave P-node |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与科学》浏览原始摘要信息 |
|
点击此处可从《计算机工程与科学》下载全文 |
