3 research outputs found
Mariages et Trahisons
A self-stabilizing protocol tolerates by definition transient faults (faults
of finite duration). Recently, a new class of self-stabilizing protocols that
are able to tolerate a given number of permanent faults. In this paper, we
focus on self-stabilizing protocols able to tolerate Byzantine faults, that is
faults that introduce an arbitrary behaviour. We focus on strict-stabilization
in which the system have to contain the effects of Byzantine faults.
Specificaly, we study the possibility to construct in a self-stabilizing way a
maximal matching in a network where an arbitrary number of process may become
Byzantine
A New Self-Stabilizing Maximal Matching Algorithm
The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the adversarial and fair distributed daemon, the sequential adversarial daemon, as well as the synchronous daemon. In the following we present a single self-stabilizing algorithm for this problem that unites all of these algorithms in that it stabilizes in the same number of moves as the previous best algorithms for the sequential adversarial, the distributed fair, and the synchronous daemon. In addition, the algorithm improves the previous best moves complexities for the distributed adversarial daemon from O(n^2) and O(delta m) to O(m) where n is the number of processes, m is thenumber of edges, and delta is the maximum degree in the graph
A New Self-Stabilizing Maximal Matching Algorithm
The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the adversarial and fair distributed daemon, the sequential adversarial daemon, as well as the synchronous daemon. In the following we present a single self-stabilizing algorithm for this problem that unites all of these algorithms in that it stabilizes in the same number of moves as the previous best algorithms for the sequential adversarial, the distributed fair, and the synchronous daemon. In addition, the algorithm improves the previous best moves complexities for the distributed adversarial daemon from O(n^2) and O(delta m) to O(m) where n is the number of processes, m is thenumber of edges, and delta is the maximum degree in the graph