Loss probability in an overloaded discrete-time GI/G/1/K system with very large K.
From MaRDI portal
(Redirected from Publication:703256)
Loss probability in an overloaded discrete-time \(GI/G/1/K\) system with very large \(K\).
Loss probability in an overloaded discrete-time \(GI/G/1/K\) system with very large \(K\).
Recommendations
- Accurate formulae for the loss probability evaluation in a large class of queueing systems
- Asymptotic analysis of the loss probability in the GI/PH/1/K queue
- The loss probability in an overloaded queue using the dual queue
- Extension of the loss probability formula to an overloaded queue with impatient customers
- Asymptotic Results for Buffer Systems under Heavy Load
Cites work
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 1031393 (Why is no real title available?)
- scientific article; zbMATH DE number 1783869 (Why is no real title available?)
- scientific article; zbMATH DE number 3229135 (Why is no real title available?)
- scientific article; zbMATH DE number 967319 (Why is no real title available?)
- Birth-and-death processes on the integers with phases and general boundaries
- Computing loss probabilities in discrete-time queues
- Matrix?geometric analysis of the discrete time Gi/G/1 system
- Regenerative Analysis and Steady State Distributions for Markov Chains
- The loss probability in an overloaded queue using the dual queue
This page was built for publication: Loss probability in an overloaded discrete-time \(GI/G/1/K\) system with very large \(K\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703256)