On a general mixed priority queue with server discretion

DOI10.1080/15326349.2016.1193753zbMath1345.60105OpenAlexW2467420907MaRDI QIDQ2816628

Val Andrei Fajardo, Steve Drekic

Publication date: 25 August 2016

Published in: Stochastic Models (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10012/12007

zbMATH Keywords

Laplace-Stieltjes transformwaiting time distributionaccumulating prioritymixed priority queueserver discretion rules

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Cites Work

• Controlling the workload of M/G/1 queues via the \(q\)-policy
• Waiting time distributions in the accumulating priority queue
• Mixing of non-preemptive and preemptive repeat priority disciplines
• Solving probability transform functional equations for numerical inversion
• Threshold-based interventions to optimize performance in preemptive priority queues
• Reducing Delay in Preemptive Repeat Priority Queues
• Queuing analysis of polling models
• A Dynamic Priority Queue with General Concave Priority Functions
• A Single Server Queueing System Working under Mixed Priority Disciplines
• A Mixed Delay Dependent Queue Discipline
• Sojourn Time and Waiting Time Distributions for M/GI/1 Queues with Preemption-Distance Priorities
• Numerical Inversion of Laplace Transforms of Probability Distributions
• Analysis of the M/G/1 queue under a combined preemptive/nonpreemptive priority discipline
• A delay dependent queue discipline
• A Continuation of Delay-Dependent Queue Disciplines
• Level crossing methods in stochastic models

This page was built for publication: On a general mixed priority queue with server discretion