Entropy Maximisation and Open Queueing Networks with Priority and Blocking.
dc.contributor.author | Kouvatsos, Demetres D. | * |
dc.contributor.author | Awan, Irfan U. | * |
dc.date.accessioned | 2009-07-21T10:46:58Z | |
dc.date.available | 2009-07-21T10:46:58Z | |
dc.date.issued | 2003 | |
dc.identifier.citation | Kouvatsos, D.D. and Awan, I.U. (2003). Entropy Maximisation and Open Queueing Networks with Priority and Blocking. Performance Evaluation. Vol. 51, No. 2-4, pp. 191-227. | en |
dc.identifier.uri | http://hdl.handle.net/10454/3084 | |
dc.description | No | en |
dc.description.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>1) distinct priority classes, compound Poisson arrival processes (CPPs) with geometrically distributed batches and generalised exponential (GE) service times is analysed via entropy maximisation, subject to suitable GE-type queueing theoretic constraints, under preemptive resume (PR) and head-of-line (HOL) scheduling rules combined with complete buffer sharing (CBS) and partial buffer sharing (PBS) management schemes stipulating a sequence of buffer thresholds {N=(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. | en |
dc.language.iso | en | en |
dc.subject | Queueing network models (QNMs); | en |
dc.subject | Maximum entropy (ME) principle | en |
dc.subject | Preemptive resume (PR) rule | en |
dc.subject | Head-of-line (HOL) rule | en |
dc.subject | Complete buffer sharing (CBS) scheme | en |
dc.subject | Partial buffer sharing (PBS) scheme | en |
dc.subject | Compound Poisson process (CPP); | en |
dc.subject | Generalised exponential (GE) distribution | en |
dc.subject | Blocking-after-service (BAS) mechanism | en |
dc.subject | Repetitive service blocking with random (RS-RD) or fixed (RS-RD) destination mechanism | en |
dc.title | Entropy Maximisation and Open Queueing Networks with Priority and Blocking. | en |
dc.status.refereed | Yes | en |
dc.type | Article | en |
dc.type.version | published version paper | en |
dc.identifier.doi | https://doi.org/10.1016/S0166-5316(02)00092-5 |