Overlay node deployment based on node coreness

Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing, carefully placing infrastructure overlay nodes is very important. In this paper, we use the k-core decomposition, based on a recursive pruning of the least connected vertices, to obtain the node coreness for overlay topology placement. By using this strategy, we develop a heuristic algorithm that can achieve intelligent placement of overlay nodes to facilitate transmission control protocol (TCP) performance improvement. Using simulations on generated topologies, we demonstrate the effectiveness of the placement algorithm.