Complexity of network synchronization
Journal of the ACM (JACM)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-stabilization
Phase Clocks for Transient Fault Repair
IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Distributed Algorithms
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Self-stabilizing clock synchronization in the presence of Byzantine faults
Journal of the ACM (JACM)
Self-stabilizing Byzantine digital clock synchronization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A Byzantine-fault tolerant self-stabilizing protocol for distributed clock synchronization systems
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
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
Dynamic FTSS in asynchronous systems: The case of unison
Theoretical Computer Science
Hi-index | 0.00 |
Consider an asynchronous network in a shared-memory environment consisting of n nodes. Assume that up to f of the nodes might be Byzantine (n 12f), where the adversary is full-information and dynamic (sometimes called adaptive). In addition, the non-Byzantine nodes may undergo transient failures. Nodes advance in atomic steps, which consist of reading all registers, performing some calculation and writing to all registers. The three main contributions of the paper are: first, the clock-function problem is defined, which is a generalization of the clock synchronization problem. This generalization encapsulates previous clock synchronization problem definitions while extending them to the current paper's model. Second, a randomized asynchronous self-stabilizing Byzantine tolerant clock synchronization algorithm is presented. In the construction of the clock synchronization algorithm, a building block that ensures different nodes advance at similar rates is developed. This feature is the third contribution of the paper. It is self-stabilizing and Byzantine tolerant and can be used as a building block for different algorithms that operate in an asynchronous self-stabilizing Byzantine model. The convergence time of the presented algorithm is exponential. Observe that in the asynchronous setting the best known full-information dynamic Byzantine agreement also has an expected exponential convergence time.