Computing loss probabilities in discrete-time queues
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1031393
- Loss probability in a finite discrete-time queue in terms of the steady state distribution of an infinite queue
- Cell loss probability for M/G/1 and time-slotted queues
- Performance analysis of discrete-time Erlang loss system
- scientific article; zbMATH DE number 4100354
Cited in
(15)- Discrete-time Geo/Geo/1 queueing system associated with (s, S) inventory policy
- Cell loss probability for M/G/1 and time-slotted queues
- Heuristics for Finite-Buffer Queues
- Loss probability in an overloaded discrete-time GI/G/1/K system with very large K.
- On the total loss probability of service stages in series
- Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues
- Numerical method for discrete-time finite-buffer queues with some regenerative structure
- Performance evaluation of finite buffer queues through regenerative simulation
- Calculating the loss probability in aBMAP/G/l/N+1 queue
- scientific article; zbMATH DE number 922965 (Why is no real title available?)
- Methods for reducing the amount of computation in modeling lossy communication systems based on ignoring low-probability states
- On the calculation of steady-state loss probabilities in the \(GI/G/2/0\) queue
- Order independent loss queues
- A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline
- Methods to reduce loss probability in systems with infinite service time dispersion
This page was built for publication: Computing loss probabilities in discrete-time queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770076)
