The Annals of Applied Probability

Sample-path large deviations for tandem and priority queues with Gaussian inputs

Michel Mandjes and Miranda van Uitert

Full-text: Open access

Abstract

This paper considers Gaussian flows multiplexed in a queueing network. A single node being a useful but often incomplete setting, we examine more advanced models. We focus on a (two-node) tandem queue, fed by a large number of Gaussian inputs. With service rates and buffer sizes at both nodes scaled appropriately, Schilder’s sample-path large-deviations theorem can be applied to calculate the asymptotics of the overflow probability of the second queue. More specifically, we derive a lower bound on the exponential decay rate of this overflow probability and present an explicit condition for the lower bound to match the exact decay rate. Examples show that this condition holds for a broad range of frequently used Gaussian inputs. The last part of the paper concentrates on a model for a single node, equipped with a priority scheduling policy. We show that the analysis of the tandem queue directly carries over to this priority queueing system.

Article information

Source
Ann. Appl. Probab., Volume 15, Number 2 (2005), 1193-1226.

Dates
First available in Project Euclid: 3 May 2005

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1115137973

Digital Object Identifier
doi:10.1214/105051605000000133

Mathematical Reviews number (MathSciNet)
MR2134102

Zentralblatt MATH identifier
1069.60079

Subjects
Primary: 60K25: Queueing theory [See also 68M20, 90B22]
Secondary: 60F10: Large deviations 60G15: Gaussian processes

Keywords
Sample-path large deviations Gaussian traffic Schilder’s theorem tandem queue priority queue communication networks differentiated services

Citation

Mandjes, Michel; van Uitert, Miranda. Sample-path large deviations for tandem and priority queues with Gaussian inputs. Ann. Appl. Probab. 15 (2005), no. 2, 1193--1226. doi:10.1214/105051605000000133. https://projecteuclid.org/euclid.aoap/1115137973


Export citation

References

  • Addie, R., Mannersalo, P. and Norros, I. (2002). Most probable paths and performance formulae for buffers with Gaussian input traffic. European Transactions on Telecommunications 13 183–196.
  • Addie, R., Neame, T. and Zukerman, M. (2002). Performance evaluation of a queue fed by a Poisson Pareto burst process. Computer Networks 40 377–397.
  • Adler, R. (1990). An Introduction to Continuity, Extrema, and Related Topics for General Gaussian Processes. IMS, Hayward, CA.
  • Avi-Itzhak, B. (1965). A sequence of service stations with arbitrary input and regular service times. Management Science 11 565–571.
  • Bahadur, R. and Zabell, S. (1979). Large deviations of the sample mean in general vector spaces. Ann. Probab. 7 587–621.
  • Berger, A. and Whitt, W. (1998). Effective bandwidths with priorities. IEEE/ACM Transactions on Networking 6 447–460.
  • Botvich, D. and Duffield, N. (1995). Large deviations, the shape of the loss curve, and economies of scale in large multiplexers. Queueing Systems 20 293–320.
  • Courcoubetis, C. and Weber, R. (1996). Buffer overflow asymptotics for a buffer handling many traffic sources. J. Appl. Probab. 33 886–903.
  • Dębicki, K. and Mandjes, M. (2003). Exact overflow asymptotics for queues with many Gaussian inputs. J. Appl. Probab. 40 704–720.
  • Dembo, A. and Zeitouni, O. (1998). Large Deviations Techniques and Applications, 2nd ed. Springer, New York.
  • Deuschel, J.-D. and Stroock, D. (1989). Large Deviations. Academic Press, London.
  • Duffield, N. (1998). Queueing at large resources driven by long-tailed $M/G/\infty$-modulated processes. Queueing Systems 28 245–266.
  • Elwalid, A. and Mitra, D. (1995). Analysis, approximations and admission control of a multi-service multiplexing system with priorities. In Proceedings of the IEEE Infocom 463–472.
  • Friedman, H. (1965). Reduction methods for tandem queueing systems. Oper. Res. 13 121–131.
  • Hüsler, J. and Piterbarg, V. (1999). Extremes of a certain class of Gaussian processes. Stochastic Process. Appl. 83 257–271.
  • Kella, O. and Whitt, W. (1992). A tandem fluid network with Lévy input. In Queues and Related Models (I. Basawa and U. Bhat, eds.) 112–128. Oxford Univ. Press, London.
  • Kilkki, K. (1999). Differentiated Services for the Internet. Macmillan Technical Publishing, Indianapolis.
  • Kilpi, J. and Norros, I. (2002). Testing the Gaussian approximation of aggregate traffic. In Proceedings of the Internet Measurement Workshop.
  • Leland, W., Taqqu, M., Willinger, W. and Wilson, D. (1994). On the self-similar nature of Ethernet traffic. IEEE/ACM Transactions on Networking 2 1–15.
  • Mandjes, M. (2004). A note on the benefits of buffering. Stochastic Models 20 43–54.
  • Mandjes, M. and Kim, J. H. (2001). An analysis of the phase transition phenomenon in packet networks. Adv. in Appl. Probab. 33 260–280.
  • Mandjes, M., Saniee, I. and Stolyar, A. (2000). Load characterization, overload prediction, and load anomaly detection for voice over IP traffic. In Proceedings of the 38th Allerton Conference 567–576.
  • Mannersalo, P. and Norros, I. (2001). Approximate formulae for Gaussian priority queues. In Proceedings of the ITC 17 991–1002.
  • Mannersalo, P. and Norros, I. (2002). GPS schedulers and Gaussian traffic. In Proceedings of the IEEE Infocom 1660–1667.
  • Mannersalo, P. and Norros, I. (2002). A most probable path approach to queueing systems with general Gaussian input. Computer Networks 40 399–412.
  • Norros, I. (1994). A storage model with self-similar input. Queueing Systems 16 387–396.
  • Norros, I. (1999). Busy periods of fractional Brownian storage: A large deviations approach. Advances in Performance Analysis 2 1–20.
  • Parekh, A. and Gallager, R. (1993). A generalized processor sharing approach to flow control in integrated services networks: The single node case. IEEE/ACM Transactions on Networking 1 344–357.
  • Parekh, A. and Gallager, R. (1994). A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. IEEE/ACM Transactions on Networking 2 137–150.
  • Parulekar, M. and Makowski, A. (1997). $M/G/\infty$ input processes: A versatile class of models for network traffic. In Proceedings of the IEEE Infocom 419–426.
  • Reich, E. (1958). On the integro-differential equation of Takács. I. Ann. Math. Statist. 29 563–570.
  • Weiss, A. (1986). A new technique for analyzing large traffic systems. Adv. in Appl. Probab. 18 506–532.
  • Wischik, D. (2001). Sample path large deviations for queues with many inputs. Ann. Appl. Probab. 11 379–404.