Computing steady state probabilities in λ(n)/G/1/K queue
From MaRDI portal
Recommendations
- ON the GI/M(n)/1/K queue-an alternative approach
- scientific article; zbMATH DE number 866108
- A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\)
- A unified algorithm for computing the stationary queue length distributions in M(k)/G/1/N and GI/M(k)/1/N queues
- Performance analysis of the single server queue with state-dependent service
Cited in
(11)- A queueing model for optimal control of partial buffer sharing in ATM
- A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\)
- The impact of disruption characteristics on the performance of a server
- A preemptive priority queue with balking
- COMPUTATION OF STEADY-STATE PROBABILITIES FOR RESOURCE-SHARING CALL-CENTER QUEUEING SYSTEMS
- ON the GI/M(n)/1/K queue-an alternative approach
- scientific article; zbMATH DE number 866108 (Why is no real title available?)
- Survey on queueing models with standbys support
- Analyzing state-dependent arrival in \(GI/\mathrm{BMSP}/1/\infty \) queues
- Evaluation of steady state probabilities of the \(\bullet/\mathrm{G}/\infty\) queuing system for different input flow models
- A survey of the machine interference problem
This page was built for publication: Computing steady state probabilities in λ(n)/G/1/K queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122492)