IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4419-6472-4_10.html
   My bibliography  Save this book chapter

Stability of Join-the-Shortest-Queue networks: Analysis by Fluid Limits

In: Queueing Networks

Author

Listed:
  • J. G. Dai

    (Georgia Institute of Technology)

  • John J. Hasenbein

    (University of Texas at Austin)

  • Bara Kim

    (Korea University)

Abstract

The standard fluid model tool is employed to investigate stability behavior in a variant of a generalized Jackson queueing network. In the network, some customers use a join-the-shortest-queue policy when entering the network or moving to the next station. Furthermore, we allow interarrival and service times to have general distributions. For networks with two stations, necessary and sufficient conditions are given for positive Harris recurrence of the network process. These conditions involve only the mean values of the network primitives. Two counterexamplesare provided to show that more information on distributions and tie-breaking probabilities is needed for networks with more than two stations, in order to characterize the stability of such systems. However, if the routing probabilities in the network satisfy a certain homogeneity condition, then it is proved that the stability behavior can be explicitly determined, again using the mean value parameters of the network.

Suggested Citation

  • J. G. Dai & John J. Hasenbein & Bara Kim, 2011. "Stability of Join-the-Shortest-Queue networks: Analysis by Fluid Limits," International Series in Operations Research & Management Science, in: Richard J. Boucherie & Nico M. Dijk (ed.), Queueing Networks, chapter 10, pages 461-487, Springer.
    • Handle: RePEc:spr:isochp:978-1-4419-6472-4_10
    DOI: 10.1007/978-1-4419-6472-4_10
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:isochp:978-1-4419-6472-4_10. 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.