English

Asymptotics for the Late Arrivals Problem

Probability 2017-01-02 v6

Abstract

We study a discrete time queueing system where deterministic arrivals have i.i.d. exponential delays ξi\xi_{i}. The standard deviation σ\sigma of the delay is finite, but its value is much larger than the deterministic unit service time. We describe the model as a bivariate Markov chain, we prove that it is ergodic and then we focus on the unique joint equilibrium distribution. We write a functional equation for the bivariate generating function, finding the solution of such equation on a subset of its set of definition. This solution allows us to prove that the equilibrium distribution of the Markov chain decays super-exponentially fast in the quarter plane. Finally, exploiting the latter result, we discuss the numerical computation of the stationary distribution, showing the effectiveness of a simple approximation scheme in a wide region of the parameters. The model, motivated by air and railway traffic, was proposed many decades ago by Kendall with the name of "late arrivals problem", but no solution has been found so far.

Keywords

Cite

@article{arxiv.1302.1999,
  title  = {Asymptotics for the Late Arrivals Problem},
  author = {Carlo Lancia and Gianluca Guadagni and Sokol Ndreca and Benedetto Scoppola},
  journal= {arXiv preprint arXiv:1302.1999},
  year   = {2017}
}
R2 v1 2026-06-21T23:23:08.084Z