The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January-February (2011 vol.8)
pp: 122-136
Nuno Ferreira Neves , Universidade de Lisboa, Lisboa
Henrique Moniz , Universidade de Lisboa, Lisboa
Paulo Verissimo , Universidade de Lisboa, Lisboa
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.
INDEX TERMS
Intrusion tolerance, Byzantine agreement, randomized protocols, performance evaluation.
CITATION
Nuno Ferreira Neves, Henrique Moniz, Paulo Verissimo, "RITAS: Services for Randomized Intrusion Tolerance", IEEE Transactions on Dependable and Secure Computing, vol.8, no. 1, pp. 122-136, January-February 2011, doi:10.1109/TDSC.2008.76
REFERENCES
[1] J.S. Fraga and D. Powell, "A Fault- and Intrusion-Tolerant File System," Proc. Third IFIP Int'l Conf. Computer Security (IFIP/Sec '85), pp. 203-218, Aug. 1985.
[2] A. Avizienis, J.-C. Laprie, B. Randell, and C. Landwehr, "Basic Concepts and Taxonomy of Dependable and Secure Computing," IEEE Trans. Dependable and Secure Computing, vol. 1, no. 1, pp. 11-33, Jan.-Mar. 2004.
[3] P.E. Verissimo, N.F. Neves, and M.P. Correia, "Intrusion-Tolerant Architectures: Concepts and Design," Architecting Dependable Systems, R. Lemos, C. Gacek, and A. Romanovsky, eds. Springer-Verlag, vol. 2677, 2003.
[4] F.B. Schneider, "Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial," ACM Computing Surveys, vol. 22, no. 4, pp. 299-319, Dec. 1990.
[5] R. Guerraoui and A. Schiper, "The Generic Consensus Service," IEEE Trans. Software Eng., vol. 27, no. 1, pp. 29-41, Jan. 2001.
[6] V. Hadzilacos and S. Toueg, "A Modular Approach to Fault-Tolerant Broadcasts and Related Problems," Dept. Computer Science, Cornell Univ., Technical Report TR94-1425, May 1994.
[7] M. Correia, N.F. Neves, and P. Verissimo, "From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures," The Computer J., vol. 41, no. 1, pp. 82-96, Jan. 2006.
[8] M.J. Fischer, N.A. Lynch, and M.S. Paterson, "Impossibility of Distributed Consensus with One Faulty Process," J. ACM, vol. 32, no. 2, pp. 374-382, Apr. 1985.
[9] C. Dwork, N. Lynch, and L. Stockmeyer, "Consensus in the Presence of Partial Synchrony," J. ACM, vol. 35, no. 2, pp. 288-323, Apr. 1988.
[10] D. Dolev, C. Dwork, and L. Stockmeyer, "On the Minimal Synchronism Needed for Distributed Consensus," J. ACM, vol. 34, no. 1, pp. 77-97, Jan. 1987.
[11] T. Chandra and S. Toueg, "Unreliable Failure Detectors for Reliable Distributed Systems," J. ACM, vol. 43, no. 2, pp. 225-267, Mar. 1996.
[12] D. Malkhi and M. Reiter, "Unreliable Intrusion Detection in Distributed Computations," Proc. 10th Computer Security Foundations Workshop (CSFW '97), pp. 116-124, June 1997.
[13] K.P. Kihlstrom, L.E. Moser, and P.M. Melliar-Smith, "Byzantine Fault Detectors for Solving Consensus," The Computer J., vol. 46, no. 1, pp. 16-35, Jan. 2003.
[14] N.F. Neves, M. Correia, and P. Verissimo, "Solving Vector Consensus with a Wormhole," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 12, Dec. 2005.
[15] M. Ben-Or, "Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols," Proc. Second ACM Symp. Principles of Distributed Computing (PODC '83), pp. 27-30, Aug. 1983.
[16] M.O. Rabin, "Randomized Byzantine Generals," Proc. 24th Ann. IEEE Symp. Foundations of Computer Science (FOCS '83), pp. 403-409, Nov. 1983.
[17] C. Cachin, K. Kursawe, and V. Shoup, "Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography," Proc. 19th ACM Symp. Principles of Distributed Computing (PODC '00), pp. 123-132, July 2000.
[18] C. Cachin and J.A. Poritz, "Secure Intrusion-Tolerant Replication on the Internet," Proc. IEEE Int'l Conf. Dependable Systems and Networks (DSN '02), pp. 167-176, June 2002.
[19] H. Moniz, M. Correia, N.F. Neves, and P. Verissimo, "Experimental Comparison of Local and Shared Coin Randomized Consensus Protocols," Proc. 25th IEEE Symp. Reliable Distributed Systems (SRDS '06), pp. 235-244, Oct. 2006.
[20] R. Friedman, A. Mostefaoui, and M. Raynal, "Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems," Trans. Dependable and Secure Computing, vol. 2, no. 1, pp. 46-56, Jan.-Mar. 2005.
[21] S. Kent and R. Atkinson, "Security Architecture for the Internet Protocol," IETF Request for Comments: RFC 2093, Nov. 1998.
[22] G. Bracha, "An Asynchronous $\lfloor(n - 1)/3\rfloor$ -Resilient Consensus Protocol," Proc. Third ACM Symp. Principles of Distributed Computing (PODC '84), pp. 154-162, Aug. 1984.
[23] M. Reiter, "Secure Agreement Protocols: Reliable and Atomic Group Multicast in Rampart," Proc. Second ACM Conf. Computer and Comm. Security (CCS '94), pp. 68-80, Nov. 1994.
[24] S. Toueg, "Randomized Byzantine Agreements," Proc. Third ACM Symp. Principles of Distributed Computing (PODC '84), pp. 163-178, Aug. 1984.
[25] R. Canetti and T. Rabin, "Fast Asynchronous Byzantine Agreement with Optimal Resilience," Proc. 25th Ann. ACM Symp. Theory of Computing (STOC '93), pp. 42-51, 1993.
[26] L.E. Moser and P.M. Melliar-Smith, "Byzantine-Resistant Total Ordering Algorithms," Information and Computation, vol. 150, pp. 75-111, 1999.
[27] R. Baldoni, J. Helary, M. Raynal, and L. Tanguy, "Consensus in Byzantine Asynchronous Systems," Proc. Seventh Int'l Colloquium on Structural Information and Comm. Complexity (SIROCCO '00), pp. 1-16, June 2000.
[28] J.P. Martin and L. Alvisi, "Fast Byzantine Consensus," Proc. IEEE Int'l Conf. Dependable Systems and Networks (DSN '05), June 2005.
[29] M. Correia, N.F. Neves, L.C. Lung, and P. Verissimo, "Low Complexity Byzantine-Resilient Consensus," Distributed Computing, vol. 17, no. 3, pp. 237-249, 2005.
[30] H. Ramasamy, P. Pandey, J. Lyons, M. Cukier, and W.H. Sanders, "Quantifying the Cost of Providing Intrusion Tolerance in Group Communication Systems," Proc. IEEE Int'l Conf. Dependable Systems and Networks (DSN '02), pp. 229-238, June 2002.
[31] K.P. Kihlstrom, L.E. Moser, and P.M. Melliar-Smith, "The SecureRing Group Communication System," ACM Trans. Information and System Security, vol. 4, no. 4, pp. 371-406, 2001.
[32] M. Correia, N.F. Neves, L.C. Lung, and P. Verissimo, "Worm-IT—A Wormhole-Based Intrusion-Tolerant Group Communication System," J. Systems and Software, vol. 80, no. 2, pp. 178-197, 2007.
[33] V. Drabkin, R. Friedman, and A. Kama, "Practical Byzantine Group Communication," Proc. 26th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '06), p. 36, 2006.
[34] M. Castro and B. Liskov, "Practical Byzantine Fault Tolerance," Proc. Third Symp. Operating Systems Design and Implementation (OSDI '99), pp. 173-186, Feb. 1999.
[35] H. Moniz, "Randomized Intrusion-Tolerant Asynchronous Services, Master's Thesis," Dept. Informatics, Univ. of Lisbon, master's thesis, DI/FCUL TR-07-2, http://www.di.fc.ul.pt/tech-reports07-2.pdf , Feb. 2007.
[36] R. van Renesse, K.P. Birman, and S. Maffeis, "Horus: A Flexible Group Communication System," Comm. ACM, vol. 39, no. 4, pp. 76-83, 1996.
[37] R. van Renesse, K. Birman, M. Hayden, A. Vaysburd, and D. Karr, "Building Adaptive Systems Using Ensemble," Software—Practice and Experience, vol. 28, no. 9, pp. 963-979, 1998.
[38] G.R. Wright and W.R. Stevens, TCP/IP Illustrated, Volume 2: The Implementation. Addison-Wesley, 1995.
[39] G.S. Veronese, M. Correia, L.C. Lung, and P. Verissimo, "On the Effects of Finite Memory on Intrusion-Tolerant Systems," Proc. 13th Pacific Rim Int'l Symp. Dependable Computing (PRDC '07), pp. 401-404, 2007.
[40] M.K. Reiter, "The Rampart Toolkit for Building High-Integrity Services," Proc. Int'l Workshop Theory and Practice in Distributed Systems, pp. 99-110, 1995.
[41] B. Chun, D. Culler, T. Roscoe, A. Bavier, L. Peterson, M. Wawrzoniak, and M. Bowman, "Planetlab: An Overlay Testbed for Broad-Coverage Services," SIGCOMM Computer Comm. Rev., vol. 33, no. 3, pp. 3-12, 2003.
41 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool