@inproceedings{155,
abstract = {{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 daemon. 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.}},
author = {{Gmyr, Robert and LefĂ¨vre, Jonas and Scheideler, Christian}},
booktitle = {{Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}},
pages = {{248----262}},
title = {{{Self-stabilizing Metric Graphs}}},
doi = {{10.1007/978-3-319-49259-9_20}},
year = {{2016}},
}