Highly Available DHTs: Keeping Data Consistency After Updates


Share/Save/Bookmark

Knežević, P. and Wombacher, A. and Risse, T. (2006) Highly Available DHTs: Keeping Data Consistency After Updates. In: 4th International Workshop, AP2PC 2005, July 25, 2005, Revised Papers, July 25, 2005, Utrecht, Netherlands (pp. pp. 70-80).

[img] PDF
Restricted to UT campus only
: Request a copy
144kB
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.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/63699
Official URL:http://dx.doi.org/10.1007/11925941_6
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 237631