A new approach for analyzing the busy period distribution of M/M/c queue
From MaRDI portal
Publication:4641059
Recommendations
- Analysis of the busy period for the \(\text{M}/\text{M}/c\) queue: An algorithmic approach
- Lattice path approach for busy period density of \(M/G/1\) queues using \(C_{3}\) Coxian distribution
- scientific article; zbMATH DE number 958402
- A new formula for the busy period of a non-empty multiserver queueing system
- A new approach to the busy period of the M/M/1 queue
Cited in
(12)- The M/M/c with critical jobs
- A new formula for the busy period of a non-empty multiserver queueing system
- A new approach to the busy period of the M/M/1 queue
- Analysis of the busy period for the \(\text{M}/\text{M}/c\) queue: An algorithmic approach
- Distribution of the busy period in a controllable M/M/2 queue operating under the triadic (0, K, N, M) policy
- scientific article; zbMATH DE number 5287693 (Why is no real title available?)
- A note on the alternative form of the busy period density for an m/m/1/∞ queue
- scientific article; zbMATH DE number 4123022 (Why is no real title available?)
- scientific article; zbMATH DE number 1902522 (Why is no real title available?)
- scientific article; zbMATH DE number 958402 (Why is no real title available?)
- Busy period analysis for the n-policy GI/M/c queue
- Busy period analysis of queue: lattice path approach
This page was built for publication: A new approach for analyzing the busy period distribution of \(\mathrm{M}/\mathrm{M}/c\) queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4641059)