Highly Available DHTs: Keeping Data Consistency After Updates

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.

• Type: Conference
• Year: 2005
• Where: AP2PC
• Authors: Predrag Knezevic, Andreas Wombacher, Thomas Risse
• Keywords: AP2PC 2005, Applied Computing, Coordination Guaranteeing Data, Probabilistic Guarantees, Replica Value