MRE hierarchical decomposition of general queueing network models

DOI10.1007/BF01178507MaRDI QIDQ913642zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

closed queueing networkflow conservationhierarchical decompositioninfinite capacity queuesmean queue lengthMinimum Relative Entropymultilevel variable aggregationsubparallelism

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queueing theory (aspects of probability theory) (60K25) Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)

Review text

The principle of Minimum Relative Entropy (MRE), given fully decomposable subset and aggregate mean queue length, utilisation and flow-balance constraints, is used in conjunction with asymptotic connections to infinite capacity queues, to derive new analytic approximations for the conditional and marginal state probabilities of single class general closed queueing network models (QNMs) in the context of a multilevel variable aggregation scheme. The concept of subparallelism is applied to preserve the flow conservation and a universal MRE hierarchical decomposition algorithm is proposed for the approximate analysis of arbitrary closed queueing networks with single server queues and general service-times. Heuristic criteria towards an optimal coupling of network's units at each level of aggregation are suggested. As an illustration, the MRE algorithm is implemented iteratively by using the Generalized Exponential (GE) distributional model to approximate the service and asymptotic flow processes in the network. This algorithm captures the exact solution of separable queueing networks, while for general queueing networks it compares favourably against exact solutions and known approximations.

Recommendations

• Multilevel aggregation of central server models: a minimum relative entropy approach
• Information theoretic decomposition of exponential-type closed queueing networks with finite capacity and multiple servers
• Equivalence and decomposition in queueing systems—A unified approach
• Entropy maximisation and queueing network models
• MEM for arbitrary closed queueing networks with RS-blocking and multiple job classes

Cites work

• Aggregation of Variables in Dynamic Systems
• Approximate Analysis of General Queuing Networks
• Approximate Analysis of General Queuing Networks by Decomposition
• Decomposability, instabilities, and saturation in multiprogramming systems
• Exact Aggregation in Exponential Queueing Networks
• scientific article; zbMATH DE number 3574935 (Why is no real title available?)
• Maximum entropy and the G/G/1/N queue
• Multilevel aggregation of central server models: a minimum relative entropy approach
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Properties of cross-entropy minimization

Cited in

(5)

• Entropy maximisation and queueing network models
• Arbitrary open queueing networks with server vacation periods and blocking
• Information theoretic decomposition of exponential-type closed queueing networks with finite capacity and multiple servers
• scientific article; zbMATH DE number 4106588 (Why is no real title available?)
• Multilevel aggregation of central server models: a minimum relative entropy approach

This page was built for publication: MRE hierarchical decomposition of general queueing network models

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