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

DOI10.1007/BF01068325zbMath0754.60098OpenAlexW1998334797MaRDI QIDQ4007367

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

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

• A note on cycle times in tree-like queueing networks
• Technical Note—On Normalizing Constants in Queueing Networks
• Computational Model of a Closed Queuing Network with Exponential Servers
• Computational algorithms for closed queueing networks with exponential servers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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