Abstract
The principle of Maximum Entropy (ME) provides a consistent method of inference for estimating the form of an unknown discrete-state probability distribution, based on information expressed in terms of true expected values. In this tutorial paper entropy maximisation is used to characterise product-form approximations and resolution algorithms for arbitrary continuous-time and discrete-time Queueing Network Models (QNMs) at equilibrium under Repetitive-Service (RS) blocking and Arrivals First (AF) or Departures First (DF) buffer management policies. An ME application to the performance modelling of a shared-buffer Asynchronous Transfer Mode (ATM) switch architecture is also presented. The ME solutions are implemented subject to Generalised Exponential (GE) and Generalised Geometric (GGeo) queueing theoretic mean value constraints, as appropriate. In this context, single server GE and GGeo type queues in conjunction with associated effective flow streams (departure, splitting, merging) are used as building blocks in the solution process. Physical interpretations of the results are given and extensions to the quantitative analysis of more complex queueing networks are discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
