The heavy-traffic bottleneck phenomenon in open queueing networks

DOI10.1016/0167-6377(90)90054-9zbMath0709.60562OpenAlexW2126252419MaRDI QIDQ921758

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)

Related Items (12)

Evaluation of the end-to-end delay of a multiphase queuing system using artificial neural networks ⋮ Approximating class-departure variability in tandem queues with downtime events: regression-based variability function ⋮ A robust queueing network analyzer based on indices of dispersion ⋮ Modeling and Design of Container Terminal Operations ⋮ The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes ⋮ A hybrid method for performance analysis of \(G/G/m\) queueing networks ⋮ The heavy-traffic bottleneck phenomenon under splitting and superposition ⋮ The advantage of indices of dispersion in queueing approximations ⋮ Using Robust Queueing to Expose the Impact of Dependence in Single-Server Queues ⋮ Point and interval estimation of decomposition error in discrete-time open tandem queues ⋮ Taking account of correlations between streams in queueing network approximations ⋮ Towards better multi-class parametric-decomposition approximations for open queueing networks

Cites Work

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

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