Model reduction of general queueing networks

A method of model reduction using the universal maximum entropy algorithm in conjunction with Norton's theorem for queueing networks is proposed for the analysis of large G-type distributed closed queueing networks. This method is called Norton-Maximum Entropy (N-ME) and has an advantage over t...

Full description

Saved in:
Bibliographic Details
Published in:International journal of systems science 1993-01, Vol.24 (1), p.183-192
Main Authors: KU-MAHAMUD, KU RUHANA, OTHMAN, ABU TALIB
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Queuing theory. Traffic theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A method of model reduction using the universal maximum entropy algorithm in conjunction with Norton's theorem for queueing networks is proposed for the analysis of large G-type distributed closed queueing networks. This method is called Norton-Maximum Entropy (N-ME) and has an advantage over the direct application of universal maximum entropy whereby the parametric study of a subset of queueing centres of interest can be done repeatedly without solving the entire network. The complexity of the original system is reduced into a flow equivalent two-stage load dependent queue. The marginal probability density function and various performance parameters of the two-stage load dependent queue can be obtained by using the maximum entropy analysis of the GE(n)/GE(n)/I/N queue.
ISSN:0020-7721
1464-5319
DOI:10.1080/00207729308949479