Decomposition and aggregation in queueing networks
From MaRDI portal
Recommendations
- Product forms for queueing networks with state-dependent multiple job transitions
- Decomposition of queueing networks with dependent service and negative customers
- Queue decomposition \& finite closed queueing network models
- Multiclass Queueing Networks with State-Dependent Routing
- Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
Cited in
(14)- scientific article; zbMATH DE number 45760 (Why is no real title available?)
- Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
- Decomposition property in a discrete-time queue with multiple input streams and service interruptions
- Norton's theorem and insensitivity
- Multiclass Queueing Networks with State-Dependent Routing
- On queueing-inventory-location problems
- Queue decomposition \& finite closed queueing network models
- Decomposition-Based Queueing Network Analysis with FiFiQueues
- Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models
- scientific article; zbMATH DE number 3850800 (Why is no real title available?)
- scientific article; zbMATH DE number 1535815 (Why is no real title available?)
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
- Design of fork-join networks of First-In-First-out and infinite-server queues applied to clinical chemistry laboratories
- The decomposition of a communication network considering traffic demand interrelations
This page was built for publication: Decomposition and aggregation in queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997682)