{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:56Z","timestamp":1772164076035,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T00:00:00Z","timestamp":1497398400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1234062"],"award-info":[{"award-number":["CMMI-1234062"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,14]]},"DOI":"10.1145\/2896377.2901478","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T09:57:38Z","timestamp":1465552658000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems"],"prefix":"10.1145","author":[{"given":"David","family":"Gamarnik","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John N.","family":"Tsitsiklis","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Zubeldia","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.49"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS.2008.4575205"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-AAP804"},{"issue":"4","key":"e_1_3_2_1_5_1","first-page":"1384","article-title":"Performance of multiclass markovian queueing networks via piecewise linear lyapunov functions","volume":"11","author":"Bertsimas D.","year":"2002","unstructured":"D. Bertsimas, D. Gamarnik, and J. Tsitsiklis. Performance of multiclass markovian queueing networks via piecewise linear lyapunov functions. The Annals of Applied Probability, 11(4):1384--1428, 2002.","journal-title":"The Annals of Applied Probability"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316962"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/1426671"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0225-4"},{"key":"e_1_3_2_1_9_1","first-page":"93","article-title":"Ordinary differential equations in locally convex spaces","volume":"49","author":"Lobanov S.","year":"1994","unstructured":"S. Lobanov and O. Smolyanov. Ordinary differential equations in locally convex spaces. Uspekhi Mat. Nauk, 49:93--168, 1994.","journal-title":"Uspekhi Mat. Nauk"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2011.07.015"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/924815"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652141"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.1991.261428"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-015-9448-8"},{"issue":"1","key":"e_1_3_2_1_15_1","first-page":"15","article-title":"Queueing system with selection of the shortest of two queues: an asymptotic approach","volume":"32","author":"Vvedenskaya N.","year":"1996","unstructured":"N. Vvedenskaya, R. Dobrushin, and F. Karpelevich. Queueing system with selection of the shortest of two queues: an asymptotic approach. Problems of Information Transmission, 32(1):15--27, 1996.","journal-title":"Problems of Information Transmission"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218487"}],"event":{"name":"SIGMETRICS '16: SIGMETRICS\/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems","location":"Antibes Juan-les-Pins France","acronym":"SIGMETRICS '16","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","IFIP"]},"container-title":["Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2896377.2901478","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2896377.2901478","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2896377.2901478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:41:39Z","timestamp":1763458899000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2896377.2901478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,14]]},"references-count":16,"alternative-id":["10.1145\/2896377.2901478","10.1145\/2896377"],"URL":"https:\/\/doi.org\/10.1145\/2896377.2901478","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2964791.2901478","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,6,14]]},"assertion":[{"value":"2016-06-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}