Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms

DOI10.1147/RD.193.0283MaRDI QIDQ4065040zbMATH OpenOpenAlexFDO

Authors

Publication date 1975

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1147/rd.193.0283

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(16)

• 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
• Ersatzteilbemessung für reparierbare Geräte. Grundlegende Modelle und Verfahren
• Performance evaluation of cellular flexible manufacturing systems: A decomposition approach
• Validation of a computer performance model of the exponential queuing network family
• Entropy maximisation and queueing network models
• Efficient window flow control for high speed data networks with small buffers
• Computing performance measures in a multi-class multi-resource processor-shared loss system
• A discrete event system specification (DEVS)-based model of consanguinity
• Calculating the normalization constants in queueing networks
• Condensation in large closed Jackson networks
• Algunas relaciones entre modelos Marcovianos de redes de colas
• Multivariate point process models for response times in multiprogrammed systems
• Performance bounds for stochastic timed Petri nets
• A family of multiclass LCFS networks with a novel product-form solution
• Optimizing utilization under response time constraints

This page was built for publication: Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms

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