Load-optimization in reconfigurable data-center networks: algorithms and complexity of flow routing
| dc.contributor.author | Dai, Wenkai | |
| dc.contributor.author | Foerster, Klaus-Tycho | |
| dc.contributor.author | Fuchssteiner, David | |
| dc.contributor.author | Schmid, Stefan | |
| dc.date.accessioned | 2024-05-10T09:33:27Z | |
| dc.date.available | 2024-05-10T09:33:27Z | |
| dc.date.issued | 2023-07-18 | |
| dc.description.abstract | Emerging reconfigurable data centers introduce unprecedented flexibility in how the physical layer can be programmed to adapt to current traffic demands. These reconfigurable topologies are commonly hybrid, consisting of static and reconfigurable links, enabled by e.g., an Optical Circuit Switch (OCS) connected to top-of-rack switches in Clos networks. Even though prior work has showcased the practical benefits of hybrid networks, several crucial performance aspects are not well understood. For example, many systems enforce artificial segregation of the hybrid network parts, leaving money on the table. In this article, we study the algorithmic problem of how to jointly optimize topology and routing in reconfigurable data centers, in order to optimize a most fundamental metric, maximum link load. The complexity of reconfiguration mechanisms in this space is unexplored at large, especially for the following cross-layer network-design problem: given a hybrid network and a traffic matrix, jointly design the physical layer and the flow routing in order to minimize the maximum link load. We chart the corresponding algorithmic landscape in our work, investigating both un-/splittable flows and (non-)segregated routing policies. A topological complexity classification of the problem reveals NP-hardness in general for network topologies that are trees of depth at least two, in contrast to the tractability on trees of depth one. We moreover prove that the problem is not submodular for all these routing policies, even in multi-layer trees. However, networks that can be abstracted by a single packet switch (e.g., nonblocking Fat-Tree topologies) can be optimized efficiently, and we present optimal polynomial-time algorithms accordingly. We complement our theoretical results with trace-driven simulation studies, where our algorithms can significantly improve the network load in comparison to the state-of-the-art. | en |
| dc.identifier.uri | http://hdl.handle.net/2003/42471 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-24307 | |
| dc.language.iso | en | en |
| dc.relation.ispartofseries | ACM transactions on modeling and performance evaluation of computing systems;8(3) | |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | networks | en |
| dc.subject | network architectures | en |
| dc.subject | theory of computation | en |
| dc.subject | design and analysis of algorithms | en |
| dc.subject | network design | en |
| dc.subject | load optimization | en |
| dc.subject | optical networks | en |
| dc.subject | algorithms | en |
| dc.subject | complexity | en |
| dc.subject.ddc | 004 | |
| dc.title | Load-optimization in reconfigurable data-center networks: algorithms and complexity of flow routing | en |
| dc.type | Text | |
| dc.type.publicationtype | ResearchArticle | |
| dcterms.accessRights | open access | |
| eldorado.secondarypublication | true | |
| eldorado.secondarypublication.primarycitation | Dai, W. et al. (2023) ‘Load-optimization in reconfigurable data-center networks: algorithms and complexity of flow routing’, ACM transactions on modeling and performance evaluation of computing systems , 8(3). Available at: https://doi.org/10.1145/3597200 | |
| eldorado.secondarypublication.primaryidentifier | https://doi.org/10.1145/3597200 |