Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems
From MaRDI portal
Publication:2052432
DOI10.1007/s11134-020-09675-7zbMath1475.60177OpenAlexW3101444841MaRDI QIDQ2052432
Publication date: 26 November 2021
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-020-09675-7
moment problem\(GI/GI/1\) queuetight boundsbounds for the mean steady-state mean waiting timeextremal queues
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (4)
SET-VALUED PERFORMANCE APPROXIMATIONS FOR THE QUEUE GIVEN PARTIAL INFORMATION ⋮ Distributionally robust views on extremal queues ⋮ Applying optimization theory to study extremal \(GI/GI/1\) transient mean waiting times ⋮ Correction to: ``Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Markov-Krein characterization of the mean waiting time in \(M/G/K\) and other queueing systems
- An investigation of phase-distribution moment-matching algorithms for use in queueing models
- On the complete monotonicity of the waiting time density in some GI/G/k systems
- Phase-type representations in random walk and queueing problems
- Stochastic ordering and dependence in applied probability
- Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue
- Extremal models for the \(G I \slash G I \slash K\) waiting-time tail-probability decay rate
- On Approximations for Queues, I: Extremal Distributions
- On Approximations for Queues, III: Mixtures of Exponential Distributions
- Simple Inequalities for the D/G/1 Queue
- Bounds for cumulants of waiting-times in gi/gi/1 queues
- Inequalities for moments of tails of random variables, with a queueing application
- Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems
- The s-convex orders among real random variables, with applications
- Tchebycheff Systems for Probabilistic Analysis
- Idle period approximations and bounds for the GI/G/1 queue
- Applied Probability and Queues
- The Accuracy of the Equivalent Random Method With Renewal Inputs*
- Some Extremal Problems in the Theory of Mass Service
- Some inequalities for the queue GI/G/1
This page was built for publication: Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems
