A computer and communications network performance analysis primer
A computer and communications network performance analysis primer
Approximate analysis of priority queueing networks
Proc. of the international seminar on Teletraffic analysis and computer performance evaluation
A note on the effect of preemptive policies on the stability of a priority queue
Information Processing Letters
A new MVA-based approximation for closed queueing networks with a preemptive priority server
Performance Evaluation
Interdeparture-time distributions in the non-preemptive priority &Sgr;Mi/Gi/1 queue
Performance Evaluation
Large fluctuations in a deterministic multiclass network of queues
Management Science
The MVA priority approximation
ACM Transactions on Computer Systems (TOCS)
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
Expected Tardiness Computations in Multiclass Priority M/M/c Queues
INFORMS Journal on Computing
| Hi-index | 0.01 |
This paper reviews existing results for the stationary interdeparture time distribution in the M/G/1 nonpreemptive and preemptive resume queues, and introduces a unified approach which exploits for the first time the common structure for the interdeparture time process that is present in all classical preemptive priority service disciplines. This approach confirms previously known results for the preemptive resume discipline, and presents new results for several variants of the preemptive repeat model. Exact expressions for the squared coefficient of variation of the interdeparture time distribution are also provided. Several numerical examples are given and discussed.