Resilient Routing Overlay Network Construction with Super-Relay Nodes

• Shengwen Tian,
• Jianxin Liao,
• Tonghong Li,
• Jingyu Wang,
• Guanghai Cui,

Vol. 11, No. 4, April 29, 2017
10.3837/tiis.2017.04.005, Download Paper (Free):

• overlay topology
• Super-Relay nodes
• Betweenness Centrality
• resilient routing
• one-hop path recovery

Abstract

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. The key to overlay routing is the placement and maintenance of the overlay infrastructure, especially, the selection and placement of key relay nodes. Spurred by the observation that a few relay nodes with high betweenness centrality can provide more optimal routes for a large number of node pairs, we propose a resilient routing overlay network construction method by introducing Super-Relay nodes. In detail, we present the K-Minimum Spanning Tree with Super-Relay nodes algorithm (SR-KMST), in which we focus on the selection and connection of Super-Relay nodes to optimize the routing quality in a resilient and scalable manner. For the simultaneous path failures between the default physical path and the overlay backup path, we also address the selection of recovery path. The objective is to select a proper one-hop recovery path with minimum cost in path probing and measurement. Simulations based on a real ISP network and a synthetic Internet topology show that our approach can provide high-quality overlay routing service, while achieving good robustness.

Statistics

Cite this article