Name
Abstract | ||
|---|---|---|
We present a self-stabilizing algorithm for overlay networks that for an arbitrary given metric specified via 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 stabilizes in time O(n), and after stabilization each node sends and receives only a constant number of messages per round. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-319-49259-9_20 | SSS |
Keywords | DocType | Volume |
Overlay networks, Self-stabilizing algorithms, Metric graph | Journal | 10083 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.35 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert Gmyr | 1 | 79 | 9.70 |
| Jonas Lefèvre | 2 | 2 | 0.71 |
| Christian Scheideler | 3 | 1729 | 152.71 |