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

Celý popis

Podrobná bibliografia

Vydané v:	IEEE/ACM transactions on networking Ročník 32; číslo 2; s. 1435 - 1450
Hlavní autori:	Chaturvedi, Anya, Chekuri, Chandra, Liu, Mengxue, Richa, Andrea W., Rost, Matthias, Schmid, Stefan, Weber, Jamison
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.04.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!