Key-based consistency and availability in structured overlay networks

Authors:
Tallat M. Shafaat;Thorsten Schütt;Monika Moser;Seif Haridi;Ali Ghodsi;Alexander Reinefeld
Affiliations:
Royal Institute of Technology (KTH), Stockholm, Sweden;Zuse Institute Berlin, Berlin, Germany;Zuse Institute Berlin, Berlin, Germany;Royal Institute of Technology (KTH), Stockholm, Sweden;Swedish Institute of Computer Science, Stockholm, Sweden;Zuse Institute Berlin, Berlin, Germany
Venue:
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Year:
2008

Citing 4
Cited 0

Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

ACM SIGACT News
Routing tradeoffs in dynamic peer-to-peer networks

Routing tradeoffs in dynamic peer-to-peer networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Structured Overlay Networks (SONs) provide a promising platform for high performance applications since they are scalable, fault-tolerant and self-managing. SONs provide lookup services that map keys to nodes that can be used as processing or storage resources. In SONs, lookups for a key may return inconsistent results. Consequently, it is difficult to provide consistent data services on top of SONs that build on key-based search. In this paper, we study the frequency of occurrence of inconsistent lookups. We show that the affect of lookup inconsistencies can be reduced by using node responsibilities. We present our results as a trade-off between consistency and availability of keys.