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

Stability and Instability of the MaxWeight Policy

Author

Listed:
  • Maury Bramson

    (School of Mathematics, University of Minnesota, Minneapolis, Minnesota 55455)

  • Bernardo D’Auria

    (Departmento de Estadística, Universidad Carlos III de Madrid, 28903 Madrid, Spain)

  • Neil Walton

    (Department of Mathematics, University of Manchester, Manchester M13 9PL, United Kingdom)

Abstract

Consider a switched queueing network with general routing among its queues. The MaxWeight policy assigns available service by maximizing the objective function ∑ j Q j σ j among the different feasible service options, where Q j denotes queue size and σ j denotes the amount of service to be executed at queue j . MaxWeight is a greedy policy that does not depend on knowledge of arrival rates and is straightforward to implement. These properties and its simple formulation suggest MaxWeight as a serious candidate for implementation in the setting of switched queueing networks; MaxWeight has been extensively studied in the context of communication networks. However, a fluid model variant of MaxWeight was previously shown not to be maximally stable. Here, we prove that MaxWeight itself is not in general maximally stable. We also prove MaxWeight is maximally stable in a much more restrictive setting, and that a weighted version of MaxWeight, where the weighting depends on the traffic intensity, is always stable.

Suggested Citation

  • Maury Bramson & Bernardo D’Auria & Neil Walton, 2021. "Stability and Instability of the MaxWeight Policy," Mathematics of Operations Research, INFORMS, vol. 46(4), pages 1611-1638, November.
    • Handle: RePEc:inm:ormoor:v:46:y:2021:i:4:p:1611-1638
    DOI: 10.1287/moor.2020.1106
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2020.1106
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2020.1106?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:46:y:2021:i:4:p:1611-1638. 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.