IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v79y1998i0p207-22910.1023-a1018970621392.html
   My bibliography  Save this article

Throughput estimation in cyclic queueing networks with blocking

Author

Listed:
  • T. Tolio
  • S.B. Gershwin

Abstract

The paper presents a new approach for estimating the throughput of a closed queueing network with exponential servers, finite buffer capacity and a blocking after service discipline. The problem is tackled by decomposing the network. The population constraint is enforced by requiring that the sum of the expected number of customers in the various subsystems is equal to the population size. Each subsystem is analyzed as an M/M/1/C i+1 queue with state-dependent arrival and service rates. The rationale behind this last assumption is that the behavior of the system at a given time is affected by the history of blockings and starvations. The results obtained by applying the proposed algorithm to a set of test problems show a good agreement with those obtained with simulation, the difference on the maximum throughput of the network being of the order of 3%. The obtained results also compare favorably with those described in the literature. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • T. Tolio & S.B. Gershwin, 1998. "Throughput estimation in cyclic queueing networks with blocking," Annals of Operations Research, Springer, vol. 79(0), pages 207-229, January.
    • Handle: RePEc:spr:annopr:v:79:y:1998:i:0:p:207-229:10.1023/a:1018970621392
    DOI: 10.1023/A:1018970621392
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018970621392
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018970621392?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. Osorio, Carolina & Wang, Carter, 2017. "On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 305-339.
    2. Noa Zychlinski & Avishai Mandelbaum & Petar Momčilović, 2018. "Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection," Queueing Systems: Theory and Applications, Springer, vol. 89(1), pages 15-47, June.

    More about this item

    Statistics

    Access and download statistics

    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:207-229:10.1023/a:1018970621392. 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.