Overlay routing network construction by introducing Super-Relay nodes

Abstract

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. However, deploying a routing overlay network requires the placement and maintenance of overlay infrastructure, especially, the selection and placement of key relay nodes. Spurred by the observation that a few relay nodes with high betweenness centrality, which are called Super-Relay nodes, can provide more optimal routes for a large number of node pairs, we propose an overlay routing network constructing method by introducing Super-Relay nodes. In detail, we focus on the selection and connection of Super-Relay nodes to optimize routing quality in a resilient and scalable manner, by which we address K-Minimum Spanning Tree with Super-Relay nodes algorithm (SR-KMST). Using simulations on a real Internet topology, we conclude that our approach can provide high-quality overlay routing service, and achieve better robustness by comparing with other algorithms.