Maximum Metric Spanning Tree made Byzantine Tolerant

Details Maximum Metric Spanning Tree made Byzantine Tolerant Maximum Metric Spanning Tree made Byzantine Tolerant

2011-04-28

arxiv.org/abs/1104.5368v1

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. 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.

Affiliated with

Also associated with

No associations

Rating

Maximum Metric Spanning Tree made Byzantine Tolerant 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 Maximum Metric Spanning Tree made Byzantine Tolerant, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum Metric Spanning Tree made Byzantine Tolerant will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-449599