• 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

Small Byzantine Quorum Systems (2001)

Cached

  • Download as a PDF

Download Links

  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.research.microsoft.com]
  • [users.ece.utexas.edu]
  • [www.eng.tau.ac.il]
  • [www.cs.utexas.edu]
  • [www.cs.unc.edu]
  • [www.ece.cmu.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.ece.cmu.edu]
  • [www.cs.utexas.edu]
  • [www.cs.huji.ac.il]
  • [ftp.cs.huji.ac.il]
  • [www.cs.huji.ac.il]
  • [www.research.att.com]
  • [ppr.kr.org]
  • [www.research.att.com]
  • [ftp.wisdom.weizmann.ac.il]
  • [www.research.att.com]
  • [www.research.att.com]
  • [www.research.att.com]
  • [www.research.att.com]
  • [www.research.att.com]
  • [www.cs.utexas.edu]
  • [www.ece.cmu.edu]
  • [users.ece.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.research.microsoft.com]
  • [www.cse.ucsd.edu]

    • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Jean-Philippe Martin , Lorenzo Alvisi , Michael Dahlin
Venue:DISTRIBUTED COMPUTING
Citations:366 - 48 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

Versions

  • Version 0
  • Version 1
  • Version 2
  • Version 3
  • Version 4

Version History

Metadata Version 4

User correction supplied by jpmartin

DatumValueSource
TITLE Small Byzantine Quorum Systems user correction - Legacy Corrections
AUTHOR NAME Jean-Philippe Martin user correction
AUTHOR NAME Lorenzo Alvisi user correction
AUTHOR AFFIL University of Texas at Austin- Dept. of Computer Science user correction
AUTHOR NAME Michael Dahlin user correction
AUTHOR AFFIL University of Texas at Austin- Dept. of Computer Science user correction
ABSTRACT In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channels---one for self-verifying data and the other for any data. Our protocols tolerate Byzantine failures with fewer servers than existing solutions by eliminating nonessential work in the write protocol and by using read and write quorums of different sizes. Since engineering a reliable network layer on an unreliable network is difficult, two other possibilities must be explored. The first is to strengthen the model by allowing synchronous networks that use time-outs to identify failed links or machines. We consider running synchronous and asynchronous Byzantine Quorum protocols over synchronous networks and conclude that, surprisingly, "self-timing" asynchronous Byzantine protocols may offer significant advantages for many synchronous networks when network time-outs are long. We show how to extend an existing Byzantine Quorum protocol to eliminate its dependency on reliable networking and to handle message loss and retransmission explicitly. user correction - Legacy Corrections
YEAR 2001 user correction - Legacy Corrections
VENUE DISTRIBUTED COMPUTING user correction
VENUE TYPE JOURNAL INFERENCE
PAGES 569--578 INFERENCE
VOLUME 11 INFERENCE
CITATIONS 30 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