Robust queueing theory: an initial study using imprecise probabilities

DOI10.1007/S11134-015-9458-6MaRDI QIDQ257060zbMATH OpenOpenAlexFDO

Authors Stavros Lopatatzidis, Jasper De Bock, Stijn De Vuyst, Joris Walraevens, Gert De Cooman

Publication date 15 March 2016

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11134-015-9458-6

zbMATH Keywords

robustnessdiscrete-time queuesimprecise probabilitiesperformance measures

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Generalized stochastic processes (60G20)

Recommendations

• Robust queueing theory
• Using robust queueing to expose the impact of dependence in single-server queues
• Performance analysis of queueing networks via robust optimization
• Robustness of queuing network formulas
• Performance analysis of a Geom/Geom/1 queueing system with variable input probability

Cites work

• scientific article; zbMATH DE number 48344 (Why is no real title available?)
• scientific article; zbMATH DE number 3514781 (Why is no real title available?)
• scientific article; zbMATH DE number 3560492 (Why is no real title available?)
• scientific article; zbMATH DE number 3613880 (Why is no real title available?)
• scientific article; zbMATH DE number 1478490 (Why is no real title available?)
• scientific article; zbMATH DE number 845703 (Why is no real title available?)
• scientific article; zbMATH DE number 918134 (Why is no real title available?)
• scientific article; zbMATH DE number 1424151 (Why is no real title available?)
• scientific article; zbMATH DE number 3201010 (Why is no real title available?)
• scientific article; zbMATH DE number 3076638 (Why is no real title available?)
• An Efficient Algorithm for Estimating State Sequences in Imprecise Hidden Markov Models
• Characterisation of ergodic upper transition operators
• Coefficients of ergodicity for Markov chains with uncertain parameters
• Epistemic irrelevance in credal nets: the case of imprecise Markov trees
• Fundamentals of queueing theory
• Fuzzy sets
• IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
• Introduction to imprecise probabilities
• Lower Previsions
• Monte Carlo simulation and large deviations theory for uniformly recurrent Markov chains
• Notes on conditional previsions
• Optimization of computer simulation models with rare events
• Performance optimization of queueing systems with perturbation realization
• Perturbation analysis for denumerable Markov chains with application to queueing models
• Perturbation realization, potentials, and sensitivity analysis of Markov processes
• Perturbation theory and finite Markov chains
• Queueing theory for telecommunications. Discrete time modelling of a single node system.
• Rethinking the Foundations of Statistics
• The theory of interval-probability as a unifying concept for uncertainty
• Towards a unified theory of imprecise probability

Cited in

(6)

• On the structure and solutions of functional equations arising from queueing models
• An interval-based approach to model input uncertainty in M/M/1 simulation
• Imprecise continuous-time Markov chains
• On the selection of an optimal outer approximation of a coherent lower probability
• Robustness of Rootfinding in Single-Server Queueing Models
• Credal networks under epistemic irrelevance

This page was built for publication: Robust queueing theory: an initial study using imprecise probabilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q257060)