Transcription of Practical Byzantine Fault Tolerance
{{id}} {{{paragraph}}}
AppearsintheProceedingsoftheThird SymposiumonOperatingSystemsDesignandImpl ementation,New Orleans,USA,February1999 PracticalByzantineFaultToleranceMiguelCa stroandBarbaraLiskovLaboratoryforCompute rScience,MassachusettsInstituteofTechnol ogy,545 TechnologySquare, Cambridge, ,thealgorithmdescribedinthispaperis Practical :it worksinasynchronousenvironmentslike theInternetandincorporatesseveralimporta ntoptimizationsthatimprove thatourserviceis only3%slowerthana ,thenumberofsoftwareerrorsis ( ,arbitrary)behavior, new,practicalalgorithmforstatemachinerep lication[17, 34] totalofreplicasaresimultaneouslyfaulty. Thismeansthatclientseventuallyreceive repliestotheirrequestsandthoserepliesare correctaccordingto linearizability[14, 4].
The algorithm does not rely on synchrony to provide safety. Therefore, it must rely on synchrony to provide liveness; otherwise it could be used to implement consensus in an asynchronous system, which is not possible [9]. We guarantee liveness, i.e., clients eventually receive replies to their requests, provided at most 1
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}