TY - GEN

T1 - A Constant Approximation for Maximum Throughput Multicommodity Routing and Its Application to Delay-Tolerant Network Scheduling

AU - Liu, Mengxue

AU - Richa, Andréa W.

AU - Rost, Matthias

AU - Schmid, Stefan

N1 - Funding Information:
Supported in part by an ASU-BGU Collaboration Seed Grant, and NSF grants CCF-1422603, CCF-1637393, and CCF-1733680.
Publisher Copyright:
© 2019 IEEE.

PY - 2019/4

Y1 - 2019/4

N2 - This paper considers the following fundamental maximum throughput routing problem: given a set of k (splittable) multicommodity flows with equal demands in an n-node network, select and route a subset of flows such that the total number of commodities routed that satisfy their demands (i.e., the all-or-nothing throughput) is maximized. Our main contribution is the first constant (i.e., independent of k and n) throughput-approximation algorithm for this NP-hard problem, with sublin-ear, namely O(√k), edge capacity violation ratio. Our algorithm is based on a clever application of randomized rounding. We also present an interesting application of our result in the context of delay-tolerant network scheduling. We complement our theoretical contribution with extensive simulation in two different scenarios, and find that our algorithm performs significantly better than predicted in theory, achieving an edge capacity violation ratio of at most 3.

AB - This paper considers the following fundamental maximum throughput routing problem: given a set of k (splittable) multicommodity flows with equal demands in an n-node network, select and route a subset of flows such that the total number of commodities routed that satisfy their demands (i.e., the all-or-nothing throughput) is maximized. Our main contribution is the first constant (i.e., independent of k and n) throughput-approximation algorithm for this NP-hard problem, with sublin-ear, namely O(√k), edge capacity violation ratio. Our algorithm is based on a clever application of randomized rounding. We also present an interesting application of our result in the context of delay-tolerant network scheduling. We complement our theoretical contribution with extensive simulation in two different scenarios, and find that our algorithm performs significantly better than predicted in theory, achieving an edge capacity violation ratio of at most 3.

UR - http://www.scopus.com/inward/record.url?scp=85068228643&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85068228643&partnerID=8YFLogxK

U2 - 10.1109/INFOCOM.2019.8737402

DO - 10.1109/INFOCOM.2019.8737402

M3 - Conference contribution

AN - SCOPUS:85068228643

T3 - Proceedings - IEEE INFOCOM

SP - 46

EP - 54

BT - INFOCOM 2019 - IEEE Conference on Computer Communications

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE Conference on Computer Communications, INFOCOM 2019

Y2 - 29 April 2019 through 2 May 2019

ER -