FatPaths: Routing in Supercomputers, Data Centers, and Clouds with Low-Diameter Networks when Shortest Paths Fall Short.
Maciej BestaMarcel SchneiderKarolina CynkMarek KoniecznyErik HenrikssonSalvatore Di GirolamoAnkit SinglaTorsten HoeflerPublished in: CoRR (2019)
Keyphrases
- shortest path
- data center
- cloud computing
- traffic engineering
- path selection
- routing algorithm
- path length
- energy aware
- betweenness centrality
- road network
- virtual machine
- source node
- shortest path algorithm
- dijkstra algorithm
- energy efficiency
- high performance computing
- finding the shortest path
- power consumption
- cost effective
- computing resources
- network resources
- massively parallel
- edge weights
- travel time
- carbon dioxide
- optimal path
- flow graph
- weighted graph
- data management
- routing protocol
- computer networks
- social networks
- network design
- vehicle routing problem
- spatial networks
- ip networks
- dynamic routing
- network structure
- geodesic distance
- energy consumption