Description
TL;DR: A design for placing stateful replicated services on a Chord overlay while separating service recovery from the ring's own maintenance rules.
About This Document
Alan Dearle, Graham N. C. Kirby, and Stuart J. Norcross distribute service components across Chord nodes and map application entities into the overlay's key space. Their approach makes clients replication-aware, introduces a consensus protocol for serializing updates, and adds Byzantine-fault-tolerant replication so service data can remain consistent even when some hosts misbehave.
Why Bitcoin People May Care
This is not a Bitcoin paper, though Chord overlays, distributed hash tables, replication, and Byzantine faults share vocabulary with decentralized networks. Its participants, membership, and service model differ from Bitcoin's open proof-of-work consensus. The useful comparison is architectural: routing and storage availability are separate problems from agreeing on valid state under an adversary.
What You Receive
Purchase reveals the verified preserved PDF location for this document.
Document Details
- Title: Hosting Byzantine-Fault-Tolerant Services on a Chord Ring
- Author / organization: Alan Dearle, Graham N. C. Kirby, and Stuart J. Norcross
- Year: 2010
- Language: English
- Document type: Distributed-systems research paper
- Pages: 6
CacheRat provides researched source-location and document-identification information. CacheRat does not claim ownership of the underlying third-party documentation.
