Abstract
We study queues in tandem with customer deadlines and retrials. We first consider a 2-queue Markovian system with blocking at the second queue, analyze it, and derive its stability condition. We then study a non-Markovian setting and derive the stability condition for an approximating diffusion, showing its similarity to the former condition. In the Markovian setting, we use probability generating functions and matrix analytic techniques. In the diffusion setting, we consider expectations of the first hitting times of compact sets.
Similar content being viewed by others
References
Altman, E., Yechiali, U.: Analysis of customers impatience in queues with server vacations. Queueing Syst. 52(4), 261–279 (2006)
Altman, E., Yechiali, U.: Infinite-server queues with system’s additional tasks and impatient customers. Probab. Eng. Inf. Sci. 22(4), 477–493 (2008)
Artalejo, J.: Accessible bibliography on retrial queues. Math. Comput. Model. 30(3–4), 223–233 (1999)
Asmussen, S.: Applied Probability and Queues, vol. 51. Springer, Berlin (2003)
Atar, R., Budhiraja, A., Dupuis, P.: On positive recurrence of constrained diffusion processes. Ann. Probab. 979–1000 (2001)
Avrachenkov, K., Yechiali, U.: Retrial networks with finite buffers and their application to Internet data traffic. Probab. Eng. Inf. Sci. 22(4), 519–536 (2008)
Avrachenkov, K., Yechiali, U.: On tandem blocking queues with a common retrial queue. Comput. Oper. Res. 37(7), 1174–1180 (2010)
Billingsley, P.: Convergence of Probability Measures, 2nd edn. Wiley, New York (1999)
Brandon, J., Yechiali, U.: A tandem Jackson network with feedback to the first node. Queueing Syst. 9(4), 337–352 (1991)
Dai, J.: On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Ann. Appl. Probab. 49–77 (1995)
Falin, G., Templeton, J.: Retrial Queues, vol. 75. Chapman & Hall/CRC Press, London/Boca Raton (1997)
Garnett, O., Mandelbaum, A., Reiman, M.I.: Designing a call center with impatient customers. Manuf. Serv. Oper. Manag. 4, 208–227 (2002)
Jackson, J.: Networks of waiting lines. Oper. Res. 5(4), 518–521 (1957)
Jackson, J.: Jobshop-like queueing systems. Manag. Sci. 1796–1802 (2004)
Karatzas, I., Shreve, S.: Brownian Motion and Stochastic Calculus. Springer, Berlin (1991)
Karatzas, I., Shreve, S.E.: Brownian Motion and Stochastic Calculus. Springer, New York (1991)
Lieb, E., Loss, M.: Analysis. Graduate Studies in Mathematics, vol. 14. American Mathematical Society, Providence, 4 (2001)
Litvak, N., Yechiali, U.: Routing in queues with delayed information. Queueing Syst. 43(1), 147–165 (2003)
Mandelbaum, A., Momcilovic, P.: Queues with many servers and impatient customers. EECS Department, University of Michigan (2009)
Mandelbaum, A., Zeltyn, S.: Staffing many-server queues with impatient customers: constraint satisfaction in call centers. Oper. Res. 57(5), 1189–1205 (2009)
Meyn, S., Tweedie, R.: State-dependent criteria for convergence of Markov chains. Ann. Appl. Probab. 149–168 (1994)
Neuts, M.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Dover, New York (1981)
Perel, E., Yechiali, U.: Queues where customers of one queue act as servers of the other queue. Queueing Syst. 60(3), 271–288 (2008)
Pitman, J., Yor, M.: Bessel processes and infinitely divisible laws. Stoch. Integr. 285–370 (1981)
Reed, J.E., Ward, A.R.: A diffusion approximation for a generalized Jackson network with reneging. In: Proceedings of the 42nd Allerton Conference on Communication, Control, and Computing (2004)
Reed, J., Ward, A., Zhan, D.: On the generalized Skorokhod problem (submitted for publication)
Ward, A., Glynn, P.: Properties of the reflected Ornstein–Uhlenbeck process. Queueing Syst. 44(2), 109–123 (2003)
Whitt, W.: Stochastic-Process Limits. Springer, New York (2002)
Whitt, W.: Heavy-traffic limits for the G/H2/n/m/ queue. Math. Oper. Res. 30, 1–27 (2005)
Yechiali, U.: Sequencing an n-stage process with feedback. Probab. Eng. Inf. Sci. 2(02), 263–265 (1988)
Yechiali, U.: Queues with system disasters and impatient customers when system is down. Queueing Syst. 56(3), 195–202 (2007)
Acknowledgements
The authors would like to thank Jim Dai for bringing this problem to their attention. We thank Efrat Perel for providing the details of Theorem 5.1.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Reed, J., Yechiali, U. Queues in tandem with customer deadlines and retrials. Queueing Syst 73, 1–34 (2013). https://doi.org/10.1007/s11134-012-9290-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-012-9290-1