DISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY

Abstract

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discrete<br />Markovian service process. The server terminates service whenever the system becomes empty, and recommences<br />service as soon as the number of waiting customers in the queue is N. We obtain the system-length distributions<br />at pre-arrival and arbitrary epochs using the supplementary variable and the imbedded Markov chain techniques.<br />Various performance measures such as the loss probability, mean queue length and mean waiting time in the queue along with some numerical results have been presented. The proposed model has potential applications in the areas of computer and<br />telecommunication systems.