MRE hierarchical decomposition of general queueing network models
DOI10.1007/BF01178507zbMath0699.90040OpenAlexW2041783183MaRDI QIDQ913642
Panagiotis J. Tomaras, Demetres D. Kouvatsos
Publication date: 1991
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01178507
closed queueing networkhierarchical decompositionmean queue lengthflow conservationinfinite capacity queuesMinimum Relative Entropymultilevel variable aggregationsubparallelism
Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (2)
Cites Work
- Unnamed Item
- Maximum entropy and the G/G/1/N queue
- Properties of cross-entropy minimization
- Multilevel aggregation of central server models: a minimum relative entropy approach
- Approximate Analysis of General Queuing Networks
- Decomposability, instabilities, and saturation in multiprogramming systems
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Exact Aggregation in Exponential Queueing Networks
- Approximate Analysis of General Queuing Networks by Decomposition
- Aggregation of Variables in Dynamic Systems
This page was built for publication: MRE hierarchical decomposition of general queueing network models