Your browser does not fully support modern features. Please upgrade for a smoother experience.
Submitted Successfully!
Thank you for your contribution! You can also upload a video entry or images related to this topic. For video creation, please contact our Academic Video Service.
Version Summary Created by Modification Content Size Created at Operation
1 handwiki Vivi Li -- 1945 2022-11-28 01:46:46

Video Upload Options

We provide professional Academic Video Service to translate complex research into visually appealing presentations. Would you like to try it?
Cite
If you have any further questions, please contact Encyclopedia Editorial Office.
HandWiki. Byzantine Fault Tolerance. Encyclopedia. Available online: https://encyclopedia.pub/entry/36682 (accessed on 22 September 2026).
HandWiki. Byzantine Fault Tolerance. Encyclopedia. Available at: https://encyclopedia.pub/entry/36682. Accessed September 22, 2026.
HandWiki. "Byzantine Fault Tolerance" Encyclopedia, https://encyclopedia.pub/entry/36682 (accessed September 22, 2026).
HandWiki. (2022, November 28). Byzantine Fault Tolerance. In Encyclopedia. https://encyclopedia.pub/entry/36682
HandWiki. "Byzantine Fault Tolerance." Encyclopedia. Web. 28 November, 2022.
Byzantine Fault Tolerance
Edit

Byzantine fault tolerance (BFT) is the dependability of a fault-tolerant computer system, particularly distributed computing systems, where components may fail and there is imperfect information on whether a component has failed. In a "Byzantine failure", a component such as a server can inconsistently appear both failed and functioning to failure-detection systems, presenting different symptoms to different observers. It is difficult for the other components to declare it failed and shut it out of the network, because they need to first reach a consensus regarding which component has failed in the first place. The term is derived from the Byzantine Generals' Problem, where actors must agree on a concerted strategy to avoid catastrophic system failure, but some of the actors are unreliable. Byzantine fault tolerance has been also referred to with the phrases interactive consistency or source congruency, error avalanche, Byzantine agreement problem, Byzantine generals problem, and Byzantine failure.

fault tolerance distributed computing dependability

