Abstract:Self-stabilization is an versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed system that permits to cope with arbitrary malicious behaviors.We consider the well known problem of constructing a maximum metric tree in this context. Combining these two properties prove difficult: we demonstrate that it is impossible to contain… Show more
“…Moreover, [5] proves that the algorithm introduced for the maximum metric spanning tree construction in [9] performed this optimal containment area. More formally, [5] proves the following results. …”
Section: Theorem 1 (Characterization Of Maximizable Metrics [10]) a Mmentioning
confidence: 77%
“…To circumvent this impossibility result, we describe here another weaker notion than the strict stabilization: the topology-aware strict stabilization (denoted by TA strict stabilization for short) introduced by [5]. Here, the requirement to the containment radius is relaxed, i.e.…”
Section: Definition 5 (C-stable Configuration) a Configuration ρ Is Cmentioning
confidence: 99%
“…Following discussion of Section 2, it is obvious that there exists no strictly stabilizing protocol for this problem. If we consider the weaker notion of topology-aware strict stabilization, [5] defines the best containment area as:…”
Section: Theorem 1 (Characterization Of Maximizable Metrics [10]) a Mmentioning
confidence: 99%
“…If we focus on the protocol provided by [5] (which is (S B , n − 1)-TA strictly stabilizing), we can prove that this protocol does not satisfy our constraints since we have the following result.…”
“…Proof To prove this result, it is sufficient to construct an execution of the protocol of [5] for a given metric M which contains an infinite number of S * B -TA disruptions with two Byzantine processes.…”
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. This paper focus on systems that are both self-stabilizing and Byzantine tolerant.We consider the well known problem of constructing a maximum metric tree in this context. Combining these two properties is known to induce many impossibility results. In this paper, we provide first two impossibility results about the construction of maximum metric tree in presence of transients and (permanent) Byzantine faults. Then, we provide a new self-stabilizing protocol that provides optimal containment of an arbitrary number of Byzantine faults.
“…Moreover, [5] proves that the algorithm introduced for the maximum metric spanning tree construction in [9] performed this optimal containment area. More formally, [5] proves the following results. …”
Section: Theorem 1 (Characterization Of Maximizable Metrics [10]) a Mmentioning
confidence: 77%
“…To circumvent this impossibility result, we describe here another weaker notion than the strict stabilization: the topology-aware strict stabilization (denoted by TA strict stabilization for short) introduced by [5]. Here, the requirement to the containment radius is relaxed, i.e.…”
Section: Definition 5 (C-stable Configuration) a Configuration ρ Is Cmentioning
confidence: 99%
“…Following discussion of Section 2, it is obvious that there exists no strictly stabilizing protocol for this problem. If we consider the weaker notion of topology-aware strict stabilization, [5] defines the best containment area as:…”
Section: Theorem 1 (Characterization Of Maximizable Metrics [10]) a Mmentioning
confidence: 99%
“…If we focus on the protocol provided by [5] (which is (S B , n − 1)-TA strictly stabilizing), we can prove that this protocol does not satisfy our constraints since we have the following result.…”
“…Proof To prove this result, it is sufficient to construct an execution of the protocol of [5] for a given metric M which contains an infinite number of S * B -TA disruptions with two Byzantine processes.…”
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. This paper focus on systems that are both self-stabilizing and Byzantine tolerant.We consider the well known problem of constructing a maximum metric tree in this context. Combining these two properties is known to induce many impossibility results. In this paper, we provide first two impossibility results about the construction of maximum metric tree in presence of transients and (permanent) Byzantine faults. Then, we provide a new self-stabilizing protocol that provides optimal containment of an arbitrary number of Byzantine faults.
Self-stabilization is an versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed system that permits to cope with arbitrary malicious behaviors.We consider the well known problem of constructing a maximum metric tree in this context. Combining these two properties prove difficult: we demonstrate that it is impossible to contain the impact of Byzantine nodes in a self-stabilizing context for maximum metric tree construction (strict stabilization). We propose a weaker containment scheme called topology-aware strict stabilization, and present a protocol for computing maximum metric trees that is optimal for this scheme with respect to impossibility result.
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors.We consider the well known problem of constructing a breadth-first spanning tree in this context. Combining these two properties proves difficult: we demonstrate that it is impossible to contain the impact of Byzantine nodes in a strictly or strongly stabilizing manner. We then adopt the weaker scheme of topology-aware strict stabilization and we present a similar weakening of strong stabilization. We prove that the classical min + 1 protocol has optimal Byzantine containment properties with respect to these criteria.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.