Asymptotic optimality of shortest path routing algorithms
IEEE Transactions on Information Theory
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
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 polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
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
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
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science
Theoretical Computer Science
Corona: A stabilizing deterministic message-passing skip list
Theoretical Computer Science
| Hi-index | 0.00 |
This paper studies the construction of self-stabilizing topologies for distributed systems. While recent research has focused on chain topologies where nodes need to be linearized with respect to their identifiers, we go a step further and explore a natural 2-dimensional generalization. In particular, we present a local self-stabilizing algorithm that constructs a Delaunay graph from any initial connected topology and in a distributed manner. This algorithm terminates in time O(n 3) in the worst-case. We believe that such self-stabilizing Delaunay networks have interesting applications and give insights into the necessary geometric reasoning that is required for higher-dimensional linearization problems.