Performance Analysis of Discrete-Time Erlang Loss System

We study a discrete-time Geom/Geom/c/c Erlang loss system. In this queueing system, we give the function equation that the generating function of the number of customers satisfies in steady-state system, and get the formula of stationary mean queue length. Furthermore, we derive recursive method to compute stationary queue length probability and loss probability. Finally, using a numerical example, we exemplify the relation between loss probability, the mean number of customers and various parameters