Skip to Main content Skip to Navigation

Byzantine Failure Detection for Dynamic Distributed Systems

Abstract : Byzantine failure detectors provide an elegant abstraction for implementing Byzantine fault tolerance. However, as far as we know, there is no general solution for this problem in a dynamic distributed system over wireless networks with unknown membership. This paper presents thus a first Byzantine failure detector for this context. The protocol has the interesting feature to be time-free, that is, it does not rely on timers to detect omission failures. This characteristic favors its scalability and help to deal with the dynamics and unpredictability of those networks.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Pierre Sens <>
Submitted on : Friday, April 8, 2011 - 11:50:19 PM
Last modification on : Friday, January 8, 2021 - 5:46:03 PM
Long-term archiving on: : Saturday, July 9, 2011 - 3:05:43 AM


Files produced by the author(s)


  • HAL Id : inria-00461518, version 2


Murilo Santos de Lima, Fabiola Greve, Luciana Arantes, Pierre Sens. Byzantine Failure Detection for Dynamic Distributed Systems. [Research Report] RR-7222, INRIA. 2010, pp.21. ⟨inria-00461518v2⟩



Record views


Files downloads