Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
425367 | Future Generation Computer Systems | 2007 | 8 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hongjun Liu, Ping Luo, Zhifeng Zeng,