@article{76a36de431c842b38b908a64dcc41004,
title = "Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands",
abstract = "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.",
author = "Anya Chaturvedi and Chandra Chekuri and Richa, {And{\'r}ea W.} and Matthias Rost and Stefan Schmid and Jamison Weber",
note = "Funding Information: 1Arizona State U., USA. Research partially supported under NSF CCF-1637393 and CCF-1733680 and DoD-ARO MURI No.W911NF-19-1-0233 awards. 2U. of Illinois at Urbana-Champaign, USA. Partially supported by NSF grant CCF-1910149 3TU Berlin, Germany. 4Faculty of Computer Science, Univesity of Vienna, Austria; TU Berlin, Germany; and Fraunhofer SIT, Germany. Research supported by the ERC Consolidator project AdjustNet, grant agreement No. 864228. Publisher Copyright: {\textcopyright} 2022 Copyright is held by the owner/author(s).",
year = "2021",
month = dec,
doi = "10.1145/3529113.3529121",
language = "English (US)",
volume = "49",
pages = "22--27",
journal = "Performance Evaluation Review",
issn = "0163-5999",
publisher = "Association for Computing Machinery (ACM)",
number = "3",
}