Approximate mean value analysis algorithms for queuing networks

DOI10.1145/79147.214074MaRDI QIDQ3477947zbMATH OpenOpenAlexWikidataFDO

Authors J. L. Teele, Krishna R. Pattipati, Michael M. Kostreva

Publication date 1990

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/79147.214074

zbMATH Keywords

convex programmingsystemsprimal-dual algorithmsmean value analysisthroughput boundsmodeling techniquesclosed product-form queueing networksperformance ofSchweitzer-Bard approximation

Mathematics Subject Classification ID

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

Recommendations

• An analysis of an approximation algorithm for queueing networks
• scientific article; zbMATH DE number 3845312
• Mean Value Analysis Approximation for multiple server queueing networks
• PAM—A noniterative approximate solution method for closed multichain queueing networks
• Experiments with improved approximate mean value analysis algorithms

Cited in

(9)

• Mean Value Analysis Approximation for multiple server queueing networks
• PAM—A noniterative approximate solution method for closed multichain queueing networks
• scientific article; zbMATH DE number 3845312 (Why is no real title available?)
• A note on stable flow-equivalent aggregation in closed networks
• LN: a flexible algorithmic framework for layered queueing network analysis
• An analysis of an approximation algorithm for queueing networks
• Optimizing large on-demand transportation systems through stochastic conic programming
• The correction terms in approximate mean value analysis
• Experiments with improved approximate mean value analysis algorithms

This page was built for publication: Approximate mean value analysis algorithms for queuing networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3477947)