Efficient decomposition methods for the analysis of multi-facility blocking models

DOI10.1145/179812.179838MaRDI QIDQ4310839zbMATH OpenOpenAlexWikidataFDO

Authors Adrian E. Conway, Eugene Pinsky, Srinivasan Tridandapani

Publication date 18 May 1995

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

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

zbMATH Keywords

circuit-switched networksdecomposition methodsparsitystochastic multi-facility blocking models

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• On Decomposition Methods for Tandem Queueing Networks with Blocking
• Analysis of multistation production systems with limited buffer capacity. I: The subsystem model
• Analysis of multistation production systems with limited buffer capacity. II: The decomposition method
• Exact computation of time and call blocking probabilities in large, multi-traffic, multi-resource loss systems
• Mean-value analysis of multi-facility blocking models with state-dependent arrivals

Cited in

(3)

• Computational complexity of loss networks
• Modeling the blocking phenomenon of service facilities
• Mean-value analysis of multi-facility blocking models with state-dependent arrivals

This page was built for publication: Efficient decomposition methods for the analysis of multi-facility blocking models

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