Maximum Metric Spanning Tree Made Byzantine Tolerant
- Cite this paper as:
- Dubois S., Masuzawa T., Tixeuil S. (2011) Maximum Metric Spanning Tree Made Byzantine Tolerant. In: Peleg D. (eds) Distributed Computing. DISC 2011. Lecture Notes in Computer Science, vol 6950. Springer, Berlin, Heidelberg
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 focuses 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 first provide two new impossibility results about the construction of a maximum metric tree in presence of transient and (permanent) Byzantine faults. Then, we propose a new self-stabilizing protocol that provides optimal containment to an arbitrary number of Byzantine faults.
KeywordsByzantine fault Distributed protocol Fault tolerance Stabilization Spanning tree construction
Unable to display preview. Download preview PDF.