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

Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling

Author

Listed:
  • Daniela Andrea Hurtado Lange

    (The College of William and Mary, Williamsburg, Virginia 23187)

  • Siva Theja Maguluri

    (Georgia Institute of Technology, Atlanta, Georgia 30332)

Abstract

We study the heavy-traffic limit of the generalized switch operating under MaxWeight, without assuming that the complete resource pooling condition is satisfied and allowing for correlated arrivals. The main contribution of this paper is the steady-state mean of linear combinations of queue lengths in heavy traffic. We showcase the generality of our result by presenting various stochastic networks as corollaries, each of which is a contribution by itself. In particular, we study the input-queued switch with correlated arrivals, and we show that, if the state space collapses to a full-dimensional subspace, the correlation among the arrival processes does not matter in heavy traffic. We exemplify this last case with a parallel-server system, an N -system, and an ad hoc wireless network. Whereas these results are obtained using the drift method, we additionally present a negative result showing a limitation of the drift method. We show that it is not possible to obtain the individual queue lengths using the drift method with polynomial test functions. We do this by presenting an alternate view of the drift method in terms of a system of linear equations, and we use this system of equations to obtain bounds on arbitrary linear combinations of the queue lengths.

Suggested Citation

  • Daniela Andrea Hurtado Lange & Siva Theja Maguluri, 2022. "Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling," Mathematics of Operations Research, INFORMS, vol. 47(4), pages 3129-3155, November.
    • Handle: RePEc:inm:ormoor:v:47:y:2022:i:4:p:3129-3155
    DOI: 10.1287/moor.2021.1248
    as

    Download full text from publisher

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