Limits of applicability of approximate methods of design of queuing networks

MaRDI QIDQ918376zbMATH OpenFDO

Authors S. M. Porotskij

Publication date 1989

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

sensitivitydecompositionasymptotic estimatesapproximate method

Mathematics Subject Classification ID

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

Recommendations

• Approximate method of design of open nonexponential queueing networks of finite capacity with losses or blocking
• scientific article; zbMATH DE number 4203688
• Analysis and calculation of queueing networks using the two-dimensional diffusion approximation
• Approximate analysis of load dependent general queueing networks
• scientific article; zbMATH DE number 3876361

Cited in

(7)

• Approximate method of design of open nonexponential queueing networks of finite capacity with losses or blocking
• scientific article; zbMATH DE number 4045131 (Why is no real title available?)
• Bounds for Design Parameters in Queues
• Analytic error bounds for approximations of queueing networks with an application to alternate routing
• scientific article; zbMATH DE number 220141 (Why is no real title available?)
• Qeueing models for performance analysis: Selection of single station models
• Method of polynomial approximation for analysis of computer systems and networks

This page was built for publication: Limits of applicability of approximate methods of design of queuing networks

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