Breaking the dimensionality curse in multi-server queues
DOI10.1016/j.cor.2016.04.011zbMath1349.90210OpenAlexW2332130330MaRDI QIDQ342434
Thomas Begin, Alexandre Brandwajn
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01322249/document
approximate solution\(G/G/c\) queuedimensionality cursemulti-server systemsreduced state descriptionstate-dependent \(Ph/ Ph/c\)-like queue
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) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough
- Queueing models of call centers: An introduction
- An Analytic Approach to a General Class of G/G/s Queueing Systems
- The queue GI/M/s with customers of different types or the queue GI/Hm/s
- Algorithms for the multi-server queue with phase type service
- Asymptotic exponentiality of the tail of the waiting-time distribution in a Ph/Ph/C queue
- A logarithmic reduction algorithm for quasi-birth-death processes
- Introduction to Queueing
- A Diffusion Approximation for the G/GI/n/m Queue
- Numerical Methods for Structured Markov Chains
- Matching Three Moments with Minimal Acyclic Phase Type Distributions
- Calculation of the steady state waiting time distribution in GI/PH/\(c\) and MAP/PH/\(c\) queues
This page was built for publication: Breaking the dimensionality curse in multi-server queues
