• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Resilient Routing Overlay Network Construction with Super-Relay Nodes


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

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Shengwen Tian, Jianxin Liao, Tonghong Li, Jingyu Wang and Guanghai Cui, "Resilient Routing Overlay Network Construction with Super-Relay Nodes," KSII Transactions on Internet and Information Systems, vol. 11, no. 4, pp. 1911-1930, 2017. DOI: 10.3837/tiis.2017.04.005

[ACM Style]
Tian, S., Liao, J., Li, T., Wang, J., and Cui, G. 2017. Resilient Routing Overlay Network Construction with Super-Relay Nodes. KSII Transactions on Internet and Information Systems, 11, 4, (2017), 1911-1930. DOI: 10.3837/tiis.2017.04.005