IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v100y2022i3d10.1007_s11134-022-09803-5.html
   My bibliography  Save this article

Rates of convergence of the join the shortest queue policy for large-system heavy traffic

Author

Listed:
  • Debankur Mukherjee

    (Georgia Institute of Technology)

Abstract

No abstract is available for this item.

Suggested Citation

  • Debankur Mukherjee, 2022. "Rates of convergence of the join the shortest queue policy for large-system heavy traffic," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 317-319, April.
    • Handle: RePEc:spr:queues:v:100:y:2022:i:3:d:10.1007_s11134-022-09803-5
    DOI: 10.1007/s11134-022-09803-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-022-09803-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-022-09803-5?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Varun Gupta & Neil Walton, 2019. "Load Balancing in the Nondegenerate Slowdown Regime," Operations Research, INFORMS, vol. 67(1), pages 281-294, January.
    2. Anton Braverman, 2020. "Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 1069-1103, August.
    3. Patrick Eschenfeldt & David Gamarnik, 2018. "Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 867-886, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Daniela Hurtado-Lange & Siva Theja Maguluri, 2022. "A load balancing system in the many-server heavy-traffic asymptotics," Queueing Systems: Theory and Applications, Springer, vol. 101(3), pages 353-391, August.
    2. Rami Atar & David Lipshutz, 2021. "Heavy Traffic Limits for Join-the-Shortest-Estimated-Queue Policy Using Delayed Information," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 268-300, February.
    3. Anton Braverman, 2020. "Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 1069-1103, August.
    4. Debankur Mukherjee & Sem C. Borst & Johan S. H. van Leeuwaarden & Philip A. Whiting, 2020. "Asymptotic Optimality of Power-of- d Load Balancing in Large-Scale Systems," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1535-1571, November.
    5. Jonatha Anselmi & Francois Dufour, 2020. "Power-of- d -Choices with Memory: Fluid Limit and Optimality," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 862-888, August.
    6. Sem Borst, 2022. "Load balancing in large-scale heterogeneous systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 397-399, April.
    7. Danielle Tibi, 2019. "Martingales and buffer overflow for the symmetric shortest queue model," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 153-190, October.
    8. Varun Gupta & Neil Walton, 2019. "Load Balancing in the Nondegenerate Slowdown Regime," Operations Research, INFORMS, vol. 67(1), pages 281-294, January.
    9. Zhong, Zhiheng & Cao, Ping, 2023. "Balanced routing with partial information in a distributed parallel many-server queueing system," European Journal of Operational Research, Elsevier, vol. 304(2), pages 618-633.

    More about this item

    Statistics

    Access and download statistics

    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:queues:v:100:y:2022:i:3:d:10.1007_s11134-022-09803-5. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.