The Annals of Applied Probability

The critical greedy server on the integers is recurrent

James R. Cruise and Andrew R. Wade

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

Each site of $\mathbb{Z}$ hosts a queue with arrival rate $\lambda $. A single server, starting at the origin, serves its current queue at rate $\mu $ until that queue is empty, and then moves to the longest neighbouring queue. In the critical case $\lambda =\mu $, we show that the server returns to every site infinitely often. We also give a sharp iterated logarithm result for the server’s position. Important ingredients in the proofs are that the times between successive queues being emptied exhibit doubly exponential growth, and that the probability that the server changes its direction is asymptotically equal to $1/4$.

Article information

Source
Ann. Appl. Probab., Volume 29, Number 2 (2019), 1233-1261.

Dates
Received: December 2017
Revised: August 2018
First available in Project Euclid: 24 January 2019

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

Digital Object Identifier
doi:10.1214/18-AAP1434

Mathematical Reviews number (MathSciNet)
MR3910027

Zentralblatt MATH identifier
07047448

Subjects
Primary: 60J27: Continuous-time Markov processes on discrete state spaces
Secondary: 60K25: Queueing theory [See also 68M20, 90B22] 68M20: Performance evaluation; queueing; scheduling [See also 60K25, 90Bxx] 90B22: Queues and service [See also 60K25, 68M20]

Keywords
Greedy server queueing system recurrence iterated logarithm law

Citation

Cruise, James R.; Wade, Andrew R. The critical greedy server on the integers is recurrent. Ann. Appl. Probab. 29 (2019), no. 2, 1233--1261. doi:10.1214/18-AAP1434. https://projecteuclid.org/euclid.aoap/1548298940


Export citation

References

  • [1] Billingsley, P. (1999). Convergence of Probability Measures, 2nd ed. Wiley, New York.
  • [2] Bordenave, C., Foss, S. and Last, G. (2011). On the greedy walk problem. Queueing Syst. 68 333–338.
  • [3] Chen, A. Y. and Renshaw, E. (1992). The Gillis–Domb–Fisher correlated random walk. J. Appl. Probab. 29 792–813.
  • [4] Christoph, G. and Wolf, W. (1992). Convergence Theorems with a Stable Limit Law. Mathematical Research 70. Akademie-Verlag, Berlin.
  • [5] Coffman, E. G. Jr. and Gilbert, E. N. (1987). Polling and greedy servers on a line. Queueing Syst. 2 115–145.
  • [6] Durrett, R. (2010). Probability: Theory and Examples, 4th ed. Cambridge Series in Statistical and Probabilistic Mathematics 31. Cambridge Univ. Press, Cambridge.
  • [7] Ethier, S. N. and Kurtz, T. G. (1986). Markov Processes. Characterization and Convergence. Wiley, New York.
  • [8] Feller, W. (1971). An Introduction to Probability Theory and Its Applications. Vol. II. 2nd ed. Wiley, New York.
  • [9] Foss, S. and Last, G. (1996). Stability of polling systems with exhaustive service policies and state-dependent routing. Ann. Appl. Probab. 6 116–137.
  • [10] Foss, S., Rolla, L. T. and Sidoravicius, V. (2015). Greedy walk on the real line. Ann. Probab. 43 1399–1418.
  • [11] Ibragimov, I. A. and Linnik, Yu. V. (1971). Independent and Stationary Sequences of Random Variables. Wolters-Noordhoff, Groningen.
  • [12] Kallenberg, O. (2002). Foundations of Modern Probability, 2nd ed. Springer, New York.
  • [13] Kurkova, I. A. and Menshikov, M. V. (1997). Greedy algorithm, $\mathbf{Z}^{1}$ case. Markov Process. Related Fields 3 243–259.
  • [14] Nolan, J. P. (2018). Stable Distributions—Models for Heavy Tailed Data. Birkhäuser, Boston, MA.
  • [15] Paulauskas, V. I. (1974). Estimates of the remainder term in a limit theorem in the case of a stable limit law. Lith. Math. J. 14 127–146. DOI:10.1007/BF01414320. Cf. Litovsk. Mat. Sb. 14 (1974) 165–187, 231–232.
  • [16] Penrose, M. (2003). Random Geometric Graphs. Oxford Studies in Probability 5. Oxford Univ. Press, Oxford.
  • [17] Rojas-Nandayapa, L., Foss, S. and Kroese, D. P. (2011). Stability and performance of greedy server systems. A review and open problems. Queueing Syst. 68 221–227.
  • [18] Satybaldina, K. I. (1972). Absolute estimates of the rate of convergence to stable laws. Theory Probab. Appl. 17 726–728. DOI:10.1137/1117091. Cf. Teor. Verojatnost. i Primenen. 17 (1972) 773–775.
  • [19] Stout, W. F. (1970). A martingale analogue of Kolmogorov’s law of the iterated logarithm. Z. Wahrsch. Verw. Gebiete 15 279–290.
  • [20] Watson, G. N. (1944). A Treatise on the Theory of Bessel Functions, 2nd ed. Cambridge Univ. Press, New York.
  • [21] Whitt, W. (2002). Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues. Springer, New York.