A structured hierarchical P2P model based on a rigorous binary tree code algorithm

被引：19

作者：

Liu, Hongjun ^{[1
]}

Luo, Ping

Zeng, Zhifeng

机构：

[1] Tsinghua Univ, Dept Comp Sci, Beijing 100084, Peoples R China

[2] Yunnam Police Officer Acad, Dept Comp Sci & Technol, Yunnan KunMing 650223, Peoples R China

来源：

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2007年 / 23卷 / 02期

关键词：

P2P; super-peer; rigorous binary tree code algorithm; DHT;

D O I：

10.1016/j.future.2006.04.016

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

One of the main problems in peer-to-peer systems is how to balance the lookup latency, the number of transmitted messages and the network expansibility. In this paper, we present a P2P model based on a rigorous binary tree code algorithm. Our model is robust and efficient with constant lookup latency and constant message transmission. More importantly, the model has good expansibility and is suitable for super-scale networks. (c) 2006 Elsevier B.V. All rights reserved.

引用

页码：201 / 208

页数：8