DISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
الموضوعات : فصلنامه ریاضی
Veena Goswami
1
(KIIT University
India
Professor & Dean ,
School of Computer Application,KIIT University, Bhubaneswar)
P. Vijaya Laxmi
2
(Andhra University
India
Assistant Professor, Department of Applied Mathematics, Andhra University, Visakhapatnam)
الکلمات المفتاحية: Discrete Markovian service process, N threshold policy, Finite buffer, Queue, Supplementary variable,
ملخص المقالة :
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat 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 andtelecommunication systems.
