2003/01/01 by K. P. Kihlstrom, Kim Potter Kihlstrom · 2 citations
Computer Science · #Distributed systems and fault tolerance #Optimization and Search Problems #Age of Information Optimization
paper · doi:10.1093/comjnl/46.1.16
this paper we extend the work of Chandra and Toueg [3] by considering unreliable fault detectors for solving consensus in an asynchronous distributed system that is subject to Byzantine faults. A Byzantine processor is a processor that behaves in an arbitrary manner, or even according to some malicious design. It might send, to different destinations, different messages that purport to be # A preliminary version of this paper appeared in the Proceedings of the International Conference on Principles of Distributed Systems [1]