Abstract
We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of their shortest path in the tree. We rigorously prove that our protocol works correctly under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes after O(N2) asynchronous rounds where N is the number of nodes in the overlay.
Author supplied keywords
Cite
CITATION STYLE
Götte, T., Scheideler, C., & Setzer, A. (2018). On underlay-aware self-stabilizing overlay networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11201 LNCS, pp. 50–64). Springer Verlag. https://doi.org/10.1007/978-3-030-03232-6_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
