Name
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.
|
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11576235_79 | International Symposium on Parallel and Distributed Processing and Applications |
Keywords | Field | DocType |
content addressable network.,fault-tolerance,distributed hash table,index information,peer-to-peer system,efficient synchronization scheme,distinct manner,basic idea,hash table,p2p system,proposed scheme,new method,content addressable network,fault-tolerant content addressable network,fault tolerant | Synchronization,Content-addressable memory,Peer-to-peer,Computer science,Content addressable network,Computer network,Redundancy (engineering),Fault tolerance,Systems architecture,Distributed hash table,Distributed computing | Journal |
Volume | Issue | ISSN |
89-D | 6 | 0302-9743 |
ISBN | Citations | PageRank |
3-540-29769-3 | 1 | 0.40 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daisuke Takemoto | 1 | 11 | 1.84 |
| Shigeaki Tagashira | 2 | 94 | 28.39 |
| Satoshi Fujita | 3 | 46 | 18.99 |