Brief announcement: Communication-efficient self-stabilizing protocols for spanning-tree construction

Abstract

Most of self-stabilizing protocols require every pair of neighboring processes to communicate with each other repeatedly and forever even after converging to legitimate configurations. Such permanent communication impairs efficiency, but is necessary in nature of self-stabilization. So it is challenging to minimize the number of process pairs communicating after convergence. In this paper, we investigate possibility of communication- efficient self-stabilization for spanning-tree construction, which allows only O(n) pairs of neighboring processes to communicate repeatedly after convergence. © 2009 Springer-Verlag.