Khintchine–Pollaczek formula for random walks whose steps have one geometric tail

Abstract

We derive a Khinchine–Pollaczek formula for random walks whose steps have a geometric left tail. The construction rests on the memory-less property of the geometric distribution. An example from a tandem queue modeling dynamic isnstability for microtubules is given.