Abstract
Highly-aggregated traffic in communication networks is often modeled as fractional Brownian motion (fBm). This is justified by the theoretical result that the sum of a large number of on–off inputs, with either on-times or off-times having a heavy-tailed distribution with infinite variance, converges to fBm, after rescaling time appropriately. For performance analysis purposes, the key question is whether this convergence carries over to the stationary buffer content process. In this paper it is shown that, in a heavy-traffic queueing environment, this property indeed holds.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Berman, An asymptotic formula for the distribution of the maximum of a Gaussian process with stationary increments, J. Appl. Probab. 22 (1985) 454–460.
P. Billingsley, Convergence of Probability Measures (Wiley, New York, 1968).
N.H. Bingham, C.M. Goldie and J.L. Teugels, Regular Variation (Cambridge Univ. Press, Cambridge, 1987).
A.A. Borovkov, Stochastic Processes in Queueing Theory (Springer, New York, 1976).
J. Cao and K. Ramanan, A Poisson limit for buffer overflow probabilities, in: Proceedings of INFOCOM 2002, 2002.
K. Debicki and Z. Palmowski, Heavy traffic asymptotics of on-off fluid model, Queueing Systems 33 (1999) 327–338.
D. Heath, S. Resnick and G. Samorodnitsky, Heavy tails and long range dependence in ON/OFF processes and associated fluid models, Math. Oper. Res. 23 (1998) 145–165.
K. Konstantopoulos and S. Lin, Macroscopic models for long-range dependent network traffic, Queueing Systems 28 (1998) 215–243.
V. Kulkarni, Fluid models for single buffer systems, in: Frontiers in Queueing: Models and Applications in Science and Engineering, ed. J.H. Dshalalow (CRC Press, Boca Raton, FL, 1997) pp. 321–338.
V. Kulkarni and T. Rolski, Fluid model driven by an Ornstein-Uhlenbeck process, Probab. Engrg. Inform. Sci. 8 (1994) 403–417.
T. Lindvall, Weak convergence of probability measures and random functions in the function space D[0, ∞), J. Appl. Probab. 10 (1973) 109–121.
M. Mandjes and S. Borst, Overflow behavior in queues with many long-tailed inputs, Adv. in Appl. Probab. 32 (2000) 1150–1167.
T. Mikosch, S. Resnick, H. Rootzén and A. Stegeman, Is network traffic approximated by stable Lévy motion or fractional Brownian motion, Ann. Appl. Probab. 12 (2002) 23–68.
I. Norros, A storage model with self-similar input, Queueing Systems 16 (1994) 387–396.
V.I. Piterbarg, Asymptotic Methods in the Theory of Gaussian Processes and Fields, Translations of Mathematical Monographs, Vol. 148 (Amer. Mah. Soc., Providence, RI, 1996).
W. Szczotka, Central limit theorem in D[0, ∞) for breakdown processes, Probab. Math. Statist. 1 (1980) 49–57.
M.S. Taqqu, W. Willinger and R. Sherman, Proof of a fundamental result in self-similar traffic modeling, Comput. Commun. Rev. 27 (1997) 5–23.
W. Whitt, Stochastic-Process Limits (Springer, New York, 2002).
B. Zwart, S. Borst and M. Mandjes, Exact queueing asymptotics for multiple heavy-tailed on-off flows, in: Proc. of IEEE INFOCOM, 2001, pp. 279–288.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dębicki, K., Mandjes, M. Traffic with an fBm Limit: Convergence of the Stationary Workload Process. Queueing Systems 46, 113–127 (2004). https://doi.org/10.1023/B:QUES.0000021144.61749.aa
Issue Date:
DOI: https://doi.org/10.1023/B:QUES.0000021144.61749.aa