A robust queueing network analyzer based on indices of dispersion

DOI10.1002/nav.22010zbMath1523.60155arXiv2003.11174OpenAlexW3178872234MaRDI QIDQ6053043

Ward Whitt, Wei You

Publication date: 18 October 2023

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.11174

zbMATH Keywords

heavy trafficqueueing networksindex of dispersionqueueing approximationsrobust queueingnon-Markov

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (1)

Queueing networks with path-dependent arrival processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mean waiting time approximations in the \(G/G/1\) queue
• Queueing networks. A fundamental approach
• The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes
• A review of \(L=\lambda W\) and extensions
• The QNET method for two-moment analysis of open queueing networks
• The heavy-traffic bottleneck phenomenon in open queueing networks
• Asymptotically exact decomposition approximations for open queueing networks
• Queues with superposition arrival processes in heavy traffic
• Reflected Brownian motion on an orthant
• The Fourier-series method for inverting transforms of probability distributions
• Reflected Brownian motion in an orthant: Numerical methods for steady- state analysis
• An introduction to the theory of point processes
• Multidimensional reflected Brownian motions having exponential stationary distributions
• Heavy-traffic limits for stationary network flows
• The advantage of indices of dispersion in queueing approximations
• Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue
• Minimizing multimodular functions and allocating capacity in bike-sharing systems
• Stochastic-Process Limits
• Modeling a Hospital Queueing Network
• Modeling Cross Correlation in Three-Moment Four-Parameter Decomposition Approximation of Queueing Networks
• Open Queueing Networks in Heavy Traffic
• Robust Queueing Theory
• Approximations for departure processes and queues in series
• A versatile Markovian point process
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• The diffusion approximation for tandem queues in heavy traffic
• Approximate Analysis of General Queuing Networks by Decomposition
• Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks
• Applied Probability and Queues
• The heavy traffic approximation for single server queues in series
• Using Robust Queueing to Expose the Impact of Dependence in Single-Server Queues
• Heavy-Traffic Limit of the GI/GI/1 Stationary Departure Process and Its Variance Function
• Time-Varying Robust Queueing
• A Data-Driven Model of an Appointment-Generated Arrival Process at an Outpatient Clinic
• Queues with Time-Varying Arrivals and Inspections with Applications to Hospital Discharge Policies
• Multiple channel queues in heavy traffic. II: sequences, networks, and batches
• Multiple channel queues in heavy traffic. I
• On the relation between customer and time averages in queues
• Variability Functions for Parametric-Decomposition Approximations of Queueing Networks
• Optimal Resource Capacity Management for Stochastic Networks

This page was built for publication: A robust queueing network analyzer based on indices of dispersion