Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
Transaction management in the R* distributed database management system
ACM Transactions on Database Systems (TODS)
Recovery management in QuickSilver
ACM Transactions on Computer Systems (TOCS)
The open book: a practical perspective on OSI
The open book: a practical perspective on OSI
Camelot and Avalon: a distributed transaction facility
Camelot and Avalon: a distributed transaction facility
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
Computation and communication in R*: a distributed database manager
ACM Transactions on Computer Systems (TOCS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Using encryption for authentication in large networks of computers
Communications of the ACM
Computer Networks
Overview of an Ada compatible distributed database manager
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Distributed Systems - Architecture and Implementation, An Advanced Course
Efficient commit protocols for the tree of processes model of distributed transactions
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Reducing the blocking in two-phase commit with backup sites
Information Processing Letters
Byzantine Fault Tolerant Coordination for Web Services Atomic Transactions
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Atomic commit protocols, their integration, and their optimisations in distributed database systems
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.00 |
To ensure atomicity of transactions in distributed systems so-called 2-phase commit (2PC) protocols have been proposed. The basic assumption of these protocols is that the processing nodes involved in transactions are “sane,” i.e., they only fail with omission failures, and nodes eventually recover from failures. Unfortunately, this assumption is not realistic for so-called Open Distributed Systems (ODSs), in which nodes may have totally different reliability characteristics. In ODSs, nodes can be classified into trusted nodes (e.g., a banking server) and nontrusted nodes (e.g., a home PC requesting a remote banking service). While trusted nodes are assumed to be sane, nontrusted nodes may fail permanently and even cause commission failures to occur.In this paper, we propose a family of 2PC protocols that tolerate any number of omission failures at trusted nodes and any number of commission and omission failures at nontrusted nodes. The proposed protocols ensure that (at least) the trusted nodes participating in a transaction eventually terminate the transaction in a consistent manner. Unlike Byzantine commit protocols, our protocols do not incorporate mechanisms for achieving Byzantine agreement, which has advantages in terms of complexity: Our protocols have the same or only a slightly higher message complexity than traditional 2PC protocols.