MEM for arbitrary closed queueing networks with RS-blocking and multiple job classes

Demetres Kouvatsos and Irfan-Ullah Awan

Annals of Operations Research, 1998, vol. 79, issue 0, 269 pages

Abstract: A new product-form approximation, based on the method of entropy maximisation (MEM), is characterised for arbitrary closed queueing networks with multiple and distinct classes of jobs, Generalised Exponential (GE) service times, mixed service disciplines, complete buffer sharing and repetitive-service blocking with both fixed (RS-FD) and random destinations (RS-RD). The maximum entropy (ME) approximation implies decomposition of the network into individual multiple class GE/GE/1/N queues satisfying constraints on population and flow conservation which is, in turn, truncated and efficiently implemented by a general convolution recursive procedure for the efficient calculation of the normalising constant and typical performance metrics. A relationship between MEM and reversible closed multiple class queueing networks is identified and it is shown how the ME approximation reduces to the exact solution. Numerical validation experiments against simulation are included to demonstrate the credibility of ME results. Copyright Kluwer Academic Publishers 1998

Keywords: Queueing Network Model (QNM); Maximum Entropy (ME) principle; Generalised Exponential (GE) distribution; multiple job classes; mixed service disciplines; complete buffer sharing; repetitive-service blocking with fixed (RS-FD) or random (RS-RD) destination (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018922705462 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:79:y:1998:i:0:p:231-269:10.1023/a:1018922705462

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018922705462

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().