论文信息 - Distributed Zone Partitioning Schemes for CAN and Its Application to the Load Balancing in Pure P2P Systems

Distributed Zone Partitioning Schemes for CAN and Its Application to the Load Balancing in Pure P2P Systems

In this paper, we propose several distributed zone partitioning schemes for Content-Addressable Networks (CAN), that is known as a pure peer-to-peer system based on the Distributed Hash Table (DHT). The main objective of the proposed schemes is to balance the load of nodes in the CAN system, in such a way that every node receives almost the same number of inquiries from the other nodes in the system. The result of simulations implies that, by using the proposed schemes instead of a randomized zone partitioning scheme originally implemented in the CAN system, we could reduce the response time for each inquiry to less than 75%.

[1] Satoshi Fujita,et al. Maintaining a Dynamic Set of Processors in a Distributed System , 1996, WDAG.

[2] Robert Morris,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[3] Ben Y. Zhao,et al. An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[4] Ian Clarke,et al. Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[5] Mark Handley,et al. Application-Level Multicast Using Content-Addressable Networks , 2001, Networked Group Communication.

[6] Karl Aberer,et al. P-Grid: A Self-Organizing Access Structure for P2P Information Systems , 2001, CoopIS.

[7] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM 2001.

[8] Robert E. Tarjan,et al. Self-Adjusting Heaps , 1986, SIAM J. Comput..