{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:32:26Z","timestamp":1740123146612,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"FWO","award":["G033119N"],"award-info":[{"award-number":["G033119N"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11134-023-09897-5","type":"journal-article","created":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T14:01:48Z","timestamp":1700056908000},"page":"291-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Join-Up-To(m): improved hyperscalable load balancing"],"prefix":"10.1007","volume":"105","author":[{"given":"Grzegorz","family":"Kielanski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Hellemans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5955-8493","authenticated-orcid":false,"given":"Benny","family":"Van Houdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,15]]},"reference":[{"key":"9897_CR1","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1016\/j.peva.2011.07.015","volume":"68","author":"Y Lu","year":"2011","unstructured":"Lu, Y., Xie, Q., Kliot, G., Geller, A., Larus, J.R., Greenberg, A.: Join-idle-queue: a novel load balancing algorithm for dynamically scalable web services. Perform. Eval. 68, 1056\u20131071 (2011). https:\/\/doi.org\/10.1016\/j.peva.2011.07.015","journal-title":"Perform. Eval."},{"issue":"4","key":"9897_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s11134-015-9448-8","volume":"80","author":"AL Stolyar","year":"2015","unstructured":"Stolyar, A.L.: Pull-based load distribution in large-scale heterogeneous service systems. Queueing Syst. 80(4), 341\u2013361 (2015). https:\/\/doi.org\/10.1007\/s11134-015-9448-8","journal-title":"Queueing Syst."},{"issue":"4","key":"9897_CR3","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1109\/TPDS.2019.2950621","volume":"31","author":"J Anselmi","year":"2020","unstructured":"Anselmi, J.: Combining size-based load balancing with round-robin for scalable low latency. IEEE Trans. Parallel Distrib. Syst. 31(4), 886\u2013896 (2020). https:\/\/doi.org\/10.1109\/TPDS.2019.2950621","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"9897_CR4","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.orl.2020.04.006","volume":"48","author":"M Van der Boor","year":"2020","unstructured":"Van der Boor, M., Zubeldia, M., Borst, S.: Zero-wait load balancing with sparse messaging. Oper. Res. Lett. 48(3), 368\u2013375 (2020). https:\/\/doi.org\/10.1016\/j.orl.2020.04.006","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9897_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/stsy.2017.0008","volume":"44","author":"D Gamarnik","year":"2016","unstructured":"Gamarnik, D., Tsitsiklis, J.N., Zubeldia, M.: Delay, memory, and messaging tradeoffs in distributed service systems. ACM SIGMETRICS Perf. Evaluat. Rev. 44(1), 1\u201312 (2016). https:\/\/doi.org\/10.1287\/stsy.2017.0008","journal-title":"ACM SIGMETRICS Perf. Evaluat. Rev."},{"issue":"1","key":"9897_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3322205.3311075","volume":"3","author":"M Van der Boor","year":"2019","unstructured":"Van der Boor, M., Borst, S., van Leeuwaarden, J.: Hyper-scalable JSQ with sparse feedback. Proc. ACM Meas. Anal. Comput. Syst. 3(1), 1\u201337 (2019). https:\/\/doi.org\/10.1145\/3322205.3311075","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"key":"9897_CR7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3221283","author":"T Hellemans","year":"2022","unstructured":"Hellemans, T., Kielanski, G., Van Houdt, B.: Performance of load balancers with bounded maximum queue length in case of non-exponential job sizes. IEEE\/ACM Trans. Netw. (2022). https:\/\/doi.org\/10.1109\/TNET.2022.3221283","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9897_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1145\/1811039.1811071","volume":"2010","author":"M Bramson","year":"2010","unstructured":"Bramson, M., Lu, Y., Prabhakar, B.: Randomized load balancing with general service time distributions. ACM Sigmetrics 2010, 275\u2013286 (2010). https:\/\/doi.org\/10.1145\/1811039.1811071","journal-title":"ACM Sigmetrics"},{"key":"9897_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11134-021-09686-y","volume":"98","author":"S Shneer","year":"2021","unstructured":"Shneer, S., Stolyar, A.: Large-scale parallel server system with multi-component jobs. Queueing Syst. 98, 21\u201348 (2021). https:\/\/doi.org\/10.1007\/s11134-021-09686-y","journal-title":"Queueing Syst."},{"issue":"3","key":"9897_CR10","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/moor.2019.1014","volume":"45","author":"J Anselmi","year":"2020","unstructured":"Anselmi, J., Dufour, F.: Power-of-d-choices with memory: fluid limit and optimality. Math. Oper. Res. 45(3), 862\u2013888 (2020). https:\/\/doi.org\/10.1287\/moor.2019.1014","journal-title":"Math. Oper. Res."},{"key":"9897_CR11","doi-asserted-by":"publisher","DOI":"10.1145\/3224422","author":"T Hellemans","year":"2018","unstructured":"Hellemans, T., Van Houdt, B.: On the power-of-d-choices with least loaded server selection. Proc. ACM Meas. Anal. Comput. Syst. (2018). https:\/\/doi.org\/10.1145\/3224422","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"issue":"1","key":"9897_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/3084454","volume":"1","author":"N Gast","year":"2017","unstructured":"Gast, N.: Expected values estimated via mean-field approximation are 1\/N-accurate. Proc. ACM Meas. Anal. Comput. Syst. 1(1), 17 (2017). https:\/\/doi.org\/10.1145\/3084454","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"key":"9897_CR13","doi-asserted-by":"publisher","DOI":"10.1002\/9781118625651","volume-title":"Fundamentals of Queueing Theory","author":"D Gross","year":"2008","unstructured":"Gross, D., Shortle, J.F., Thompson, J.M., Harris, C.M.: Fundamentals of Queueing Theory, 4th edn. Wiley-Interscience, New York (2008)","edition":"4"},{"issue":"6","key":"9897_CR14","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.1287\/opre.32.6.1368","volume":"32","author":"SW Fuhrmann","year":"1984","unstructured":"Fuhrmann, S.W.: A note on the M\/G\/1 queue with server vacations. Oper. Res. 32(6), 1368\u20131373 (1984)","journal-title":"Oper. Res."},{"issue":"5","key":"9897_CR15","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1287\/opre.33.5.1117","volume":"33","author":"SW Fuhrmann","year":"1985","unstructured":"Fuhrmann, S.W., Cooper, R.B.: Stochastic decompositions in the M\/G\/1 queue with generalized vacations. Oper. Res. 33(5), 1117\u20131129 (1985)","journal-title":"Oper. Res."},{"key":"9897_CR16","volume-title":"Matrix-Geometric Solutions in Stochastic Models: an Algorithmic Approach","author":"MF Neuts","year":"1981","unstructured":"Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: an Algorithmic Approach. John Hopkins University Press, Baltimore (1981)"},{"key":"9897_CR17","doi-asserted-by":"crossref","unstructured":"Kurtz, T.G.: Approximation of Population Processes. Approximation of Population Processes, vol. nrs. 36-40. SIAM, (1981). https:\/\/books.google.be\/books?id=XbDd8SIYzFYC","DOI":"10.1137\/1.9781611970333"},{"issue":"12","key":"9897_CR18","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.peva.2012.07.003","volume":"69","author":"N Gast","year":"2012","unstructured":"Gast, N., Gaujal, B.: Markov chains with discontinuous drifts have differential inclusion limits. Perform. Eval. 69(12), 623\u2013642 (2012)","journal-title":"Perform. Eval."},{"key":"9897_CR19","unstructured":"Cohen, J.W.: The Single Server Queue, 2 sub edn. North-Holland Series in Applied Mathematics and Mechanics 8. North-Holland, Amsterdam,The Netherlands (1982)"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-023-09897-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11134-023-09897-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-023-09897-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T12:05:33Z","timestamp":1700913933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11134-023-09897-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":19,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["9897"],"URL":"https:\/\/doi.org\/10.1007\/s11134-023-09897-5","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"type":"print","value":"0257-0130"},{"type":"electronic","value":"1572-9443"}],"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}