Transient results for M/M/1/c queues via path counting

We find combinatorially the probability of having n customers in an M/M/1/c queueing system at an arbitrary time t when the arrival rate λ and the service rate µ are equal, including the case c = ∞. Our method uses path-counting methods and finds a bijection between the paths of the type needed for the queueing model and paths of another type which are easy to count. The bijection involves some interesting geometric methods.

[1]  Carl M. Harris,et al.  Fundamentals of queueing theory , 1975 .

[2]  Janet E. Williams,et al.  The transient solution to M/Ek/1 queue , 2006, Oper. Res. Lett..

[3]  D. Guichard.  Sums of Selected Binomial Coefficients , 1995 .

[4]  Ahmed M. K. Tarabia,et al.  Exact Transient Solutions of Nonempty Markovian Queues , 2006, Comput. Math. Appl..

[5]  B. Krishna Kumar,et al.  Transient Analysis of an M/M/1 Queue Subject to Catastrophes and Server Failures , 2005 .

[6]  D. G. Champernowne,et al.  An Elementary Method of Solution of the Queueing Problem with a Single Server and Constant Parameters , 1956 .

[7]  Joti Jain,et al.  A Course on Queueing Models , 2006 .

[8]  Walter Böhm,et al.  The combinatorics of birth-death processes and applications to queues , 1997, Queueing Syst. Theory Appl..

[9]  Alan C. Krinik,et al.  Transient probability functions of finite birth–death processes with catastrophes , 2007 .

[10]  Simon Jones,et al.  Transient Probabilities for Queues with Applications to Hospital Waiting List Management , 2005, Health care management science.

[11]  C. Blondia,et al.  Approximated Transient Queue Length and Waiting Time Distributions via Steady State Analysis , 2005 .

[12]  Rakesh Kumar,et al.  Transient Solution of a Catastrophic-Cum-Restorative Queueing Problem with Correlated Arrivals and Variable Service Capacity , 2007 .

[13]  Barbara Haas Margolius,et al.  Transient and periodic solution to the time-inhomogeneous quasi-birth death process , 2007, Queueing Syst. Theory Appl..

[14]  Carl M. Harris,et al.  Fundamentals of queueing theory (2nd ed.). , 1985 .

[15]  H. D. Miller.  Combinatorial methods in the theory of stochastic processes , 1968, Comput. J..