Complexity of network synchronization
Journal of the ACM (JACM)
Probabilistic recurrence relations
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Sorting on a parallel pointer machine with applications to set expression evaluation
Journal of the ACM (JACM)
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Deterministic resource discovery in distributed networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
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
Asynchronous Resource Discovery in Peer to Peer Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Asynchronous resource discovery
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
Dynamic networks are as fast as static networks
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
New models and algorithms for future networks
IEEE Transactions on Information Theory
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
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
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
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science
Building self-stabilizing overlay networks with the transitive closure framework
Theoretical Computer Science
| Hi-index | 0.00 |
A fast self-stabilizing algorithm is described to rapidly construct a balanced overlay network from a directed graph initially with out-degree 1, a natural starting case that arises in peer-to-peer systems where each node attempts to join by contacting some single other node. This algorithm constructs a balanced search tree in time O(W + log n), where W is the key length and n is the number of nodes, improving by a factor of log n on the previous bound starting from a general graph, while retaining the properties of low contention and short messages. Our construction includes an improved version of the distributed Patricia tree structure of Angluin et al. [1], which we call a double-headed radix tree. This data structure responds gracefully to node failures and supports search, predecessor, and successor operations in O(W) time with smoothly distributed load for predecessor and successor operations. Though the resulting tree data structure is highly vulnerable to disconnection due to failures, the fast predecessor and successor operations (as shown in previous work) can be used to quickly construct standard overlay networks with more redundancy.