RITAS: Services for Randomized Intrusion Tolerance
- 9 December 2008
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 8 (1) , 122-136
Abstract
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 local-area-network (LAN) and wide-area-network environments. The stack provides a set of relevant services ranging from basic communication primitives up to 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.Keywords
This publication has 35 references indexed in Scilit:
- From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without SignaturesThe Computer Journal, 2005
- Low complexity Byzantine-resilient consensusDistributed Computing, 2005
- Basic concepts and taxonomy of dependable and secure computingIEEE Transactions on Dependable and Secure Computing, 2004
- PlanetLabACM SIGCOMM Computer Communication Review, 2003
- Byzantine Fault Detectors for Solving ConsensusThe Computer Journal, 2003
- The SecureRing group communication systemACM Transactions on Information and System Security, 2001
- The generic consensus serviceIEEE Transactions on Software Engineering, 2001
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- Implementing fault-tolerant services using the state machine approach: a tutorialACM Computing Surveys, 1990
- Consensus in the presence of partial synchronyJournal of the ACM, 1988