{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:47:44Z","timestamp":1767340064492,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,3,22]],"date-time":"2022-03-22T00:00:00Z","timestamp":1647907200000},"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":[[2022,3,22]]},"abstract":"<jats:p>Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem-the all-or-nothing multicommodity flow (ANF) problem - in arbitrary directed graphs and in the practically relevant but challenging setting where demands can be (much) larger than the edge capacities. Hence, in addition to assigning requests to valid flows for each routed commodity, an admission control mechanism is required which prevents overloading the network when routing commodities.<\/jats:p>","DOI":"10.1145\/3529113.3529121","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T22:30:42Z","timestamp":1648247442000},"page":"22-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands"],"prefix":"10.1145","volume":"49","author":[{"given":"Anya","family":"Chaturvedi","sequence":"first","affiliation":[{"name":"Arizona State U., USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chandra","family":"Chekuri","sequence":"additional","affiliation":[{"name":"U. of Illinois at Urbana-Champaign, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00b4ea W.","family":"Richa","sequence":"additional","affiliation":[{"name":"Arizona State U., USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Rost","sequence":"additional","affiliation":[{"name":"TU Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"Univesity of Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamison","family":"Weber","sequence":"additional","affiliation":[{"name":"Arizona State U., USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,3,25]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-010-2455-9"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"e_1_2_1_3_1","volume-title":"Improved bi-criteria approximation for the all-or-nothing multicommodity flow problem in arbitrary networks. CoRR, abs\/2005.04533","author":"Chaturvedi A.","year":"2021","unstructured":"A. Chaturvedi , C. Chekuri , A. W. Richa , M. Rost , S. Schmid , and J. Weber . Improved bi-criteria approximation for the all-or-nothing multicommodity flow problem in arbitrary networks. CoRR, abs\/2005.04533 , 2021 . A. Chaturvedi, C. Chekuri, A. W. Richa, M. Rost, S. Schmid, and J. Weber. Improved bi-criteria approximation for the all-or-nothing multicommodity flow problem in arbitrary networks. CoRR, abs\/2005.04533, 2021."},{"key":"e_1_2_1_4_1","volume-title":"The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Math. Program., 154(1--2):249--272","author":"Chekuri C.","year":"2015","unstructured":"C. Chekuri and A. Ene . The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Math. Program., 154(1--2):249--272 , 2015 . C. Chekuri and A. Ene. The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Math. Program., 154(1--2):249--272, 2015."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060618"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/100796820"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007383"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250816"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523685"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737402"},{"key":"e_1_2_1_11_1","volume-title":"Randomized algorithms","author":"Motwani Rajeev","year":"2010","unstructured":"Rajeev Motwani and Prabhakar Raghavan . Randomized algorithms . Chapman & Hall\/CRC , 2010 . Rajeev Motwani and Prabhakar Raghavan. Randomized algorithms. Chapman & Hall\/CRC, 2010."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1780374.1780385"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314212.3314214"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking.2018.8696623"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787472"},{"key":"e_1_2_1_17_1","volume-title":"The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems. CoRR, abs\/1504.00627","author":"Bruce Shepherd F.","year":"2015","unstructured":"F. Bruce Shepherd and A. Vetta . The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems. CoRR, abs\/1504.00627 , 2015 . F. Bruce Shepherd and A. Vetta. The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems. CoRR, abs\/1504.00627, 2015."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529113.3529121","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3529113.3529121","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:25Z","timestamp":1750182685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529113.3529121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,22]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3,22]]}},"alternative-id":["10.1145\/3529113.3529121"],"URL":"https:\/\/doi.org\/10.1145\/3529113.3529121","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2022,3,22]]},"assertion":[{"value":"2022-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}