Exploring foci of:
Proceedings of the Genetic and Evolutionary Computation Conference
In the Search of Optimal Tree Networks: Hardness and Heuristics
July 2025 • Pavel Martynov, Maxim Buzdalov, Sergey Pankratov, Vitaly Aksenov, Stefan Schmid
Traffic in datacenters may follow some pattern: some pairs of servers communicate more frequently than others. Demand-oblivious networks may perform poorly for such workloads, and demand-aware networks optimized for traffic should be used instead. Unfortunately, not all shapes of networks are feasible in real hardware. Practical limitations are usually provided in the form of a topology. For example, a network may be required to be a binary tree, a bounded-degree graph or a Fat tree. In this work, we consider a to…
Computer Science
Mathematics
Combinatorics