IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i3p1862-1874.html
   My bibliography  Save this article

Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems

Author

Listed:
  • David Gamarnik

    (Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

  • John N. Tsitsiklis

    (Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachusetts, 02139)

  • Martin Zubeldia

    (Industrial and Systems Engineering Department, Georgia Institute of Technology, Atlanta, Georgia 30332)

Abstract

We consider a heterogeneous distributed service system consisting of n servers with unknown and possibly different processing rates. Jobs with unit mean arrive as a renewal process of rate proportional to n and are immediately dispatched to one of several queues associated with the servers. We assume that the dispatching decisions are made by a central dispatcher with the ability to exchange messages with the servers and endowed with a finite memory used to store information from one decision epoch to the next, about the current state of the queues and about the service rates of the servers. We study the fundamental resource requirements (memory bits and message exchange rate) in order for a dispatching policy to be always stable. First, we present a policy that is always stable while using a positive (but arbitrarily small) message rate and log 2 ( n ) bits of memory. Second, we show that within a certain broad class of policies, a dispatching policy that exchanges o ( n 2 ) messages per unit of time, and with o ( log ( n ) ) bits of memory, cannot be always stable.

Suggested Citation

  • David Gamarnik & John N. Tsitsiklis & Martin Zubeldia, 2022. "Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems," Mathematics of Operations Research, INFORMS, vol. 47(3), pages 1862-1874, August.
    • Handle: RePEc:inm:ormoor:v:47:y:2022:i:3:p:1862-1874
    DOI: 10.1287/moor.2021.1191
    as

    Download full text from publisher

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

    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:ormoor:v:47:y:2022:i:3:p:1862-1874. 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.