Self-stabilization and Byzantine Tolerance for Maximal Independent Set

Johanne Cohen,Laurence Pilard, Jonas Sénizergues

Lecture Notes in Computer ScienceStabilization, Safety, and Security of Distributed Systems（2022）

Cited 0|Views1

No score

Abstract

We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by Turau [15] for computing such a vertex set. Our algorithm is self-stabilizing, and also works under the more difficult context of arbitrary Byzantine faults.

Translated text

AI Read Science

Must-Reading Tree

Example

Generate MRT to find the research sequence of this paper

Chat Paper

Summary is being generated by the instructions you defined