Analysis of single working vacation in GI/M/1/N and GI/M/1/∞ queueing systems

Analysis of single working vacation in GI/M/1/N and GI/M/1/∞ queueing systems

0.00 Avg rating0 Votes
Article ID: iaor20102658
Volume: 7
Issue: 3
Start Page Number: 314
End Page Number: 333
Publication Date: Mar 2010
Journal: International Journal of Operational Research
Authors:
Keywords: GI/M/1 queues
Abstract:

We consider a finite-buffer GI/M/1 queue with exhaustive service discipline and single working vacation. Service time in a vacation, in a service period and vacation time all are exponentially distributed random variables independent of each other. Queue length distributions at pre-arrival and arbitrary epoch with some important performance measures such as, probability of blocking, mean waiting time in the system, etc. have been obtained using the method of embedded Markov chain and supplementary variable. The corresponding infinite-buffer GI/M/1 queue with exhaustive service discipline and single working vacation has also been analysed. For this model, we also obtain pre-arrival and arbitrary epoch probability along with some important performance measures. These queueing models have potential application in the area of computer and communication network where a single channel is allotted for more than one type of job.

Reviews

Required fields are marked *. Your email address will not be published.