Skip to main content
Log in

A Nonstationary Offered-Load Model for Packet Networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Motivated by the desire to appropriately account for complex features of network traffic revealed in traffic measurements, such as heavy-tail probability distributions, long-range dependence, self similarity and nonstationarity, we propose a nonstationary offered-load model. Connections of multiple types arrive according to independent nonhomogeneous Poisson processes, and general bandwidth stochastic processes (not necessarily Markovian) describe the individual user bandwidth requirements at multiple links of a communication network during their connections. We obtain expressions for the moment generating function, mean and variance of the total required bandwidth of all customers on each link at any designated time. We justify Gaussian approximations by establishing a central limit theorem for the offered-load process. We also obtain a Gaussian approximation for the time-dependent buffer-content distribution in an infinite-capacity buffer with constant processing rate. The offered-load model can be used for predicting future bandwidth requirements; we then advocate exploiting information about the history of connections in progress.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Abate and W. Whitt, Numerical inversion of probability generating functions, Operations Research Letters 12 (1992) 245-251.

    Google Scholar 

  2. J. Abate and W. Whitt, Numerical inversion of Laplace transforms of probability distributions, ORSA Journal on Computing 7 (1995) 36-43.

    Google Scholar 

  3. R.G. Addie and M. Zukerman, An approximation for performance evaluation of stationary single server queues, IEEE Transactions on Communications 42 (1994) 3150-3160.

    Google Scholar 

  4. R.G. Addie, M. Zukerman and T. Neame, Fractal traffic-measurements, modeling and performance evaluation, in: Proc. of IEEE Infocom '95 (1995) pp. 977-984.

  5. H. Ahmadi, P.F. Chimento, R.A. Guerin, L. Gün, B. Lin, R.O. Onvural and T.E. Tedijanto, NBBS traffic management overview, IBM Systems Journal 34 (1995) 604-628.

    Google Scholar 

  6. J.P. Billingsley, Convergence of Probability Measures (Wiley, New York, 1968).

    Google Scholar 

  7. D.D. Botvich and N.G. Duffield, Large deviations, the shape of the loss curve, and economies of scale in large multiplexes, Queueing Systems 20 (1995) 293-320.

    Google Scholar 

  8. R. Cáceres, P.G. Danzig, S. Jamin and D.J. Mitzel, Characteristics of wide-area TCP/IP conversations, Computer Communications Review 21 (1991) 101-112.

    Google Scholar 

  9. C.S. Chang, Stability, queue length, and delay of deterministic and stochastic queueing networks, IEEE Transactions on Automatic Control 39 (1994) 913-931.

    Google Scholar 

  10. J. Choe and N.B. Shroff, A central limit theorem based approach for analyzing queue behavior in high-speed networks, in: Teletraffic Contributions for the Information Age, Proc. of ITC 15, eds. V. Ramaswami and P.E. Wirth (Elsevier, Amsterdam, 1997) pp. 1129-1138.

  11. K.L. Chung, A Course in Probability Theory, 2nd ed. (Academic Press, New York, 1974).

    Google Scholar 

  12. E. Çinlar, Superposition of point processes, in: Stochastic Point Processes: Statistical Analysis, Theory and Applications, ed. P.A.W. Lewis (Wiley, New York, 1972) pp. 549-606.

    Google Scholar 

  13. P.J. Davis and P. Rabinowitz, Methods of Numerical Integration, 2nd ed. (Academic Press, New York, 1984).

    Google Scholar 

  14. N.G. Duffield and N. O'Connell, Large deviations and overflow probabilities for the general singleserver queue, with applications, Mathematical Proceedings of the Cambridge Philosophical Society 118 (1995) 363-374.

    Google Scholar 

  15. N.G. Duffield and W. Whitt, Control and recovery from rare congestion events in a large multi-server system, Queueing Systems 26 (1997) 69-104.

    Google Scholar 

  16. N.G. Duffield and W. Whitt, A source traffic model and its transient analysis for network control, Stochastic Models 14 (1998) 51-78.

    Google Scholar 

  17. N.G. Duffield and W. Whitt, Network design and control using on—off and multi-level source traffic models with heavy-tailed distributions, in: Self-Similar Network Traffic and Performance Evaluation, eds. K. Park and W. Willinger (Wiley, New York, 2000) chapter 17, pp. 421-445.

    Google Scholar 

  18. S.G. Eick, W.A. Massey and W. Whitt, The physics of the M t/G/∞ queue, Operations Research 41 (1993) 731-742.

    Google Scholar 

  19. A. Feldmann, A.C. Gilbert, W. Willinger and T.G. Kurtz, The changing nature of network traffic: scaling phenomena, Computer Communications Review 28 (1998) 5-29.

    Google Scholar 

  20. C.M. Fortuin, P.W. Kastelyn and J. Ginibre, Correlation inequalities on some partially ordered sets, Communications in Mathematical Physics 22 (1971) 89-103.

    Google Scholar 

  21. A.G. Greenberg, R. Srikant and W. Whitt, Resource sharing for book-ahead and instantaneous-request calls, in: Teletraffic Contributions for the Information Age, Proc. of ITC 15, eds. V. Ramaswami and P.E. Wirth (Elsevier, Amsterdam, 1997) pp. 539-548. Longer version to appear in IEEE/ACM Transaction Networking.

    Google Scholar 

  22. R. Guerin, H. Ahmadi and M. Naghshineh, Equivalent capacity and its application to bandwidth allocation in high-speed networks, IEEE Journal on Selected Areas in Communications 9 (1991) 968-991.

    Google Scholar 

  23. J. Keilson and L. Servi, Networks of non-homogeneous M/G/∞ systems, Journal of Applied Probabibility 31A (1994) 157-168.

    Google Scholar 

  24. F.P. Kelly, Notes on effective bandwidths, in: Stochastic Networks, Theory and Applications, eds. F.P. Kelly, S. Zachary and I. Ziedins (Clarendon Press, Oxford, 1996) pp. 141-168.

    Google Scholar 

  25. T.G. Kurtz, Limit theorems for workload input models, in: Stochastic Networks, Theory and Applications, eds. F.P. Kelly, S. Zachary and I. Ziedins (Clarendon Press, Oxford, 1996) pp. 119-139.

    Google Scholar 

  26. C. Klüppelberg and T. Mikosch, Explosive Poisson shot noise processes with application to risk reserves, Bernoulli 1 (1995) 125-147.

    Google Scholar 

  27. W.E. Leland, M.S. Taqqu, W. Willinger and D.V. Wilson, On the self-similar nature of Ethernet traffic, IEEE/ACM Transactions on Networking 2 (1994) 1-15.

    Google Scholar 

  28. K.K. Leung, W.A. Massey and W. Whitt, Traffic models for wireless communication networks, IEEE Journal on Selected Areas in Communications 12 (1994) 1353-1364.

    Google Scholar 

  29. A. Mandelbaum, W.A. Massey and M.I. Reiman, Strong approximations for markovian service networks, Queueing Systems 30 (1998) 149-201.

    Google Scholar 

  30. W.A. Massey and W. Whitt, Networks of infinite-server queues with nonstationary Poisson input, Queueing Systems 13 (1993) 183-250.

    Google Scholar 

  31. W.A. Massey and W. Whitt, A stochastic model to capture space and time dynamics in wireless communication systems, Probability in the Engineering and Informational Sciences 8 (1994) 541-569.

    Google Scholar 

  32. W.A. Massey and W. Whitt, Peak congestion in multi-server service systems with slowly varying arrival rates, Queueing Systems 25 (1997) 157-172.

    Google Scholar 

  33. W.A. Massey and W. Whitt, A probabilistic generalization of Taylor's theorem, Statistics and Probability Letters 16 (1993) 51-54.

    Google Scholar 

  34. I. Norros, A storage model with self-similar input, Queueing Systems 16 (1994) 387-396.

    Google Scholar 

  35. I. Norros, On the use of fractal Brownian motion in the theory of connectionless networks, IEEE Journal on Selected Areas in Communications 13 (1995) 953-962.

    Google Scholar 

  36. K.R. Parthasarathy, Probability Measures on Metric Spaces (Academic Press, New York, 1967).

    Google Scholar 

  37. P.F. Pawlita, Traffic measurements in data networks, recent measurement results, and some implications, IEEE Transactions on Communications 29 (1981) 525-535.

    Google Scholar 

  38. V. Paxson and S. Floyd, Wide-area traffic: the failure of Poisson modeling, IEEE/ACM Transactions on Networking 3 (1995) 226-244.

    Google Scholar 

  39. J. Rice, On generalized shot noise, Advances in Applied Probability 9 (1977) 553-565.

    Google Scholar 

  40. W. Whitt, Dynamic staffing in a telephone call center aiming to immediately answer all calls, Operations Research Letters 24 (1999) 205-212.

    Google Scholar 

  41. W. Willinger, M.S. Taqqu and A. Erramilli, A bibliographical guide to self-similar traffic and performance modeling for modern high-speed networks, in: Stochastic Networks, eds. F.P. Kelly, S. Zachary and I. Ziedins (Clarendon Press, Oxford, 1996) pp. 339-366.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Duffield, N., Massey, W. & Whitt, W. A Nonstationary Offered-Load Model for Packet Networks. Telecommunication Systems 16, 271–296 (2001). https://doi.org/10.1023/A:1016654625257

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016654625257

Navigation