A self-stabilizing algorithm for coloring bipartite graphs
Information Sciences: an International Journal
Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
On FTSS-solvable distributed problems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Tolerating Transient and Permanent Failures (Extended Abstract)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Linear time self-stabilizing colorings
Information Processing Letters
A self-stabilizing algorithm for coloring planar graphs
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing coloration in anonymous planar networks
Information Processing Letters
A self-stabilizing link-coloring protocol resilient to byzantine faults in tree networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Journal of Parallel and Distributed Computing
Bounding the impact of unbounded attacks in stabilization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
On bootstrapping topology knowledge in anonymous networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Adaptive containment of time-bounded byzantine faults
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
Self-stabilizing protocols can tolerate any type and any number of transient faults. However, in general, self-stabilizing protocols provide no guarantee about their behavior against permanent faults. This paper proposes a self-stabilizing link-coloring protocol resilient to (permanent) Byzantine faults in arbitrary networks. The protocol assumes the central daemon, and uses 2Δ−1 colors where Δ is the maximum degree in the network. This protocol guarantees that any link (u,v) between non faulty processes u and v is assigned a color within 2Δ+2 rounds and its color remains unchanged thereafter. Our protocol is Byzantine insensitive in the sense that the subsystem of correct processes remains operating properly in spite of unbounded Byzantine faults.