Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed Algorithms
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Scalable, distributed data structures for internet service construction
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
IEEE Transactions on Computers
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Ivy: a read/write peer-to-peer file system
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Secure routing for structured peer-to-peer overlay networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
LAND: stretch (1 + ε) locality-aware networks for DHTs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Ivy: a read/write peer-to-peer file system
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
D2B: a de Bruijn based content-addressable network
Theoretical Computer Science - Complex networks
Cycloid: a constant-degree and lookup-efficient P2P overlay network
Performance Evaluation - P2P computing systems
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
P2P systems with transactional semantics
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Key-based consistency and availability in structured overlay networks
Proceedings of the 3rd international conference on Scalable information systems
Future directions in distributed computing
Topology-aware routing in structured peer-to-peer overlay networks
Future directions in distributed computing
Maintaining the Ranch topology
Journal of Parallel and Distributed Computing
Comet: an active distributed key-value store
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
Scalable consistency in Scatter
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Lightweight causal cluster consistency
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
The dynamic and-or quorum system
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Robust locality-aware lookup networks
Self-star Properties in Complex Information Systems
A protocol for the atomic capture of multiple molecules on large scale platforms
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Adaptive atomic capture of multiple molecules
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
While recent proposals for distributed hashtables address the crucial issues of communication efficiency and load balancing in dynamic networks, they do not guarantee strong semantics on concurrent data accesses. While it is well known that guaranteeing availability and consistency in an asynchronous and failure prone network is impossible, we believe that guaranteeing atomic semantics is crucial for establishing DHTs as a robust middleware service. In this paper, we describe a simple DHT algorithm that maintains the atomicity property regardless of timing, failures, or concurrency in the system. The liveness of the algorithm, while not dependent on the order of operations in the system, requires that node failures do not occur and that the network eventually delivers all messages to intended recipients. We outline how state machine replication techniques can be used to approximate these requirements even in failure-prone networks, and examine the merits of placing the responsibility for fault-tolerance and reliable delivery below the level of the DHT algorithm.