Information theoretic approximations for the \(M/G/1\) retrial queue (Q1338900)
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: Information theoretic approximations for the \(M/G/1\) retrial queue |
scientific article; zbMATH DE number 695008
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Information theoretic approximations for the \(M/G/1\) retrial queue |
scientific article; zbMATH DE number 695008 |
Statements
Information theoretic approximations for the \(M/G/1\) retrial queue (English)
0 references
18 December 1994
0 references
In this paper we present information theoretic approximations for the M/G/1 queue with retrials. Various approximations for this model are obtained according to the available information about the service time probability density and the steady-state distribution of the system state. The results are well-suited for numerical computation.
0 references
\(M/G/1\) queue
0 references
retrial queues
0 references
monotonicity properties
0 references
\(I\)-projection
0 references
steady-state distribution
0 references
0 references
0 references
0 references
0 references
0 references
0.90234536
0 references
0.90226424
0 references
0.8925139
0 references
0 references
0.8884986
0 references
0.88730216
0 references
