Key-based consistency and availability in structured overlay networks

Authors:
Tallat M. Shafaat;Monika Moser;Thorsten Schütt;Alexander Reinefeld;Ali Ghodsi;Seif Haridi
Affiliations:
Royal Institute of Technology (KTH), Stockholm, Sweden;Zuse Institute Berlin, Berlin, Germany;Zuse Institute Berlin, Berlin, Germany;Zuse Institute Berlin, Berlin, Germany;Swedish Institute of Computer Science, Stockholm, Sweden;Swedish Institute of Computer Science, Stockholm, Sweden
Venue:
Proceedings of the 3rd international conference on Scalable information systems
Year:
2008

Citing 9
Cited 5

Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

ACM SIGACT News
Atomic Data Access in Distributed Hash Tables

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Weighted voting for replicated data

SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Guaranteeing correctness and availability in P2P range indices

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays

LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
Routing tradeoffs in dynamic peer-to-peer networks

Routing tradeoffs in dynamic peer-to-peer networks

Scalaris: reliable transactional p2p key/value store

Proceedings of the 7th ACM SIGPLAN workshop on ERLANG
Highly available and scalable grid services

Proceedings of the Third Workshop on Dependable Distributed Data Management
Enhanced Paxos Commit for Transactions on DHTs

CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Shepherd: node monitors for fault-tolerant distributed process execution in OSIRIS

Proceedings of the 5th International Workshop on Enhanced Web Service Technologies
Modeling the performance of ring based DHTs in the presence of network address translators

Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Structured Overlay Networks provide a promising platform for high performance applications since they are scalable, fault-tolerant and self-managing. Structured overlays provide lookup services that map keys to nodes that can be used as processing or storage resources. The lookups for a key may return inconsistent results. Consequently, it is nontrivial to provide consistent data services on the top of structured overlays that are built on key-based search. In this paper, we study the frequency of occurrence of inconsistent lookups. We show that the effect of lookup inconsistencies can be reduced by assigning responsibility of key intervals to nodes. We present our results as a trade-off between consistency and availability of keys. Further, since many distributed applications employ quorum techniques at their core, we analyze the probability that majority-based quorum techniques will function correctly in a structured overlay with inconsistent lookups. Our analysis shows that the probability of majority-based algorithms to function correctly despite lookup inconsistencies is high.