Use this URL to cite or link to this record in EThOS:
Title: General queueing networks with priorities : maximum entropy analysis of general queueing network models with priority pre-emptive resume or head-of-line and non-priority based service disciplines
Author: Tabet Aouel, Nasreddine
ISNI:       0000 0001 3495 3617
Awarding Body: University of Bradford
Current Institution: University of Bradford
Date of Award: 1989
Availability of Full Text:
Access from EThOS:
Access from Institution:
Priority based scheduling disciplines are widely used by existing computer operating systems. However, the mathematical analysis and modelling of these systems present great difficulties since priority schedulling is not compatible with exact product form solutions of queueing network models (QNM's). It is therefore, necessary to employ credible approximate techniques for solving QNM's with priority classes. The principle of maximum entropy (ME) is a method of inference for estimating a probability distribution given prior information in the form of expected values. This principle is applied, based on marginal utilisation, mean queue length and idle state probability constraints, to characterise new product-form approximations for general open and closed QNM's with priority (preemptive-resume, non-preemtive head-of-line) and non-priority (first-come-first-served, processor-sharing, last-come-first-served with, or without preemtion) servers. The ME solutions are interpreted in terms of a decomposition of the original network into individual stable GIG11 queueing stations with assumed renewal arrival processes. These solutions are implemented by making use of the generalised exponential (GE) distributional model to approximate the interarrival-time and service-time distributions in the network. As a consequence the ME queue length distribution of the stable GE/GEzl priority queue, subject to mean value constraints obtained via classical queueing theory on bulk queues, is used as a 'building block' together with corresponding universal approximate flow formulae for the analysis of general QNM's with priorities. The credibility of the ME method is demonstrated with illustrative numerical examples and favourable comparisons against exact, simulation and other approximate methods are made.
Supervisor: Kouvatsos, Demetres D. Sponsor: Algerian government
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: Scheduling discipline ; Priority class ; Maximum entropy ; Preemptive resume ; Head-of-line ; Generalised exponential ; Queueing network