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

Authors

1 KIIT University India Professor & Dean , School of Computer Application,KIIT University, Bhubaneswar

2 Andhra University India Assistant Professor, Department of Applied Mathematics, Andhra University, Visakhapatnam

Abstract

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discrete
Markovian service process. The server terminates service whenever the system becomes empty, and recommences
service as soon as the number of waiting customers in the queue is N. We obtain the system-length distributions
at pre-arrival and arbitrary epochs using the supplementary variable and the imbedded Markov chain techniques.
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
telecommunication systems.
 

Keywords