Exact Aggregation in Exponential Queueing Networks
From MaRDI portal
Publication:4170243
DOI10.1145/322092.322102zbMATH Open0388.68050OpenAlexW1963883479MaRDI QIDQ4170243FDOQ4170243
Authors: H. Vantilborgh 
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322092.322102
Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Cited In (8)
- NORTON'S THEOREM FOR BATCH ROUTING QUEUEING NETWORKS
- A New Algorithm for Computing the Ergodic Probability Vector for Large Markov Chains
- A generalization of Norton's theorem for queueing networks
- Theory of queuing networks and its applications to the analysis of information-computing systems
- Multilevel aggregation of central server models: a minimum relative entropy approach
- Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques
- Entropy maximisation and queueing network models
- MRE hierarchical decomposition of general queueing network models
This page was built for publication: Exact Aggregation in Exponential Queueing Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170243)
