Approximate analysis of a Gordon-Newell like non-product-form queueing network

DOI10.1007/BF02024660zbMATH Open0788.90031MaRDI QIDQ1315344FDOQ1315344

Authors: V. Pereyra 

Publication date: 10 March 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3876361
• Approximate Analysis Of Bulk Closed Queueing Networks
• On a class of approximations for closed queueing networks
• An Approach to Analyzing the Behavior of Some Queueing Networks
• scientific article; zbMATH DE number 4203688

zbMATH Keywords

heuristictutorial

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Stochastic network models in operations research (90B15)

Cites Work

• On a class of approximations for closed queueing networks
• Closed Queuing Systems with Exponential Servers

This page was built for publication: Approximate analysis of a Gordon-Newell like non-product-form queueing network

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