Approximate Analysis of General Queuing Networks

DOI10.1147/RD.191.0043zbMATH Open0293.90021OpenAlexW2066866933MaRDI QIDQ4045860FDOQ4045860

Authors:

Publication date: 1975

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

Full work available at URL: https://semanticscholar.org/paper/a4e518171169a120c7b6c30bebc90dec10a2d74b

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Stochastic network models in operations research (90B15)

Cited In (20)

• Multitype multiprogramming models
• An analytical model for loss estimation in network traffic analysis systems
• Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
• Heuristic analysis of closed queueing networks
• Theory of queuing networks and its applications to the analysis of information-computing systems
• Performance bounds for modeling NUMA architectures
• On queueing network models of flexible manufacturing systems
• Maximum entropy two-station cyclic queues with multiple general servers
• Multilevel aggregation of central server models: a minimum relative entropy approach
• Air traffic management: High-low traffic intensity analysis
• A universal building block for the approximate analysis of a shared buffer ATM switch architecture
• Entropy maximisation and queueing network models
• Firms, queues, and coffee breaks: a flow model of corporate activity with delays
• Modeling and design of container terminal operations
• MRE hierarchical decomposition of general queueing network models
• Capacity planning of a perinatal network with generalised loss network model with overflow
• Performance evaluation for general queueing networks in manufacturing systems: characterizing the trade-off between queue time and utilization
• Probabilistic models of computer systems. I: Exact results
• Validation of a computer performance model of the exponential queuing network family
• The exponentialization approach to flexible manufacturing system models with general processing times

This page was built for publication: Approximate Analysis of General Queuing Networks

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