Randomized Intrusion-Tolerant Asynchronous Services

Henrique Moniz, Nuno Ferreira Neves, Miguel Correia, Paulo VerĂ­ssimo

Proceedings of the International Conference on Dependable Systems and Networks (DSN), Philadelphia, USA, pages 568-577, June 2006.


Abstract

The paper presents a comparative performance study of the two main classes of randomized binary consensus protocols: a local coin protocol, with an expected high communication complexity and cheap symmetric cryptography, and a shared coin protocol, with an expected low communication complexity and expensive asymmetric cryptography. The experimental evaluation was conducted on a LAN environment, by varying several system parameters, such as the fault types and number of processes. The analysis shows that there is a significant gap between the theoretical and the practical performance results of these protocols, and provides an important insight into what actually happens during their execution.
 


BibTeX

@InProceedings{moniz06randomized,
    author = {Henrique Moniz and Nuno Ferreira Neves and Miguel Correia and Paulo Ver\'{\i}ssimo},
    title = {Randomized Intrusion-Tolerant Asynchronous Services},
    booktitle = {DSN '06: Proceedings of the International Conference on Dependable Systems and Networks (DSN'06)},
    year = {2006},
    pages = pages = {568--577},
    month = {jun}
}


Extended Version

Download the pdf.