Multilevel aggregation of central server models: a minimum relative entropy approach

DOI10.1080/00207729208949245zbMath0747.60087OpenAlexW2025164870MaRDI QIDQ3992167

Panagiotis J. Tomaras, Demetres D. Kouvatsos

Publication date: 28 June 1992

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729208949245

zbMATH Keywords

infinite capacity queueshierarchical decomposition algorithmprinciple of minimum relative entropyproduct- form

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Inference from stochastic processes (62M99)

Related Items (3)

MRE hierarchical decomposition of general queueing network models ⋮ Analytical forms for most likely matrices derived from incomplete information ⋮ Entropy maximisation and queueing network models

Cites Work

• MRE hierarchical decomposition of general queueing network models
• A maximum entropy analysis of the M/G/1 and G/M/1 queueing systems at equilibrium
• An Approximate Analytical Method for General Queueing Networks
• Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
• An Extension of Norton's Theorem for Queueing Networks
• Approximate Analysis of General Queuing Networks
• Approximate Analysis of Central Server Models
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Exact Aggregation in Exponential Queueing Networks
• Computational algorithms for closed queueing networks with exponential servers
• Aggregation of Variables in Dynamic Systems

This page was built for publication: Multilevel aggregation of central server models: a minimum relative entropy approach