Analysis of an M/Ek/1 queue with N-policy

Abstract

In this paper, an M/E_k/1 queueing model with N-policy is investigated under time-dependent state. Every arriving customer should undergo k exponential phases of service before leaving the system. As soon as the system becomes empty, the server stays idle and waits for the accumulation of N customers to begin the service. When the N^th customer enters into the queue, the server starts an exhaustive busy period. Using the method of generating function and Laplace transform, the transient system size probabilities are derived for the model under consideration. The analytical results are verified numerically.

Cite as

A. Azhagappan, & T. Deepa. (2021). Analysis of an M/Ek/1 queue with N-policy. Journal of Applied Mathematics and Statistical Analysis, 2(1), 1–5. http://doi.org/10.5281/zenodo.4817877