Tight bounds for the sequence transmission problem
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Memory-efficient self stabilizing protocols for general networks
Proceedings of the 4th international workshop on Distributed algorithms
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Memory requirements for silent stabilization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Crash failures can drive protocols to arbitrary states
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing routing and related protocols
Journal of Parallel and Distributed Computing
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Distributed Algorithms
Tolerating Transient and Permanent Failures (Extended Abstract)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Self-Stabilization of Wait-Free Shared Memory Objects
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Self-stabilizing census with cut-through constraint
ICDCS '99 Workshop on Self-stabilizing Systems
Self-Stabilizing Algorithms in DAG Structured Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Superstabilizing Protocols for Dynamic Distributed Systems
Superstabilizing Protocols for Dynamic Distributed Systems
Self-Stabilizing Unidirectional Network Algorithms by Power Supply
Self-Stabilizing Unidirectional Network Algorithms by Power Supply
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Self-stabilization over unreliable communication media
Distributed Computing - Special issue: Self-stabilization
On bootstrapping topology knowledge in anonymous networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
OPODIS '09 Proceedings of the 13th International Conference on Principles 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
Self-stabilizing group communication in directed networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Global predicate detection in distributed systems with small faults
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Algorithms and theory of computation handbook
Self-stabilization with r-operators revisited
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
| Hi-index | 0.00 |
Fault tolerance is a crucial property for recent distributed systems. We propose an algorithm that solves the census problem (list all processor identifiers and their relative distance) on an arbitrary strongly connected network.This algorithm tolerates transient faults that corrupt the processors and communication links memory (it is self-stabilizing) as well as intermittent faults (fair loss, reorder, finite duplication of messages) on communication media. A formal proof establishes its correctness for the considered problem. Our algorithm leads to the construction of algorithms for any silent problems that are self-stabilizing while supporting the same communication hazards.