Transient properties of many-server queues and related QBDs
The time tau(n) of first passage from queue length x to queue lengthn > x in a many-server queue with both the arrival process and service intensities governed by a finite Markov process is considered. The mean and the Laplace transform are computed as solutions of systems of linear equations coming out by optional stopping of a martingale obtained as a stochastic integral of the exponential Wald
