On the exact asymptotics for the stationary sojourn time distribution in a tandem of queues with light-tailed service times (Q941885): Difference between revisions

This paper deals with a two-node open queueing network with first-come-first-served service discipline at each queue. The inter-arrival times between successive customers, the service times in the first queue, and the service times in the second queue constitute three independent sequences of i.i.d random variables. It is assumed that the network is stable. For this model, the author studies the asymptotics of the probability \(\mathbf{P}(Z > x ) \) as \(x\) tends to infinity, where \(Z\) denotes the stationary soujourn time of a typical customer in the network (i.e., the time between the customer's arrival at the first queue and its departure from the second queue ). It is shown that in a certain ``intermediate'' region of light-tailed service distributions, \(Z\) may take a large value mostly due to a large value of a single service time of one of the customers. Arguments used in this article enable to obtain an elementary proof of the logarithemic asymptotics for the tail distribution of the stationary soujourn time in the whole class of light-tailed distributions.