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

Saved in:
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!
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, mandating the need for splittable flows (i.e., flows may not follow a single path). Formally, the input for the ANF problem is an edge-capacitated directed graph where we have a given number of source-destination node-pairs with their respective demands and strictly positive weights. The goal is to route a maximum weight subset of the given pairs (i.e., the weighted throughput), respecting the edge capacities: A commodity is routed if all of its demand is routed from its respective source to destination (this is the all-or-nothing aspect). We present a polynomial-time bi-criteria approximation randomized rounding framework for this NP-hard problem that yields an arbitrarily good approximation on the weighted throughput while violating the edge capacity constraints by at most a sublogarithmic multiplicative factor. We present two non-trivial linear programming relaxations that can be used in the framework; the first uses a novel edge-flow formulation and the second uses a packing formulation. We demonstrate the "equivalence" of these formulations and then highlight the advantages of each of the two approaches. We complement our theoretical results with a proof of concept empirical evaluation, considering a variety of network scenarios.
AbstractList 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, mandating the need for splittable flows (i.e., flows may not follow a single path). Formally, the input for the ANF problem is an edge-capacitated directed graph where we have a given number of source-destination node-pairs with their respective demands and strictly positive weights. The goal is to route a maximum weight subset of the given pairs (i.e., the weighted throughput), respecting the edge capacities: A commodity is routed if all of its demand is routed from its respective source to destination (this is the all-or-nothing aspect). We present a polynomial-time bi-criteria approximation randomized rounding framework for this NP-hard problem that yields an arbitrarily good approximation on the weighted throughput while violating the edge capacity constraints by at most a sublogarithmic multiplicative factor. We present two non-trivial linear programming relaxations that can be used in the framework; the first uses a novel edge-flow formulation and the second uses a packing formulation. We demonstrate the "equivalence" of these formulations and then highlight the advantages of each of the two approaches. We complement our theoretical results with a proof of concept empirical evaluation, considering a variety of network scenarios.
Author Liu, Mengxue
Chekuri, Chandra
Weber, Jamison
Chaturvedi, Anya
Schmid, Stefan
Rost, Matthias
Richa, Andrea W.
Author_xml – sequence: 1
  givenname: Anya
  orcidid: 0000-0002-4071-0467
  surname: Chaturvedi
  fullname: Chaturvedi, Anya
  email: anya.chaturvedi@asu.edu
  organization: School of Computing and Augmented Intelligence, Arizona State University, Tempe, AZ, USA
– sequence: 2
  givenname: Chandra
  orcidid: 0000-0003-3035-1699
  surname: Chekuri
  fullname: Chekuri, Chandra
  email: chekuri@illinois.edu
  organization: Department of Computer Science, University of Illinois at Urbana-Champaign, Champaign, IL, USA
– sequence: 3
  givenname: Mengxue
  orcidid: 0000-0002-2321-2669
  surname: Liu
  fullname: Liu, Mengxue
  email: mengxue.liu@asu.edu
  organization: School of Computing and Augmented Intelligence, Arizona State University, Tempe, AZ, USA
– sequence: 4
  givenname: Andrea W.
  orcidid: 0000-0003-3592-3756
  surname: Richa
  fullname: Richa, Andrea W.
  email: aricha@asu.edu
  organization: School of Computing and Augmented Intelligence, Arizona State University, Tempe, AZ, USA
– sequence: 5
  givenname: Matthias
  orcidid: 0000-0002-2380-0284
  surname: Rost
  fullname: Rost, Matthias
  email: mrost@inet.tu-berlin.de
  organization: Observe Inc., San Mateo, CA, USA
– sequence: 6
  givenname: Stefan
  orcidid: 0000-0002-7798-1711
  surname: Schmid
  fullname: Schmid, Stefan
  email: schmiste@gmail.com
  organization: Department of Telecommunication Systems, Faculty IV, Technische Universität Berlin, Berlin, Germany
– sequence: 7
  givenname: Jamison
  orcidid: 0000-0002-9573-1783
  surname: Weber
  fullname: Weber, Jamison
  email: jwweber@asu.edu
  organization: School of Computing and Augmented Intelligence, Arizona State University, Tempe, AZ, USA
