Efficient Commit Processing of Web Transactions Using Priority Scheduling Mechanism

Authors:
M. Younas;I. Awan
Affiliations:
-;-
Venue:
WISE '03 Proceedings of the Fourth International Conference on Web Information Systems Engineering
Year:
2003

Citing 0
Cited 3

Analytical modelling of priority commit protocol for reliable Web applications

Proceedings of the 2004 ACM symposium on Applied computing
A class-based scheme for E-commerce web servers: Formal specification and performance evaluation

Journal of Network and Computer Applications
Priority scheduling of requests to web portals

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a novel approach for the efficient commit processing of Web transactions. The approach is based on the priority active network scheduling mechanism. This approach takes into account the actual queuing delay of the network nodes involved in the commit processing of Web transactions. Using this approach, the queuing delays for the high priority messages (such as commit/abort) can significantly be reduced. Consequently, the performance of the commit processing is improved as response time of the nodes responsible for making decisions is reduced. This approach can be used to improve the performance of the existing commit protocols of Web transactions.