论文信息 - Toward Fault-Tolerant Atomic Data Access in Mutable Distributed Hash Tables

Toward Fault-Tolerant Atomic Data Access in Mutable Distributed Hash Tables

Though the peer-to-peer network based on distributed hash table have scalability and availability features, but most of the distributed hash tables lack the support for the atomic data accessing, this ability is important to build data structures on distributed system. This paper gives the design and implementation of an atomic accessible mutable distributed hash table - FamDHT. The FamDHT use the Paxos distributed consensus protocol to ensure that the simultaneous access to data is executed under a total order agreement. The FamDHT is build on top of the Bamboo DHT, a robust, open-source DHT implementation. At the end of the paper, an evaluation was given

Yi Jiang | Jinyuan You | Guangtao Xue

[1] Leslie Lamport,et al. The part-time parliament , 1998, TOCS.

[2] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[3] Robert Tappan Morris,et al. Ivy: a read/write peer-to-peer file system , 2002, OSDI '02.

[4] John Kubiatowicz,et al. Handling churn in a DHT , 2004 .

[5] Leslie Lamport,et al. Paxos Made Simple , 2001 .

[6] Robert Morris,et al. Etna: A Fault-tolerant Algorithm for Atomic Mutable DHT Data , 2005 .

[7] Matt Welsh,et al. The Staged Event-Driven Architecture for Highly-Concurrent Server Applications , 2000 .

[8] Nancy A. Lynch,et al. Atomic Data Access in Distributed Hash Tables , 2002, IPTPS.

[9] Robert Morris,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[10] Monica Brockmeyer,et al. PaxonDHT: achieving consensus in distributed hash tables , 2006, International Symposium on Applications and the Internet (SAINT'06).

[11] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.