Decomposition of general queueing network models. An investigation into the implementation of hierarchical decomposition schemes of general closed queueing network models using the principle of minimum relative entropy subject to fully decomposable constraints.
AuthorTomaras, Panagiotis J.
SupervisorKouvatsos, Demetres D.
Queueing network models
Rights© 1989 Tomaras, P. J. This work is licensed under a Creative Commons Attribution-Non-Commercial-Share-Alike License (http://creativecommons.org/licenses/by-nc-nd/2.0/uk).
InstitutionUniversity of Bradford
DepartmentPostgraduate School of Studies in Computing