Priority scheduling service for E-commerce web servers

Service scheduling is one of the crucial issues in E-commerce environment. E-commerce web servers often get overloaded as they have to deal with a large number of customers’ requests—for example, browse, search, and pay, in order to make purchases or to get product information from E-commerce web sites. In this paper, we propose a new approach in order to effectively handle high traffic load and to improve web server’s performance. Our solution is to exploit networking techniques and to classify customers’ requests into different classes such that some requests are prioritised over others. We contend that such classification is financially beneficial to E-commerce services as in these services some requests are more valuable than others. For instance, the processing of “browse” request should get less priority than “payment” request as the latter is considered to be more valuable to the service provider. Our approach analyses the arrival process of distinct requests and employs a priority scheduling service at the network nodes that gives preferential treatment to high priority requests. The proposed approach is tested through various experiments which show significant decrease in the response time of high priority requests. This also reduces the probability of dropping high priority requests by a web server and thus enabling service providers to generate more revenue.

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

[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]  Virgílio A. F. Almeida,et al.  A methodology for workload characterization of E-commerce sites , 1999, EC '99.

[4]  Qing Yang,et al.  Performance Evaluation of Distributed Web Server Architectures under E-Commerce Workloads , 2000, International Conference on Internet Computing.

[5]  Daniel A. Menascé,et al.  TPC-W: A Benchmark for E-Commerce , 2002, IEEE Internet Comput..

[6]  Daniel A. Menascé Tradeoffs in Designing Web Clusters , 2002, IEEE Internet Comput..

[7]  Suresha,et al.  Proxy-based acceleration of dynamically generated content on the world wide web: an approach and implementation , 2002, SIGMOD '02.

[8]  Irfan-Ullah Awan,et al.  Efficient commit processing of Web transactions using priority scheduling mechanism , 2003, Proceedings of the Fourth International Conference on Web Information Systems Engineering, 2003. WISE 2003..

[9]  Mor Harchol-Balter,et al.  Size-based scheduling to improve web performance , 2003, TOCS.

[10]  Mor Harchol-Balter,et al.  Priority mechanisms for OLTP and transactional Web applications , 2004, Proceedings. 20th International Conference on Data Engineering.

[11]  Erich M. Nahum,et al.  A method for transparent admission control and request scheduling in e-commerce web sites , 2004, WWW '04.

[12]  Irfan-Ullah Awan,et al.  Analytical modelling of priority commit protocol for reliable Web applications , 2004, SAC '04.

[13]  Krithi Ramamritham,et al.  Proxy-based acceleration of dynamically generated content on the world wide web: An approach and implementation , 2004, ACM Trans. Database Syst..

[14]  Daniel A. Menascé MOM vs. RPC: Communication Models for Distributed Applications , 2005, IEEE Internet Comput..

[15]  D. Manjunath,et al.  A Combined LIFO-Priority Scheme for Overload Control of E-commerce Web Servers , 2006, ArXiv.

[16]  Irfan-Ullah Awan,et al.  Efficient Scheduling of Vital E-Commerce Requests , 2006, 2006 IEEE International Conference on e-Business Engineering (ICEBE'06).

[17]  A. Furnham Why people shop , 2006 .