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

Subdiffusive Load Balancing in Time-Varying Queueing Systems

Author

Listed:
  • Rami Atar

    (The Viterbi Faculty of Electrical Engineering, Technion-Israel Institute of Technology, Haifa 32000, Israel)

  • Isaac Keslassy

    (The Viterbi Faculty of Electrical Engineering, Technion-Israel Institute of Technology, Haifa 32000, Israel)

  • Gal Mendelson

    (The Viterbi Faculty of Electrical Engineering, Technion-Israel Institute of Technology, Haifa 32000, Israel)

Abstract

Load-balancing algorithms for systems that operate in heavy traffic are known to lead, under suitable conditions, to state space collapse (SSC). This term refers to the phenomenon whereby imbalance is negligible compared with queue lengths. Specifically, whereas queue lengths behave diffusively, the size of imbalance is at a subdiffusive scale: denoting by n the usual scaling parameter, the former and the latter are of order O ( n 1/2 ) and o ( n 1/2 ) , respectively. In this paper we consider load balancing for time-varying systems. SSC results and the standard techniques on which they are based do not apply to these systems, which (a) are not in heavy traffic, thus queue lengths may reach levels as high as O ( n ) , and (b) have time-varying traffic intensities that cause transitions between underloaded, critically loaded and overloaded regimes. Our results extend SSC far beyond the heavy traffic setting, by establishing subdiffusive [i.e., o ( n 1/2 ) ] balance for time-varying systems. To exhibit the breadth of the described phenomenon, the results address three load-balancing models. The first is the power of d choices [SQ( d )], where arrivals from a single stream are routed to the shortest among d randomly chosen queues, where 1 < d ≤ N and N denotes the fixed number of queues in the system. The second is redundancy-d [R( d )], where jobs are replicated d times and simultaneously routed to d randomly chosen queues. All, but the first, replica to be admitted into service are canceled. The third model is the longest queue first (LQF), where a single resource is shared by N job classes, and the job that receives service is always selected from the queue that is longest. As an application of these results, asymptotic optimality of SQ( d ) and R( d ) is shown, with an optimality guarantee of order o ( n 1/2 ) in the aforementioned framework, where, in particular, queue sizes may reach O ( n ) . Moreover, in the special case of the standard heavy traffic setting, the results are shown to yield new, explicit sufficient conditions for SSC.

