Threshold-based interventions to optimize performance in preemptive priority queues

DOI10.1023/A:1019106530558zbMath0960.90022OpenAlexW1597828655MaRDI QIDQ1587114

David A. Stanford, Steve Drekic

Publication date: 22 November 2000

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019106530558

zbMATH Keywords

residence timesojourn timepreemptive priorityLaplace-Stieltjes transformscompletion timethreshold policy

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (5)

Resource optimization in \(MMAP[2/PH[2]/S\) priority queueing model with threshold \(PH\) retrial times and the preemptive resume policy] ⋮ \(T\)-preemptive priority queue and its application to the analysis of an opportunistic spectrum access in cognitive radio networks ⋮ On a general mixed priority queue with server discretion ⋮ Waiting and sojourn times in a multi-server queue with mixed priorities ⋮ Discrete-time queues with discretionary priorities

This page was built for publication: Threshold-based interventions to optimize performance in preemptive priority queues