Browse wiki

From Navigators

Jump to: navigation, search
Abstract Randomized agreement protocols have been a … Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexities, they have remained overlooked by the community-at-large as a valid solution for the deployment of fault-tolerant distributed systems. This paper aims to demonstrate that randomization can be a very competitive approach even in hostile environments where arbitrary faults can occur. A stack of randomized intrusion-tolerant protocols is described and its performance evaluated under several settings in both LAN and WAN environments. The stack provides a set of relevant services ranging from basic communication primitives up through atomic broadcast. The experimental evaluation shows that the protocols are efficient, especially in LAN environments where no performance reduction is observed under certain Byzantine faults. s observed under certain Byzantine faults.
Author Henrique Moniz + , Nuno Ferreira Neves + , Miguel Correia + , Paulo Verissimo +
Journal IEEE Transactions on Dependable and Secure Computing, vol. 8, n. 1, pp. 122-136, Jan.-Feb. 2011.  +
Key Moniz10ritas  +
Month jan  +
NumPubDate 2,011.01  +
Project Project:RITAS + , Project:HIDENETS + , Project:CRUTIAL +
ResearchLine Fault And Intrusion Tolerance in Open Distributed Systems (FIT) +
Title RITAS: Services for Randomized Intrusion Tolerance  +
Type article  +
Url  +
Year 2011  +
Categories Publication  +
Modification¬†dateThis property is a special property in this wiki. 14 January 2013 14:40:52  +
hide properties that link here 
  No properties link to this page.


Enter the name of the page to start browsing from.
Personal tools
Navigators toolbox