IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v79y1998i0p181-20610.1023-a1018918604554.html
   My bibliography  Save this article

Performance evaluation of open queueing networks with arbitrary configuration and finite buffers

Author

Listed:
  • H.S. Lee
  • A. Bouhchouch
  • Y. Dallery
  • Y. Frein

Abstract

We consider an open queueing network consisting of servers linked in an arbitrary configuration with exponential service times and separated by intermediate finite buffers. The model allows any number of saturated servers (never starved) and exit servers (never blocked). The considered blocking mechanism is blocking-after-service. In the case of simultaneous blocking, blocked customers enter the destination node on a first-blocked-first-enter basis. If feedback loops exist in the network, deadlocks may arise. We assume that a deadlock is detected and resolved instantaneously by transferring all the blocked customers simultaneously. In this paper, we present an approximation method to analyze this kind of networks. The method decomposes the original network into subsystems. Each subsystem is composed of one or many upstream servers and one downstream server, separated by a finite buffer. The upstream and downstream servers are characterized by exponential service time distributions. Based on the symmetrical approach [2], we develop an algorithm to determine the unknown parameters corresponding to each subsystem. The class of models considered in this paper includes the class of open loss models for feed-forward networks considered by Lee and Pollock [11]. For this class of models, we can show that the system of equations in our algorithm is equivalent to the one used in the algorithm proposed by Lee and Pollock. As a result, our algorithm provides the same results as the algorithm of Lee and Pollock for this class of models. However, it is observed that our algorithm takes less CPU execution time than the one proposed by Lee and Pollock. For the cases of networks with feedback loops, extensive numerical experiments show that the new algorithm, in general, converges very fast and yields accurate results compared with those obtained by simulation as long as deadlocks do not occur too frequently. Moreover, for the merge configuration, we provide the proof of the convergence of the algorithm as well as the existence and uniqueness of the solution by exploiting the properties associated with a symmetric approach. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • H.S. Lee & A. Bouhchouch & Y. Dallery & Y. Frein, 1998. "Performance evaluation of open queueing networks with arbitrary configuration and finite buffers," Annals of Operations Research, Springer, vol. 79(0), pages 181-206, January.
    • Handle: RePEc:spr:annopr:v:79:y:1998:i:0:p:181-206:10.1023/a:1018918604554
    DOI: 10.1023/A:1018918604554
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018918604554
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018918604554?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. Haskose, A. & Kingsman, B. G. & Worthington, D., 2002. "Modelling flow and jobbing shops as a queueing network for workload control," International Journal of Production Economics, Elsevier, vol. 78(3), pages 271-285, August.
    2. D Worthington, 2009. "Reflections on queue modelling from the last 50 years," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 83-92, May.
    3. Saied Samiedaluie & Vedat Verter, 2019. "The impact of specialization of hospitals on patient access to care; a queuing analysis with an application to a neurological hospital," Health Care Management Science, Springer, vol. 22(4), pages 709-726, December.
    4. Osorio, Carolina & Bierlaire, Michel, 2009. "An analytic finite capacity queueing network model capturing the propagation of congestion and blocking," European Journal of Operational Research, Elsevier, vol. 196(3), pages 996-1007, August.

    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:181-206:10.1023/a:1018918604554. 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.