{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:01:29Z","timestamp":1750309289831,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T00:00:00Z","timestamp":1704240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2024,1,3]]},"abstract":"<jats:p>Stochastic Processing Networks (SPNs) [24] are ubiquitous in engineering with applications in Data Centers (eg. packet routing), Telecommunication (eg. call centers), Transportation, etc. Stochastic Matching Networks (SMNs) are newly emerging variation of SPNs where 'jobs' and 'servers' arrive in the system and are matched using a decision rule. SMNs have applications in Online matching markets (eg. uber platform), Healthcare (eg. kidney transplant), Quantum Networks, Assemble-to-order (eg. manufacturing plants) and many other crucial problems. The aim of my research is to design provably efficient decision-making policies for Stochastic Processing Networks (SPNs) and Stochastic Matching Networks (SMNs) and develop analytical tools to obtain performance guarantees on their throughput and delay.<\/jats:p>","DOI":"10.1145\/3639830.3639845","type":"journal-article","created":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T23:34:15Z","timestamp":1704497655000},"page":"33-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Design and Analysis of Stochastic Processing and Matching Networks"],"prefix":"10.1145","volume":"51","author":[{"given":"Prakirt Raj","family":"Jhunjhunwala","sequence":"first","affiliation":[{"name":"Columbia University, Columbia Business School, New York, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,1,5]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1145\/2408776.2408794"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1287\/msom.4.3.208.7753"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_1","DOI":"10.1109\/JSAC.2003.810496"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1287\/stsy.2019.0056"},{"key":"e_1_2_1_5_1","volume-title":"A load balancing system in the many-server heavy-traffic asymptotics. Queueing Systems, 101(3--4):353--391","author":"Hurtado-Lange D.","year":"2022","unstructured":"D. Hurtado-Lange and S. T. Maguluri. A load balancing system in the many-server heavy-traffic asymptotics. Queueing Systems, 101(3--4):353--391, 2022."},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.1287\/moor.2021.1248"},{"key":"e_1_2_1_7_1","volume-title":"Heavy traffic distribution of queueing systems without resource pooling. Preprint arXiv:2206.06504","author":"Jhunjhunwala P.","year":"2022","unstructured":"P. Jhunjhunwala and S. T. Maguluri. Heavy traffic distribution of queueing systems without resource pooling. Preprint arXiv:2206.06504, 2022."},{"key":"e_1_2_1_8_1","volume-title":"Exponential tail bounds on queues: A confluence of non-asymptotic heavy traffic and large deviations. arXiv preprint arXiv:2306.10187","author":"Jhunjhunwala P. R.","year":"2023","unstructured":"P. R. Jhunjhunwala, D. Hurtado-Lange, and S. T. Maguluri. Exponential tail bounds on queues: A confluence of non-asymptotic heavy traffic and large deviations. arXiv preprint arXiv:2306.10187, 2023."},{"key":"e_1_2_1_9_1","volume-title":"Low-complexity switch scheduling algorithms: Delay optimality in heavy traffic","author":"Jhunjhunwala P. R.","year":"2021","unstructured":"P. R. Jhunjhunwala and S. T. Maguluri. Low-complexity switch scheduling algorithms: Delay optimality in heavy traffic. IEEE\/ACM Transactions on Networking, 2021."},{"key":"e_1_2_1_10_1","volume-title":"Join-the-shortest queue with abandonment: Critically loaded and heavily overloaded regimes. arXiv preprint arXiv:2211.15050","author":"Jhunjhunwala P. R.","year":"2022","unstructured":"P. R. Jhunjhunwala, M. Zubeldia, and S. T. Maguluri. Join-the-shortest queue with abandonment: Critically loaded and heavily overloaded regimes. arXiv preprint arXiv:2211.15050, 2022."},{"issue":"1","key":"e_1_2_1_11_1","first-page":"41","volume":"113","author":"Koole G.","year":"2002","unstructured":"G. Koole and A. Mandelbaum. Queueing Models of Call Centers: An Introduction. Annals of Operations Research, 113(1\/4):41--59, 2002.","journal-title":"Queueing Models of Call Centers: An Introduction. Annals of Operations Research"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1287\/15-SSY193"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.1109\/26.780463"},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_1","DOI":"10.1287\/opre.30.4.680"},{"doi-asserted-by":"publisher","key":"e_1_2_1_15_1","DOI":"10.1016\/j.physrep.2019.10.001"},{"doi-asserted-by":"publisher","key":"e_1_2_1_16_1","DOI":"10.1109\/40.988685"},{"doi-asserted-by":"publisher","key":"e_1_2_1_17_1","DOI":"10.1109\/INFCOM.2002.1019350"},{"key":"e_1_2_1_18_1","volume-title":"Optimal scaling of average queue sizes in an input-queued switch: an open problem. Queueing Systems, 68(3--4):375--384","author":"Shah D.","year":"2011","unstructured":"D. Shah, J. N. Tsitsiklis, and Y. Zhong. Optimal scaling of average queue sizes in an input-queued switch: an open problem. Queueing Systems, 68(3--4):375--384, 2011."},{"key":"e_1_2_1_19_1","volume-title":"Optimal scaling of average queue sizes in an input-queued switch: an open problem. Queueing Systems, 68(3--4):375--384","author":"Shah D.","year":"2011","unstructured":"D. Shah, J. N. Tsitsiklis, and Y. Zhong. Optimal scaling of average queue sizes in an input-queued switch: an open problem. Queueing Systems, 68(3--4):375--384, 2011."},{"doi-asserted-by":"publisher","key":"e_1_2_1_20_1","DOI":"10.1109\/INFCOM.1998.665071"},{"doi-asserted-by":"publisher","key":"e_1_2_1_21_1","DOI":"10.1109\/9.182479"},{"doi-asserted-by":"publisher","key":"e_1_2_1_22_1","DOI":"10.1145\/3529113.3529141"},{"doi-asserted-by":"publisher","key":"e_1_2_1_23_1","DOI":"10.1007\/s11134-005-3282-3"},{"doi-asserted-by":"publisher","key":"e_1_2_1_24_1","DOI":"10.1146\/annurev-statistics-010814-020141"},{"doi-asserted-by":"publisher","key":"e_1_2_1_25_1","DOI":"10.1103\/PhysRevA.29.1419"},{"key":"e_1_2_1_26_1","volume-title":"Matching queues with abandonments in quantum switches: Stability and throughput analysis. arXiv preprint arXiv:2209.12324","author":"Zubeldia M.","year":"2023","unstructured":"M. Zubeldia, P. R. Jhunjhunwala, and S. T. Maguluri. Matching queues with abandonments in quantum switches: Stability and throughput analysis. arXiv preprint arXiv:2209.12324, 2023."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639830.3639845","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3639830.3639845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:24Z","timestamp":1750291404000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639830.3639845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,3]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,1,3]]}},"alternative-id":["10.1145\/3639830.3639845"],"URL":"https:\/\/doi.org\/10.1145\/3639830.3639845","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2024,1,3]]},"assertion":[{"value":"2024-01-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}