Analysis of single working vacation in GI/M/1/N and GI/M/1/∞ queueing systems
by A.D. Banik
International Journal of Operational Research (IJOR), Vol. 7, No. 3, 2010

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.

Online publication date: Wed, 10-Mar-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com