Analysis of a nonpreemptive priority queue with exponential timer and server vacations

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 syste...

Full description

Saved in:
Bibliographic Details
Published inPerformance evaluation Vol. 64; no. 6; pp. 495 - 506
Main Authors Katayama, Tsuyoshi, Kobayashi, Kaori
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.07.2007
Subjects
Bernoulli scheduling
Exponential timer
Iterative functional equations
Multi-class priority
Nonpreemptive service
Server vacation
Time-limited service
Multi-class priority
Bernoulli scheduling
Iterative functional equations
Nonpreemptive service
Server vacation
Exponential timer
Time-limited service
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0166-5316
1872-745X
DOI:10.1016/j.peva.2006.06.003