Designing Optimal Compact Oblivious Routing for Datacenter Networks in Polynomial Time.
Kanatip ChitavisutthivongChakchai So-InSucha SupittayapornpongPublished in: INFOCOM (2023)
Keyphrases
- worst case
- network topologies
- social networks
- computational complexity
- special case
- dynamic programming
- path selection
- learning algorithm
- traffic engineering
- network nodes
- network topology
- network structure
- heterogeneous networks
- cellular networks
- peer to peer networks
- wireless ad hoc networks
- routing algorithm
- approximation algorithms