We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous dæmon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round.
CITATION STYLE
Gmyr, R., Lefèvre, J., & Scheideler, C. (2016). Self-stabilizing metric graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10083 LNCS, pp. 248–262). Springer Verlag. https://doi.org/10.1007/978-3-319-49259-9_20
Mendeley helps you to discover research relevant for your work.