Complexity of network synchronization
Journal of the ACM (JACM)
Fault tolerance in networks of bounded degree
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
IEEE Transactions on Computers
Self-stabilization of dynamic systems assuming only read/write atomicity
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Theoretical Computer Science
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fault-local distributed mending (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Faster computation on directed networks of automata
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
A highly safe self-stabilizing mutual exclusion algorithm
Information Processing Letters
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
The local detection paradigm and its applications to self-stabilization
Theoretical Computer Science
Optimal reactive k-stabilization: the case of mutual exclusion
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Stabilizing time-adaptive protocols
Theoretical Computer Science
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fault-containing network protocols
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Error-detecting codes and fault-containing self-stabilization
Information Processing Letters
Fault-containing self-stabilization using priority scheduling
Information Processing Letters
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Distributed Algorithms
Fault Tolerance: Principles and Practice
Fault Tolerance: Principles and Practice
SIAM Journal on Computing
Memory-Efficient Self Stabilizing Protocols for General Networks
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
Self-Stabilization by Local Checking and Global Reset (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Non-Exploratory Self-Stabilization for Constant-Space Symmetry-Breaking
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Diffusion without false rumors: on propagating updates in a Byzantine environment
Theoretical Computer Science
Practical Techniques for Damage Confinement in Software
CSDA '98 Proceedings of the Conference on Computer Security, Dependability, and Assurance: From Needs to Solutions
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
An Efficient Fault-Containing Self-Stabilizing Algorithm for Finding a Maximal Independent Set
IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
LSRP: local stabilization in shortest path routing
IEEE/ACM Transactions on Networking (TON)
A Fault-Local Self-Stabilizing Clustering Service for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Snap-Stabilizing Depth-First Search on Arbitrary Networks
The Computer Journal
Optimal snap-stabilizing depth-first token circulation in tree networks
Journal of Parallel and Distributed Computing
Guaranteed fault containment and local stabilization in routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Asynchronous and fully self-stabilizing time-adaptive majority consensus
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
| Hi-index | 0.01 |
We study error confinement in distributed applications, which can be viewed as an extreme case of various fault locality notions studied in the past. Error confinement means that to the external observer, only nodes that were directly hit by a fault may deviate from their specified correct behavior, and only temporarily. The externally observable behavior of all other nodes must remain impeccable, even though their internal state may be affected. Error confinement is impossible if an adversary is allowed to inflict arbitrary transient faults on the system, since the faults might completely wipe out input values. We introduce a new fault-tolerance measure we call agility, which quantifies the fault tolerance of an algorithm that disseminates information against state corrupting faults. We then propose broadcast algorithms that guarantee error confinement with optimal agility to within a constant factor in synchronous networks. These algorithms can serve as building blocks in more general reactive systems. Previous results in exploring locality in reactive systems were not error confined, or allowed a wide range of behaviors to be considered correct. Our results also include a new technique that can be used to analyze the “cow path” problem.