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.

View/ Open
Tomoras.pdf (10.04Mb)
Download
Publication date
2010-02-08T15:43:20ZAuthor
Tomaras, Panagiotis J.Supervisor
Kouvatsos, Demetres D.Keyword
Decomposition methodsQueueing network models
Computer networks
Communication systems
Performance analysis
Rights

The University of Bradford theses are licenced under a Creative Commons Licence.
Institution
University of BradfordDepartment
Postgraduate School of Studies in ComputingAwarded
1989