Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails

DOI10.1007/S11134-015-9435-0zbMath1317.60121arXiv1303.0038OpenAlexW3104615574MaRDI QIDQ2351799

Jean Walrand, Vijay Kamble

Publication date: 26 June 2015

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

Full work available at URL: https://arxiv.org/abs/1303.0038

zbMATH Keywords

heavy tails\(\mathrm{M}/\mathrm{G}/1\) queueapproximately optimal scheduling

Mathematics Subject Classification ID

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

Cites Work

• A large-deviations analysis of the GI/GI/1 SRPT queue
• Largest weighted delay first scheduling: Large deviations and optimality
• Scheduling strategies and long-range dependence
• On the Gittins index in the M/G/1 queue
• Multi‐Armed Bandit Allocation Indices
• PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING
• Preventing Large Sojourn Times Using SMART Scheduling
• Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
• On extremal service disciplines in single-stage queueing systems
• Recent sojourn time results for multilevel processor‐sharing scheduling disciplines
• Time-Sharing Service Systems. II
• Extremal properties of the FIFO discipline in queueing networks
• Time-Sharing Service Systems. I
• Is Tail-Optimal Scheduling Possible?
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• The impact of a heavy-tailed service-time distribution upon the \(\text{M}/\text{GI}/s\) waiting-time distribution

This page was built for publication: Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails