Highly Available DHTs: Keeping Data Consistency After Updates

Predrag Knežević, Andreas Wombacher, Thomas Risse

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

134 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationAgents and Peer-to-Peer Computing
Subtitle of host publicationthe International Workshop, AP2PC 2005, Utrecht, The Netherlands, July 25, 2005. Revised Papers
EditorsZoran Despotovic, Sam Joseph, Claudio Sartori
Place of PublicationLondon
Number of pages11
ISBN (Electronic)978-3-540-68967-6
ISBN (Print)978-3-540-49025-8
Publication statusPublished - 2006
Event2nd International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2003 - Melbourne, Australia
Duration: 14 Jul 200314 Jul 2003
Conference number: 2

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference2nd International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2003
Abbreviated titleAP2PC


  • Peer-to-peer computing
  • Decentralized data management
  • DHT


Dive into the research topics of 'Highly Available DHTs: Keeping Data Consistency After Updates'. Together they form a unique fingerprint.

Cite this