Analytical method for determining the characteristics of stochastic networks with different classes of messages

DOI10.1007/BF01068325zbMATH Open0754.60098OpenAlexW1998334797MaRDI QIDQ4007367FDOQ4007367

Authors: A. I. Gerasimov 

Publication date: 27 September 1992

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01068325

Recommendations

• Integral method for calculating closed queueing networks
• scientific article; zbMATH DE number 3941237
• Optimization of closed queueing networks with several classes of messages
• scientific article; zbMATH DE number 3941235
• scientific article; zbMATH DE number 870457

zbMATH Keywords

optimization problemsclosed stochastic networks

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cites Work

• Computational algorithms for closed queueing networks with exponential servers
• Title not available (Why is that?)
• A note on cycle times in tree-like queueing networks
• Technical Note—On Normalizing Constants in Queueing Networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational Model of a Closed Queuing Network with Exponential Servers
• Title not available (Why is that?)

This page was built for publication: Analytical method for determining the characteristics of stochastic networks with different classes of messages

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