loading...
PaxonDHT: Achieving Consensus in Distributed Hash Tables
Phoenix, Arizona January 23-January 27
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SAINT.2006.482006 International Symposium on Appli ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ben Temkow, Wayne State University
Anne-Marie Bosneag, Wayne State University
Xinjie Li, Wayne State University
Monica Brockmeyer, Wayne State University
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 replica set size and system load, and that it works well in highly dynamic environments.
Citation:
Ben Temkow, Anne-Marie Bosneag, Xinjie Li, Monica Brockmeyer, "PaxonDHT: Achieving Consensus in Distributed Hash Tables," saint, pp.236-244, 2006 International Symposium on Applications and the Internet (SAINT'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.