ACM Computing Surveys (CSUR)
Fault-local distributed mending (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Time-adaptive self stabilization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
A self-adjusting algorithm for byzantine agreement
Distributed Computing
Synchronous Consensus with Mortal Byzantines
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Consensus When All Processes May Be Byzantine for Some Time
SSS '09 Proceedings of the 11th International Symposium 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
OPODIS'05 Proceedings of the 9th 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.00 |
In this paper, we introduce a novel Byzantine fault model called time-bounded Byzantine fault that imposes an upper bound on the number of malicious actions of a Byzantine faulty process. We also propose a new method for adaptive fault-containment against time-bounded Byzantine faults that guarantees that the number of perturbed processes depends on the number of malicious actions at Byzantine processes. The proposed information diffusion method imposes k consecutive state changes on a process so that the process diffuses information to processes at distance k. We present an example of a leader election protocol to show the adaptive containment of the proposed method.