• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Practical Byzantine Fault Tolerance

Cached

  • Download as a PDF

Download Links

  • [www.imit.kth.se]
  • [www.cs.umass.edu]
  • [www.lcs.mit.edu]
  • [pmg.csail.mit.edu]
  • [www.ece.cmu.edu]
  • [www.pmg.lcs.mit.edu]
  • [www.cs.princeton.edu]
  • [www.cs.rice.edu]
  • [www.ssrc.ucsc.edu]
  • [www.cs.princeton.edu]
  • [pdos.csail.mit.edu]
  • [hpc.isti.cnr.it]
  • [pdos.csail.mit.edu]
  • [www.cs.ucsd.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [www.icir.org]
  • [www.cs.cornell.edu]
  • [research.microsoft.com]
  • [pdos.csail.mit.edu]
  • [www.pdos.lcs.mit.edu]
  • [www.pdos.lcs.mit.edu]
  • [pdos.lcs.mit.edu]
  • [www.pdos.lcs.mit.edu]
  • [pdos.csail.mit.edu]
  • [www.pmg.csail.mit.edu]
  • [www.pdos.lcs.mit.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.ucla.edu]
  • [www.pmg.lcs.mit.edu]
  • [pmg.csail.mit.edu]
  • [www.cs.cmu.edu]
  • [pmg.csail.mit.edu]
  • [www.pmg.lcs.mit.edu]
  • [research.microsoft.com]
  • [www.pmg.lcs.mit.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Miguel Castro , Barbara Loskov
Citations:476 - 20 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

Versions

  • Version 0
  • Version 1

Version History

Metadata Version 1

User correction supplied by mph

DatumValueSource
TITLE Practical Byzantine Fault Tolerance user correction
AUTHOR NAME Miguel Castro user correction
AUTHOR NAME Barbara Loskov user correction
ABSTRACT This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefault-tolerant algorithms will be increasingly important in the future because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit arbitrary behavior. Whereas previous algorithms assumed a synchronous system or were too slow to be used in practice, the algorithm described in this paper is practical: it works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude. We implemented a Byzantine-fault-tolerant NFS service using our algorithm and measured its performance. The results show that our service is only 3 % slower than a standard unreplicated NFS. user correction
CITATIONS 37 found ParsCit 1.0
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University