Approximation of the Mean Queue Length of an M/G/c Queueing System
From MaRDI portal
Publication:4838246
Recommendations
Cited in
(15)- Approximate solution for multi-server queueing systems with Erlangian service times
- Bounds for the mean system size in \(M/G/1/K\)-queues
- Equilibrium and optimal strategies to join a queue with partial information on service times
- A two-stage approach for task and resource management in multimedia cloud environment
- scientific article; zbMATH DE number 431649 (Why is no real title available?)
- Predicting the performance of queues -- a data analytic approach
- scientific article; zbMATH DE number 3928689 (Why is no real title available?)
- Approximating the Mean Time in System in a Multiple-Server Queue that Uses Threshold Scheduling
- On Markov-Krein characterization of the mean waiting time in M/G/K and other queueing systems
- An approximation for the mean response time for shortest queue routing with general interarrival and service times
- Queuing management with feedback in cloud computing centers with large numbers of web servers
- scientific article; zbMATH DE number 5593401 (Why is no real title available?)
- Queueing management for reducing the overlaps of customers in service systems
- On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough
- Mean queue size in a queue with discrete autoregressive arrivals of order \(p\)
This page was built for publication: Approximation of the Mean Queue Length of an M/G/c Queueing System
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4838246)