A self-stabilizing algorithm for cut problems in synchronous networks

Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called self-stabilizing if it reaches a stable global state in a finite number of rounds. Allowing two different states for each node induces a cut in the graph. In each round, every node decides whether it is (locally) satisfied with the current cut. Afterwards all unsatisfied nodes change sides independently with a fixed probability p. Using different notions of satisfaction enables the computation of maximal and minimal cuts, respectively. We analyze the expected time until such cuts are reached on several graph classes and study the impact of the parameter p and the initial cut.

Authors

• Thomas Sauerwald
• Dirk Sudholt University of Passau

Keywords

• Self-stabilization
• Distributed computing
• Randomization
• Cut problems