Analysis of Open Discrete Time Queueing Networks: A Refined Decomposition Approach
From MaRDI portal
Recommendations
Cited in
(10)- On decomposition of closed networks with dependent service times
- Point and interval estimation of decomposition error in discrete-time open tandem queues
- Kronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizes
- Decomposition-Based Queueing Network Analysis with FiFiQueues
- Decomposition of open queueing networks with batch service
- A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tails
- Refined mean‐field approximation for discrete‐time queueing networks with blocking
- Analysis of semi-open queueing network with correlated arrival process and multi-server nodes
- A unified framework for approximation of general telecommunication networks
- The QNET method for two-moment analysis of open queueing networks
This page was built for publication: Analysis of Open Discrete Time Queueing Networks: A Refined Decomposition Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717122)