Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Distributed algorithms for balanced zone partitioning in content-addressable networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Takemoto, D. ; Dept. of Inf. Eng., Hiroshima Univ., Higashi-Hiroshima, Japan ; Tagashira, S. ; Fujita, S.

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%.

Published in:

Parallel and Distributed Systems, 2004. ICPADS 2004. Proceedings. Tenth International Conference on

Date of Conference:

7-9 July 2004