Sarvotham, ShriramWang, XuguangRiedi, Rudolf H.Baraniuk, Richard G.2007-10-312007-10-312002-05-012002-05-01S. Sarvotham, X. Wang, R. H. Riedi and R. G. Baraniuk, "Additive and Multiplicative Mixture Trees for Network Traffic Modeling," vol. 4, 2002.https://hdl.handle.net/1911/20317Conference paperNetwork 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.engDSP for CommunicationsAdditive and Multiplicative Mixture Trees for Network Traffic ModelingConference paperhttp://dx.doi.org/10.1109/ICASSP.2002.5745544