Efficient commit processing of Web transactions using priority scheduling mechanism

This paper proposes an 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.

[1]  Akhil Sahai,et al.  An Approach to Optimistic Commit and Transparent Compensation for E-Service Transactions , 2001, ISCA PDCS.

[2]  David Wetherall,et al.  Improving the performance of distributed applications using active networks , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[3]  Jayant R. Haritsa,et al.  Revisiting commit processing in distributed database systems , 1997, SIGMOD '97.

[4]  Anne H. H. Ngu,et al.  Business-to-business interactions: issues and enabling technologies , 2003, The VLDB Journal.

[5]  Xiang Xu.  Improving the Performance of Distributed Applications Using Active Networks , 2001 .

[6]  Barry Eaglestone,et al.  A Review of Multidatabase Transactions on The Web: From the ACID to the SACReD , 2000, BNCOD.

[7]  Mike P. Papazoglou,et al.  Web Services and Business Transactions , 2003, World Wide Web.

[8]  Santosh K. Shrivastava,et al.  Constructing Reliable Web Applications Using Atomic Actions , 1997, Comput. Networks.

[9]  T. Suda,et al.  Congestion control and prevention in ATM networks , 1991, IEEE Network.

[10]  A. Elmagarmid.  Database transaction models for advanced applications , 1992 .

[11]  Philip A. Bernstein,et al.  Implementing recoverable requests using queues , 1990, SIGMOD '90.

[12]  William Perrizo,et al.  Atomic commitment in database systems over active networks , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[13]  Keith Evans,et al.  Transaction Internet Protocol Version 3.0 , 1998, RFC.

[14]  Irfan-Ullah Awan,et al.  Approximate Analysis of Arbitrary QNMs with Space and Service Priorities , 1997, Modelling and Evaluation of ATM Networks.