References

  1. Driscoll, K.; Hall, B.; Paulitsch, M.; Zumsteg, P.; Sivencrona, H. (2004). The Real Byzantine Generals. pp. 6.D.4–61-11. doi:10.1109/DASC.2004.1390734.  https://dx.doi.org/10.1109%2FDASC.2004.1390734
  2. Driscoll, Kevin; Hall, Brendan; Sivencrona, Håkan; Zumsteg, Phil (2003). Byzantine Fault Tolerance, from Theory to Reality. 2788. pp. 235–248. doi:10.1007/978-3-540-39878-3_19. ISSN 0302-9743.  https://dx.doi.org/10.1007%2F978-3-540-39878-3_19
  3. Avizienis. doi:10.1109/TDSC.2004.2.  https://dx.doi.org/10.1109%2FTDSC.2004.2
  4. "Dependable Computing and Fault Tolerance". http://www.dependability.org. Retrieved 2015-03-02. 
  5. Lamport, L.; Shostak, R.; Pease, M. (1982). "The Byzantine Generals Problem". ACM Transactions on Programming Languages and Systems 4 (3): 387–389. doi:10.1145/357172.357176. Archived from the original on 7 February 2017. https://web.archive.org/web/20170207104645/http://research.microsoft.com/en-us/um/people/lamport/pubs/byz.pdf. 
  6. Driscoll, Kevin (2012-12-11). "Real System Failures". NASA. https://c3.nasa.gov/dashlink/resources/624/. 
  7. Walter, C.; Ellis, P.; LaValley, B. (2005). The Reliable Platform Service: A Property-Based Fault Tolerant Service Architecture. pp. 34–43. doi:10.1109/HASE.2005.23.  https://dx.doi.org/10.1109%2FHASE.2005.23
  8. D., Seeley, Thomas (2010). Honeybee democracy. Princeton, N.J.: Princeton University Press. ISBN 9780691147215. OCLC 587249075. https://www.worldcat.org/oclc/587249075. 
  9. Feldman, P.; Micali, S. (1997). "An optimal probabilistic protocol for synchronous Byzantine agreement". SIAM J. Comput. 26 (4): 873–933. doi:10.1137/s0097539790187084. http://people.csail.mit.edu/silvio/Selected%20Scientific%20Papers/Distributed%20Computation/An%20Optimal%20Probabilistic%20Algorithm%20for%20Byzantine%20Agreement.pdf. 
  10. Paulitsch, M.; Morris, J.; Hall, B.; Driscoll, K.; Latronico, E.; Koopman, P. (2005). Coverage and the Use of Cyclic Redundancy Codes in Ultra-Dependable Systems. pp. 346–355. doi:10.1109/DSN.2005.31.  https://dx.doi.org/10.1109%2FDSN.2005.31
  11. Hopkins, Albert L.; Lala, Jaynarayan H.; Smith, T. Basil (1987). The Evolution of Fault Tolerant Computing at the Charles Stark Draper Laboratory, 1955–85. 1. pp. 121–140. doi:10.1007/978-3-7091-8871-2_6. ISSN 0932-5581.  https://dx.doi.org/10.1007%2F978-3-7091-8871-2_6
  12. Driscoll, Kevin; Papadopoulos, Gregory; Nelson, Scott; Hartmann, Gary; Ramohalli, Gautham (1984), Multi-Microprocessor Flight Control System, Wright-Patterson Air Force Base, OH 45433, USA: AFWAL/FIGL U.S. Air Force Systems Command, AFWAL-TR-84-3076 
  13. "SIFT: design and analysis of a fault-tolerant computer for aircraft control". Microelectronics Reliability 19 (3): 190. 1979. doi:10.1016/0026-2714(79)90211-7. ISSN 0026-2714.  https://dx.doi.org/10.1016%2F0026-2714%2879%2990211-7
  14. Castro, M.; Liskov, B. (2002). "Practical Byzantine Fault Tolerance and Proactive Recovery". ACM Transactions on Computer Systems (Association for Computing Machinery) 20 (4): 398–461. doi:10.1145/571637.571640.  https://dx.doi.org/10.1145%2F571637.571640
  15. Abd-El-Malek, M.; Ganger, G.; Goodson, G.; Reiter, M.; Wylie, J. (2005). Fault-scalable Byzantine Fault-Tolerant Services. Association for Computing Machinery. doi:10.1145/1095809.1095817.  https://dx.doi.org/10.1145%2F1095809.1095817
  16. Cowling, James; Myers, Daniel; Liskov, Barbara; Rodrigues, Rodrigo; Shrira, Liuba (2006). "HQ Replication: A Hybrid Quorum Protocol for Byzantine Fault Tolerance". Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation. pp. 177–190. ISBN 1-931971-47-1. http://portal.acm.org/citation.cfm?id=1298455.1298473. 
  17. Kotla, Ramakrishna; Alvisi, Lorenzo; Dahlin, Mike; Clement, Allen; Wong, Edmund (December 2009). "Zyzzyva: Speculative Byzantine Fault Tolerance". ACM Transactions on Computer Systems (Association for Computing Machinery) 27 (4). doi:10.1145/1658357.1658358.  https://dx.doi.org/10.1145%2F1658357.1658358
  18. Guerraoui, Rachid; Kneževic, Nikola; Vukolic, Marko; Quéma, Vivien (2010). "The Next 700 BFT Protocols". Proceedings of the 5th European conference on Computer systems. EuroSys. http://infoscience.epfl.ch/record/144158. 
  19. Clement, A.; Wong, E.; Alvisi, L.; Dahlin, M.; Marchetti, M. (April 22–24, 2009). "Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults". Symposium on Networked Systems Design and Implementation. USENIX. http://www.usenix.org/events/nsdi09/tech/full_papers/clement/clement.pdf. 
  20. Aublin, P.-L.; Ben Mokhtar, S.; Quéma, V. (July 8–11, 2013). "RBFT: Redundant Byzantine Fault Tolerance". 33rd IEEE International Conference on Distributed Computing Systems. International Conference on Distributed Computing Systems. Archived from the original on August 5, 2013. https://web.archive.org/web/20130805115252/http://www.temple.edu/cis/icdcs2013/program.html. 
  21. Bahsoun, J. P.; Guerraoui, R.; Shoker, A. (2015-05-01). "Making BFT Protocols Really Adaptive". Parallel and Distributed Processing Symposium (IPDPS), 2015 IEEE International: 904–913. doi:10.1109/IPDPS.2015.21. http://ieeexplore.ieee.org/document/7161576/. 
  22. Chun, Byung-Gon; Maniatis, Petros; Shenker, Scott; Kubiatowicz, John (2007-01-01). "Attested Append-only Memory: Making Adversaries Stick to Their Word". Proceedings of Twenty-first ACM SIGOPS Symposium on Operating Systems Principles. SOSP '07 (New York, NY, USA: ACM): 189–204. doi:10.1145/1294261.1294280. ISBN 9781595935915. http://doi.acm.org/10.1145/1294261.1294280. 
  23. Veronese, G. S.; Correia, M.; Bessani, A. N.; Lung, L. C.; Verissimo, P. (2013-01-01). "Efficient Byzantine Fault-Tolerance". IEEE Transactions on Computers 62 (1): 16–30. doi:10.1109/TC.2011.221. ISSN 0018-9340. http://ieeexplore.ieee.org/document/6081855/. 
  24. UpRight. Google Code repository for the UpRight replication library. https://code.google.com/p/upright/
  25. BFT-SMaRt. Google Code repository for the BFT-SMaRt replication library. https://bft-smart.github.io/library/
  26. Archistar. github repository for the Archistar project. https://github.com/Archistar/archistar-core
  27. Archistar-bft BFT state-machine. github repository for the Archistar project. https://github.com/Archistar/archistar-bft
  28. Askemos/BALL project home page http://ball.askemos.org/
  29. Tendermint github repository for the Tendermint project https://github.com/tendermint/tendermint
  30. M., Paulitsch; Driscoll, K. (9 January 2015). "Chapter 48:SAFEbus". in Zurawski, Richard. Industrial Communication Technology Handbook, Second Edition. CRC Press. pp. 48-1–48-26. ISBN 978-1-4822-0733-0. https://books.google.com/books?id=ppzNBQAAQBAJ. 
  31. Thomas A. Henzinger; Christoph M. Kirsch (26 September 2001). Embedded Software: First International Workshop, EMSOFT 2001, Tahoe City, CA, USA, October 8-10, 2001. Proceedings. Springer Science & Business Media. pp. 307–. ISBN 978-3-540-42673-8. http://www.csl.sri.com/papers/emsoft01/emsoft01.pdf. 
  32. Yeh, Y.C. (2001). Safety critical avionics for the 777 primary flight controls system. 1. pp. 1C2/1–1C2/11. doi:10.1109/DASC.2001.963311.  https://dx.doi.org/10.1109%2FDASC.2001.963311
  33. ELC: SpaceX lessons learned [LWN.net] https://lwn.net/Articles/540368/
  34. Nanya, T.; Goosen, H.A. (1989). "The Byzantine hardware fault model". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 8 (11): 1226–1231. doi:10.1109/43.41508. ISSN 0278-0070.  https://dx.doi.org/10.1109%2F43.41508
  35. Martins, Rolando; Gandhi, Rajeev; Narasimhan, Priya; Pertet, Soila; Casimiro, António; Kreutz, Diego; Veríssimo, Paulo (2013). Experiences with Fault-Injection in a Byzantine Fault-Tolerant Protocol. 8275. pp. 41–61. doi:10.1007/978-3-642-45065-5_3. ISSN 0302-9743.  https://dx.doi.org/10.1007%2F978-3-642-45065-5_3
  36. Kevin R. Driscoll, "Method for testing the sensitive input range of Byzantine filters", US patent 7475318, issued 2009-01-06, assigned to Honeywell International Inc. http://v3.espacenet.com/textdoc?DB=EPODOC&IDX=US7475318
More
Upload a video for this entry
Information
Subjects: Others
Contributor MDPI registered users' name will be linked to their SciProfiles pages. To register with us, please refer to https://encyclopedia.pub/register :
View Times: 2.7K
Entry Collection: HandWiki
Revision: 1 time (View History)
Update Date: 28 Nov 2022
Notice
You are not a member of the advisory board for this topic. If you want to update advisory board member profile, please contact office@encyclopedia.pub.
OK
Confirm
Only members of the Encyclopedia advisory board for this topic are allowed to note entries. Would you like to become an advisory board member of the Encyclopedia?
Yes
No
${ textCharacter }/${ maxCharacter }
Submit
Cancel
There is no comment~
${ textCharacter }/${ maxCharacter }
Submit
Cancel
${ selectedItem.replyTextCharacter }/${ selectedItem.replyMaxCharacter }
Submit
Cancel
Confirm
Are you sure to Delete?
Yes No
Academic Video Service