The Community for Technology Leaders
Proceedings 18th International Conference on Data Engineering (2002)
San Jose, California
Feb. 26, 2002 to Mar. 1, 2002
ISBN: 0-7695-1531-2
pp: 0507
Mengzhi Wang , Carnegie Mellon University
Ngai Hang Chan , Carnegie Mellon University
Spiros Papadimitriou , Carnegie Mellon University
Christos Faloutsos , Carnegie Mellon University
Tara Madhyastha , University of California Santa Cruz
Network, web, and disk I/O traffic are usually bursty, self-similar and therefore can not be modeled adequately with Poisson arrivals. However, we do want to model these types of traffic and to generate realistic traces, because of obvious applications for disk scheduling, network management, web server design.Previous models (like fractional Brownian motion, FARIMA etc) tried to capture the `burstiness'. However, the proposed models either require too many parameters to fit and/or require prohibitively large (quadratic) time to generate large traces. We propose a simple, parsimonious method, the b-model, which solves both problems: It requires just one parameter, and it can easily generate large traces. In addition, it has many more attractive properties: (a) With our proposed estimation algorithm, it requires just a single pass over the actual trace to estimate b. For example, a one-day-long disk trace in milliseconds contains about 86Mb data points and requires about 3 minutes for model fitting and 5 minutes for generation. (b) The resulting synthetic traces are very realistic: our experiments on real disk and web traces show that our synthetic traces match the real ones very well in terms of queuing behavior.
Data Mining, Performance Evaluation, Traffic Modeling

T. Madhyastha, M. Wang, C. Faloutsos, N. H. Chan and S. Papadimitriou, "Data Mining Meets Performance Evaluation: Fast Algorithms for Modeling Bursty Traffic," Proceedings 18th International Conference on Data Engineering(ICDE), San Jose, California, 2002, pp. 0507.
83 ms
(Ver 3.3 (11022016))