Fast randomized algorithms for distributed edge coloring
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
An exercise in fault-containment: self-stabilizing leader election
Information Processing Letters
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth 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
Stabilizing time-adaptive protocols
Theoretical Computer Science
Nearly optimal distributed edge colouring in O(log log n) rounds
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Self-stabilization
An experimental study of a simple, distributed edge coloring algorithm
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
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
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Journal of Parallel and Distributed Computing
Distributed edge coloration for bipartite networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Bounding the impact of unbounded attacks in stabilization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Byzantine self-stabilizing pulse in a bounded-delay model
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
The impact of topology on Byzantine containment in stabilization
DISC'10 Proceedings of the 24th international conference on Distributed computing
A fault-resistant asynchronous clock function
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
On byzantine containment properties of the min + 1 protocol
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing Byzantine asynchronous unison
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Discovering network topology in the presence of byzantine faults
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Research note: Self-stabilizing byzantine asynchronous unison
Journal of Parallel and Distributed Computing
On self-stabilizing synchronous actions despite byzantine attacks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
On byzantine broadcast in loosely connected networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Hi-index | 0.00 |
Self-stabilizing protocols can tolerate any type and any number of transient faults. But self-stabilizing protocols have no guarantee of their behavior against permanent faults. Thus, investigation concerning self-stabilizing protocols resilient to permanent faults is important. This paper proposes a self-stabilizing link-coloring protocol resilient to (permanent) Byzantine faults in tree networks. The protocol assumes the central daemon, and uses Δ+1 colors where Δ is the maximum degree in the network. This protocol guarantees that, for any nonfaulty process v, if the distance from v to any Byzantine ancestor of v is greater than two, v reaches its desired states within three rounds and never changes its states after that. Thus, it achieves fault containment with radius of two. Moreover, we prove that the containment radius becomes Ω(log n) when we use only Δ colors, and prove that the containment radius becomes Ω(n) under the distributed daemon. These lower bound results prove necessity of Δ+1 colors and the central daemon to achieve fault containment with a constant radius.