Transient solution for the number of busy servers for the discrete-time queue Geom^X/G/
From MaRDI portal
Publication:2736953
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.
Recommendations
- Complete analytic and computational analyses of the discrete-time bulk-arrival infinite-server system: \(GI^{X}/Geom/\infty\)
- On the queueing system
- scientific article; zbMATH DE number 2149284
- The queueing system BDG D∞∗∗
- Distribution of the number of customers served during a busy period in a discrete time Geom/Geom/1 queue
Cited in
(9)- Distribution of the number of customers served during a busy period in a discrete time Geom/Geom/1 queue
- Complete analytic and computational analyses of the discrete-time bulk-arrival infinite-server system: \(GI^{X}/Geom/\infty\)
- Transient solution for queue-length distribution of Geometry/G/1 queueing model
- scientific article; zbMATH DE number 2088577 (Why is no real title available?)
- scientific article; zbMATH DE number 2149284 (Why is no real title available?)
- scientific article; zbMATH DE number 1876977 (Why is no real title available?)
- The queueing system BDG D∞∗∗
- On the transient analysis of the M^X/M/ queue
- Explicit solution for the stationary distribution of a discrete-time finite buffer queue
This page was built for publication: Transient solution for the number of busy servers for the discrete-time queue \(\text{Geom}^X/\text{G}/\infty\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2736953)
