Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands

Anya Chaturvedi, Chandra Chekuri, Andŕea W. Richa, Matthias Rost, Stefan Schmid, Jamison Weber

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)22-27
Number of pages6
JournalPerformance Evaluation Review
Issue number3
StatePublished - Dec 2021

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands'. Together they form a unique fingerprint.

Cite this