Extremal GI/GI/1 queues given two moments: exploiting Tchebycheff systems
From MaRDI portal
Publication:2052432
Recommendations
- Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue
- Applying optimization theory to study extremal GI/GI/1 transient mean waiting times
- scientific article; zbMATH DE number 431647
- Heavy-traffic extreme-value limits for queues
- On Approximations for Queues, I: Extremal Distributions
Cites work
- Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue
- An investigation of phase-distribution moment-matching algorithms for use in queueing models
- Applied Probability and Queues
- Bounds for cumulants of waiting-times in gi/gi/1 queues
- Comparison methods for stochastic models and risks
- Extremal models for the \(G I \slash G I \slash K\) waiting-time tail-probability decay rate
- scientific article; zbMATH DE number 431647 (Why is no real title available?)
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 3755546 (Why is no real title available?)
- scientific article; zbMATH DE number 3556956 (Why is no real title available?)
- scientific article; zbMATH DE number 3246461 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- scientific article; zbMATH DE number 3350905 (Why is no real title available?)
- scientific article; zbMATH DE number 3185400 (Why is no real title available?)
- Idle period approximations and bounds for the GI/G/1 queue
- Inequalities for moments of tails of random variables, with a queueing application
- On Approximations for Queues, I: Extremal Distributions
- On Approximations for Queues, III: Mixtures of Exponential Distributions
- On Markov-Krein characterization of the mean waiting time in M/G/K and other queueing systems
- On the complete monotonicity of the waiting time density in some GI/G/k systems
- Phase-type representations in random walk and queueing problems
- Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems
- Simple Inequalities for the D/G/1 Queue
- Some Extremal Problems in the Theory of Mass Service
- Some inequalities for the queue GI/G/1
- Stochastic ordering and dependence in applied probability
- Tchebycheff Systems for Probabilistic Analysis
- The Accuracy of the Equivalent Random Method With Renewal Inputs*
- The s-convex orders among real random variables, with applications
Cited in
(13)- Correction to: ``Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems
- Distributionally robust views on extremal queues
- Applying optimization theory to study extremal GI/GI/1 transient mean waiting times
- 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
- Extremal property of waiting times in \(\mathrm{GI}/\mathrm{G}/1/\infty\) models
- Further properties of extremal sequences in queues
- Application des lois non paramétriques dans les systèmes d'attente et la théorie de renouvellement
- Set-valued performance approximations for the \(GI/GI/K\) queue given partial information
- MAD dispersion measure makes extremal queue analysis simple
- Two Extremal Autocorrelated Arrival Processes
- Orderings on measures induced by higher-order monotone functions
- Second-order bounds for the M/M/s queue with random arrival rate
This page was built for publication: Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052432)
