The queue GeoX/G/1/N+1 revisited

Abstract

We present analytic expressions (in terms of roots of the underlying characteristic equation) for the steady-state distributions of the number of customers for the finite-state queueing model $Ge{o}^X/G/1/N+1$ with partial-batch rejection policy. We obtain the system-length distributions at a service-completion epoch by applying the imbedded Markov chain technique. Using the roots of the related characteristic equation, the method leads to giving a unified approach for solving both finite- and infinite-buffer systems. We find relationships between system-length distributions at departure, random, and arrival epochs using discrete renewal theory and conditioning on the system states. Based on these relationships, we obtain various performance measures and provide numerical results for the same. We also perform computational analysis and compare our results with respect to the solution obtained by solving a linear system of equations in terms of running times.

Keywords:

• Discrete-time
• batch arrival
• finite buffer
• partial-batch rejection policy
• roots

Acknowledgments

We thank the anonymous referees for their useful suggestions.

Additional information

Funding

This research was supported (in part) by the Department of National Defense Applied Research Program (grant no. GRC0000B1638).