Enhanced Paxos Commit for Transactions on DHTs

Key/value stores which are built on structured overlay networks often lack support for atomic transactions and strong data consistency among replicas. This is unfortunate, because consistency guarantees and transactions would allow a wide range of additional application domains to benefit from the inherent scalability and fault-tolerance of DHTs. The Scalaris key/value store supports strong data consistency and atomic transactions. It uses an enhanced Paxos Commit protocol with only four communication steps rather than six. This improvement was possible by exploiting information from the replica distribution in the DHT. Scalaris enables implementation of more reliable and scalable infrastructure for collaborative Web services that require strong consistency and atomic changes across multiple items.

[1]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[2]  Joe Armstrong,et al.  Programming Erlang: Software for a Concurrent World , 1993 .

[3]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

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

[5]  Nancy A. Lynch,et al.  Revisiting the PAXOS algorithm , 1997, Theor. Comput. Sci..

[6]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

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

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

[9]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[10]  Seif Haridi,et al.  DKS(N, k, f): a family of low communication, scalable and fault-tolerant infrastructures for P2P applications , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

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

[12]  Seif Haridi,et al.  Symmetric Replication for Structured Peer-to-Peer Systems , 2005, DBISP2P.

[13]  Márk Jelasity,et al.  T-Man: Gossip-Based Overlay Topology Management , 2005, Engineering Self-Organising Systems.

[14]  Florian Schintke,et al.  Structured Overlay without Consistent Hashing: Empirical Results , 2006 .

[15]  Leslie Lamport,et al.  Consensus on transaction commit , 2004, TODS.

[16]  Florian Schintke,et al.  Structured Overlay without Consistent Hashing , 2006 .

[17]  Florian Schintke,et al.  Structured Overlay without Consistent Hashing: Empirical Results , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[18]  Rachid Guerraoui,et al.  Introduction to reliable distributed programming , 2006 .

[19]  Ali Ghodsi,et al.  Distributed k-ary System: Algorithms for Distributed Hash Tables , 2006 .

[20]  Brett D. Fleisch,et al.  The Chubby lock service for loosely-coupled distributed systems , 2006, OSDI '06.

[21]  Seif Haridi,et al.  Handling Network Partitions and Mergers in Structured Overlay Networks , 2007 .

[22]  Seif Haridi,et al.  Atomic Commitment in Transactional DHTs , 2007, CoreGRID.

[23]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[24]  Stefan Plantikow,et al.  Transactions for Distributed Wikis on Structured Overlays , 2007, DSOM.

[25]  Florian Schintke,et al.  Scalaris: reliable transactional p2p key/value store , 2008, ERLANG '08.

[26]  Seif Haridi,et al.  Key-based consistency and availability in structured overlay networks , 2008, HPDC '08.

[27]  David Hausheer,et al.  Towards the Future Internet - A European Research Perspective , 2009, Future Internet Assembly.

[28]  Seif Haridi,et al.  A Scalable, Transactional Data Store for Future Internet Services , 2009, Future Internet Assembly.