The probability of large queue lengths and waiting times in a heterogeneous multiserver queue I: Tight limits

We consider a multiserver queuing process specified by i.i.d. interarrival time, batch size and service time sequences. In the case that different servers have different service time distributions we say the system is heterogeneous. In this paper we establish conditions for the queuing process to be characterized as a geometrically Harris recurrent Markov chain, and we characterize the stationary probabilities of large queue lengths and waiting times. The queue length is asymptotically geometric and the waiting time is asymptotically exponential. Our analysis is a generalization of the well-known characterization of the GI/G/1 queue obtained using classical probabilistic techniques of exponential change of measure and renewal theory.

[1]  D. Iglehart.  Extreme Values in the GI/G/1 Queue , 1972 .

[2]  Esa Nummelin,et al.  Uniform limit theorems for non-singular renewal and Markov renewal processes , 1978, Journal of Applied Probability.

[3]  P. Ney,et al.  Limit Theorems for Semi-Markov Processes and Renewal Theory for Markov Chains , 1978 .

[4]  Yukio Takahashi.  Asymptotic exponentiality of the tail of the waiting-time distribution in a Ph/Ph/C queue , 1981, Advances in Applied Probability.

[5]  M. Neuts,et al.  Asymptotic behavior of the stationary distributions in the GI/PH/c queue with heterogeneous servers , 1981 .

[6]  E. Nummelin.  General irreducible Markov chains and non-negative operators: List of symbols and notation , 1984 .

[7]  E. Nummelin.  General irreducible Markov chains and non-negative operators: Preface , 1984 .

[8]  P. Ney,et al.  Some limit theorems for Markov additive processes , 1986 .

[9]  P. Ney,et al.  Monte Carlo simulation and large deviations theory for uniformly recurrent Markov chains , 1990, Journal of Applied Probability.

[10]  J. Sadowsky.  Large deviations theory and efficient simulation of excessive backlogs in a GI/GI/m queue , 1991 .

[11]  S. Meyn,et al.  Stability of Markovian processes I: criteria for discrete-time Chains , 1992, Advances in Applied Probability.

[12]  Micha Hofri,et al.  Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited , 1992, SIAM J. Comput..

[13]  Wojciech Szpankowski,et al.  Maximum Queue Length and Waiting Time Revisited: Multserver G/G/c Queue , 1992, Probability in the Engineering and Informational Sciences.

[14]  John S. Sadowsky,et al.  On the optimality and stability of exponential twisting in Monte Carlo estimation , 1993, IEEE Trans. Inf. Theory.

[15]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.