This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Model-Driven System Capacity Planning under Workload Burstiness
January 2010 (vol. 59 no. 1)
pp. 66-80
ASCII Text
x 
 
Giuliano Casale, Ningfang Mi, Evgenia Smirni, "Model-Driven System Capacity Planning under Workload Burstiness," IEEE Transactions on Computers, vol. 59, no. 1, pp. 66-80, January, 2010.
 
 
BibTex
x
 
@article{ 10.1109/TC.2009.135,
author = {Giuliano Casale and Ningfang Mi and Evgenia Smirni},
title = {Model-Driven System Capacity Planning under Workload Burstiness},
journal ={IEEE Transactions on Computers},
volume = {59},
number = {1},
issn = {0018-9340},
year = {2010},
pages = {66-80},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2009.135},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Model-Driven System Capacity Planning under Workload Burstiness
IS - 1
SN - 0018-9340
SP66
EP80
EPD - 66-80
A1 - Giuliano Casale,
A1 - Ningfang Mi,
A1 - Evgenia Smirni,
PY - 2010
KW - Performance of systems
KW - computer systems organization
KW - modeling and prediction
KW - performance
KW - operating systems
KW - software/software engineering.
VL - 59
JA - IEEE Transactions on Computers
ER -
 
Giuliano Casale, College of William and Mary, Williamsburg
Ningfang Mi, College of William and Mary, Williamsburg
Evgenia Smirni, College of William and Mary, Williamsburg
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe and predict accurately the performance of complex systems operating under bursty workloads, such as multitier architectures or storage arrays. Burstiness is a feature that significantly degrades system performance and that cannot be captured explicitly by existing capacity planning models. MAP queueing networks address this limitation by describing computer systems as closed networks of servers whose service times are Markovian Arrival Processes (MAPs), a class of Markov-modulated point processes that can model general distributions and burstiness. In this paper, we show that MAP queueing networks provide reliable performance predictions even if the service processes are bursty. We propose a methodology to solve MAP queueing networks by two state space transformations, which we call Linear Reduction (LR) and Quadratic Reduction (QR). These transformations dramatically decrease the number of states in the underlying Markov chain of the queueing network model. From these reduced state spaces, we obtain two classes of bounds on arbitrary performance indexes, e.g., throughput, response time, and utilizations. Numerical experiments show that LR and QR bounds achieve good accuracy. We also illustrate the high effectiveness of the LR and QR bounds in the performance analysis of a real multitier architecture subject to TPC-W workloads that are characterized as bursty. These results promote MAP queueing networks as a new class of robust capacity planning models.

