Breaking the dimensionality curse in multi-server queues
From MaRDI portal
(Redirected from Publication:342434)
Recommendations
Cites work
- A Diffusion Approximation for the G/GI/n/m Queue
- A logarithmic reduction algorithm for quasi-birth-death processes
- Algorithms for the multi-server queue with phase type service
- An Analytic Approach to a General Class of G/G/s Queueing Systems
- Asymptotic exponentiality of the tail of the waiting-time distribution in a Ph/Ph/C queue
- Calculation of the steady state waiting time distribution in GI/PH/c and MAP/PH/c queues
- scientific article; zbMATH DE number 3676962 (Why is no real title available?)
- Matching Three Moments with Minimal Acyclic Phase Type Distributions
- Numerical Methods for Structured Markov Chains
- On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough
- Performance modeling and design of computer systems. Queueing theory in action
- Queueing models of call centers: An introduction
- The queue GI/M/s with customers of different types or the queue GI/Hm/s
Cited in
(2)
This page was built for publication: Breaking the dimensionality curse in multi-server queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342434)