Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing

DOI10.1002/NAV.20085zbMATH Open1072.90005OpenAlexW2141353925MaRDI QIDQ5318280FDOQ5318280

Authors: Sunkyo Kim 

Publication date: 22 September 2005

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

Full work available at URL: https://doi.org/10.1002/nav.20085

Recommendations

• The heavy-traffic bottleneck phenomenon under splitting and superposition
• scientific article; zbMATH DE number 932422
• Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
• Approximations for multi-class departure processes
• Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks

zbMATH Keywords

queueing networksdeterministic routingdecomposition approximation

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Stochastic network models in operations research (90B15)

Cites Work

• Title not available (Why is that?)

Cited In (9)

• A hybrid method for performance analysis of \(G/G/m\) queueing networks
• Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
• The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes
• Decomposition Algorithms for Analyzing Transient Phenomena in Multiclass Queueing Networks in Air Transportation
• Approximating class-departure variability in tandem queues with downtime events: regression-based variability function
• Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations
• The heavy-traffic bottleneck phenomenon under splitting and superposition
• Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
• A unifying framework for the approximate solution of closed multiclass queuing networks

This page was built for publication: Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing

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