A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph

摘要

We propose a self-stabilizing algorithm (protocol) for computing the median in a given tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.