{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T20:18:17Z","timestamp":1783109897874,"version":"3.54.6"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,5,1]],"date-time":"2027-05-01T00:00:00Z","timestamp":1809129600000},"content-version":"am","delay-in-days":304,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-23-1-0350"],"award-info":[{"award-number":["FA9550-23-1-0350"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008725","name":"National Agency for Research and Innovation","doi-asserted-by":"publisher","award":["PD_NAC_2024_1_182118"],"award-info":[{"award-number":["PD_NAC_2024_1_182118"]}],"id":[{"id":"10.13039\/100008725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.orl.2026.107458","type":"journal-article","created":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:57:17Z","timestamp":1777474637000},"page":"107458","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Geometric lower bounds for the steady-state occupancy of processing networks with limited connectivity"],"prefix":"10.1016","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7212-0309","authenticated-orcid":false,"given":"Diego","family":"Goldsztajn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0134-5548","authenticated-orcid":false,"given":"Andres","family":"Ferragut","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.orl.2026.107458_bib0001","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1137\/20M1323746","article-title":"Scalable load balancing in networked systems: a survey of recent advances","volume":"64","author":"van der Boor","year":"2022","journal-title":"SIAM Rev."},{"issue":"1","key":"10.1016\/j.orl.2026.107458_bib0002","first-page":"20","article-title":"Queueing system with selection of the shortest of two queues: an asymptotic approach","volume":"32","author":"Vvedenskaya","year":"1996","journal-title":"Probl. Peredachi Informatsii"},{"issue":"10","key":"10.1016\/j.orl.2026.107458_bib0003","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1109\/71.963420","article-title":"The power of two choices in randomized load balancing","volume":"12","author":"Mitzenmacher","year":"2001","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"11","key":"10.1016\/j.orl.2026.107458_bib0004","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1016\/j.peva.2011.07.015","article-title":"Join-idle-queue: a novel load balancing algorithm for dynamically scalable web services","volume":"68","author":"Lu","year":"2011","journal-title":"Perform. Eval."},{"key":"10.1016\/j.orl.2026.107458_bib0005","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s11134-015-9448-8","article-title":"Pull-based load distribution in large-scale heterogeneous service systems","volume":"80","author":"Stolyar","year":"2015","journal-title":"Queueing Syst."},{"issue":"4","key":"10.1016\/j.orl.2026.107458_bib0006","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1287\/stsy.2018.0016","article-title":"Universality of power-of-d load balancing in many-server systems","volume":"8","author":"Mukherjee","year":"2018","journal-title":"Stoch. Syst."},{"key":"10.1016\/j.orl.2026.107458_bib0007","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF01159224","article-title":"Optimality of routing and servicing in dependent parallel processing systems","volume":"9","author":"Menich","year":"1991","journal-title":"Queueing Syst."},{"key":"10.1016\/j.orl.2026.107458_bib0008","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/3214634","article-title":"Extremal properties of the shortest\/longest non-full queue policies in finite-capacity systems with state-dependent service rates","volume":"30","author":"Sparaggis","year":"1993","journal-title":"J. Appl. Probab."},{"issue":"2","key":"10.1016\/j.orl.2026.107458_bib0009","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/2825236.2825263","article-title":"The power of two choices on graphs: the pair-approximation is accurate?","volume":"43","author":"Gast","year":"2015","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"issue":"1","key":"10.1016\/j.orl.2026.107458_bib0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3179417","article-title":"Asymptotically optimal load balancing topologies","volume":"2","author":"Mukherjee","year":"2018","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"issue":"3","key":"10.1016\/j.orl.2026.107458_bib0011","doi-asserted-by":"crossref","first-page":"1740","DOI":"10.1214\/18-AAP1437","article-title":"Supermarket model on graphs","volume":"29","author":"Budhiraja","year":"2019","journal-title":"Ann. Appl. Probab."},{"issue":"3","key":"10.1016\/j.orl.2026.107458_bib0012","first-page":"1","article-title":"Optimal load balancing with locality constraints","volume":"4","author":"Weng","year":"2020","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"issue":"1","key":"10.1016\/j.orl.2026.107458_bib0013","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1287\/moor.2022.1258","article-title":"Load balancing under strict compatibility constraints","volume":"48","author":"Rutten","year":"2023","journal-title":"Math. Oper. Res."},{"issue":"6","key":"10.1016\/j.orl.2026.107458_bib0014","doi-asserted-by":"crossref","first-page":"5228","DOI":"10.1214\/24-AAP2090","article-title":"Mean-field analysis for load balancing on spatial graphs","volume":"34","author":"Rutten","year":"2024","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/j.orl.2026.107458_bib0015","doi-asserted-by":"crossref","unstructured":"Z. Zhao, D. Mukherjee, R. Wu, Exploiting data locality to improve performance of heterogeneous server clusters, Stochastic Systems. INFORMS. 14 (3) (2024) 229\u2013272.arXiv preprint arXiv: 2211.16416.","DOI":"10.1287\/stsy.2022.0040"},{"key":"10.1016\/j.orl.2026.107458_bib0016","doi-asserted-by":"crossref","unstructured":"Z. Zhao, D. Mukherjee, Optimal rate-matrix pruning for large-scale heterogeneous systems, Queueing Systems. Springer. 110 (1) (2026) 16.arXiv preprint arXiv: 2306.00274.","DOI":"10.1007\/s11134-026-09971-8"},{"key":"10.1016\/j.orl.2026.107458_bib0017","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1023\/A:1019175812444","article-title":"On the stability of a partially accessible multi-station queue with state-dependent routing","volume":"29","author":"Foss","year":"1998","journal-title":"Queueing Syst."},{"issue":"2","key":"10.1016\/j.orl.2026.107458_bib0018","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3656018","article-title":"Server saturation in skewed networks","volume":"8","author":"Goldsztajn","year":"2024","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000556?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000556?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T19:39:24Z","timestamp":1783107564000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637726000556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":18,"alternative-id":["S0167637726000556"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2026.107458","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Geometric lower bounds for the steady-state occupancy of processing networks with limited connectivity","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2026.107458","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107458"}}