{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/89065"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/89065","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Eventual fault recovery strategies for Byzantine failures","abstract":"Byzantine faults in distributed systems can have very destructive consequences for services built on top of these systems but are not commonly tolerated in production systems due to the overhead and scalability limitations with existing approaches such as Byzantine fault tolerance. This work describes a reactive protocol for recovering from Byzantine failures in replicated state machines. In contrast to traditional Byzantine fault tolerance (BFT), which attempts to mask faults, this protocol is designed to allow faults to be exposed to clients but ensures that no client can fork the state of the system by rolling back faulty updates once they are detected. This ensures that, in spite of Byzantine failures, the system will always converge to a consistent state. The system provides a contract to the client called lapse consistency that bounds the number of inconsistent reads that can be experienced as a result of the rollbacks that it performs. This system extends prior work on Byzantine detection to provide an integrated system that can not only eventually detect, but also respond to Byzantine faults with provable consistency semantics while preserving many of the important properties of Byzantine detection such as scalability, and responsiveness. We evaluate the overhead of a proof of concept implementation of the system.","abstract_html":"Byzantine faults in distributed systems can have very destructive consequences for services built on top of these systems but are not commonly tolerated in production systems due to the overhead and scalability limitations with existing approaches such as Byzantine fault tolerance. This work describes a reactive protocol for recovering from Byzantine failures in replicated state machines. In contrast to traditional Byzantine fault tolerance (BFT), which attempts to mask faults, this protocol is designed to allow faults to be exposed to clients but ensures that no client can fork the state of the system by rolling back faulty updates once they are detected. This ensures that, in spite of Byzantine failures, the system will always converge to a consistent state. The system provides a contract to the client called lapse consistency that bounds the number of inconsistent reads that can be experienced as a result of the rollbacks that it performs. This system extends prior work on Byzantine detection to provide an integrated system that can not only eventually detect, but also respond to Byzantine faults with provable consistency semantics while preserving many of the important properties of Byzantine detection such as scalability, and responsiveness. We evaluate the overhead of a proof of concept implementation of the system.","abstract_has_math":false,"creators":["Zahdeh, Alexander A"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Vaidya, Nitin H."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-03-02T19:34:31Z","date_published":"2016-03-02T19:34:31Z","updated_at":"2026-07-22T22:26:32Z","subjects":["fault tolerance","Byzantine","eventual","consistency","distributed systems","dependable systems","fault detection","scalability","cloud computing","Vaidya, Nitin H."],"languages":["en"],"rights":["Copyright 2015 Alexander Zahdeh"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/89065","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Vaidya, Nitin H."]},{"key":"dc:creator","label":"Author","values":["Zahdeh, Alexander A"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2016-03-02T19:34:31Z","2015-12-08","2015-12"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["fault tolerance","Byzantine","eventual","consistency","distributed systems","dependable systems","fault detection","scalability","cloud computing","Vaidya, Nitin H."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2015 Alexander Zahdeh"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/89065"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Byzantine faults in distributed systems can have very destructive consequences for services built on top of these systems but are not commonly tolerated in production systems due to the overhead and scalability limitations with existing approaches such as Byzantine fault tolerance. This work describes a reactive protocol for recovering from Byzantine failures in replicated state machines. In contrast to traditional Byzantine fault tolerance (BFT), which attempts to mask faults, this protocol is designed to allow faults to be exposed to clients but ensures that no client can fork the state of the system by rolling back faulty updates once they are detected. This ensures that, in spite of Byzantine failures, the system will always converge to a consistent state. The system provides a contract to the client called lapse consistency that bounds the number of inconsistent reads that can be experienced as a result of the rollbacks that it performs. This system extends prior work on Byzantine detection to provide an integrated system that can not only eventually detect, but also respond to Byzantine faults with provable consistency semantics while preserving many of the important properties of Byzantine detection such as scalability, and responsiveness. We evaluate the overhead of a proof of concept implementation of the system.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2016-03-02 without embargo terms","The student, Alexander Zahdeh, accepted the attached license on 2015-12-07 at 22:33.","The student, Alexander Zahdeh, submitted this Thesis for approval on 2015-12-07 at 22:38.","This Thesis was approved for publication on 2015-12-08 at 13:58.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8959 on 2016-03-02 at 12:51:48","Made available in DSpace on 2016-03-02T19:34:31Z (GMT). No. of bitstreams: 2 ZAHDEH-THESIS-2015.pdf: 1726335 bytes, checksum: 696c0f3242f086988c4b1c1bf99caa6b (MD5) LICENSE.txt: 4213 bytes, checksum: c2c1e27d779a029b5cbfad442d95ac74 (MD5) Previous issue date: 2015-12-08"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Eventual fault recovery strategies for Byzantine failures"]}]}],"canonical_facts":{"dc:contributor":["Vaidya, Nitin H."],"dc:creator":["Zahdeh, Alexander A"],"dc:date":["2016-03-02T19:34:31Z","2015-12-08","2015-12"],"dc:description":["Byzantine faults in distributed systems can have very destructive consequences for services built on top of these systems but are not commonly tolerated in production systems due to the overhead and scalability limitations with existing approaches such as Byzantine fault tolerance. This work describes a reactive protocol for recovering from Byzantine failures in replicated state machines. In contrast to traditional Byzantine fault tolerance (BFT), which attempts to mask faults, this protocol is designed to allow faults to be exposed to clients but ensures that no client can fork the state of the system by rolling back faulty updates once they are detected. This ensures that, in spite of Byzantine failures, the system will always converge to a consistent state. The system provides a contract to the client called lapse consistency that bounds the number of inconsistent reads that can be experienced as a result of the rollbacks that it performs. This system extends prior work on Byzantine detection to provide an integrated system that can not only eventually detect, but also respond to Byzantine faults with provable consistency semantics while preserving many of the important properties of Byzantine detection such as scalability, and responsiveness. We evaluate the overhead of a proof of concept implementation of the system.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2016-03-02 without embargo terms","The student, Alexander Zahdeh, accepted the attached license on 2015-12-07 at 22:33.","The student, Alexander Zahdeh, submitted this Thesis for approval on 2015-12-07 at 22:38.","This Thesis was approved for publication on 2015-12-08 at 13:58.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8959 on 2016-03-02 at 12:51:48","Made available in DSpace on 2016-03-02T19:34:31Z (GMT). No. of bitstreams: 2 ZAHDEH-THESIS-2015.pdf: 1726335 bytes, checksum: 696c0f3242f086988c4b1c1bf99caa6b (MD5) LICENSE.txt: 4213 bytes, checksum: c2c1e27d779a029b5cbfad442d95ac74 (MD5) Previous issue date: 2015-12-08"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/89065"],"dc:language":["en"],"dc:rights":["Copyright 2015 Alexander Zahdeh"],"dc:subject":["fault tolerance","Byzantine","eventual","consistency","distributed systems","dependable systems","fault detection","scalability","cloud computing","Vaidya, Nitin H."],"dc:title":["Eventual fault recovery strategies for Byzantine failures"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:32Z"}