Some algorithms for discrete time queues with finite capacity
From MaRDI portal
The paper deals with discrete time queues with finite capacity and i.i.d. and Markov modulated arrivals. The authors develop efficient algorithms to calculate the moments and the distribution at the first time. Results are extended to the multiserver queue, and the paper is accomplished with some illustrative examples.
Recommendations
- scientific article; zbMATH DE number 3860152
- scientific article; zbMATH DE number 1424151
- On finite capacity queues with time dependent arrival rates
- Applied discrete-time queues
- scientific article; zbMATH DE number 65357
- Algorithmic computation of \(MAP/PH/1\) queue with finite system capacity and two-stage vacations
- Analysis of discrete-time queues with general service demands and finite-support service capacities
- An algorithm for Ph/Ph/c queues
This page was built for publication: Some algorithms for discrete time queues with finite capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370373)