Analysis of Web Workload on QoS to Assist Capacity
Workload characterization is a well-established discipline, which finds its applications in performance evaluation of modern Internet services. With the high degree of popularity of the Internet, there is a huge variation in the intensity of workload and this opens up new challenging performance issues to be addressed. Internet Services are subject to huge variations in demand, with bursts coinciding with the times that the service has the most value. Apart from these flash crowds, sites are also subject to denial-of-service (DoS) attacks that can knock a service out of commission. The paper aims to study the effect of various workload distributions with the service architecture ‘thread-per-connection’ in use as a basis. The source model is structured as a sequence of activities with equal execution time requirement with an additional load time of page (loading embedded objects, images, etc.). The threads are allocated to the requests in the queue; leftover requests if any are denied service. The rejection rate is used as a criterion for evaluation of the performance of the system with a given capacity. The proposed model could form a basis for various system models to be integrated into the system and get its performance metrics (i.e. QoS) evaluated.
KeywordsWorkload distribution Workload modeling Workload characterization Performance evaluation Image loading time
- 5.Gunther NJ (2001) Performance and scalability models for a hypergrowth e-commerce web site. In: Performance engineering, state of the art and current trends. Springer, London, UK, pp 267–282Google Scholar
- 7.Menasce D, Almeida V, Riedi R, Ribeiro F, Fonseca R, Meira W Jr (2000) In search of invariants for e-business workloads. In: EC 00: proceedings of the 2nd ACM conference on electronic commerce, New York, NY, USA. ACM, pp. 56–65Google Scholar
- 9.Harini N, Padmanabhan TR (2012) A secured-concurrent available architecture for improving performance of web services. In: Communications in computer and information science, vol 292, no 1. Springer, pp 621–631Google Scholar
- 10.Harini N, Padmanabhan TR (2013) Admission control and request scheduling for secured-concurrent-available architecture. Int J Comput Appl 63(6):24–30Google Scholar