In this study the maximum entropy formalism [JAYN 57] is suggested
as an alternative theory for general queueing systems of computer
performance analysis. The motivation is to overcome some of the
problems arising in this field and to extend the scope of the results
derived in the context of Markovian queueing theory.
For the M/G/l model a unique maximum entropy solution., satisfying
locALl balance is derived independent of any assumptions about the service
time distribution. However, it is shown that this solution is identical
to the steady state solution of the underlying Marko-v process when the
service time distribution is of the generalised exponential (CE) type.
(The GE-type distribution is a mixture of an exponential term and a unit
impulse function at the origin). For the G/M/1 the maximum entropy
solution is identical in form to that of the underlying Markov process,
but a GE-type distribution still produces the maximum overall similar
distributions.
For the GIG11 model there are three main achievements:
first, the spectral methods are extended to give exaft formulae for
the average number of customers in the system for any G/G/l with rational
Laplace transform. Previously, these results are obtainable only through
simulation and approximation methods.
(ii) secondly, a maximum entropy model is developed and used to obtain
unique solutions for some types of the G/G/l. It is also discussed how
these solutions can be related to the corresponding stochastic processes.
(iii) the importance of the G/GE/l and the GE/GE/l for the analysis of
general networks is discussed and some flow processes for these systems
are characterised.
For general queueing networks it is shown that the maximum entropy
solution is a product of the maximum entropy solutions of the individual
nodes. Accordingly, existing computational algorithms are extended to
cover general networks with FCFS disciplines. Some implementations are
suggested and a flow algorithm is derived. Finally, these results are
iised to improve existing aggregation methods.
In addition, the study includes a number of examples, comparisons,
surveys, useful comments and conclusions.
| Identifer | oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/3743 |
| Date | January 1983 |
| Creators | El-Affendi, Mohamed A. |
| Contributors | Kouvatsos, Demetres D. |
| Publisher | University of Bradford, Postgraduate School of Studies in Computing |
| Source Sets | Bradford Scholars |
| Language | English |
| Detected Language | English |
| Type | Thesis, doctoral, PhD |
| Rights | <a rel="license" href="http://creativecommons.org/licenses/by-nc-nd/3.0/"><img alt="Creative Commons License" style="border-width:0" src="http://i.creativecommons.org/l/by-nc-nd/3.0/88x31.png" /></a><br />The University of Bradford theses are licenced under a <a rel="license" href="http://creativecommons.org/licenses/by-nc-nd/3.0/">Creative Commons Licence</a>. |
Page generated in 0.0025 seconds