Logarithmic asymptotics for unserved messages at a FIFO

Abstract

We consider an infinite{buffered single server First In, First Out (FIFO) queue. Messages arrives at stochastic intervals and take random amounts of time to process. Logarithmic asymptotics are proved for the tail of the distribution of the number of messages awaiting service, under general large deviation and stability assumptions, and formulae presented for the asymptotic decay rate

    Similar works