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.











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)