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.
ASJC Scopus subject areas
- Hardware and Architecture
- Computer Networks and Communications