BookMark eNp9kE1PwjAYxxuDiYB-ABMPTTwP-7K27EgQlAQxMTMel63tWMm2Yttp-PaOwMF48PQ8h__vefmNwKC1rQbgFqMJxih5SDeLdEIQoRNKCYupuABDzNg0IozzQd8jTiPOE3IFRt7vEMIUET4Eb6tm7-yXVjCtnO221b4LsLQOzuo6si7a2FCZdgtfujoYaZvGKhMOcFnbbw8_TKjgzBUmuNwd4KNu8lb5a3BZ5rXXN-c6Bu_LRTp_jtavT6v5bB1JksQhEiWnVCVlkZNYSJUUTEiC8lwxQWgyTQhCVBQlLxKBNZ8iLSUTpZRC61hMlaJjcH-a2z_w2Wkfsp3tXNuvzCiKMSMk5qRPiVNKOuu902UmTciDsW1_tKkzjLKjwOwoMDsKzM4CexL_IffONP2j_zJ3J8ZorX_lKcYsxvQHzsZ-jg
CODEN IEANEP
CitedBy_id crossref_primary_10_3390_sym17081279
Cites_doi 10.1016/S0022-0000(03)00066-7
10.1145/2378956.2378964
10.1007/s00453-005-1167-9
10.1007/b135457
10.1007/BF02579324
10.1145/1250790.1250816
10.1287/opre.8.1.101
10.1137/100796820
10.1007/BF02523685
10.1002/net.20371
10.1145/1060590.1060618
10.1145/2829988.2787472
10.1145/3529113.3529121
10.1137/S0895480199361259
10.1137/1.9781611973730.93
10.1007/s10107-014-0856-z
10.1109/TNET.2017.2782006
10.1007/s00453-006-1210-5
10.1287/moor.2016.0782
10.1002/(SICI)1097-0037(199607)27:4<279::AID-NET3>3.0.CO;2-D
10.1007/s00493-010-2455-9
10.1109/tnet.2023.3325437
10.1145/2509413.2509416
10.4086/toc.2012.v008a006
10.1145/3188745.3188772
10.1145/3314212.3314214
10.23919/IFIPNetworking.2018.8696623
10.1002/net.10008
10.1137/15M1033708
10.1016/0022-0000(88)90003-7
10.1109/INFOCOM.2019.8737402
10.1201/9781584888239-c12
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TNET.2023.3325437
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2566
EndPage 1450
ExternalDocumentID 10_1109_TNET_2023_3325437
10311541
Genre orig-research
GrantInformation_xml – fundername: NSF
  grantid: CCF-1637393; CCF-1733680; CCF-1910149
  funderid: 10.13039/100000001
– fundername: DoD-Army Research Office (ARO) Multidisciplinary University Research Initiative (MURI)
  grantid: W911NF-19-1-0233
  funderid: 10.13039/100000005
