IDEAS home Printed from https://ideas.repec.org/p/tin/wpaper/20010107.html
   My bibliography  Save this paper

Simple Product-Form Bounds for Queueing Networks with Finite Clusters

Author

Listed:
  • Nico M. van Dijk

    (University of Amsterdam)

  • Erik van der Sluis

    (University of Amsterdam)

Abstract

This discussion paper resulted in a publication in 'Annals of Operations Research' . Queueing networks are studied with finite capacity constraints forclusters of stations. First, by an instructive tandemcluster example it is shown how a product-form modification methodfor networks with finite stations can be extended tonetworks with finite clusters. Next, a general result is establishedby which networks with finite clusters can be studied atcluster level by merely keeping track of the total number of jobs atthese clusters, that is, by regarding these clusters asaggregate stations. This result is of practical interest to concludesimple performance bounds at global network level. Anumber of illustrative examples with numerical support are provided.

Suggested Citation

  • Nico M. van Dijk & Erik van der Sluis, 2001. "Simple Product-Form Bounds for Queueing Networks with Finite Clusters," Tinbergen Institute Discussion Papers 01-107/4, Tinbergen Institute.
    • Handle: RePEc:tin:wpaper:20010107
    as

    Download full text from publisher

    File URL: https://papers.tinbergen.nl/01107.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Nico van Dijk, 1998. "Bounds and error bounds for queueing networks," Annals of Operations Research, Springer, vol. 79(0), pages 295-319, January.
    2. P. G. Taylor & N. M. Van Dijk, 1998. "Strong Stochastic Bounds for the Stationary Distribution of a Class of Multicomponent Performability Models," Operations Research, INFORMS, vol. 46(5), pages 665-674, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nico M. van Dijk & Masakiyo Miyazawa, 2004. "Error Bounds for Perturbing Nonexponential Queues," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 525-558, August.
    2. Nico Dijk, 2005. "On product form tandem structures," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(3), pages 429-436, December.
    3. Ana Bušić & Ingrid Vliegen & Alan Scheller-Wolf, 2012. "Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 259-287, May.
    4. Ke Fu & Vernon N. Hsu & Chung‐Yee Lee, 2011. "Approximation methods for the analysis of a multicomponent, multiproduct assemble‐to‐order system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(7), pages 685-704, October.
    5. van Dijk, Nico M., 2008. "Error bounds for state space truncation of finite Jackson networks," European Journal of Operational Research, Elsevier, vol. 186(1), pages 164-181, April.

    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:tin:wpaper:20010107. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Tinbergen Office +31 (0)10-4088900 (email available below). General contact details of provider: https://edirc.repec.org/data/tinbenl.html .

    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.