M / G /1/ N Queue with Vacation Time and Exhaustive Service Discipline

Tony T. Lee
Additional contact information
Tony T. Lee: AT&T Bell Laboratories, Holmdel, New Jersey

Operations Research, 1984, vol. 32, issue 4, 774-784

Abstract: This paper studies an M / G /1 queueing system with a finite waiting room and with server vacation times consisting of periods of time that the server is away from the queue doing additional work. This model has been used in conjunction with a related model to analyze the performance of a processor with a cyclic scheduling algorithm and where, due to finite queueing capacities, losses are a primary concern. Service at the queue is exhaustive, in that a busy period at the queue ends only when the queue is empty. At each termination of a busy period, the server takes an independent vacation. The queue length process is studied using the embedded Markov chain. Using a combination of the supplementary variable and sample biasing techniques, we derive the general queue length distribution of the time continuous process, as well as the blocking probability of the system, due to the finite waiting room in the queue. We also obtain the busy period and waiting time distributions.

Keywords: 681 M/G/1/N queue with vacation time; 688 M/G/1/N with vacation time (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.4.774 (application/pdf)

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:inm:oropre:v:32:y:1984:i:4:p:774-784

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().