How to Improve Safety under Convergence Using Stable Storage
IEEE Transactions on Parallel and Distributed Systems
LSRP: local stabilization in shortest path routing
IEEE/ACM Transactions on Networking (TON)
Stability of Distributed Algorithms in the Face of Incessant Faults
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Analysis of an Intentional Fault Which Is Undetectable by Local Checks under an Unfair Scheduler
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Journal of Parallel and Distributed Computing
A 1-strong self-stabilizing transformer
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
Algorithms and theory of computation handbook
The impact of topology on Byzantine containment in stabilization
DISC'10 Proceedings of the 24th international conference on Distributed computing
Necessary and sufficient conditions for 1-adaptivity
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
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
Adaptive containment of time-bounded byzantine faults
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
Dynamic FTSS in asynchronous systems: The case of unison
Theoretical Computer Science
Probabilistic self-stabilizing vertex coloring in unidirectional anonymous networks
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Maximum metric spanning tree made Byzantine tolerant
DISC'11 Proceedings of the 25th international conference on Distributed computing
Discovering network topology in the presence of byzantine faults
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Self-stabilization of byzantine protocols
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
On the possibility and the impossibility of message-driven self-stabilizing failure detection
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
A hierarchy-based fault-local stabilizing algorithm for tracking in sensor networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
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
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
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 |
An ideal approach to deal with faults in large-scale distributed systems is to contain the effects of faults as locally as is possible and, additionally, to ensure some type of tolerance within each fault-affected locality. Existing results using this approach accommodate only limited faults (such as crushes) or assume that fault occurrence is bounded in space and/or time. In this paper, we define and explore possibility/impossibility of local tolerance with respect to arbitrary faults (such as Byzantine faults) whose occurrence may be unbounded in space and in time. Our positive results include programs for graph coloring and dining philosophers, withproofs that the size of their tolerance locality is optimal. The type of tolerance achieved within fault-affected localities is self-stabilization. That is, starting from an arbitrary state of the distributed system, each non-faulty process eventually reaches a state from where it behaves correctly as long as the only faults that occur henceforth (regardless of their number) are outside the locality of this process.