loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Dependable Systems and Networks (DSN'06)
Consensus with Byzantine Failures and Little System Synchrony
Philadelphia, Pennsylvania
June 25-June 28
ISBN: 0-7695-2607-1
ASCII Text
x 
 
Marcos K. Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg, "Consensus with Byzantine Failures and Little System Synchrony," Dependable Systems and Networks, International Conference on, pp. 147-155, International Conference on Dependable Systems and Networks (DSN'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/DSN.2006.22,
author = {Marcos K. Aguilera and Carole Delporte-Gallet and Hugues Fauconnier and Sam Toueg},
title = {Consensus with Byzantine Failures and Little System Synchrony},
journal ={Dependable Systems and Networks, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2607-1},
pages = {147-155},
doi = {http://doi.ieeecomputersociety.org/10.1109/DSN.2006.22},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Dependable Systems and Networks, International Conference on
TI - Consensus with Byzantine Failures and Little System Synchrony
SN - 0-7695-2607-1
SP147
EP155
A1 - Marcos K. Aguilera,
A1 - Carole Delporte-Gallet,
A1 - Hugues Fauconnier,
A1 - Sam Toueg,
PY - 2006
KW - null
VL - 0
JA - Dependable Systems and Networks, International Conference on
ER -
 
Marcos K. Aguilera, HP Laboratories, Palo Alto, California, USA
Carole Delporte-Gallet, IGM, ESIEE Paris, France
Hugues Fauconnier, LIAFA, Universite Paris 7, France
Sam Toueg, University of Toronto
We study consensus in a message-passing system where only some of the n^2 links exhibit some synchrony. This problem was previously studied for systems with process crashes; we now consider byzantine failures. We show that consensus can be solved in a system where there is at least one non-faulty process whose links are eventually timely; all other links can be arbitrarily slow. We also show that, in terms of problem solvability, such a system is strictly weaker than one where all links are eventually timely.
Citation:
Marcos K. Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg, "Consensus with Byzantine Failures and Little System Synchrony," dsn, pp.147-155, International Conference on Dependable Systems and Networks (DSN'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.