Highly available DHTs: keeping data consistency after updates

Authors:
Predrag Knežević;Andreas Wombacher;Thomas Risse
Affiliations:
Integrated Publication and Information Systems Institute, Fraunhofer IPSI, Darmstadt, Germany;Department of Computer Science, University of Twente, Enschede, The Netherlands;Integrated Publication and Information Systems Institute, Fraunhofer IPSI, Darmstadt, Germany
Venue:
AP2PC'05 Proceedings of the 4th international conference on Agents and Peer-to-Peer Computing
Year:
2005

Citing 9
Cited 0

Principles of distributed database systems (2nd ed.)

Principles of distributed database systems (2nd ed.)
Maintenance-Free Global Data Storage

IEEE Internet Computing
Don't Be Lazy, Be Consistent: Postgres-R, A New Way to Implement Database Replication

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Are quorums an alternative for data replication?

ACM Transactions on Database Systems (TODS)
Consistent and automatic replica regeneration

ACM Transactions on Storage (TOS)
Ivy: a read/write peer-to-peer file system

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
A Self-organizing Data Store for Large Scale Distributed Infrastructures

ICDEW '05 Proceedings of the 21st International Conference on Data Engineering Workshops
Total recall: system support for automated availability management

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availability and support updates. High data availability in a DHT can be guaranteed by data replication. However, DHTs can not provide a centralized coordination guaranteeing data consistency upon updates. In particular, replicas may have different values due to concurrent updates or partitioning of the P2P network. An approach based on versioning of replica values is presented proposing a decentralized concurrency control system, where probabilistic guarantees can be provided for retrieving a correct replica value. This paper presents the protocol as well as a statistical analysis of the lower bound of the probabilistic guarantees.