The heavy-traffic bottleneck phenomenon under splitting and superposition

DOI10.1016/S0377-2217(03)00299-6zbMath1067.90018MaRDI QIDQ703930

Sunkyo Kim

Publication date: 12 January 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

SimulationDecomposition approximationInnovations methodQueueing networksVariability function

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items

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 ⋮ Taking account of correlations between streams in queueing network approximations

Cites Work

• Unnamed Item
• The heavy-traffic bottleneck phenomenon in open queueing networks
• Towards better multi-class parametric-decomposition approximations for open queueing networks
• Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues
• Approximations for departure processes and queues in series
• Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• Approximate Analysis of General Queuing Networks by Decomposition
• Variability Functions for Parametric-Decomposition Approximations of Queueing Networks

This page was built for publication: The heavy-traffic bottleneck phenomenon under splitting and superposition