SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilization by local checking and correction
Self-stabilization by local checking and correction
Self-stabilization by counter flushing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Fault-local distributed mending (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Self-stabilization by window washing
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Time-adaptive self stabilization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Peer-to-peer systems for prefix search
Proceedings of the twenty-second annual symposium on Principles of distributed computing
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
The expansion and mixing time of skip graphs with applications
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Self-Stabilizing Structured Ring Topology P2P Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
The rainbow skip graph: a fault-tolerant constant-degree distributed data structure
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Novel architectures for P2P applications: The continuous-discrete approach
ACM Transactions on Algorithms (TALG)
ACM Transactions on Algorithms (TALG)
O(log n)-time overlay network construction from graphs with out-degree 1
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization
SSS '09 Proceedings of the 11th International Symposium 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
Brief announcement: a framework for building self-stabilizing overlay networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
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
Building self-stabilizing overlay networks with the transitive closure framework
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
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
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Theoretical Computer Science
Adaptive distributed b-matching in overlays with preferences
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Future Generation Computer Systems
ACM SIGACT News
Building self-stabilizing overlay networks with the transitive closure framework
Theoretical Computer Science
Corona: A stabilizing deterministic message-passing skip list
Theoretical Computer Science
| Hi-index | 0.01 |
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only needs to connect to a small number of other nodes. In contrast to static communication networks, peer-to-peer networks allow nodes to adapt their neighbor set over time in order to react to join and leave events and failures. This paper shows how to maintain such networks in a robust manner. Concretely, we present a distributed and self-stabilizing algorithm that constructs a (variant of the) skip graph in polylogarithmic time from any initial state in which the overlay network is still weakly connected. This is an exponential improvement compared to previously known self-stabilizing algorithms for overlay networks. In addition, individual joins and leaves are handled locally and require little work.