The Community for Technology Leaders
Performance, Computing, and Communications Conference, 2002. 21st IEEE International (2002)
Phoenix, AZ, USA
Apr. 3, 2002 to Apr. 5, 2002
ISBN: 0-7803-7371-5
pp: 65-72
Shun-Zheng Yu , Res. Div., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Hidden semi-Markov models (HSMMs) have been well studied and successfully applied to many engineering and scientific problems. The advantage of using a HSMM is its efficient forward-backward algorithms for estimating model parameters to account for an observed sequence. In this paper, we propose a HSMM for modeling Web workloads. We show that this model asymptotically characterizes second order self-similar workloads when some duration distributions of the hidden states are heavy-tailed. A recursive formula is developed for estimating the Hurst parameter of self-similarity. We validate our model and estimation methods with respect to two sets of empirical data (requests per second) collected from two different Web servers. We then use this model to generate self-similar workloads that exhibit the same statistical properties. These measurements show that we can use as few as 4 states together with a simple Poisson process and heavy-tailed Pareto holding time distributions to accurately model the Web workloads considered in this study.

Z. Liu, L. Zhang, C. Xia, S. Yu and M. Squillante, "A hidden semi-Markov model for web workload self-similarity," Performance, Computing, and Communications Conference, 2002. 21st IEEE International(PCC), Phoenix, AZ, USA, 2002, pp. 65-72.
89 ms
(Ver 3.3 (11022016))