Loss probability in an overloaded discrete-time GI/G/1/K system with very large K.
DOI10.1016/J.ORL.2003.12.005zbMATH Open1054.90015OpenAlexW1981040201MaRDI QIDQ703256FDOQ703256
Authors: Attahiru Sule Alfa
Publication date: 11 January 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2003.12.005
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
Discrete phase type distributionFinite bufferLoss probabilityMatrix-analytic methodOverloaded queueQuasi-birth-and-death process
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Title not available (Why is that?)
- Matrix?geometric analysis of the discrete time Gi/G/1 system
- The loss probability in an overloaded queue using the dual queue
- Title not available (Why is that?)
- Computing loss probabilities in discrete-time queues
- Birth-and-death processes on the integers with phases and general boundaries
- Title not available (Why is that?)
Cited In (1)
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)