The Experts below are selected from a list of 1215 Experts worldwide ranked by ideXlab platform
I.s. Moskowitz - One of the best experts on this subject based on the ideXlab platform.
-
Analysis of a storage channel in the two phase Commit protocol
Proceedings Computer Security Foundations Workshop IV, 1991Co-Authors: O.l. Costich, I.s. MoskowitzAbstract:The authors discuss how a noisy storage channel arises in the two phase Commit protocol. The analysis is done through Shannon's information theory. They discuss how large the channel is and offer suggestions on how to diminish the channel capacity.
-
CSFW - Analysis of a storage channel in the two phase Commit protocol
Proceedings Computer Security Foundations Workshop IV, 1991Co-Authors: O.l. Costich, I.s. MoskowitzAbstract:The authors discuss how a noisy storage channel arises in the two phase Commit protocol. The analysis is done through Shannon's information theory. They discuss how large the channel is and offer suggestions on how to diminish the channel capacity. >
Celso Massaki Hirata - One of the best experts on this subject based on the ideXlab platform.
-
Fault‐tolerant timestamp‐based two‐phase Commit protocol for RESTful services
Software - Practice and Experience, 2012Co-Authors: Luiz Alexandre Hiane Da Silva Maciel, Celso Massaki HirataAbstract:SUMMARY Service-oriented architecture provides interoperability and weak coupling features for software development. Representational state transfer (REST) is an architectural style that has attracted attention in the SOA domain as it allows the development of Web services based on original principles of the World Wide Web. Unlike Web service specifications, which are based on Simple Object Access Protocol and Web Services Description Language, REST does not provide ‘official’ standards to address non-functional requirements of services, such as security, reliability, and transaction control. The timestamp-based Two-Phase Commit protocol for RESTful service (TS2PC4RS) algorithm specifies concurrency control of RESTful services during a transaction. An extension of the TS2PC4RS specifies the concurrency control of the Web services considering the update operation to meet some business rules. However, neither algorithm addresses transaction control when failures occur. In long-term transactions, failures can occur and compromise the success of Web service applications. Two common failures traditionally considered in the analysis of protocols are host and connection failures. The aim of this paper is to address fault tolerance for TS2PC4RS and its extension. A fault-tolerant protocol based on timeout and log records is proposed. The fault-tolerant protocol provides support for the host and connection failures that may occur during a transaction execution. The fault-tolerant mechanisms are used to meet the application domain business rules that guide the behavior of RESTful services. We describe the protocol using scenarios when failures occur. Copyright © 2012 John Wiley & Sons, Ltd.
-
SAC - Extending timestamp-based two phase Commit protocol for RESTful services to meet business rules
Proceedings of the 2011 ACM Symposium on Applied Computing - SAC '11, 2011Co-Authors: Luiz Alexandre Hiane Da Silva Maciel, Celso Massaki HirataAbstract:Service Oriented Architecture allows development of software with requirements of interoperability and weak coupling. Nowadays, REST is an architectural style that has been gaining attention in the SOA domain. REST allows the development of web services based on concepts simpler than WS-*, however, REST, as an architectural style, does not provide "official" standards to address some nonfunctional requirements of services, such as, security, reliability, and transaction control. The Timestamp-based Two Phase Commit Protocol for RESTful Services (TS2PC4RS) algorithm proposes a REST-based technique to support the web services transactional control implementation. This paper proposes to extend the TS2PC4RS algorithm to improve the satisfaction of business rules. The goal is met in the way the clients can update their prewrites on the ongoing transactions, so that the clients do not need to start a new transaction in order to implement the desired updates. The update of prewrites takes into account the application domain business rules which guide the RESTful services behavior. Thus the business rules are also considered in the algorithm extension. An example was used to describe the TS2PC4RS extension for updates.
-
A timestamp-based two phase Commit protocol for web services using rest architectural style
Journal of Web Engineering, 2010Co-Authors: Luiz Alexandre Hiane Da Silva Maciel, Celso Massaki HirataAbstract:Service Oriented Architecture allows development of software with requirements of interoperability and weak coupling. Nowadays WS-* is the most used SOAP-based specification set for constructing web services. REST is an architectural style that permits the development of services in a simpler way than WS-* and obeys the SOA's paradigm, however, it does not provide standardized support to address some non-functional requirements of services, such as, security, reliability, and transaction control. This article proposes a REST-based technique to support the web services transactional control implementation. The technique uses the timestamp method and two phase Commit protocol to control distributed systems transactions. An example of application using the technique is implemented to show its feasibility.
C. Pu - One of the best experts on this subject based on the ideXlab platform.
-
A Dynamic Two-Phase Commit Protocol for Adaptive Composite Services
International Journal of Web Services Research, 2020Co-Authors: Weihai Yu, C. PuAbstract:Next-generation applications based on Web services impose additional requirements on the use of coordination protocols with various optimizations, such as the Two-Phase Commit protocol (2PC). This article analyses the well-known 2PC optimizations “presumed Commit†and “presumed abort,†and presents an improved 2PC that is suitable for Web-service-based applications. More specifically, the protocol allows every individual service provider to choose dynamically the most appropriate presumption for any distributed transaction. This new capability is especially useful when a composite Web service is integrating component services that make different presumptions in their Commit protocols. The protocol does not introduce extra overhead to the previous 2PC variants in terms of number of messages and log records, and it is easy to understand and realize. Our simulation shows that the choice of appropriate presumption has significant influence on system performance, and that in some heterogeneous settings, combining different presumptions in individual transactions outperforms adopting only one single presumption.
-
IEEE SCC - A dynamic Two-Phase Commit protocol for self-adapting services
IEEE International Conference onServices Computing 2004. (SCC 2004). Proceedings. 2004, 2004Co-Authors: Weihai Yu, Yan Wang, C. PuAbstract:Next-generation applications based on Web services impose additional requirements on the use of coordination protocols with various optimizations, such as the Two-Phase Commit protocol (2PC). We analyse the well-known 2PC optimizations presumed Commit and presumed abort, and present an improved 2PC that is suitable for Web services based applications. More specifically, the protocol allows every individual service provider to choose dynamically the most appropriate presumption for any distributed transaction. The protocol does not introduce extra overhead to the previous 2PC variants in terms of number of messages and log records, and it is easy to understand and realize.
-
A dynamic Two-Phase Commit protocol for self-adapting services
IEEE International Conference onServices Computing 2004. (SCC 2004). Proceedings. 2004, 2004Co-Authors: Weihai Yu, Yan Wang, C. PuAbstract:Next-generation applications based on Web services impose additional requirements on the use of coordination protocols with various optimizations, such as the Two-Phase Commit protocol (2PC). We analyse the well-known 2PC optimizations presumed Commit and presumed abort, and present an improved 2PC that is suitable for Web services based applications. More specifically, the protocol allows every individual service provider to choose dynamically the most appropriate presumption for any distributed transaction. The protocol does not introduce extra overhead to the previous 2PC variants in terms of number of messages and log records, and it is easy to understand and realize.
O.l. Costich - One of the best experts on this subject based on the ideXlab platform.
-
Analysis of a storage channel in the two phase Commit protocol
Proceedings Computer Security Foundations Workshop IV, 1991Co-Authors: O.l. Costich, I.s. MoskowitzAbstract:The authors discuss how a noisy storage channel arises in the two phase Commit protocol. The analysis is done through Shannon's information theory. They discuss how large the channel is and offer suggestions on how to diminish the channel capacity.
-
CSFW - Analysis of a storage channel in the two phase Commit protocol
Proceedings Computer Security Foundations Workshop IV, 1991Co-Authors: O.l. Costich, I.s. MoskowitzAbstract:The authors discuss how a noisy storage channel arises in the two phase Commit protocol. The analysis is done through Shannon's information theory. They discuss how large the channel is and offer suggestions on how to diminish the channel capacity. >
P. Van Der Stok - One of the best experts on this subject based on the ideXlab platform.
-
ICFEM - Mechanical verification of transaction processing systems
ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods, 2000Co-Authors: D. Chkliaev, J. Hooman, P. Van Der StokAbstract:Concerns the formal specification and mechanical verification of transaction processing systems aimed at distributed databases. In such systems, a standard set of ACID (Atomicity, Consistency, Isolation and Durability) properties must be ensured by a combination of concurrency control and recovery protocols. In the existing literature, these protocols are often studied in isolation, making strong assumptions about each other. The problem of combining them in a formal way has been largely ignored. To study the formal verification of combined protocols, we specify a transaction processing system, integrating strict Two-Phase locking, undo/redo recovery and Two-Phase Commit. In our method, the locking and undo/redo mechanism at distributed sites is defined by state machines, whereas the interaction between sites according to the Two-Phase Commit protocol is specified by assertions. We have proved, using the interactive proof checker of PVS, that our system satisfies atomicity, durability and serializability properties.
-
Mechanical verification of transaction processing systems
ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods, 2000Co-Authors: D. Chkliaev, J. Hooman, P. Van Der StokAbstract:Concerns the formal specification and mechanical verification of transaction processing systems aimed at distributed databases. In such systems, a standard set of ACID (Atomicity, Consistency, Isolation and Durability) properties must be ensured by a combination of concurrency control and recovery protocols. In the existing literature, these protocols are often studied in isolation, making strong assumptions about each other. The problem of combining them in a formal way has been largely ignored. To study the formal verification of combined protocols, we specify a transaction processing system, integrating strict Two-Phase locking, undo/redo recovery and Two-Phase Commit. In our method, the locking and undo/redo mechanism at distributed sites is defined by state machines, whereas the interaction between sites according to the Two-Phase Commit protocol is specified by assertions. We have proved, using the interactive proof checker of PVS, that our system satisfies atomicity, durability and serializability properties.
