TY - GEN
T1 - ATOMIC BROADCAST
T2 - FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE AGREEMENT.
AU - Cristian, Flaviu
AU - Aghili, Houtan
AU - Strong, Ray
AU - Dolev, Danny
PY - 1985
Y1 - 1985
N2 - A new family of atomic broadcast protocols is presented that ranges from a very simple protocol that only tolerates omission faults to a rather sophisticated protocol that tolerates any type of fault. The more types of faults a protocol can tolerate, the more complex and expensive it is to build and run. The objective is to provide, for all considered fault classes, protocols that are cost-effective for those classes in terms of message traffic, speed, and complexity. The protocols work for arbitrary point-to-point network topologies, can tolerate any number of faults up to network partitioning, use a small number of messages, and achieve in many cases the best possible termination times.
AB - A new family of atomic broadcast protocols is presented that ranges from a very simple protocol that only tolerates omission faults to a rather sophisticated protocol that tolerates any type of fault. The more types of faults a protocol can tolerate, the more complex and expensive it is to build and run. The objective is to provide, for all considered fault classes, protocols that are cost-effective for those classes in terms of message traffic, speed, and complexity. The protocols work for arbitrary point-to-point network topologies, can tolerate any number of faults up to network partitioning, use a small number of messages, and achieve in many cases the best possible termination times.
UR - http://www.scopus.com/inward/record.url?scp=0022246697&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0022246697
SN - 0818606185
T3 - Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)
SP - 200
EP - 206
BT - Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)
PB - IEEE
ER -