English

Byzantine Fault Tolerance for Nondeterministic Applications

Distributed, Parallel, and Cluster Computing 2016-11-15 v2

Abstract

All practical applications contain some degree of nondeterminism. When such applications are replicated to achieve Byzantine fault tolerance (BFT), their nondeterministic operations must be controlled to ensure replica consistency. To the best of our knowledge, only the most simplistic types of replica nondeterminism have been dealt with. Furthermore, there lacks a systematic approach to handling common types of nondeterminism. In this paper, we propose a classification of common types of replica nondeterminism with respect to the requirement of achieving Byzantine fault tolerance, and describe the design and implementation of the core mechanisms necessary to handle such nondeterminism within a Byzantine fault tolerance framework.

Keywords

Cite

@article{arxiv.cs/0701134,
  title  = {Byzantine Fault Tolerance for Nondeterministic Applications},
  author = {Wenbing Zhao},
  journal= {arXiv preprint arXiv:cs/0701134},
  year   = {2016}
}

Comments

To appear in the proceedings of the 3rd IEEE International Symposium on Dependable, Autonomic and Secure Computing, 2007