Article

Analytical modelling of priority commit protocol for reliable Web applications

Authors:

I. Awan,

M. YounasAuthors Info & Claims

SAC '04: Proceedings of the 2004 ACM symposium on Applied computing

Pages 313 - 317

https://doi.org/10.1145/967900.967969

Published: 14 March 2004 Publication History

Get Access

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.

References

[1]

U. Legedza, D. Wetherall, H. Guttag," Improving the Performance of Distributed Applications Using Active Networks," IEEE INFOCOM, CA, USA, 1998, pp. 590--599.]]

Google Scholar

[2]

Z. Zhang, W. Perrizo, and V. Shi," Atomic Commitment in Database Systems over Wide Area Active Networks"", IEEE International Conference on Data Engineering (ICDE 1999), Sidney, Australia, 1999]]

Digital Library

Google Scholar

[3]

A.K. Elmagarmid," Database Transaction Models for Advanced Applications", Morgan Kaufman, 1992]]

Digital Library

Google Scholar

[4]

M. Younas, B. Eaglestone, R. Holton," A Review of Multidatabase Transactions on the Web: From the ACID to the SACReD"," 17th British National Conference on Databases (BNCOD), Exeter, UK, Springer LNCS, 2000, pp. 140--152]]

Digital Library

Google Scholar

[5]

Little, S. K. Shrivastava, S. J. Caughey, D. B. Ingham, "Constructing Reliable Web Applications using Atomic Actions"," Computer Networks, 29(8--13), 1997, pp. 1281--1290]]

Digital Library

Google Scholar

[6]

M. Papazoglou, "Web Services and Business Transactions"," World Wide Web, Vol. 6 (1), 2003, pp. 49--91.]]

Digital Library

Google Scholar

[7]

F. Cabrera, G. Copeland, B. Cox, T. Freund, J. Klein, T. Storey, and S. Thatte, "Web Services Transaction"," 2002 http://www-106.ibm.com/developerworks/library/ws-transpec/]]

Google Scholar

[8]

P. K. Chrysanthis, G., Samaras, Y. J. Al-Houmaily, "Recovery and Performance of Atomic Commit Processing in Distributed Database Systems", in Recovery Mechanisms in Database Systems, V. Kumar, M. Hsu, Eds. Prentice-Hall, 1998.]]

Google Scholar

[9]

OASIS, "Business Transaction Protocol", Version 1.0, 2002]]

Google Scholar

[10]

I. Awan, D. Kouvatsos," Approximate Analysis of Arbitrary QNMs with Space and Service Priorities", Performance Analysis of ATM Networks, Kluwer Publishers, 1999, pp. 497--521.]]

Digital Library

Google Scholar

[11]

I.Awan, D. Kouvatsos, " Approximate Analysis of Arbitary QNMs, with HoL Priorities, CBS Buffer Management Scheme and RS-RD Blocking", Proceeding of 18th UKPEW, Glasgow, UK, July 2002, pp. 15--26.]]

Google Scholar

[12]

D.D. Kouvatsos and I. Awan, "Entropy Maximization and Open Queueing Networks with Priorities and Blocking", Technical report, CS-09--02, Department of computing, Bradford University Sept. 2002.]]

Google Scholar

[13]

P.A. Bernstein, M. Hsu, B. Mann, "Implementing Recoverable Requests Using Queues"," ACM SIGMOD Conference, Atlantic City, NJ, USA, 1990, pp. 112--122]]

Digital Library

Google Scholar

[14]

M. Younas, I. Awan, "Efficient Commit Processing of Web Transactions using Priority Scheduling Mechanism 4th Int. Conference on Web Information Systems Engineering (WISE 2003), IEEE CS Press, December, 2003, Rome, Italy.]]

Digital Library

Google Scholar

Cited By

View all

