Computational algorithms for product form queueing networks

DOI10.1145/359015.359020MaRDI QIDQ3886857zbMATH OpenOpenAlexFDO

Authors K. Mani Chandy, Charles H. Sauer

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

zbMATH Keywords

algorithmsperformance evaluationproduct form queueing networks

Mathematics Subject Classification ID

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

Cited in

(6)

• Theory of queuing networks and its applications to the analysis of information-computing systems
• Exact solutions for open, closed and mixed queueing networks with rejection blocking
• Fleet-sizing and service availability for a vehicle rental system via closed queueing networks
• Exact-order asymptotic analysis for closed queueing networks
• Performance bounds for stochastic timed Petri nets
• Capacity analysis of sequential zone picking systems

This page was built for publication: Computational algorithms for product form queueing networks

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