Consensus in Byzantine asynchronous systems

Journal of Discrete Algorithms - Tập 1 - Trang 185-210 - 2003
Roberto Baldoni1, Jean-Michel Hélary2, Michel Raynal3, Lenaik Tangui3
1DIS, Universitá di Roma “La Sapienza”, Via Salaria 113, I00198, Roma, Italy
2IRISA, Campus de Beaulieu, 35042 Rennes-cedex, France
3IRISA, Campus de Beaulieu, 35042 RENNES Cedex, France

Tài liệu tham khảo

Baldoni, 2000, From crash-fault tolerance to arbitrary fault tolerance: towards a modular approach, 273 Chandra, 1996, Unreliable failure detectors for reliable distributed systems, J. ACM, 34, 225, 10.1145/226643.226647 Chandra, 1996, The weakest failure detector for solving consensus, J. ACM, 43, 685, 10.1145/234533.234549 Dolev, 1997, Failure detectors in omission failure environments. Brief announcement, 286 Doudou, 1998, Muteness failure detectors for consensus with Byzantine processes. Brief announcement, 315 Doudou, 1999, Muteness failure detectors: specification and implementation, 1667, 71 Fischer, 1985, Impossibility of distributed consensus with one faulty process, J. ACM, 32, 374, 10.1145/3149.214121 Hurfin, 1999, A simple and fast asynchronous consensus protocol based on a weak failure detector, Distrib. Comput., 12, 209, 10.1007/s004460050067 Kihlstrom, 1997, Solving consensus in a Byzantine environment using an unreliable fault detector, 61 Malkhi, 1997, Unreliable intrusion detection in distributed computations, 116 Pease, 1980, Reaching agreement in presence of faults, J. ACM, 27, 228, 10.1145/322186.322188 Schiper, 1997, Early consensus in an asynchronous system with a weak failure detector, Distrib. Comput., 10, 149, 10.1007/s004460050032