High throughput byzantine fault tolerance

Proceedings of the International Conference on Dependable Systems and Networks

Volumn , Issue , 2004, Pages 575-584

  Kotla, Ramakrishna ^a   Dahlin, Mike ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER ARCHITECTURE; CONCURRENCY CONTROL; ELECTRIC LOADS; PARALLEL PROCESSING SYSTEMS; REMOTE CONSOLES; THROUGHPUT;

BYZANTINE FAULT TOLERANCE (BFT); MACRO-BENCHMARKS; REPLICATED SERVICES; SYSTEM MODELS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 4544373717     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/dsn.2004.1311928     Document Type: Conference Paper

References (23)

1. http://www.cert.org.
2. http://www.iozone.org.
3. http://www.netapp.com/tech_library/postmark.html.
4. Nfs: Network file system protocol specification. Request for Comments 1094, Network Working Group, ISI, Mar. 1987.
5. A. Adya, W. Bolosky, M. Castro, R. Chaiken, G. Cermak, J.Douceur, J. Howell, J. Lorch, M. Theimer, and R. Wattenhofer. Farsite: Federated, available, and reliable storage for an incompletely trusted environment. In 5th Symp on Operating Systems Design and Impl., 2002.
6. R. Canetti and T. Rabin. Optimal Asynchronous Byzantine Agreement. Technical Report 92-15, Dept, of Computer Science, Hebrew University, 1992.
7. M. Castro. Practical Byzantine Fault Tolerance. PhD thesis, MIT, Jan. 2001.
8. M. Castro and B. Liskov. Practical byzantine fault tolerance. In 3rd Symp. on Operating Systems Design and Impl., Feb.
9. M. Castro and B. Liskov. Proactive recovery in a Byzantine-Fault-Tolerant system. In 4th Symp. on Operating Systems Design and Impl., pages 273-288, 2000.
10. J. Garay and Y. Moses. Fully Polynomial Byzantine Agreement for n>3t Processors in t + 1 Rounds. SIAM Journal of Compouting, 27(1), 1998.
11. J. Howard, M. Kazar, S. Menees, D. Nichols, M. Satyanarayanan, R. Sidebotham, and M. West. Scale and Performance in a Distributed File System. ACM Trans. on Computer Systems, 6(1):51-81, Feb. 1988.
12. R. Kotla. High throughput byzantine fault tolerant architecture. Master's thesis, The Univ. of Texas, Austin, Dec. 2003.
13. R. Kotla and M. Dahlin. High throughput byzantine fault tolerance. Technical Report UTCS-TR-03-58, The Univ. of Texas, Austin, 2003.
14. L. Lamport. Part time parliament. ACM Trans. on Computer Systems, 16(2), May 1998.
15. B. Liskov, S. Ghemawat, R. Gruber, P. Johnson, L. Shrira, and M. Williams. Replication in the Harp File System. In 13th ACM Symp. on Operating Systems Principles, Oct. 1991.
16. D. Mazires. A toolkit for user-level file systems. In USENIX Annual Technical Conference, pages 261-274, June 2001.
17. M. Reiter. The Rampart toolkit for building high-integrity services. In Dagstuhl Seminar on Dist. Sys., pages 99-110, 1994.
18. S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao, and J. Kubiatowicz. Pond: the oceanstore prototype. In 2nd Usenix Confon File and Storage Technologies, March 2003.
19. R. Rodrigues, M. Castro, and B. Liskov. Base: Using abstraction to improve fault tolerance. In 18th ACM Symp. on Operating Systems Principles, Oct. 2001.
20. F. Schneider. Implementing Fault-tolerant Services Using the State Machine Approach: A tutorial. Computing Surveys, 22(3):299-319, Sept. 1990.
21. U. Voges and L. Gmeiner. Software diversity in reader protection systems: An experiment. In IFAC Workshop SAFE-COMP79, May 1979.
22. M. Welsh, D. Culler, and E. Brewer. SEDA: An architecture for well-conditioned, scalable internet services. In 18th ACM Symp. on Operating Systems Principles, pages 230-243, 2001.
23. J. Yin, J. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin. Separating agreement from execution for byzantine fault tolerant services. In 19th ACM Symp. on Operating Systems Principles, Oct 2003.