Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing
From MaRDI portal
Publication:5318280
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
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)