Structured Overlay without Consistent Hashing: Empirical Results

Schütt, Thorsten; Schintke, Florian; Reinefeld, Alexander

doi:10.1109/ccgrid.2006.1630903

Cited by 22 publications

(16 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It uses symmetric data replication [8] on top of a structured overlay like Chord [20] or Chord # [17]. In contrast to many other key/value stores, Scalaris provides strong data consistency.…”

Section: Scalaris: Replicated Data On Structured Overlaysmentioning

confidence: 99%

Enhanced Paxos Commit for Transactions on DHTs

Schintke

Reinefeld

Haridi

et al. 2010

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing

View full text Add to dashboard Cite

Abstract-Key/value stores which are built on structured overlay networks often lack support for atomic transactions and strong data consistency among replicas. This is unfortunate, because consistency guarantees and transactions would allow a wide range of additional application domains to benefit from the inherent scalability and faulttolerance of DHTs.The Scalaris key/value store supports strong data consistency and atomic transactions. It uses an enhanced Paxos Commit protocol with only four communication steps rather than six. This improvement was possible by exploiting information from the replica distribution in the DHT. Scalaris enables implementation of more reliable and scalable infrastructure for collaborative Web services that require strong consistency and atomic changes across multiple items.

show abstract

Section: Scalaris: Replicated Data On Structured Overlaysmentioning

confidence: 99%

Enhanced Paxos Commit for Transactions on DHTs

Schintke

Reinefeld

Haridi

et al. 2010

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing

View full text Add to dashboard Cite

show abstract

“…Although a lot of extensions have been proposed for Chord, such as biasing Id assignment to load balance data over nodes [25] and network-awareness to reduce latencies [31], we consider these issues to be outside the scope of this paper. However, one extension we provide that is an address caching mechanism to preserve connection information for future session establishment.…”

Section: Usurp Sonmentioning

confidence: 99%

Usurp: Distributed NAT Traversal for Overlay Networks

Niazi¹,

Dowling²

2011

Distributed Applications and Interoperable Systems

View full text Add to dashboard Cite

“…Each node that is part of the DHT is responsible for at least one subrange in the identifier space. Examples for DHTs are DKS [4], Chord [1], Chord# [2] and CAN [10]. There exist a number of storage systems which are built on DHTs, e.g.…”

Section: Problem Descriptionmentioning

confidence: 99%

Atomic Commitment in Transactional DHTs

Moser

Haridi

2007

Towards Next Generation Grids

View full text Add to dashboard Cite

We investigate the problem of atomic commit in transactional database systems built on top of Distributed Hash Tables. Therefore we present a framework for DHTs to provide strong data consistency and transactions on data stored in a decentralized way. To solve the atomic commit problem within distributed transactions, we propose to use an adaption of Paxos commit as a non-blocking algorithm. We exploit the symmetric replication technique existing in the DKS DHT to determine which nodes are necessary to execute the commit algorithm. By doing so, we achieve a lower number of communication rounds in contrast to applying traditional Three-Phase-Commit protocols. We also show how the proposed solution can cope with dynamism due to churn in DHTs. Our solution works correctly relying only on an inaccurate failure detection of node failure, what is necessary for systems running over the Internet.

show abstract

Structured Overlay without Consistent Hashing: Empirical Results

Cited by 22 publications

References 20 publications

Enhanced Paxos Commit for Transactions on DHTs

Enhanced Paxos Commit for Transactions on DHTs

Usurp: Distributed NAT Traversal for Overlay Networks

Atomic Commitment in Transactional DHTs

Contact Info

Product

Resources

About