Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
Performance analysis of integrated services on a single server system
Performance Evaluation
Performance of discrete-time queueing systems
Computers and Operations Research
Analysis of a discrete-time GI-G-1 queueing model subjected to bursty interruptions
Computers and Operations Research
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
A note on the discretization of Little's result
Operations Research Letters
A Mathematical Model for Performability of Beowulf Clusters
ANSS '06 Proceedings of the 39th annual Symposium on Simulation
Computers and Operations Research
Mixed Finite-/Infinite-Capacity Priority Queue with Interclass Correlation
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
The discrete-time queueing system with inversive service order and probabilistic priority
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
A new efficient solution for QoS support in all optical metropolitan area networks
Computer Communications
Queueing Systems: Theory and Applications
Optical MAN ring performance with traffic aggregations
Computer Communications
The preemptive repeat hybrid server interruption model
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Performance analysis of priority queueing systems in discrete time
Network performance engineering
| Hi-index | 0.00 |
In this contribution, we investigate a discrete-time single-server queue subjected to server interruptions. Server interruptions are modeled as an on/off process with geometrically distributed on-periods and generally distributed off-periods. As message lengths can exceed one time-slot, different operation modes are considered, depending on whether service of an interrupted message continues, partially restarts or completely restarts after an interruption. For all alternatives, we establish expressions for the steady-state probability generating functions (pgf) of the buffer contents at message departure times and random slot boundaries, of the unfinished work at random slot boundaries, the message delay, and the lengths of the idle and busy periods. From these results, closed-form expressions for various performance measures, such as mean and variance of the buffer occupancy and message delay, can be established. As an application, we show that this model is able to assess performance of a multi-class priority scheduling system. We then illustrate our approach with some numerical examples.