Self-similar communication models and very heavy tails
Resnick, Sidney ; Rootzén, Holger
Ann. Appl. Probab., Tome 10 (2000) no. 2, p. 753-778 / Harvested from Project Euclid
Several studies of file sizes either being downloaded or stored in the World Wide Web have commented that tails can be so heavy that not only are variances infinite, but so are means. Motivated by this fact, we study the infinite node Poisson model under the assumption that transmission times are heavy tailed with infinite mean. The model is unstable but we are able to provide growth rates. Self-similar but nonstationary Gaussian process approximations are provided for the number of active sources, cumulative input, buffer content and time to buffer overflow.
Publié le : 2000-08-14
Classification:  Heavy tails,  regular variation,  Pareto tails,  self-similarity,  scaling,  data communication,  traffic modeling,  infinite source,  Poisson connections,  60K25,  60F05,  60F10,  60F17,  60G18,  60G55
@article{1019487509,
     author = {Resnick, Sidney and Rootz\'en, Holger},
     title = {Self-similar communication models and very heavy tails},
     journal = {Ann. Appl. Probab.},
     volume = {10},
     number = {2},
     year = {2000},
     pages = { 753-778},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1019487509}
}
Resnick, Sidney; Rootzén, Holger. Self-similar communication models and very heavy tails. Ann. Appl. Probab., Tome 10 (2000) no. 2, pp.  753-778. http://gdmltest.u-ga.fr/item/1019487509/