The critical greedy server on the integers is recurrent.

Abstract

Each site of Z hosts a queue with arrival rate λ. A single server, starting at the origin, serves its current queue at rate μ until that queue is empty, and then moves to the longest neighbouring queue. In the critical case λ=μ, 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.