The heavy-traffic bottleneck phenomenon in open queueing networks

DOI10.1016/0167-6377(90)90054-9MaRDI QIDQ921758zbMATH OpenOpenAlexFDO

Authors Elsie Sterbin Gottlieb

Publication date 1990

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

Full work available at URL https://doi.org/10.1016/0167-6377(90)90054-9

Mathematics Subject Classification ID

Probability theory and stochastic processes (60-XX)

Cites work

• A Light-Traffic Approximation for Single-Class Departure Processes from Multi-Class Queues
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues
• Approximation for the departure process of a queue in a network
• Approximations for departure processes and queues in series
• Asymptotically exact decomposition approximations for open queueing networks
• Comparing counting processes and queues
• scientific article; zbMATH DE number 3868389 (Why is no real title available?)
• Multiple channel queues in heavy traffic. II: sequences, networks, and batches
• Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
• Open Queueing Networks in Heavy Traffic
• Planning Queueing Simulations
• The Best Order for Queues in Series

Cited in

(14)

• Towards better multi-class parametric-decomposition approximations for open queueing networks
• Approximating class-departure variability in tandem queues with downtime events: regression-based variability function
• Point and interval estimation of decomposition error in discrete-time open tandem queues
• A hybrid method for performance analysis of \(G/G/m\) queueing networks
• The advantage of indices of dispersion in queueing approximations
• Taking account of correlations between streams in queueing network approximations
• Using robust queueing to expose the impact of dependence in single-server queues
• Modeling and design of container terminal operations
• A robust queueing network analyzer based on indices of dispersion
• The superposition of Markovian arrival processes: moments and the minimal Laplace transform
• The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes
• Computing the steady-state probabilities of the number of customers in the system of a tandem queueing system, a machine learning approach
• The heavy-traffic bottleneck phenomenon under splitting and superposition
• Evaluation of the end-to-end delay of a multiphase queuing system using artificial neural networks

This page was built for publication: The heavy-traffic bottleneck phenomenon in open queueing networks

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