IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v45y1997i2p309-314.html
   My bibliography  Save this article

Instability of the Join-the-Shortest-Queue and FCFS Policies in Queueing Systems and Their Stabilization

Author

Listed:
  • Ali Sharifnia

    (Boston University, Boston, Massachusetts)

Abstract

We demonstrate the instability of the “join-the-shortest-queue” routing policy and the “first-come-first-served” dispatching policy for a multiclass single-station queuing system with multiple nonidentical servers. Although instability is demonstrated in a deterministic setting, we have found strong evidence that it is not limited to this setting. The phenomenon that leads to instability is different from the one reported recently in the literature for nonacyclic systems, namely, servers starvation. The systems considered here are acyclic, and instability is caused by the failure of the policies to assign jobs to servers in an efficient manner. A modification to the investigated policies is proposed to make them stable. The modified policies (called guided policies ) provide an oversight control that ensure efficient utilization of the servers and hence stability.

Suggested Citation

  • Ali Sharifnia, 1997. "Instability of the Join-the-Shortest-Queue and FCFS Policies in Queueing Systems and Their Stabilization," Operations Research, INFORMS, vol. 45(2), pages 309-314, April.
    • Handle: RePEc:inm:oropre:v:45:y:1997:i:2:p:309-314
    DOI: 10.1287/opre.45.2.309
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.2.309
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.45.2.309?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
    ---><---

    Citations

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


    Cited by:

    1. Ali K. Parlaktürk & Sunil Kumar, 2004. "Self-Interested Routing in Queueing Networks," Management Science, INFORMS, vol. 50(7), pages 949-966, July.
    2. Hyytiä, Esa & Penttinen, Aleksi & Aalto, Samuli, 2012. "Size- and state-aware dispatching problem with queue-specific job sizes," European Journal of Operational Research, Elsevier, vol. 217(2), pages 357-370.
    3. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.

    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:inm:oropre:v:45:y:1997:i:2:p:309-314. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.