Holton DYounas MAwan I(2011)Priority scheduling of requests to web portalsJournal of Systems and Software10.1016/j.jss.2011.03.07484:8(1373-1378)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1016/j.jss.2011.03.074
Al-Houmaily Y(2010)Atomic commit protocols, their integration, and their optimisations in distributed database systemsInternational Journal of Intelligent Information and Database Systems10.1504/IJIIDS.2010.0355824:4(373-412)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1504/IJIIDS.2010.035582
Holton DAwan IYounas M(2009)Priority Scheduling of Requests to Web PortalsProceedings of the 2009 International Conference on Advanced Information Networking and Applications10.1109/AINA.2009.111(786-791)Online publication date: 26-May-2009
https://dl.acm.org/doi/10.1109/AINA.2009.111
Show More Cited By

Analytical modelling of priority commit protocol for reliable Web applications
1. General and reference
  1. Cross-computing tools and techniques
2. Social and professional topics
  1. Professional topics
    1. Computing profession

Recommendations

The impact of priority generations in a multi-priority queueing system: a simulation approach
WSC '09: Winter Simulation Conference

In this paper, we consider a preemptive (multiple) priority queueing model in which arrivals occur according to a Markovian arrival process (MAP). An arriving customer belongs to priority type i, 1 ≤ i ≤ m+1, with probability p_i. The highest priority, ...
An N-Server Cutoff Priority Queue

We consider a multi-priority, nonpreemptive, multi-server queueing system, with Poisson arrivals and negative exponential service times. In order to save available servers for higher priority customers, the system deliberately queues arriving lower ...
(N,n)-preemptive priority queues

In this paper, we propose a new priority discipline, called the (N,n)-preemptive priority discipline. Under this discipline, the preemption of the service of a low-class customer is determined by two thresholds N and n of the queue length of high-class ...

Comments

Information & Contributors

Information

Published In

SAC '04: Proceedings of the 2004 ACM symposium on Applied computing

March 2004

1733 pages

ISBN:1581138121

DOI:10.1145/967900

Conference Chair:
Hisham M. Haddad
Kennesaw State University
,
Program Chairs:
Andrea Omicini
Università degli Studi di Bologna a Cesena
,
Roger L. Wainwright
University of Tulsa
,
Publications Chair:
Lorie M. Liebrock
New Mexico Institute of Mining and Technology

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 March 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SAC04

Sponsor:

SIGAPP

SAC04: The 2004 ACM Symposium on Applied Computing

March 14 - 17, 2004

Nicosia, Cyprus

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
324
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Holton DYounas MAwan I(2011)Priority scheduling of requests to web portalsJournal of Systems and Software10.1016/j.jss.2011.03.07484:8(1373-1378)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1016/j.jss.2011.03.074
Al-Houmaily Y(2010)Atomic commit protocols, their integration, and their optimisations in distributed database systemsInternational Journal of Intelligent Information and Database Systems10.1504/IJIIDS.2010.0355824:4(373-412)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1504/IJIIDS.2010.035582
Holton DAwan IYounas M(2009)Priority Scheduling of Requests to Web PortalsProceedings of the 2009 International Conference on Advanced Information Networking and Applications10.1109/AINA.2009.111(786-791)Online publication date: 26-May-2009
https://dl.acm.org/doi/10.1109/AINA.2009.111
Santos CCosta JFurtado P(2007)QoS-Broker for Transactional WorkloadsProceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 0210.1109/AINAW.2007.300(594-599)Online publication date: 21-May-2007
https://dl.acm.org/doi/10.1109/AINAW.2007.300
Younas MAwan IChao KChung J(2007)Priority scheduling service for E-commerce web serversInformation Systems and e-Business Management10.1007/s10257-007-0058-96:1(69-82)Online publication date: 9-Aug-2007
https://doi.org/10.1007/s10257-007-0058-9
Younas MAwan IChao K(2006)Efficient Scheduling of Vital E-Commerce RequestsProceedings of the IEEE International Conference on e-Business Engineering10.1109/ICEBE.2006.44(496-503)Online publication date: 24-Oct-2006
https://dl.acm.org/doi/10.1109/ICEBE.2006.44
Younas MAwan IKuo-Ming Chao (2004)Performance analysis of preemptive resume scheduling in mobile transactions18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.10.1109/AINA.2004.1283919(249-254)Online publication date: 2004
https://doi.org/10.1109/AINA.2004.1283919

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

The impact of priority generations in a multi-priority queueing system: a simulation approach

An N-Server Cutoff Priority Queue

(N,n)-preemptive priority queues