A Fault-Tolerant Content Addressable Network

Daisuke TAKEMOTO
Shigeaki TAGASHIRA
Satoshi FUJITA

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E89-D    No.6    pp.1923-1930
Publication Date: 2006/06/01
Online ISSN: 1745-1361
DOI: 10.1093/ietisy/e89-d.6.1923
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Networks
Keyword: 
peer-to-peer system,  fault-tolerance,  distributed hash table,  content addressable network,  

Full Text: PDF(332.1KB)>>
Buy this Article


Summary: 
In this paper, we propose a new method to enhance the fault-tolerance of the Content Addressable Network (CAN), which is known as a typical pure P2P system based on the notion of Distributed Hash Table (DHT). The basic idea of the proposed method is to introduce redundancy to the management of index information distributed over the nodes in the given P2P network, by allowing each index to be assigned to several nodes, which was restricted to be one in the original CAN system. To keep the consistency among several copies of indices, we propose an efficient synchronization scheme based on the notion of labels assigned to each copy in a distinct manner. The performance of the proposed scheme is evaluated by simulation. The result of simulations indicates that the proposed scheme significantly enhances the fault-tolerance of the CAN system.

open access publishing via