Self-stabilization
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Stabilization of maximal metric trees
ICDCS '99 Workshop on Self-stabilizing Systems
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
IEEE/ACM Transactions on Networking (TON)
Self-stabilizing clock synchronization in the presence of Byzantine faults
Journal of the ACM (JACM)
Fast self-stabilizing byzantine tolerant digital clock synchronization
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Discovering Network Topology in the Presence of Byzantine Faults
IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing Byzantine digital clock synchronization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Algorithms and theory of computation handbook
Self-stabilization of byzantine protocols
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
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
On self-stabilizing synchronous actions despite byzantine attacks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
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
Maximum metric spanning tree made Byzantine tolerant
DISC'11 Proceedings of the 25th international conference on Distributed computing
Research note: Self-stabilizing byzantine asynchronous unison
Journal of Parallel and Distributed Computing
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
On byzantine broadcast in loosely connected networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
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 maximum metric 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 self-stabilizing context for maximum metric tree construction (strict stabilization). We propose a weaker containment scheme called topology-aware strict stabilization, and present a protocol for computing maximum metric trees that is optimal for this scheme with respect to impossibility result.