Analytical modelling of priority commit protocol for reliable Web applications

  • Authors:

  • I. Awan;M. Younas

  • Affiliations:

  • University of Bradford, Bradford, UK;Coventry University, Coventry, UK

  • Venue:
  • Proceedings of the 2004 ACM symposium on Applied computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Web applications are vulnerable to failures and low performance due to the large population of users and the widespread distribution of Internet. Transaction technology provides Web applications with high reliability and improved performance. This paper presents a novel approach for the efficient commit processing of Web transactions. The proposed approach is based on the implementation of priority active network scheduling mechanism at each network node. It involves rigorous analysis of a network node with-finite capacity to accommodate messages, bursty arrival process to represent incoming multi-class messages, and the employment of a priority scheduling mechanism to give preferential treatment to high priority messages. This analytical solution provides closed from expressions for calculating the queuing delay per class involved in the commit processing of Web transactions at each network node. The proposed approach significantly reduces the queuing delay for high priority messages such as commit, abort, and compensation of Web transactions. Consequently, performance of the commit processing of Web transactions is improved as response time of the nodes responsible for making decision is reduced.