Conference Paper

Performance Modeling of an Apache Web Server with Bursty Arrival Traffic.

Conference: Proceedings of the International Conference on Internet Computing, IC '03, Las Vegas, Nevada, USA, June 23-26, 2003, Volume 2
Source: DBLP

ABSTRACT Performance modeling is an important topic in capacity planning and overload control for web servers. We present a queueing model of an Apache web server that uses bursty arrival traffic. The arrivals of HTTP requests is assumed to be a Markov Modulated Poisson Process and the service discipline of the server is processor sharing. The total number of requests that can be processed at one time is limited to K. We obtain web server performance metrics such as average response time, throughput and blocking probability by simulations. Compared to other models, our model is conceptually simple. The model has been validated through measurements and simulations in our lab. The per- formance metrics predicted by the model fit well to the experimental outcome. Keywords--Internet, World Wide Web, web server, perfor- mance model, MMPP.

1 Bookmark
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Resource allocation in the cloud is usually driven by performance predictions, such as estimates of the future incoming load to the servers or of the quality-of-service(QoS) offered by applications to end users. In this context, characterizing web workload fluctuations in an accurate way is fundamental to understand how to provision cloud resources under time-varying traffic intensities. In this paper, we investigate the Markovian Arrival Processes (MAP) and the related MAP/MAP/1 queueing model as a tool for performance prediction of servers deployed in the cloud. MAPs are a special class of Markov models used as a compact description of the time-varying characteristics of workloads. In addition, MAPs can fit heavy-tail distributions, that are common in HTTP traffic, and can be easily integrated within analytical queueing models to efficiently predict system performance without simulating. By comparison with traced riven simulation, we observe that existing techniques for MAP parameterization from HTTP log files often lead to inaccurate performance predictions. We then define a maximum likelihood method for fitting MAP parameters based on data commonly available in Apache log files, and a new technique to cope with batch arrivals, which are notoriously difficult to model accurately. Numerical experiments demonstrate the accuracy of our approach for performance prediction of web systems.
    IEEE International Conference on Cloud Computing, CLOUD 2011, Washington, DC, USA, 4-9 July, 2011; 01/2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: Bursty has been considered as one of the main fea- tures of the Internet traffic. Although many different models have been proposed to profile this feature, most of existing approaches are hardly to simultaneously present the time property and statistic characteristics. In this paper, a new model is introduced for generating burst Web traffic based on hierarchical hidden Markov model. The proposed model includes two underlying Markov state processes. The parent Markov state process is used to describe the large-scale trends or phase of burst traffic. The child Markov process is used to describe the small-scale fluctuations that are happening during a given phase of arrival process. Efficient algorithms for parameter re-estimation and traffic synthesis are derived. Experiments are implemented to validate the proposed model. I. INTRODUCTION Traffic modeling is an important part of the research area of Internet. Without a correct model of the Internet traffic, it is difficult to give an accurate prediction of performance metrics. A validated model is the basis of performance test, capacity planning and attack defending. Therefore modeling Internet traffic represents a critical task in the study and in the design of Internet architectures. In order to derive an accurate traffic model, traffic characteristics have to be understood. Most existing studies, e.g. (1)(2), have suggested that measured Internet traffic exhibits a complex behavior like self-similarity
    Eighth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2011, 26-28 July 2011, Shanghai, China; 01/2011
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Predictive performance models are important tools that support system sizing, capacity planning, and systems management exercises. We introduce the Weighted Average Method (WAM) to improve the accuracy of analytic predictive performance models for systems with bursts of concurrent customers. WAM considers the customer population distribution at a system to reflect the impact of bursts. The WAM approach is robust with respect to distribution functions, including heavy-tail-like distributions, for workload parameters. We demonstrate the effectiveness of WAM using a case study involving a multitier TPC-W benchmark system. To demonstrate the utility of WAM with multiple performance modeling approaches, we developed both Queuing Network Models and Layered Queuing Models for the system. Results indicate that WAM improves prediction accuracy for bursty workloads for QNMs and LQMs by 10 and 12 percent, respectively, with respect to a Markov Chain approach reported in the literature.
    IEEE Transactions on Software Engineering 11/2011; · 2.59 Impact Factor

Full-text (2 Sources)

Available from
May 16, 2014