In the Search of Optimal Tree Networks: Hardness and Heuristics
<|reference_start|>In the Search of Optimal Tree Networks: Hardness and Heuristics: Demand-aware communication networks are networks whose topology is optimized toward the traffic they need to serve. These networks have recently been enabled by novel optical communication technologies and are investigated intensively in the context of datacenters. In this work, we consider networks with one of the most common topologies~ -- a binary tree.   We show that finding an optimal demand-aware binary tree network is NP-hard. Then, we propose optimization algorithms that generate efficient binary tree networks on real-life and synthetic workloads.<|reference_end|>
@article{buzdalov2024in,
    title={In the Search of Optimal Tree Networks: Hardness and Heuristics},
    author={Maxim Buzdalov, Pavel Martynov, Sergey Pankratov, Vitaly Aksenov,
  Stefan Schmid},
    journal={arXiv preprint arXiv:2403.03724},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.03724},
    primaryClass={cs.NI cs.DS}
}