Multiple graph abstractions for parallel routing over virtual topologies

High throughput data transfers across the Internet has become a challenge with deployment of data centers and cloud platforms. In this paper, we propose to utilize the cores of a router to build multiple abstractions of the underlying topology to parallelize end-to-end (e2e) streams for bulk data transfers. By abstracting a different graph for each core, we steer each core to calculate a different e2e path in parallel. The e2e transfers can use the shortest paths obtained from each subgraph to increase the total throughput over the underlying network. Even though calculating shortest paths is well optimized in legacy routing protocols (e.g., OSPF), finding optimal set of subgraphs to generate non-overlapping and effective multiple paths is a challenging problem. To this end, we analyze centrality metrics to eliminate potentially highest loaded routers or edges in the topology without coordination and eliminate them from the subgraphs. We evaluate the heuristics in terms of aggregate throughput and robustness against failures.