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

A.D. Banik

International Journal of Operational Research, 2010, vol. 7, issue 3, 314-333

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. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=32111 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:7:y:2010:i:3:p:314-333

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().