GroupedDBID -DZ
-~X
.DC
0R~
29I
4.4
5GY
5VS
6IK
85S
8US
97E
9M8
AAJGR
AAKMM
AALFJ
AARMG
AASAJ
AAWTH
AAWTV
ABAZT
ABPPZ
ABQJQ
ABVLG
ACGFS
ACGOD
ACIWK
ACM
ADBCU
ADL
AEBYY
AEFXT
AEJOY
AENSD
AETEA
AETIX
AFWIH
AFWXC
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AIKLT
AKJIK
AKQYR
AKRVB
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BDXCO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CCLIF
CS3
D0L
EBS
EJD
FEDTE
GUFHI
HF~
HGAVV
HZ~
H~9
I07
ICLAB
IEDLZ
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
LHSKQ
M43
MVM
O9-
OCL
P1C
P2P
PQQKQ
RIA
RIE
RNS
ROL
TN5
UPT
UQL
VH1
XOL
YR2
ZCA
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c294t-7f633d9fba247cd9b57c20aad572398920037bf6b971e680ecc57fcc7ee478dd3
IEDL.DBID RIE
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001103659200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1063-6692
IngestDate Mon Jun 30 03:19:37 EDT 2025
Tue Nov 18 22:37:42 EST 2025
Sat Nov 29 03:05:27 EST 2025
Wed Aug 27 02:09:06 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c294t-7f633d9fba247cd9b57c20aad572398920037bf6b971e680ecc57fcc7ee478dd3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-2321-2669
0000-0002-9573-1783
0000-0002-2380-0284
0000-0003-3035-1699
0000-0003-3592-3756
0000-0002-7798-1711
0000-0002-4071-0467
PQID 3041522462
PQPubID 32020
PageCount 16
ParticipantIDs proquest_journals_3041522462
crossref_citationtrail_10_1109_TNET_2023_3325437
ieee_primary_10311541
crossref_primary_10_1109_TNET_2023_3325437
PublicationCentury 2000
PublicationDate 2024-April
2024-4-00
20240401
PublicationDateYYYYMMDD 2024-04-01
PublicationDate_xml – month: 04
  year: 2024
  text: 2024-April
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE/ACM transactions on networking
PublicationTitleAbbrev TNET
PublicationYear 2024
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref34
ref15
ref14
ref31
ref30
Bruce Shepherd (ref35) 2015
ref11
ref33
ref10
ref32
ref2
ref1
ref17
ref16
ref19
ref18
ref24
ref23
ref26
ref25
ref20
ref22
Webb (ref36)
ref21
ref28
ref27
ref29
ref8
ref7
ref9
ref4
ref3
ref6
ref5
Chekuri (ref12)
References_xml – ident: ref23
  doi: 10.1016/S0022-0000(03)00066-7
– ident: ref27
  doi: 10.1145/2378956.2378964
– ident: ref6
  doi: 10.1007/s00453-005-1167-9
– ident: ref18
  doi: 10.1007/b135457
– ident: ref31
  doi: 10.1007/BF02579324
– ident: ref15
  doi: 10.1145/1250790.1250816
– ident: ref17
  doi: 10.1287/opre.8.1.101
– ident: ref14
  doi: 10.1137/100796820
– year: 2015
  ident: ref35
  article-title: The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems
  publication-title: arXiv:1504.00627
– ident: ref21
  doi: 10.1007/BF02523685
– start-page: 65
  volume-title: Proc. ACM/IEEE Symp. Archit. Netw. Commun. Syst. (ANCS)
  ident: ref36
  article-title: Blender: Upgrading tenant-based data center networking
– ident: ref29
  doi: 10.1002/net.20371
– ident: ref13
  doi: 10.1145/1060590.1060618
– ident: ref34
  doi: 10.1145/2829988.2787472
– ident: ref10
  doi: 10.1145/3529113.3529121
– ident: ref19
  doi: 10.1137/S0895480199361259
– ident: ref3
  doi: 10.1137/1.9781611973730.93
– ident: ref11
  doi: 10.1007/s10107-014-0856-z
– ident: ref9
  doi: 10.1145/3529113.3529121
– ident: ref20
  doi: 10.1109/TNET.2017.2782006
– ident: ref7
  doi: 10.1007/s00453-006-1210-5
– ident: ref22
  doi: 10.1287/moor.2016.0782
– ident: ref25
  doi: 10.1002/(SICI)1097-0037(199607)27:4<279::AID-NET3>3.0.CO;2-D
– ident: ref4
  doi: 10.1007/s00493-010-2455-9
– ident: ref8
  doi: 10.1109/tnet.2023.3325437
– ident: ref2
  doi: 10.1145/2509413.2509416
– start-page: 3:1
  volume-title: Proc. 1st Symp. Simplicity Algorithms (SOSA)
  ident: ref12
  article-title: Congestion minimization for multipath routing via multiroute flows
– ident: ref5
  doi: 10.4086/toc.2012.v008a006
– ident: ref16
  doi: 10.1145/3188745.3188772
– ident: ref32
  doi: 10.1145/3314212.3314214
– ident: ref33
  doi: 10.23919/IFIPNetworking.2018.8696623
