Atomicity and isolation for transactional processes
ACM Transactions on Database Systems (TODS)
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
TCOT-A Timeout-Based Mobile Transaction Commitment Protocol
IEEE Transactions on Computers
Packet Delay and Packet Loss in the Internet
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Web Service Conversation Modeling: A Cornerstone for E-Business Automation
IEEE Internet Computing
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Charging for information services in Service-Oriented Architectures
BSN '05 Proceedings of the IEEE EEE05 international workshop on Business services networks
The Efficiency of Decreasing Payment Amounts in Mobile Commerce and Ubiquitous Computing
WMCS '05 Proceedings of the Second IEEE International Workshop on Mobile Commerce and Services
π_RBT-calculus Compensation and Exception Handling Protocol
PDP '06 Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
Publishing and composition of atomicity-equivalent services for B2B collaboration
Proceedings of the 28th international conference on Software engineering
Delay-Tolerant Network Technologies Coming Together
IEEE Distributed Systems Online
Scheduling optimization in coupling independent services as a Grid transaction
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Clients from Delay Tolerant Networks (DTNs) might encounter overtime exceptions when they aggregate autonomic commercial web service references to form an all-or-nothing transaction. Such exceptions may cause extra overhead-''compensation cost'' when aborting transactions. Regarding the delay-related characteristics of DTNs, this paper models the expected compensation cost (ECC) for the schedulings of commit-requests, presents a calculability analysis for quantitative ECC prediction, and explores the limitation of ECC's probabilistic prediction accordingly. The analysis is based on the timed-2PC plus compensation (t2PC+) protocol and the multi-step price tag pattern, which is verified conditionally by simulation tests through randomly-chosen severely-fluctuant samplings of compensation cost and delays. The ultimate target of this work is to demonstrate the high complexity, and in particular, the uncertainty of ECC predictions due to the randomicity of DTNs' delays.