Priority scheduling service for E-commerce web servers

Springer Science and Business Media LLC - Tập 6 - Trang 69-82 - 2007
Muhammad Younas1, Irfan Awan2, Kuo-Ming Chao3, Jen-Yao Chung4
1Department of Computing, Oxford Brookes University, Oxford, UK
2Department of Computing University of Bradford, Bradford, UK
3Department of Computer and Network Systems, Coventry University, Coventry, UK
4IBM T.J. Watson Research Center, Yorktown Heights, USA

Tóm tắt

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.

Tài liệu tham khảo

Awan I, Kouvatsos D (1999) Approximate analysis of arbitrary QNMs with space and service priorities, performance analysis of ATM networks, Kluwer, Dordrecht, pp 497–521 Awan I, Kouvatsos D (2002) Approximate analysis of arbitrary QNMs with HoL priorities, CBS buffer management scheme and RS-RD blocking. In: Proceeding of 18th UKPEW, Glasgow, pp 15–26 Awan I, Younas M (2004) Analytical modelling of priority commit protocol for reliable web applications. In: Proceedings of the 19th ACM symposium on applied computing (SAC), Nicosia Badel M, Chandresris D, Guillemaud J-J, Potier D, Saintoyant P-Y, Veran M (1981) QNAP2 reference manual, Cii Honeywell Bull and INRIA Elnikety S, Nahum E, Tracey J, Zwaenepoel W (2004) A method for transparent admission control and request scheduling in E-Commerce web sites. In: Proceedings of ACM WWW conference, New York E*TRADE FINANCIAL (accessed on 20 February 2007). https://www.us.etrade.com/e/t/home Harchol-Balter M, Schroeder B, Bansal N, Agrawal M (2003) Size-based scheduling to improve web performance. ACM Trans Comput Syst 21(2):207–233 He X, Yang Q (2000) Performance evaluation of distributed web server architectures under e-commerce workloads. In: Proceedings of the 1st international conference on internet computing (IC’2000), Nevada, pp 285–292 Legedza U, Wetherall D, Guttag H (1998) Improving the performance of distributed applications using active networks. In: Proceedings of the 17th conference on computer communications (INFOCOM), San Francisco, California, April 1998, IEEE, pp 590–599 McWherter D, Schroeder B, Ailamaki A, Harchol-Balter M (2004) Priority mechanisms for OLTP and transactional web applications. In: 20th international conference on data engineering (ICDE 2004), Boston Menascé DA (2002a) Trade-offs in designing web clusters, IEEE internet comput 6(5):76–80 Menascé DA (2002b) TPC-W: a benchmark for E-Commerce, IEEE internet comput 6(3):83–87 Menascé DA (2005) MoM vs. RPC: communication models for distributed applications, IEEE internet comput 9(2):90–93 Menascé DA, Almeida VAF, Fonseca R, Mendes MA (1999) A methodology for workload characterization of e-commerce sites. ACM Conf Electro Commer, Denver pp 119–128 Nielsen J (1999) Why people shop on the web. http://www.useit.com/alertbox/990207.html Singhmar N, Mathur V, Apte V, Manjunath D (2004) A combined LIFO-priority scheme for overload control of e-commerce web servers, international infrastructure survivability workshop (IISW’04) overloads, attacks and failures: the trade-off against time in conjunction with the 25th IEEE international real-time systems symposium (RTSS04), Portugal Transaction processing performance council (2007), TPC-W: transactional web e-commerce benchmarkhttp://www.tpc.org/tpcw/ VanderMeer D, Datta A, Dutta K, Thomas H, Ramamritham K, (2004) Proxy-based acceleration of dynamically generated content on the world wide web: an approach and implementation. ACM Trans Database Syst 29(2):403–443 Younas M, Awan I (2003) Efficient commit processing of web transactions using priority scheduling mechanism. In: 4th international conference on web information systems engineering (WISE 2003), IEEE CS, Rome Younas M, Awan I, Chao K-M (2006) Efficient scheduling of vital e-commerce requests. In: 2006 IEEE international conference on e-business engineering (ICEBE 2006), Shanghai, pp 496–503 Website optimization (2007) LLC (accessed on 20 February 2007). http://www.websiteoptimization.com/