– ident: ref1
  doi: 10.1002/net.10008
– ident: ref24
  doi: 10.1137/15M1033708
– ident: ref30
  doi: 10.1016/0022-0000(88)90003-7
– ident: ref26
  doi: 10.1109/INFOCOM.2019.8737402
– ident: ref28
  doi: 10.1201/9781584888239-c12
SSID ssj0013026
Score 2.4473553
Snippet Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem - the...
Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem — the...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1435
SubjectTerms 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
Title Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands
URI https://ieeexplore.ieee.org/document/10311541
https://www.proquest.com/docview/3041522462
Volume 32
WOSCitedRecordID wos001103659200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE/IET Electronic Library
  customDbUrl:
  eissn: 1558-2566
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0013026
  issn: 1063-6692
  databaseCode: RIE
  dateStart: 19930101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA46POjB3-J0Sg6ehGxp0ybNceiGBykiVXcrzY_ioFvH1um_b5J2OhEFbz0kobwvyXsvyfc-AK6IDCULFEUmuwpRIBRDQuMIBV7mm-QnU5E7uni-Z3EcjUb8oSGrOy6M1to9PtNd--nu8lUpl_aorGclCYzLN8nOJmO0Jmt9XRlgp61mUhyCKOV-c4XpYd5L4kHStTrhXUIs-Zt9c0JOVeXHVuz8y3Dvn3-2D3abQBL2a-QPwIaeHoKdtfKCR-CxPjHQCia1Gs9sWUETpMJ-UaByjmKDkmkIHQnXzLxJqUxMDodF-b6AL-Pq1Ywuxo6XD2_1xJKCj8HTcJDc3KFGQwFJnwcVYjklRPFcZH7ApOIiZNLHWaZCZiv_cfs2jYmcCs48TSNsEA1ZLiXTOmCRUuQEtKblVJ8CiKk0-0MmqNAmzONeRgQOiMywVoHOBW0DvDJqKpsC41bnokhdooF5anFILQ5pg0MbXH92mdXVNf5qfGwNv9awtnkbdFbQpc0CXKTElh6wxfL8s1-6nYNtM3rzCqcDWtV8qS_Alnyrxov5pZtbH-rqy6g
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFA4yBfXBuzidmgefhMysSZPmcahDcRaRqnsrzaU4mKtsnf59k7TeEAXf-nCSlnxpzjlJvvMBcERUqDjVDNnsKkRUao6kwRGinSywyU-mI791cd_ncRwNBuKmJqt7Lowxxl8-M2336M_ydaFmbqvsxEkSWJdvk535kNIAV3Stz0MD7NXVbJJDEGMiqA8xO1icJPF50nZK4W1CHP2bf3NDXlflx2LsPUxv9Z_ftgZW6lASdivs18GcGW-A5S8FBjfBbbVnYDRMKj2e51kJbZgKu6MRKiYotjhZQ-hpuHbuPRXaRuWwNypep_BhWD7a3uXQM_PhmXlytOAtcNc7T04vUK2igFQgaIl4zgjRIpdZQLnSQoZcBTjLdMhd7T_hbqdxmTMpeMewCFtMQ54rxY2hPNKabIPGuBibHQAxU3aFyCSTxgZ6opMRiSlRGTaamlyyJsDvg5qqusS4U7oYpT7VwCJ1OKQOh7TGoQmOP5o8V_U1_jLecgP_xbAa8yZovUOX1r_gNCWu-IArlxfs_tLsECxeJNf9tH8ZX-2BJfum-k5OCzTKyczsgwX1Ug6nkwM_z94ArK_O7w
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Improved+Throughput+for+All-or-Nothing+Multicommodity+Flows+With+Arbitrary+Demands&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Chaturvedi%2C+Anya&rft.au=Chekuri%2C+Chandra&rft.au=Liu%2C+Mengxue&rft.au=Richa%2C+Andrea+W&rft.date=2024-04-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1063-6692&rft.eissn=1558-2566&rft.volume=32&rft.issue=2&rft.spage=1435&rft_id=info:doi/10.1109%2FTNET.2023.3325437&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon