Self-stabilizing Metric Graphs
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.
KeywordsOverlay network Self-stabilizing algorithms Metric graph
This work was partially supported by the German Research Foundation (DFG) within the Collaborative Research Center “On-The-Fly Computing” (SFB 901) and by the EU within FET project MULTIPLEX under contract no. 317532.
- 4.Cramer, C., Fuhrmann, T., Informatik, F.F.: Self-stabilizing ring networks on connected graphs. Technical report (2005)Google Scholar
- 5.Gärtner, F.C.: A survey of self-stabilizing spanning-tree construction algorithms. Technical report (2003)Google Scholar
- 6.Jacob, R., Richa, A., Scheideler, C., Schmid, S., Täubig, H.: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, pp. 131–140. ACM (2009)Google Scholar
- 10.Onus, M., Richa, A.W., Scheideler, C.: Linearization: Locally self-stabilizing sorting in graphs. In: ALENEX (2007)Google Scholar
- 12.Shaker, A., Reeves, D.S.: Self-stabilizing structured ring topology p2p systems. In: Fifth IEEE International Conference on Peer-to-Peer Computing, P2P, pp. 39–46 (2005)Google Scholar