Some algorithms for discrete time queues with finite capacity (Q1370373)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some algorithms for discrete time queues with finite capacity |
scientific article; zbMATH DE number 1078419
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some algorithms for discrete time queues with finite capacity |
scientific article; zbMATH DE number 1078419 |
Statements
Some algorithms for discrete time queues with finite capacity (English)
0 references
31 March 1998
0 references
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.
0 references
finite capacity queue
0 references
discrete time queue
0 references
regeneration cycle length
0 references
0.88750744
0 references
0 references
0.8762477
0 references
0.87472916
0 references
0 references
