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

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...

Full description

Bibliographic Details

Published in:	IEEE/ACM transactions on networking Vol. 32; no. 2; pp. 1435 - 1450
Main Authors:	Chaturvedi, Anya, Chekuri, Chandra, Liu, Mengxue, Richa, Andrea W., Rost, Matthias, Schmid, Stefan, Weber, Jamison
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.04.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Approximation Approximation algorithms Communication networks Directed graphs Graph theory IEEE transactions Linear programming Mathematical analysis Multicommodity flows network optimization Optimization Polynomials randomized and approximation algorithms Routing Throughput
ISSN:	1063-6692, 1558-2566
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!