A single server queue with service interruptions
Queueing Systems: Theory and Applications
Analysis of a single server queue with semi-Markovian service interruption
Queueing Systems: Theory and Applications
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
| Hi-index | 0.00 |
As modeling for the behavior of each satellite node in a hub network with central node, we consider an M/G/1 queue with preemption of urgent jobs, in which the inter-arrival time of urgent jobs or the arrival rate are easily controllable by setting the most suitable parameters in the central node. Messages (i.e. ordinary jobs) are served in the queueing system, however, the service of messages are interrupted by urgent job arrivals. Basic performance measures such as waiting time and system delay (sojourn time) of messages are derived as the well-known decomposition expression for the Laplace-Stieltjes transform (LST) under the preemptive-resume service-restarting rule for interrupted messages. An optimal inter-arrival time of urgent jobs and the relationship between the data size of urgent jobs and the inter-arrival time are also investigated through numerical examples. The moment formulas of the performance measures are usable and effective for dimensioning of the similar hub networks.