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

Authors: A.D. Banik

Addresses: School of Technology and Computer Science, Tata Institute of Fundamental Research, Homi Bhaba Road, Colaba, Mumbai 400005, India

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.

Keywords: finite buffers; GI/M/1 queue; infinite buffers; single working vacation; queueing models; computer networks; communication networks.

DOI: 10.1504/IJOR.2010.032111

International Journal of Operational Research, 2010 Vol.7 No.3, pp.314 - 333

Published online: 10 Mar 2010 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article