We consider the coupling of a single server queue and a storage model defined as a queue/store model. We establish that if the input variables, arrivals at the queue and store, satisfy large deviations principles and are linked through an exponential tilting, then the output variables (departures from each system) satisfy large deviations principles with the same rate function.
P. J. Burke, “The output of a queuing system,” Operations Research, vol. 4, pp. 699–704 (1957), 1956.
View at: Google Scholar | MathSciNetC.-S. Chang, “Stability, queue length, and delay of deterministic and stochastic queueing networks,” IEEE Transactions on Automatic Control, vol. 39, no. 5, pp. 913–931, 1994.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetC. Courcoubetis, G. Kesidis, A. Ridder, J. Walrand, and R. Weber, “Admission control and routing in ATM networks using inference from measured buffer occupancy,” IEEE Transations on Communications, vol. 43, no. 234, pp. 1778–1784, 1995.
View at: Publisher Site | Google ScholarA. Dembo and T. Zajic, “Large deviations: from empirical mean and measure to partial sums process,” Stochastic Processes and Their Applications, vol. 57, no. 2, pp. 191–224, 1995.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetA. Dembo and O. Zeitouni, Large Deviations Techniques and Applications, Jones and Bartlett, Massachusetts, 1993.
View at: Google Scholar | Zentralblatt MATH | MathSciNetM. Draief, J. Mairesse, and N. O'Connell, “Joint Burke's theorem and RSK representation for a queue and a store,” in Discrete Random Walks (DRW '03), C. Banderier and C. Krattenthaler, Eds., vol. AC, pp. 69–82, Institut Henri Poincaré, Paris, 2003.
View at: Google ScholarM. Draief, J. Mairesse, and N. O'Connell, “Queues, stores, and tableaux,” Journal of Applied Probability, vol. 42, no. 4, pp. 1145–1167, 2005.
View at: Publisher Site | Google Scholar | MathSciNetN. G. Duffield and N. O'Connell, “Large deviations and overflow probabilities for the general single-server queue, with applications,” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 118, no. 2, pp. 363–374, 1995.
View at: Google Scholar | Zentralblatt MATH | MathSciNetA. Ganesh and N. O'Connell, “A large deviation principle with queueing applications,” Stochastics and Stochastics Reports, vol. 73, no. 1-2, pp. 25–35, 2002.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetA. Ganesh, N. O'Connell, and B. Prabhakar, “Invariant rate functions for discrete-time queues,” Annals of Applied Probability, vol. 13, no. 2, pp. 446–474, 2003.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetA. Ganesh, N. O'Connell, and D. Wischik, Big Queues, vol. 1838 of Lecture Notes in Mathematics, Springer, Berlin, 2004.
View at: Google Scholar | Zentralblatt MATH | MathSciNetP. W. Glynn and W. Whitt, “Logarithmic asymptotics for steady-state tail probabilities in a single-server queue,” Journal of Applied Probability, vol. 31A, pp. 131–156, 1994.
View at: Google Scholar | MathSciNetF. Kelly, “Effective bandwidths at multi-class queues,” Queueing Systems. Theory and Applications, vol. 9, no. 1-2, pp. 5–15, 1991.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetF. Kelly, “Notes on effective bandwidth,” in Stochastic Networks, F. Kelly and I. Ziedens, Eds., pp. 141–168, Oxford University Press, Oxford, 1996.
View at: Google ScholarR. M. Loynes, “The stability of a queue with non-independent interarrival and service times,” Proceedings of the Cambridge Philosophical Society, vol. 58, pp. 497–520, 1962.
View at: Google Scholar | Zentralblatt MATH | MathSciNetB. Prabhakar and R. Gallager, “Entropy and the timing capacity of discrete queues,” IEEE Transactions on Information Theory, vol. 49, no. 2, pp. 357–370, 2003.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet