An analysis of an approximation algorithm for queueing networks

DOI10.1016/0166-5316(84)90012-9MaRDI QIDQ3334074zbMATH OpenOpenAlexFDO

Authors Derek L. Eager, K. C. Sevcik

Publication date 1984

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(84)90012-9

zbMATH Keywords

approximation algorithmsmean value analysisqueueing networks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

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

(19)

• The correction terms in approximate mean value analysis
• Analysis of networks of the resource queuing systems
• Device utilizations in approximate MVA
• Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
• scientific article; zbMATH DE number 3845312 (Why is no real title available?)
• scientific article; zbMATH DE number 3876361 (Why is no real title available?)
• Approximate mean value analysis algorithms for queuing networks
• The tree MVA algorithm
• scientific article; zbMATH DE number 3925942 (Why is no real title available?)
• Mean Value Analysis Approximation for multiple server 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
• MVA approximations for SJN scheduling
• An Approach to Analyzing the Behavior of Some Queueing Networks
• scientific article; zbMATH DE number 1129912 (Why is no real title available?)
• Experiments with improved approximate mean value analysis algorithms
• Approximate Analysis Of Bulk Closed Queueing Networks
• Comparing LP Bounds for Queueing Networks
• Longest path analysis in networks of queues: dynamic scheduling problems

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)