Sciweavers

Share
SAINT
2006
IEEE

PaxonDHT: Achieving Consensus in Distributed Hash Tables

10 years 5 months ago
PaxonDHT: Achieving Consensus in Distributed Hash Tables
Despite the scalability, availability and resiliency potential suggested by Distributed Hash Tables, their lack of support for replication of mutable data and for strong consistency models stands in the way of their becoming widely accepted as a viable basis for the future generation Internet. This paper presents PaxonDHT, a Paxos-based middleware service, which ensures with high probability that a dynamic set of replicas reach total order agreement. PaxonDHT works well in the highly dynamic environment of DHTs, preserving the properties of the underlying DHT layer, and provides simultaneous support for heterogeneous services. Our algorithm has been deployed on Pastry, using the common API for interoperability with other DHTs. Experimental results in a simulated network show that PaxonDHT is scalable with the replica set size and the load, and that it works well in highly dynamic environments.
Ben Temkow, Anne-Marie Bosneag, Xinjie Li, Monica
Added 12 Jun 2010
Updated 12 Jun 2010
Type Conference
Year 2006
Where SAINT
Authors Ben Temkow, Anne-Marie Bosneag, Xinjie Li, Monica Brockmeyer
Comments (0)
books