loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th International Conference on Parallel and Distributed Systems (ICPADS'04)
Distributed Algorithms for Balanced Zone Partitioning in Content-Addressable Networks
Newport Beach, California
July 07-July 09
ISBN: 0-7695-2152-5
Daisuke Takemoto, Hiroshima University, Japan
Shigeaki Tagashira, Hiroshima University, Japan
Satoshi Fujita, Hiroshima University, Japan
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 scheme originally implemented in the CAN system, we could reduce the response time for each inquiry to less than 75%.
Index Terms:
Pure peer-to-peer systems, Content-Addressable Networks, zone partitioning, load balancing
Citation:
Daisuke Takemoto, Shigeaki Tagashira, Satoshi Fujita, "Distributed Algorithms for Balanced Zone Partitioning in Content-Addressable Networks," icpads, pp.377, 10th International Conference on Parallel and Distributed Systems (ICPADS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.