Entropy maximisation and open queueing networks with priorities and blocking

  • Authors:

  • Demetres Kouvatsos;Irfan Awan

  • Affiliations:

  • Performance Modelling and Engineering Research Group, Department of Computing, University of Bradford, Bradford, UK BD7 IDP;Performance Modelling and Engineering Research Group, Department of Computing, University of Bradford, Bradford, UK BD7 IDP

  • Venue:
  • Performance Evaluation
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A review is carried out on the characterisation and algorithmic implementation of an extended product-form approximation, based on the principle of maximum entropy (ME), for a wide class of arbitrary finite capacity open queueing network models (QNMs) with service and space priorities. A single server finite capacity GE/GE/1/N queue with R (R N1, ..., NR), 0 Ni ≤ Ni-1, i = 2 ..., R}. The GE/GE/1/N queue is utilised, in conjunction with GE-type first two moment flow approximation formulae, as a cost-effective building block towards the establishment of a generic ME queue-by-queue decomposition algorithm for arbitrary open QNMs with space and service priorities under repetitive service blocking with random destination (RS-RD). Typical numerical results are included to illustrate the credibility of the ME algorithm against simulation for various network topologies and define experimentally pessimistic GE-type performance bounds. Remarks on the extensions of the ME algorithm to other types of blocking mechanisms, such as repetitive service blocking with fixed destination (RS-FD) and blocking-after-service (BAS), are included.