Analysis of an $$M/M/1+G$$ queue operated under the FCFS policy with exact admission control.

In this article, we present an exact theoretical analysis of an $$M/M/1$$ system, with arbitrary distribution of relative deadline for the end of service, operated under the first come first served scheduling policy with exact admission control. We provide an explicit solution to the functional equation that must be satisfied by the workload distribution, when the system reaches steady state. We use this solution to derive explicit expressions for the loss ratio and the sojourn time distribution. Finally, we compare this loss ratio with that of a similar system operating without admission control, in the cases of some common distributions of the relative deadline. [ABSTRACT FROM AUTHOR]