Computational algorithms for product form queueing networks
From MaRDI portal
Publication:3886857
DOI10.1145/359015.359020zbMath0443.68027OpenAlexW2005002355MaRDI QIDQ3886857
Charles H. Sauer, K. Mani Chandy
Publication date: 1980
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359015.359020
Related Items (6)
Exact-Order Asymptotic Analysis for Closed Queueing Networks ⋮ Exact solutions for open, closed and mixed queueing networks with rejection blocking ⋮ Performance bounds for stochastic timed Petri nets ⋮ Capacity Analysis of Sequential Zone Picking Systems ⋮ Fleet-sizing and service availability for a vehicle rental system via closed queueing networks ⋮ Theory of queuing networks and its applications to the analysis of information-computing systems
This page was built for publication: Computational algorithms for product form queueing networks