STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
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
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
D2B: a de Bruijn based content-addressable network
Theoretical Computer Science - Complex networks
Tiara: A Self-stabilizing Deterministic Skip List
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A Distributed and Oblivious Heap
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
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
Re-Chord: a self-stabilizing chord overlay network
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
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
| Hi-index | 0.00 |
This paper presents a dynamic overlay network based on the De Bruijn graph which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage that it has a guaranteed constant node degree and that the routing between any two nodes takes at most O(log n) hops with high probability. Also, we show that there is a simple local-control algorithm that can recover the LDB network from any network topology that is weakly connected.