Autostabilizing Minimal Clique Decomposition with Byzantine Faults tolerance
Abstract
In this paper, we tackle the problem of finding a minimal clique decomposition of the underlying graph of a distributed system, in the presence of transient and byzantines faults. We propose a distributed algorithm that performs such a decomposition of the underlying graph -minus byzantine nodes and nodes that are "too close" to them-. It does so in O(∆n) rounds with high probability.
Origin | Files produced by the author(s) |
---|---|
licence |