[1] A.T. Andersen and B.F. Nielsen, “A Markovian Approach for Modeling Packet Traffic with Long-Range Dependence,” IEEE J. on Selected Areas in Comm., vol. 16, no. 5, pp. 719-732, June 1998.
[2] M.F. Arlitt and C.L. Williamson, “Web Server Workload Characterization: The Search for Invariants,” Proc. ACM SIGMETRICS, pp. 126-137, 1996.
[3] F. Baskett, K.M. Chandy, R.R. Muntz, and F.G. Palacios, “Open, Closed, and Mixed Networks of Queues with Different Classes of Customers,” J. ACM, vol. 22, no. 2, pp. 248-260, 1975.
[4] D. Bertsimas and J. Tsitsiklis, Introduction to Linear Optimization. Athena, 1997.
[5] G. Bolch, S. Greiner, H. de Meer, and K.S. Trivedi, Queueing Networks and Markov Chains. Wiley, 1998.
[6] A.B. Bondi and W. Whitt, “The Influence of Service-Time Variability in a Closed Network of Queues,” Performance Evaluation, vol. 6, pp. 219-234, 1986.
[7] G. Casale, “An Efficient Algorithm for the Exact Analysis of Multiclass Queueing Networks with Large Population Sizes,” Proc. Joint ACM SIGMETRICS/IFIP Performance, pp. 169-180, 2006.
[8] G. Casale, N. Mi, and E. Smirni, “Bound Analysis of Closed Queueing Networks with Nonrenewal Workloads,” TR WM-CS-2008-03, College of William and Mary, 2008.
[9] G. Casale, N. Mi, and E. Smirni, “Bound Analysis of Closed Queueing Networks with Workload Burstiness,” Proc. ACM SIGMETRICS, pp. 13-24, 2008.
[10] G. Casale, N. Mi, L. Cherkasova, and E. Smirni, “How to Parameterize Models with Bursty Workloads,” Proc. First Workshop Hot Topics in Metrics (HOTMETRICS '08), ACM Performance Evaluation Rev., vol. 36, no. 2, pp. 38-44, June 2008.
[11] G. Casale, E.Z. Zhang, and E. Smirni, “Trace Data Characterization and Fitting for Markov Modeling,” Performance Evaluation, Elsevier, to appear.
[12] G. Casale, E.Z. Zhang, and E. Smirni, “KPC-Toolbox: Simple Yet Effective Trace Fitting Using Markovian Arrival Processes,” Proc. Third Int'l Conf. Quantitative Evaluation of Systems (QEST '08), pp.83-92, Sept. 2008.
[13] K.M. Chandy, U. Herzog, and L. Woo, “Parametric Analysis of Queueing Networks,” IBM J. Research and Development, vol. 19, no. 1, pp. 36-42, 1975.
[14] P.J. Courtois, “Decomposability, Instabilities, and Saturation in Multiprogramming Systems,” Comm. ACM, vol. 18, no. 7, pp. 371-377, 1975.
[15] D.R. Cox and P.A.W. Lewis, The Statistical Analysis of Series of Events. John Wiley and Sons, 1966.
[16] D.L. Eager, D.J. Sorin, and M.K. Vernon, “AMVA Techniques for High Service Time Variability,” Proc. ACM SIGMETRICS, pp. 217-228, 2000.
[17] W. Fischer and K.S. Meier-Hellstern, “The Markov-Modulated Poisson Process (MMPP) Cookbook,” Performance Evaluation, vol. 18, no. 2, pp. 149-171, 1993.
[18] R. Fourer and D.M. Gay, and B.W. Kernighan, AMPL—A Modeling Language for Math. Programming. Springer-Verlag, 1995.
[19] D. Garcia and J. Garcia, “TPC-W E-Commerce Benchmark Evaluation,” Computer, vol. 36, no. 2, pp. 42-48, Feb. 2003.
[20] GNU GLPK 4.8, http://www.gnu.org/softwareglpk/, 2009.
[21] J.M. Harrison, R.J. Williams, and H. Chen, “Brownian Models of Closed Queueing Networks with Homogeneous Customer Populations,” Stochastics and Stochastics Reports, vol. 29, pp. 37-74, 1990.
[22] A. Horváth and M. Telek, “Markovian Modeling of Real Data Traffic: Heuristic Phase Type and MAP Fitting of Heavy Tailed and Fractal Like Samples,” Performance Evaluation of Complex Systems: Techniques and Tools, pp. 405-434, Springer, 2002.
[23] S. Kounev and A. Buchmann, “Performance Modeling and Evaluation of Large-Scale J2EE Applications,” Proc. 29th Int'l Conf. Computer Measurement Group (CMG), pp. 273-283, 2003.
[24] E.D. Lazowska, J. Zahorjan, G. Graham, and K.C. Sevcik, Quantitative System Performance. Prentice-Hall, 1984.
[25] W.E. Leland, M.S. Taqqu, W. Willinger, and D.V. Wilson, “On the Self-Similar Nature of Ethernet Traffic,” IEEE/ACM Trans. Networking, vol. 2, no. 1, pp. 1-15, Feb. 1994.
[26] Z. Liu, “Long Range Dependence and Heavy Tail Distributions,” Performance Evaluation, special issue on performance evaluations, vol. 61, nos. 2/3, pp. 91-93, 2005.
[27] N. Mi, G. Casale, L. Cherkasova, and E. Smirni, “Burstiness in Multi-Tier Applications: Symptoms, Causes, and New Models,” Proc. ACM/IFIP/USENIX Middleware 2008, pp. 265-286, Dec. 2008.
[28] N. Mi, Q. Zhang, A. Riska, E. Smirni, and E. Riedel, “Performance Impacts of Autocorrelated Flows in Multi-Tiered Systems,” Performance Evaluation, vol. 64, nos. 9-12, pp. 1082-1101, 2007.
[29] J. Morrison and P.R. Kumar, “New Linear Program Performance Bounds for Closed Queueing Networks,” Discrete Event Dynamic Systems, vol. 11, pp. 291-317, 2001.
[30] R.R. Muntz and J.W. Wong, “Asymptotic Properties of Closed Queueing Network Models,” Proc. Ann. Princeton Conf. Information Sciences and Systems, pp. 348-352, 1974.
[31] M.F. Neuts, Structured Stochastic Matrices of M/G/1 Type and Their Applications. Marcel Dekker, 1989.
[32] J. Padhye, A.D. Rahatekar, and L.W. Dowdy, “A Simple LAN File Placement Strategy,” Proc. Computer Measurement Group (CMG), pp. 396-406, 1995.
[33] K.R. Pattipati, M.M. Kostreva, and J.L. Teele, “Approximate Mean Value Analysis Algorithms for Queueing Networks: Existence, Uniqueness, and Convergence Results,” J. ACM, vol. 37, pp. 643-673, 1980.
[34] M. Reiser, “A Queueing Network Analysis of Computer Communication Networks with Window Flow Control,” IEEE Trans. Comm., vol. 27, no. 8, pp. 1199-1209, Aug. 1979.
[35] M. Reiser and S.S. Lavenberg, “Mean-Value Analysis of Closed Multichain Queueing Networks,” J. ACM, vol. 27, no. 2, pp. 312-322, 1980.
[36] A. Riska and E. Riedel, “Long-Range Dependence at the Disk Drive Level,” Proc. Third Conf. Quantitative Evaluation of Systems (QEST), pp. 41-50, 2006.
[37] J. Zahorjan, E.D. Lazowska, and R.L. Garner, “A Decomposition Approach to Modelling High Service Time Variability,” Performance Evaluation, vol. 3, pp. 35-54, 1983.
[38] Q. Zhang, N. Mi, A. Riska, and E. Smirni, “Performance-Guided Load (Un)Balancing under Autocorrelated Flows,” IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 5, pp. 652-665, May 2008.

Index Terms:
Performance of systems, computer systems organization, modeling and prediction, performance, operating systems, software/software engineering.
Citation:
Giuliano Casale, Ningfang Mi, Evgenia Smirni, "Model-Driven System Capacity Planning under Workload Burstiness," IEEE Transactions on Computers, vol. 59, no. 1, pp. 66-80, Jan. 2010, doi:10.1109/TC.2009.135
Usage of this product signifies your acceptance of the Terms of Use.