Copyright © 2006 Elsevier Ltd All rights reserved.
Analysis of a nonpreemptive priority queue with exponential timer and server vacations
Received 4 February 2005;
Abstract
We consider multi-class priority queues with nonpreemptive services controlled by an exponential timer and multiple vacations. By reducing this model to the priority model with Bernoulli schedule analyzed by Katayama (1997), we obtain the Laplace–Stieltjes transform for the sojourn time in the system for each priority class, assuming (i) constant service times or (ii) general service times with either 1-limited or exhaustive service, and provide recursive equations to evaluate its first two moments.
Keywords: Multi-class priority; Time-limited service; Exponential timer; Nonpreemptive service; Bernoulli scheduling; Server vacation; Iterative functional equations






E-mail Article
Add to my Quick Links

Cited By in Scopus (2)







