IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v79y1998i0p231-26910.1023-a1018922705462.html
   My bibliography  Save this article

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

Author

Listed:
  • Demetres Kouvatsos
  • Irfan-Ullah Awan

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

Suggested Citation

  • Demetres Kouvatsos & Irfan-Ullah Awan, 1998. "MEM for arbitrary closed queueing networks with RS-blocking and multiple job classes," Annals of Operations Research, Springer, vol. 79(0), pages 231-269, January.
    • Handle: RePEc:spr:annopr:v:79:y:1998:i:0:p:231-269:10.1023/a:1018922705462
    DOI: 10.1023/A:1018922705462
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018922705462
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018922705462?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:79:y:1998:i:0:p:231-269:10.1023/a:1018922705462. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.