Suggested Citation

  • Rami Atar & Isaac Keslassy & Gal Mendelson, 2019. "Subdiffusive Load Balancing in Time-Varying Queueing Systems," Operations Research, INFORMS, vol. 67(6), pages 1678-1698, November.
  • Handle: RePEc:inm:oropre:v:67:y:2019:i:6:p:1678-1698
    DOI: 10.1287/opre.2019.1851
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/opre.2019.1851
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2019.1851?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
    ---><---

    References listed on IDEAS

    as
    1. Golshid Baharian & Tolga Tezcan, 2011. "Stability analysis of parallel server systems under longest queue first," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(2), pages 257-279, October.
    2. Lawrence Brown & Noah Gans & Avishai Mandelbaum & Anat Sakov & Haipeng Shen & Sergey Zeltyn & Linda Zhao, 2005. "Statistical Analysis of a Telephone Call Center: A Queueing-Science Perspective," Journal of the American Statistical Association, American Statistical Association, vol. 100, pages 36-50, March.
    3. Avi Mandelbaum & William A. Massey, 1995. "Strong Approximations for Time-Dependent Queues," Mathematics of Operations Research, INFORMS, vol. 20(1), pages 33-64, February.
    4. William A. Massey, 1985. "Asymptotic Analysis of the Time Dependent M/M/1 Queue," Mathematics of Operations Research, INFORMS, vol. 10(2), pages 305-327, May.
    5. Avi Mandelbaum & Kavita Ramanan, 2010. "Directional Derivatives of Oblique Reflection Maps," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 527-558, August.
    6. Hong Chen & Heng-Qing Ye, 2012. "Asymptotic Optimality of Balanced Routing," Operations Research, INFORMS, vol. 60(1), pages 163-179, February.
    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. Avi Mandelbaum & Kavita Ramanan, 2010. "Directional Derivatives of Oblique Reflection Maps," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 527-558, August.
    2. Defraeye, Mieke & Van Nieuwenhuyse, Inneke, 2016. "Staffing and scheduling under nonstationary demand for service: A literature review," Omega, Elsevier, vol. 58(C), pages 4-25.
    3. Avishai Mandelbaum & Petar Momčilović, 2008. "Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 561-586, August.
    4. Gianmarco Bet & Remco van der Hofstad & Johan S. H. van Leeuwaarden, 2019. "Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 821-864, August.
    5. G. Bet, 2020. "An alternative approach to heavy-traffic limits for finite-pool queues," Queueing Systems: Theory and Applications, Springer, vol. 95(1), pages 121-144, June.
    6. Jamol Pender, 2017. "Sampling the Functional Kolmogorov Forward Equations for Nonstationary Queueing Networks," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 1-17, February.
    7. Elvin Coban & Aliza Heching & Alan Scheller‐Wolf, 2019. "Service Center Staffing with Cross‐Trained Agents and Heterogeneous Customers," Production and Operations Management, Production and Operations Management Society, vol. 28(4), pages 788-809, April.
    8. Avishai Mandelbaum & Petar Momčilović, 2017. "Personalized queues: the customer view, via a fluid model of serving least-patient first," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 23-53, October.
    9. Rouba Ibrahim & Pierre L'Ecuyer, 2013. "Forecasting Call Center Arrivals: Fixed-Effects, Mixed-Effects, and Bivariate Models," Manufacturing & Service Operations Management, INFORMS, vol. 15(1), pages 72-85, May.
    10. Nabil Channouf & Pierre L’Ecuyer & Armann Ingolfsson & Athanassios Avramidis, 2007. "The application of forecasting techniques to modeling emergency medical system calls in Calgary, Alberta," Health Care Management Science, Springer, vol. 10(1), pages 25-45, February.
    11. Achal Bassamboo & J. Michael Harrison & Assaf Zeevi, 2006. "Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method," Operations Research, INFORMS, vol. 54(3), pages 419-435, June.
    12. Rouba Ibrahim & Ward Whitt, 2011. "Wait-Time Predictors for Customer Service Systems with Time-Varying Demand and Capacity," Operations Research, INFORMS, vol. 59(5), pages 1106-1118, October.
    13. Alex Roubos & Ger Koole & Raik Stolletz, 2012. "Service-Level Variability of Inbound Call Centers," Manufacturing & Service Operations Management, INFORMS, vol. 14(3), pages 402-413, July.
    14. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    15. Barrow, Devon K., 2016. "Forecasting intraday call arrivals using the seasonal moving average method," Journal of Business Research, Elsevier, vol. 69(12), pages 6088-6096.
    16. Kinshuk Jerath & Anuj Kumar & Serguei Netessine, 2015. "An Information Stock Model of Customer Behavior in Multichannel Customer Support Services," Manufacturing & Service Operations Management, INFORMS, vol. 17(3), pages 368-383, July.
    17. Achal Bassamboo & Assaf Zeevi, 2009. "On a Data-Driven Method for Staffing Large Call Centers," Operations Research, INFORMS, vol. 57(3), pages 714-726, June.
    18. Dietz, Dennis C., 2011. "Practical scheduling for call center operations," Omega, Elsevier, vol. 39(5), pages 550-557, October.
    19. Weiwei Fan & L. Jeff Hong & Xiaowei Zhang, 2020. "Distributionally Robust Selection of the Best," Management Science, INFORMS, vol. 66(1), pages 190-208, January.
    20. Zhang, Ping & Serban, Nicoleta, 2007. "Discovery, visualization and performance analysis of enterprise workflow," Computational Statistics & Data Analysis, Elsevier, vol. 51(5), pages 2670-2687, February.

    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:67:y:2019:i:6:p:1678-1698. 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: 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.