On Byzantine Containment Properties of the $min+1$ Protocol

Details On Byzantine Containment Properties of the $min+1$ Protocol On Byzantine Containment Properties of the $min+1$ Protocol

2010-05-28

arxiv.org/abs/1005.5223v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Byzantine Containment Properties of the $min+1$ Protocol does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Byzantine Containment Properties of the $min+1$ Protocol, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Byzantine Containment Properties of the $min+1$ Protocol will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-15647