A Byzantine Fault Tolerant Distributed Commit Protocol
Wenbing Zhao
Abstract
In this paper, we present a Byzantine fault tolerant distributed commit protocol for transactions running over untrusted networks. The traditional two-phase commit protocol is enhanced by replicating the coordinator and by running a Byzantine agreement algorithm among the coordinator replicas. Our protocol can tolerate Byzantine faults at the coordinator replicas and a subset of malicious faults at the participants. A decision certificate, which includes a set of registration records and a set of votes from participants, is used to facilitate the coordinator replicas to reach a Byzantine agreement on the outcome of each transaction. The certificate also limits the ways a faulty replica can use towards non-atomic termination of transactions, or semantically incorrect transaction outcomes.
Create a lesson
Related papers
Consensus with Stochastic Broadcast
Pierre Fraigniaud, Boaz Patt-Shamir, Sergio Rajsbaum
Decoupled I/O-Dominant Pipelines for Large-Scale Whole-Slide Image Embedding Extraction
Mayanka Chandrashekar, Xi Zhang, Ethan Seefried et al.
Sintr: Safe Interactive Transactions in the Presence of Byzantine Clients
Austin T. Li, Daniel H. Lee, Lorenzo Alvisi et al.
Benchmarking Confidential Computing Performance on NVIDIA Blackwell GPUs
Daniyal Khan, Amean Asad, Ansgar Grunseid
Optimizing API Gateway Placement in Multi-Cloud Kubernetes
Vinoth Punniyamoorthy, Murali Shankar Dulam, Aswathnarayan Muthukrishnan Kirubakaran et al.
VPP: Virtual Pipeline Parallelism for Efficient Chunked Prefill in Long-Context LLM Inference
Yan Shi, Xiaochao Wang, Jingchun Gao et al.