IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v51y2000i2d10.1057_palgrave.jors.2600885.html
   My bibliography  Save this article

An approximation method for general closed queuing networks with Fork/Join mechanisms

Author

Listed:
  • B Baynat

    (Université Pierre et Marie Curie)

  • Y Dallery

    (Université Pierre et Marie Curie)

Abstract

Queuing networks with Fork/Join mechanisms are encountered in modelling and analysis of parallel computer systems and computer/communication networks. Exact analytical solutions of such networks are not available. In particular, due to the Fork/Join mechanisms, these networks do not have a product-form solution. As a result, approximation methods that can provide accurate estimates of the performance parameters are of high interest. The purpose of this paper is to propose such an approximation method that applies to a fairly general class of closed queuing networks with Fork/Join mechanisms. The method is based on the use of a product-form approximation technique. Numerical results are provided that show that the accuracy of the method is fairly good.

Suggested Citation

  • B Baynat & Y Dallery, 2000. "An approximation method for general closed queuing networks with Fork/Join mechanisms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(2), pages 198-208, February.
    • Handle: RePEc:pal:jorsoc:v:51:y:2000:i:2:d:10.1057_palgrave.jors.2600885
    DOI: 10.1057/palgrave.jors.2600885
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600885
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600885?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Erkut Sönmez & Alan Scheller-Wolf & Nicola Secomandi, 2017. "An Analytical Throughput Approximation for Closed Fork/Join Networks," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 251-267, May.

    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:pal:jorsoc:v:51:y:2000:i:2:d:10.1057_palgrave.jors.2600885. 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.palgrave-journals.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.