The Annals of Applied Probability

Limits of on/off hierarchical product models for data transmission

Sidney Resnick and Gennady Samorodnitsky

Full-text: Open access


A hierarchical product model seeks to model network traffic as a product of independent on/off processes. Previous studies have assumed a Markovian structure for component processes amounting to assuming that exponential distributions govern on and off periods, but this is not in good agreement with traffic measurements. However, if the number of factor processes grows and input rates are stabilized by allowing the on period distribution to change suitably, a limiting on/off process can be obtained which has exponentially distributed on periods and whose off periods are equal in distribution to the busy period of an $M/G/\infty$ queue. We give a fairly complete study of the possible limits of the product process as the number of factors grows and offer various characterizations of the approximating processes. We also study the dependence structure of the approximations.

Article information

Ann. Appl. Probab., Volume 13, Number 4 (2003), 1355-1398.

First available in Project Euclid: 25 November 2003

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 90B15: Network models, stochastic
Secondary: 60K25: Queueing theory [See also 68M20, 90B22]

Fluid queue $M/G/\infty$ queue heavy tales long-range dependence steady state distribution product models infinite divisibility renewal theorems


Resnick, Sidney; Samorodnitsky, Gennady. Limits of on/off hierarchical product models for data transmission. Ann. Appl. Probab. 13 (2003), no. 4, 1355--1398. doi:10.1214/aoap/1069786502.

Export citation


  • Beran, J. (1994). Statistics for Long-Memory Processes. Chapman and Hall, New York.
  • Carlsson, P. and Fiedler, M. (2000). Multifractal products of stochastic processes: Fluid flow analysis. In Proceedings of 15th Nordic Teletraffic Seminar NTS 173--184.
  • Çinlar, E. (1975). Introduction to Stochastic Processes. Prentice-Hall, Englewood Cliffs, NJ.
  • Doney, R. (1997). One-sided local large deviation and renewal theorems in the case of infinite mean. Probab. Theory Related Fields 107 451--465.
  • Embrechts, P., Goldie, C. and Veraverbeke, N. (1979). Subexponentiality and infinite divisibility. Z. Wahrsch. Verw. Gebiete 49 335--347.
  • Erickson, K. (1970). Strong renewal theorems with infinite mean. Trans. Amer. Math. Soc. 151 263--291.
  • Erickson, K. (1971). A renewal theorem for distributions on $R^1$ without expectation. Bull. Amer. Math. Soc. 77 406--410.
  • Feller, W. (1971). An Introduction to Probability Theory and Its Applications 2, 2nd ed. Wiley, New York.
  • Hall, P. (1988). Introduction to the Theory of Coverage Processes. Wiley, New York.
  • Heath, D., Resnick, S. and Samorodnitsky, G. (1997). Patterns of buffer overflow in a class of queues with long memory in the input stream. Ann. Appl. Probab. 7 1021--1057.
  • Heath, D., Resnick, S. and Samorodnitsky, G. (1998). Heavy tails and long range dependence in on/off processes and associated fluid models. Math. Oper. Res. 23 145--165.
  • Kulkarni, V., Marron, J. and Smith, F. (2001). A cascaded on-off model for TCP connection traces. Technical report, Dept. Statistics, Univ. North Carolina, Chapel Hill.
  • Leland, W., Taqqu, M., Willinger, W. and Wilson, D. (1994). On the self-similar nature of Ethernet traffic (extended version). IEEE/ACM Trans. Networking 2 1--15.
  • Mannersalo, P., Norros, I. and Riedi, R. (1999). Multifractal products of stochastic processes: A preview. Technical document COST257TD(99)31. Available at
  • Misra, V. and Gong, W. (1998). A hierarchical model for teletraffic. In Proceedings of 37th IEEE Conference of Decision and Control 2 1674--1679.
  • Resnick, S. (1987). Extreme Values, Regular Variation and Point Processes. Springer, New York.
  • Resnick, S. (1992). Adventures in Stochastic Processes. Birkhäuser, Boston.
  • Riedi, R. H. and Willinger, W. (2000). Toward an improved understanding of network traffic dynamics. In Self-similar Network Traffic and Performance Evaluation. Wiley, New York.
  • Takács, L. (1962). An Introduction to Queueing Theory. Oxford Univ. Press, New York.
  • Taqqu, M., Willinger, W. and Sherman, R. (1997). Proof of a fundamental result in self-similar traffic modeling. Comput. Comm. Rev. 27 5--23.
  • Williamson, J. (1968). Random walks and Riesz kernels. Pacific J. Math. 25 393--415.
  • Willinger, W., Taqqu, M. and Erramilli, A. (1996). A bibliographical guide to self-similar traffic and performance modeling for modern high-speed networks. In Stochastic Networks: Theory and Applications (S. Z. F. P. Kelly and I. Ziedins, eds.) 339--366. Clarendon Press, Oxford.
  • Willinger, W., Taqqu, M., Leland, M. and Wilson, D. (1995a). Self-similarity in high-speed packet traffic: Analysis and modelling of ethernet traffic measurements. Statist. Sci. 10 67--85.
  • Willinger, W., Taqqu, M., Leland, M. and Wilson, D. (1995b). Self-similarity through high variability: Statistical analysis of ethernet LAN traffic at the source level. Comput. Comm. Rev. 25 100--113.