---
res:
bibo_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.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Robert
foaf_name: Gmyr, Robert
foaf_surname: Gmyr
- foaf_Person:
foaf_givenName: Jonas
foaf_name: Lefèvre, Jonas
foaf_surname: Lefèvre
- foaf_Person:
foaf_givenName: Christian
foaf_name: Scheideler, Christian
foaf_surname: Scheideler
foaf_workInfoHomepage: http://www.librecat.org/personId=20792
bibo_doi: 10.1007/978-3-319-49259-9_20
dct_date: 2016^xs_gYear
dct_title: Self-stabilizing Metric Graphs@
...