Cart (Loading....) | Create Account
Close category search window
 

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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

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

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.