A fault-tolerant content addressable network

Authors:
Daisuke Takemoto;Shigeaki Tagashira;Satoshi Fujita
Affiliations:
Department of Information Engineering, Graduate School of Engineering, Hiroshima University;Department of Information Engineering, Graduate School of Engineering, Hiroshima University;Department of Information Engineering, Graduate School of Engineering, Hiroshima University
Venue:
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 6
Cited 0

Freenet: a distributed anonymous information storage and retrieval system

International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
P-Grid: a self-organizing structured P2P system

ACM SIGMOD Record
Distributed Algorithms for Balanced Zone Partitioning in Content-Addressable Networks

ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 a redundancy to the management of index information distributed over the nodes in the 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 really enhances the fault-tolerance of the CAN system.