A self-stabilizing distributed algorithm for resolving conflicts

In this work, we investigate the problem of resolving conflicts in a distributed environment using only local knowledge. The contribution of this paper is twofold. First, we present a self-stabilizing algorithm to deal with this problem. Self-stabilizing algorithms protect against transient failures. The second result gives a particular implementation and analysis based on probabilistic procedures. Thus, the stabilization time is computed in terms of computation steps, then approximated according to the needed synchronizations.