Using Robust Queueing to Expose the Impact of Dependence in Single-Server Queues

DOI10.1287/opre.2017.1649zbMath1442.90058DBLPjournals/ior/WhittY18OpenAlexW2740042280WikidataQ57404040 ScholiaQ57404040MaRDI QIDQ4969317

Wei You, Ward Whitt

Publication date: 5 October 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/461906625ffed6e51a85e90aad87f395419ebd31

zbMATH Keywords

heavy trafficqueueing approximationsindices of dispersionrobust queueingdependence among interarrival times and service timesqueueing network analyzer

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (11)

BROWNIAN MOTION MINUS THE INDEPENDENT INCREMENTS: REPRESENTATION AND QUEUING APPLICATION ⋮ A robust queueing network analyzer based on indices of dispersion ⋮ Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management ⋮ Heavy-Traffic Limit of the GI/GI/1 Stationary Departure Process and Its Variance Function ⋮ Asymptotic Analysis of a Multiclass Queueing Control Problem Under Heavy Traffic with Model Uncertainty ⋮ Heavy-traffic limits for stationary network flows ⋮ Analysis of a single server queue with interdependence of arrival and service processes -- a semi-Markov approach ⋮ Impact of dependence on single-server queueing systems ⋮ The advantage of indices of dispersion in queueing approximations ⋮ Ergodic theorems for queuing systems with dependent inter-arrival times ⋮ Queues with path-dependent arrival processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tractable stochastic analysis in high dimensions via robust optimization
• The heavy-traffic bottleneck phenomenon in open queueing networks
• Queues with superposition arrival processes in heavy traffic
• The Fourier-series method for inverting transforms of probability distributions
• A queueing model with independent arrivals, and its fluid and diffusion limits
• Stochastic-Process Limits
• Theory and Applications of Robust Optimization
• Robust Queueing Theory
• Queueing Networks: A Survey of Their Random Processes
• On Approximations for Queues, I: Extremal Distributions
• On Approximations for Queues, II: Shape Constraints
• On Approximations for Queues, III: Mixtures of Exponential Distributions
• Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
• A Class of Data Traffic Processes-Covariance Function Characterization and Related Queuing Results
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• Distribution Free Procedures for Some Inventory Models
• Applied Probability and Queues
• Planning Queueing Simulations
• Variability Functions for Parametric-Decomposition Approximations of Queueing Networks
• Some inequalities for the queue GI/G/1

This page was built for publication: Using Robust Queueing to Expose the Impact of Dependence in Single-Server Queues