Title :
A Byzantine Fault Tolerant Distributed Commit Protocol
Author_Institution :
Cleveland State Univ., Cleveland
Abstract :
In this paper, we present a Byzantine fault tolerant distributed commit protocol for transactions running over un- trusted 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.
Keywords :
certification; computer network reliability; decision theory; fault tolerant computing; protocols; telecommunication security; transaction processing; Byzantine agreement algorithm; byzantine fault tolerant distributed commit protocol; decision certificate; malicious faults; registration record; two-phase commit protocol; untrusted network transaction; Atomic measurements; Computer networks; Distributed computing; Fault tolerance; Multicast algorithms; Open systems; Protection; Protocols; Voting; Web services; Byzantine Agreement; Distributed Transaction; Fault Tolerance; Two Phase Commit; Web Services;
Conference_Titel :
Dependable, Autonomic and Secure Computing, 2007. DASC 2007. Third IEEE International Symposium on
Conference_Location :
Columbia, MD
Print_ISBN :
978-0-7695-2985-1
DOI :
10.1109/DASC.2007.10