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.
This work is partly funded by the European Commission under BRICKS (IST 507457).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Risse, T., Knežević, P.: A self-organizing data store for large scale distributed infrastructures. In: International Workshop on Self-Managing Database Systems (SMDB) (2005)
Knežević, P.: Towards a reliable peer-to-peer xml database. In: Lindner, W., Perego, A. (eds.) Proceedings ICDE/EDBT Joint PhD Workshop 2004, P.O. Box 1527, 71110 Heraklion, Crete, Greece, pp. 41–50. Crete University Press (2004)
W3C: Document Object Model (2002), http://www.w3.org/DOM/
Knežević, P., Wombacher, A., Risse, T., Fankhauser, P.: Enabling high data availability in a dht. In: Grid and Peer-to-Peer Computing Impacts on Large Scale Heterogeneous Distributed Database Systems (GLOBE 2005) (submitted, 2005)
Dabek, F., Zhao, B., Druschel, P., Stoica, I.: Towards a common api for structured peer-to-peer overlays. In: 2nd International Workshop on Peer-to-Peer Systems (2003)
Özsu, M.T., Valduriez, P.: Principles of Distributed Database Systems. Prentice Hall, Englewood Cliffs (1999)
Jiménez-Peris, R., Patin̄o-Marténez, M., Alonso, G., Kemme, B.: Are quorums an alternative for data replication? ACM Trans. Database Syst. 28, 257–294 (2003)
Berry, D.A., Lindgren, B.W.: Statistics: Theory and Methods. Duxbury Press, Boston (1995)
Tijms, H.C.: Stochastic Models: An Algorithmic Approach. John Wiley, Chichester (1994)
Kemme, B., Alonso, G.: Don’t be lazy, be consistent: Postgres-r, a new way to implement database replication. The VLDB Journal, 134–143 (2000)
Milojičić, D., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: Peer-to-peer computing. Technical report, HP (2002), http://www.hpl.hp.com/techreports/2002/HPL-2002-57.pdf
Rhea, S., Wells, C., Eaton, P., Geels, D., Zhao, B., Weatherspoon, H., Kubiatowicz, J.: Maintenance-free global data storage. IEEE Internet Computing 5, 40–49 (2001)
Datta, A., Hauswirth, M., Aberer, K.: Updates in highly unreliable, replicated peer-to-peer systems. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, p. 76. IEEE Computer Society, Los Alamitos (2003)
Muthitacharoen, A., Morris, R., Gil, T., Chen, B.: Ivy: A read/write peer-to-peer file system. In: Proceedings of the 5th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2002), Boston, Massachusetts (2002)
Bhagwan, R., Tati, K., Cheng, Y.C., Savage, S., Voelker, G.M.: Total recall: System support for automated availability management. In: First ACM/Usenix Symposium on Networked Systems Design and Implementation, pp. 337–350 (2004)
Yu, H., Vahdat, A.: Consistent and automatic replica regeneration. ACM Transactions on Storage 1, 3–37 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knežević, P., Wombacher, A., Risse, T. (2006). Highly Available DHTs: Keeping Data Consistency After Updates. In: Despotovic, Z., Joseph, S., Sartori, C. (eds) Agents and Peer-to-Peer Computing. AP2PC 2005. Lecture Notes in Computer Science(), vol 4118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925941_6
Download citation
DOI: https://doi.org/10.1007/11925941_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49025-8
Online ISBN: 978-3-540-68967-6
eBook Packages: Computer ScienceComputer Science (R0)