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

Authors:
Tsuyoshi Katayama;Kaori Kobayashi
Affiliations:
Department of Electronics and Informatics, Toyama Prefectural University, Kosugi, Toyama 939-0398, Japan;Department of Electronics and Informatics, Toyama Prefectural University, Kosugi, Toyama 939-0398, Japan
Venue:
Performance Evaluation
Year:
2007

Citing 9
Cited 2

Workloads and waiting times in single-server systems with multiple customer classes

Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
A single-server queue with vacations and non-gated time-limited service

Performance Evaluation
Two vacation models for token-ring networks where service is controlled by timers

Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
Queueing analysis of polling models: progress in 1990-1994

Frontiers in queueing
An Arrival Time Approach to M/G/1-type Queues with Generalized Vacations

Queueing Systems: Theory and Applications
A Communication Multiplexer Problem: Two Alternating Queues with Dependent Randomly-Timed Gated Regime

Queueing Systems: Theory and Applications
Two-class priority queueing system with time-limited schedule

PMCCN '97 Proceedings of the IFIP TC6 / WG6.3 & WG7.3 International Conference on the Performance and Management of Complex Communication Networks
Two Queues with Alternating Service Periods

Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Level-crossing approach to a time-limited service system with two types of vacations

Operations Research Letters

Time-dependent performance analysis of a discrete-time priority queue

Performance Evaluation
Short-term performance management by priority-based queueing

Service Oriented Computing and Applications

Quantified Score

Hi-index	0.00

Visualization

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.