A simple Byzantine Generals protocol
Junxing Wang ()
Additional contact information
Junxing Wang: Tsinghua University
Journal of Combinatorial Optimization, 2014, vol. 27, issue 3, No 9, 544 pages
Abstract:
Abstract The Byzantine Generals Problem is a classical problem in distributed computing that models a system’s resiliency against arbitrary adversarial faults. The existing solutions to this problem tend to be quite intricate and many of them employ some form of recursion. This paper gives a new algorithm that solves the problem in an exceptionally simple straight-line program.
Keywords: Byzantine Generals problem; Distributed algorithm; Fault tolerant (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9534-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:27:y:2014:i:3:d:10.1007_s10878-012-9534-3
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-012-9534-3
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().