Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
The hyperring: a low-congestion deterministic data structure for distributed environments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
Pagoda: a dynamic overlay network for routing, data management, and multicasting
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Self-Stabilizing Structured Ring Topology P2P Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Stabilizing Peer-to-Peer Spatial Filters
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Brief announcement: self-stabilizing spanning tree algorithm for large scale systems
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing and Byzantine-tolerant overlay network
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Snap-stabilizing prefix tree for peer-to-peer systems
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
A Self-stabilizing and Local Delaunay Graph Construction
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Robust architectures for open distributed systems and topological self-stabilization: invited paper
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Re-Chord: a self-stabilizing chord overlay network
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Corona: a stabilizing deterministic message-passing skip list
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing De Bruijn networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Time complexity of distributed topological self-stabilization: the case of graph linearization
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Theoretical Computer Science
Future Generation Computer Systems
Corona: A stabilizing deterministic message-passing skip list
Theoretical Computer Science
| Hi-index | 0.01 |
We present Tiara -- a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list . We rigorously prove the algorithm correct in the shared register model. We then describe its extension to a ring and incorporation of crash tolerance.