TY - GEN
T1 - A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput
AU - Bentert, Matthias
AU - Avin, Chen
AU - Schmid, Stefan
N1 - Publisher Copyright:
© 2026 Copyright held by the owner/author(s).
PY - 2026/7/1
Y1 - 2026/7/1
N2 - The performance of distributed applications often critically depends on the throughput of the interconnecting network: how fast data can be carried across a network. Over the last years, great progress has been made in understanding demand-oblivious throughput: how fast a given demand matrix describing pairwise communication requirements, can be served on a given network. However, surprisingly little is known today about the achievable demand-aware throughput: the throughput on a network topology which can be optimized toward the demand. Such demand-aware networks have recently gained popularity in datacenters and are enabled by emerging reconfigurable optical technologies.In this paper, we are interested in both the achievable demand-aware throughput bounds as well as in the computational complexity of finding a throughput-optimizing network topology. We take a systematic approach and investigate four variants of demand-aware throughput: we analyze, and derive bounds for, two definitions of throughput, the classic throughput usually considered in the literature, and a new generalized definition which we call weak throughput; for each of them, we consider two routing models, a direct one, where demand can only be served on a single hop, and a general one, where multi-hop routing is allowed.Our main result is a separation result which solves an open problem in the literature about the classic throughput definition, showing that demand-aware topologies can outperform demand-oblivious topologies even in the worst case: the demand-aware throughput asymptotically approaches at least 58, while it is known that the demand-oblivious throughput is at most n2n-1≈12. In terms of computational complexity, we show that computing the demand-aware weak throughput is NP-hard, but computing the demand-aware direct throughput and the demand-aware weak direct throughput are both polynomial-time solvable. We leave it as an open problem whether computing the demand-aware throughput is polynomial-time solvable or NP-hard, but we conjecture that it is NP-hard.
AB - The performance of distributed applications often critically depends on the throughput of the interconnecting network: how fast data can be carried across a network. Over the last years, great progress has been made in understanding demand-oblivious throughput: how fast a given demand matrix describing pairwise communication requirements, can be served on a given network. However, surprisingly little is known today about the achievable demand-aware throughput: the throughput on a network topology which can be optimized toward the demand. Such demand-aware networks have recently gained popularity in datacenters and are enabled by emerging reconfigurable optical technologies.In this paper, we are interested in both the achievable demand-aware throughput bounds as well as in the computational complexity of finding a throughput-optimizing network topology. We take a systematic approach and investigate four variants of demand-aware throughput: we analyze, and derive bounds for, two definitions of throughput, the classic throughput usually considered in the literature, and a new generalized definition which we call weak throughput; for each of them, we consider two routing models, a direct one, where demand can only be served on a single hop, and a general one, where multi-hop routing is allowed.Our main result is a separation result which solves an open problem in the literature about the classic throughput definition, showing that demand-aware topologies can outperform demand-oblivious topologies even in the worst case: the demand-aware throughput asymptotically approaches at least 58, while it is known that the demand-oblivious throughput is at most n2n-1≈12. In terms of computational complexity, we show that computing the demand-aware weak throughput is NP-hard, but computing the demand-aware direct throughput and the demand-aware weak direct throughput are both polynomial-time solvable. We leave it as an open problem whether computing the demand-aware throughput is polynomial-time solvable or NP-hard, but we conjecture that it is NP-hard.
KW - Datacenters
KW - Matching Lower and Upper Bounds
KW - NP-hardness
KW - Network Topology
KW - Optical Communication
KW - Probabilistic Method
UR - https://www.scopus.com/pages/publications/105044291876
U2 - 10.1145/3796701.3815941
DO - 10.1145/3796701.3815941
M3 - Conference contribution
AN - SCOPUS:105044291876
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 360
EP - 370
BT - PODC 2026 - Proceedings of the 2026 ACM Symposium on Principles of Distributed Computing
PB - Association for Computing Machinery
T2 - 45th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2026
Y2 - 6 July 2026 through 10 July 2026
ER -