Explicit formulas for E^/G/1/N-type queueing systems
The author considers \(\text{E}^{\theta}/\)GI/1/N-type queueing systems with limited queue. For such systems the following characteristics are studied: queue length, busy period, waiting time, number of served claims, lost claims; residual queueing time, time to the lost of the first claim. Explicit formulae are derived for the mentioned characteristics. Also, for some of them, stationary characteristics are calculated. The investigation is based on the potential method proposed by \textit{V. S. Korolyuk} [``Limit problems for complicated Poisson processes (1975; Zbl 0329.60040)].
- Explicit formulas for characteristics of the system M^/G/1 /b with an innovation level of the input stream.
- Explicit Formulae for the Queue Length Distribution of Batch Arrival Systems
- Explicit formulae and convergence rate for the system M α /G/1/N as N→∞
- Rate of convergence to ergodic distribution for queue length in systems of the type M θ/G/1/N
- scientific article; zbMATH DE number 3906201
- An exact formula for the mean number of claims served by a one-channel queuing system with rejections on a given time interval
- A finite-buffer queue with a single vacation policy: an analytical study with evolutionary positioning
- Explicit Formulae for the Queue Length Distribution of Batch Arrival Systems
- Explicit formulas for characteristics of the system M^/G/1 /b with an innovation level of the input stream.
- Explicit criteria for several types of ergodicity of the embedded M/G/1 and GI/M/n queues
- Mittag-Leffler function in applied problems of queuing theory
This page was built for publication: Explicit formulas for E\(^{\theta}\)/G/1/N-type queueing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2722136)
