RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks

DOI10.1145/6490.6495zbMath0637.90038OpenAlexW2023980590MaRDI QIDQ3778518

Adrian E. Conway, Nicolas D. Georganas

Publication date: 1986

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

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

zbMATH Keywords

computer communication networksexact analysisdynamic scalingmean performance measuresproduct-form multiple-chain closed queueing networksrecursion by chain algorithm

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (7)

Mean value analysis of re-entrant line with batch machines and multi-class jobs ⋮ Separable models for interconnected production-inventory systems ⋮ Examples of Applications of Queueing Theory in Canada ⋮ Performance evaluation of cellular flexible manufacturing systems: A decomposition approach ⋮ Computational algorithms for blocking probabilities in circuit-switched networks ⋮ Performability assessment by model checking of Markov reward models ⋮ RECAL

This page was built for publication: RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks