Distributed algorithms for balanced zone partitioning in content-addressable networks

Author

Takemoto, Daisuke ; Tagashira, Shigeaki ; Fujita, Satoshi

Author_Institution

Dept. of Inf. Eng., Hiroshima Univ., Higashi-Hiroshima, Japan

fYear

2004

fDate

7-9 July 2004

Firstpage

377

Lastpage

384

Abstract

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

Keywords

distributed algorithms; file organisation; multiprocessor interconnection networks; peer-to-peer computing; resource allocation; balanced zone partitioning; content-addressable networks; distributed algorithms; distributed hash table; distributed zone partitioning; load balancing; peer-to-peer system; randomized scheme; simulation; Content based retrieval; Delay; Distributed algorithms; Distributed computing; Intelligent networks; Large-scale systems; Multiprocessor interconnection networks; Network servers; Peer to peer computing; Scalability;

fLanguage

English

Publisher

ieee

Conference_Titel

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

ISSN

1521-9097

Print_ISBN

0-7695-2152-5

Type

conf

DOI

10.1109/ICPADS.2004.1316117

Filename

1316117