A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH

Abstract

We propose a simple and elegant distributed self-stabilizing algorithm to find the center of an arbitrary tree graph. The algorithm is uniform over all nodes of the tree. We prove the self-stabilization of the distributed algorithm using mathematical induction; we did not need to design a bounded function on the global state (which is customary for proving correctness of self-stabilizing algorithms).