Transient solution for the number of busy servers for the discrete-time queue \(\text{Geom}^X/\text{G}/\infty\) (Q2736953)
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: Transient solution for the number of busy servers for the discrete-time queue Geom^X/G/ |
scientific article; zbMATH DE number 1645040
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Transient solution for the number of busy servers for the discrete-time queue \(\text{Geom}^X/\text{G}/\infty\) |
scientific article; zbMATH DE number 1645040 |
Statements
11 September 2001
0 references
Geom\(^X/\text{G}/\infty\) queue
0 references
\(\text{M}^X/\text{G}/\infty\) queue
0 references
distribution
0 references
Markov process
0 references
steady-state
0 references
Transient solution for the number of busy servers for the discrete-time queue \(\text{Geom}^X/\text{G}/\infty\) (English)
0 references
The distribution of the number of busy servers at time \(k\) for the infinite discrete Geom\(^X/\text{G}/\infty\)-queueing system with a random batch arrival and with independently geometrically distributed interarrival times is derived. In addition, a probability generating function, steady-state systems and some numerical results are given, too.
0 references
0.8583036065101624
0 references
0.8514072895050049
0 references
0.8386751413345337
0 references
