Data consistency can be violated in Distributed Hash Tables (DHTs) due to inconsistent lookups. In this paper, we identify the events leading to inconsistent lookups and inconsistent responsibilities for a key. We find the inaccuracy of failure detectors as the main reason for inconsistencies. By simulations with inaccurate failure detectors, we study the probability of reaching a system configuration which may lead to inconsistent data. We analyze majority-based algorithms for operations on replicated data. To ensure that concurrent operations do not violate consistency, they have to use non-disjoint sets of replicas. We analytically derive the probability of concurrent operations including disjoint replica sets. By combining the simulation and analytical results, we show that the probability for a violation of data consistency is negligibly low for majority-based algorithms in DHTs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Rhea, D. Geels, T. Roscoe and J. Kubiatowicz. Handling Churn in a DHT. In Proceedings of USENIX Annual Technical Conference, 2004 Berkeley
A. Ghodsi, L. Onana Alima and S. Haridi. Symmetric Replication for Structured Peerto-Peer Systems. DBISP2P, 2005, Trondheim, Norway
I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, H. Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications. newblock IEEE/ACM Transactions on Networking (TON), 11(1):17-32, 2003.
S.Q. Zhuang, D. Geels, I. Stoica, R.H. Katz. On Failure Detection Algorithms in Overlay Networks. In Proceedings of INFOCOM’05, Miami, 2005
T. D. Chandra and S. Toueg. Unreliable Failure Detectors for Reliable Distributed Sys- tems. Journal of the ACM, 43:2, 1996
T. Sch ütt, F. Schintke and A. Reinefeld. Structured Overlay without Consistent Hashing: Empirical Results. In Proceedings of GP2PC’06, 2006
A. Ghodsi. Distributed k-ary System: Algorithms for Distributed Hash Tables. PhD Dissertation, KTH—Royal Institute of Technology Oct, 2006
M. Moser, S. Haridi. Atomic Commitment in a Transactional DHT. In Proceedings of the CoreGRID Symposium, 2007
S. Gilbert and N. Lynch. Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. In SIGACT News, 2002
A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of MIDDLEWARE.01, volume 2218 of Lecture Notes in Computer Science (LNCS), Germany, 2001
F. Dabek. A Distributed Hash Table. Doctoral Dissertation, MIT — Massachusetts Institute of Technology, 2005
L. Lamport. The part-time parliament. ACM Trans. Comput. Syst., ACM Press, 1998, 16, 133-169
N. Lynch, M. Merritt, W. Weihl, and A. Fekete. Atomic Transactions. Morgan Kaufmann Publishers, 1994
D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th ACM Symposium on Theory of Computing, El Paso, 1997
K. Gummadi, R. Dunn, S. Saroiu, S. Gribble, H. Levy, and J. Zahorjan. Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload. In Proceedings of SOSP, 2003.
D. K. Gifford. Weighted voting for replicated data. In Proceedings of SOSP ’79, New York, USA, 1979
D. Liben-Nowell, H. Balakrishnan, D. Karger Analysis of the Evolution of Peer-to-Peer Systems In Proceedings of PODC ’02, USA, 2002
Freepastry. http://freepastry.rice.edu/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Shafaat, T.M., Moser, M., Ghodsi, A., Schütt, T., Haridi, S., Reinefeld, A. (2008). On Consistency Of Data In Structured Overlay Networks. In: Gorlatch, S., Fragopoulou, P., Priol, T. (eds) Grid Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09457-1_21
Download citation
DOI: https://doi.org/10.1007/978-0-387-09457-1_21
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09456-4
Online ISBN: 978-0-387-09457-1
eBook Packages: Computer ScienceComputer Science (R0)