Use this URL to cite or link to this record in EThOS:
Title: Generalised analytic queueing network models : the need, creation, development and validation of mathematical and computational tools for the construction of analytic queueing network models capturing more critical system behaviour
Author: Almond, John
ISNI:       0000 0001 3418 1709
Awarding Body: University of Bradford
Current Institution: University of Bradford
Date of Award: 1988
Availability of Full Text:
Access from EThOS:
Access from Institution:
Modelling is an important technique in the comprehension and management of complex systems. Queueing network models capture most relevant information from computer system and network behaviour. The construction and resolution of these models is constrained by many factors. Approximations contain detail lost for exact solution and/or provide results at lower cost than simulation. Information at the resource and interactive command level is gathered with monitors under ULTRIX'. Validation studies indicate central processor service times are highly variable on the system. More pessimistic predictions assuming this variability are in part verified by observation. The utility of the Generalised Exponential (GE) as a distribution parameterised by mean and variance is explored. Small networks of GE service centres can be solved exactly using methods proposed for Generalised Stochastic Petri Nets. For two centre. systems of GE type a new technique simplifying the balance equations is developed. A very efficient "building bglloocbka"l. is presented for exactly solving two centre systems with service or transfer blocking, Bernoulli feedback and load dependent rate, multiple GE servers. In the tandem finite buffer algorithm the building block illustrates problems encountered modelling high variability in blocking networks. A parametric validation study is made of approximations for single class closed networks of First-Come-First-Served (FCFS) centres with general service times. The multiserver extension using the building block is validated. Finally the Maximum Entropy approximation is extended to FCFS centres with multiple chains and implemented with computationally efficient convolution.
Supervisor: Kouvatsos, Demetres D. Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: Queueing network models ; UNIX monitors, ; Coefficient of variation ; Two centre systems ; Approximation validation ; Multiple servers ; Blocking ; Multiple chains ; Convolution