An analysis of an approximation algorithm for queueing networks
From MaRDI portal
Publication:3334074
Recommendations
- Approximate mean value analysis algorithms for queuing networks
- PAM—A noniterative approximate solution method for closed multichain queueing networks
- An Approach to Analyzing the Behavior of Some Queueing Networks
- Mean Value Analysis Approximation for multiple server queueing networks
- Experiments with improved approximate mean value analysis algorithms
Cited in
(18)- Mean Value Analysis Approximation for multiple server queueing networks
- An Approach to Analyzing the Behavior of Some Queueing Networks
- A new MVA-based approximation for closed queueing networks with a preemptive priority server
- PAM—A noniterative approximate solution method for closed multichain queueing networks
- Longest path analysis in networks of queues: dynamic scheduling problems
- The tree MVA algorithm
- scientific article; zbMATH DE number 3845312 (Why is no real title available?)
- scientific article; zbMATH DE number 3925942 (Why is no real title available?)
- scientific article; zbMATH DE number 3876361 (Why is no real title available?)
- Approximate Analysis Of Bulk Closed Queueing Networks
- Approximate mean value analysis algorithms for queuing networks
- Analysis of networks of the resource queuing systems
- Comparing LP Bounds for Queueing Networks
- Device utilizations in approximate MVA
- scientific article; zbMATH DE number 1129912 (Why is no real title available?)
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
- The correction terms in approximate mean value analysis
- Experiments with improved approximate mean value analysis algorithms
This page was built for publication: An analysis of an approximation algorithm for queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3334074)