Abstract
We present a vacation model which can be used as a component of the type of polling system encountered in a fair share scheduler. Consider two queues in tandem attended by one server. The primary queue Q p, which has an infinite buffer, has a preemptive priority over the secondary queue Q s which has a finite buffer. Jobs which complete service at the primary queue will go into the secondary queue for another service with a probability p. The server visits Q s for a maximum of T units of time. After visiting for T units of time or after Q s becomes empty, whichever occurs first, the server goes on a vacation. The duration of this vacation has a phase type distribution. The vacation can also be interrupted in order to attend to the jobs in Q p. The resulting Markov chain describing this system is of the QBD type. We show that the resulting R matrix associated with this Markov chain has a very special structure which reduces to the solution of a smaller dimension matrix. We then show how to obtain the key performance measures for this system. Of interest is the approach used for obtaining the waiting time distribution. Some numerical examples are also presented.
Similar content being viewed by others
References
A.S. Alfa, A discrete MAP/PH/1 queue with vacations and ehaustive time-limited service, Operations Research Letters 18 (1995) 31–40.
A.S. Alfa, Matrix–geometric solution of discrete time MAP/PH/1 priority queue, Naval Research Logistics 45 (1998) 23–50.
I. Frigui and A.S. Alfa, Analysis of a time limited polling system, Computer Communications 21 (1998) 558–571.
I. Frigui and A.S. Alfa, Analysis of a discrete time table polling system with MAP and time-limited service discipline, Telecomunications Systems 12 (1999) 51–77.
G.J. Henry, The fair share scheduler, AT&T Bell Laboratories Technical Journal 63 (1984) 1845–1857.
D.S. Lee and B. Sengupta, An approximation analysis of cyclic server queue with limited service and reservation with application to satellite communications, Queueing Systems 11 (1992) 153–178.
M.F. Neuts, Matrix–Geometric Solutions in Stochastic Models – An Algorithm Approach, 1st ed. (Johns Hopkins Univ. Press, Baltimore, MD, 1981).
H. Takagi, Analysis of Polling Systems (MIT Press, Cambridge, MA 1986).
H. Takagi, Queueing analysis of polling models: An update, in: Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (North-Holland, Amsterdam, 1990).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Alfa, A.S., Shi, YF. A discrete time-limited vacation model for the fair share scheduler. Telecommunication Systems 13, 167–197 (2000). https://doi.org/10.1023/A:1019140005852
Issue Date:
DOI: https://doi.org/10.1023/A:1019140005852