Show simple item record

dc.contributor.authorKouvatsos, Demetres D.*
dc.contributor.authorAwan, Irfan U.*
dc.date.accessioned2009-07-21T10:46:58Z
dc.date.available2009-07-21T10:46:58Z
dc.date.issued2003
dc.identifier.citationKouvatsos, 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.urihttp://hdl.handle.net/10454/3084
dc.descriptionNoen
dc.description.abstractA 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.isoenen
dc.relation.isreferencedbyhttp://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6V13-46WPNY4-3-J4&_cdi=5663&_user=122861&_orig=search&_coverDate=02%2F28%2F2003&_sk=999489997&view=c&wchp=dGLbVtz-zSkWz&md5=f4a7235ccba96404cf0954cf89f9cd99&ie=/sdarticle.pdfen
dc.subjectQueueing network models (QNMs);en
dc.subjectMaximum entropy (ME) principleen
dc.subjectPreemptive resume (PR) ruleen
dc.subjectHead-of-line (HOL) ruleen
dc.subjectComplete buffer sharing (CBS) schemeen
dc.subjectPartial buffer sharing (PBS) schemeen
dc.subjectCompound Poisson process (CPP);en
dc.subjectGeneralised exponential (GE) distributionen
dc.subjectBlocking-after-service (BAS) mechanismen
dc.subjectRepetitive service blocking with random (RS-RD) or fixed (RS-RD) destination mechanismen
dc.titleEntropy Maximisation and Open Queueing Networks with Priority and Blocking.en
dc.status.refereedYesen
dc.typeArticleen
dc.type.versionpublished version paperen


This item appears in the following Collection(s)

Show simple item record