Additive and Multiplicative Mixture Trees for Network Traffic Modeling

Abstract

Network traffic exhibits drastically different statistics, ranging from nearly Gaussian marginals and long range dependence at very large time scales to highly non-Gaussian marginals and multifractal scaling on small scales. This behavior can be explained by forming two components of the traffic according to the speed of connections, one component absorbing most traffic and being mostly Gaussian, the other constituting virtually all the small scale bursts. Towards a better understanding of this phenomenon, we propose a novel tree-based model which is flexible enough to accommodate Gaussian as well as bursty behavior on different scales in a parsimonious way.

Description
Conference paper
Advisor
Degree
Type
Conference paper
Keywords
Citation

S. Sarvotham, X. Wang, R. H. Riedi and R. G. Baraniuk, "Additive and Multiplicative Mixture Trees for Network Traffic Modeling," vol. 4, 2002.

Has part(s)
Forms part of
Rights
Link to license
Citable link to this page