Priority queueing systems: from probability generating functions to tail probabilities
From MaRDI portal
Recommendations
- Tail probabilities of low-priority waiting times and queue lengths in MAP/GI/1 queues
- Tail Probability of Low-Priority Queue Length in a Discrete-Time Priority BMAP/PH/1 Queue
- Exact tail asymptotics for a discrete-time preemptive priority queue
- Discrete priority queueing systems
- Asymptotics for M/G/1 low-priority waiting-time tail probabilities
Cites work
- A problem of numerical inversion of implicitly defined Laplace transforms
- Analysis of a nonpreemptive priority queue with SPP arrivals of high class
- Analytic derivation of tail probabilities for queue lengths and waiting times in ATM multiserver queues
- Asymptotic analysis of tail probabilities based on the computation of moments
- Asymptotics for M/G/1 low-priority waiting-time tail probabilities
- Computing distributions and moments in polling models by numerical transform inversion
- scientific article; zbMATH DE number 986989 (Why is no real title available?)
- scientific article; zbMATH DE number 2063761 (Why is no real title available?)
- scientific article; zbMATH DE number 5222191 (Why is no real title available?)
- Many-sources delay asymptotics with applications to priority queues
- Numerical Computation of the Moments of a Probability Distribution from its Transform
- Numerical inversion for Laplace transforms of functions with discontinuities
- Numerical Inversion of Laplace Transforms of Probability Distributions
- Numerical inversion of probability generating functions
- On the Laguerre Method for Numerically Inverting Laplace Transforms
- On the numerical inversion of busy-period related transforms
- Performance analysis of a single-server ATM queue with a priority scheduling.
- Performance comparison of several priority schemes with priority jumps
- Solving probability transform functional equations for numerical inversion
- Tail probabilities of low-priority waiting times and queue lengths in MAP/GI/1 queues
- The Fourier-series method for inverting transforms of probability distributions
Cited in
(12)- Dominant poles and tail asymptotics in the critical Gaussian many-sources regime
- A Taylor series approach for service-coupled queueing systems with intermediate load
- Approximations for the performance evaluation of a discrete-time two-class queue with an alternating service discipline
- Analysis of the queue lengths in a priority retrial queue with constant retrial policy
- Exact tail asymptotics in a priority queue -- characterizations of the preemptive model
- Analysis of a discrete-time preemptive resume priority buffer
- Combined analysis of transient delay characteristics and delay autocorrelation function in the \(\text{Geo}^x\) / G /\(1\) queue
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- Analysing Multiprogramming Queues by Generating Functions
- scientific article; zbMATH DE number 5007210 (Why is no real title available?)
- scientific article; zbMATH DE number 4041008 (Why is no real title available?)
- Exact tail asymptotics in a priority queue -- characterizations of the non-preemptive model
This page was built for publication: Priority queueing systems: from probability generating functions to tail probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641949)
