Complexity of network synchronization
Journal of the ACM (JACM)
Information Processing Letters
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
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
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Self-stabilizing clock synchronization in the presence of Byzantine faults
Journal of the ACM (JACM)
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
IEEE Transactions on Dependable and Secure Computing
Fast self-stabilizing byzantine tolerant digital clock synchronization
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Self-stabilizing Byzantine digital clock synchronization
SSS'06 Proceedings of the 8th 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
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
Dynamic FTSS in asynchronous systems: The case of unison
Theoretical Computer Science
Maximum metric spanning tree made Byzantine tolerant
DISC'11 Proceedings of the 25th international conference on Distributed computing
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
Bounding the Impact of Unbounded Attacks in Stabilization
IEEE Transactions on Parallel and Distributed Systems
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
| Hi-index | 0.00 |
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under a less than strongly fair scheduler or for system topologies with maximum node degree greater than two. We present then a self-stabilizing Byzantine-tolerant solution to asynchronous unison for chain and ring topologies under the central strongly fair daemon. Our algorithm has minimum possible containment radius and optimal stabilization time.