A Fault-Tolerant Content Addressable Network*Earlier versions of some results contained in this paper appear in D. Takemoto, S. Tagashira, S. Fujita, "A Fault-Tolerant Content Addressable Network," Proc. of the 3rd International Symposium on Parallel and Distributed Processing and Applications (ISPA 2005), Nanjing, pp.792--803 (2005). This research was partially supported by the Japan Society for the Promotion of Science Grant-in-Aid for Scientific Research.

  • Authors:

  • Daisuke Takemoto;Shigeaki Tagashira;Satoshi Fujita

  • Affiliations:

  • The authors are with the Graduate School of Engineering, Hiroshima University, Higashihiroshima-shi, 739--8527 Japan. E-mail: fujita@se.hiroshima-u.ac.jp;The authors are with the Graduate School of Engineering, Hiroshima University, Higashihiroshima-shi, 739--8527 Japan. E-mail: fujita@se.hiroshima-u.ac.jp;The authors are with the Graduate School of Engineering, Hiroshima University, Higashihiroshima-shi, 739--8527 Japan. E-mail: fujita@se.hiroshima-u.ac.jp

  • Venue:
  • IEICE - Transactions on Information and Systems
  • Year:
  • 2006

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