Resilient Routing Overlay Network Construction with Super-Relay Nodes

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.

[1]  Minho Jo,et al.  Recovery for overloaded mobile edge computing , 2017, Future Gener. Comput. Syst..

[2]  Sudarshan K. Dhall,et al.  The service overlay network design problem for interactive internet applications , 2015, Comput. Oper. Res..

[3]  Nguyen Dinh Han,et al.  Green data centers for cloud-assisted mobile ad hoc networks in 5G , 2015, IEEE Network.

[4]  Jingyu Wang,et al.  Overlay routing network construction by introducing Super-Relay nodes , 2014, 2014 IEEE Symposium on Computers and Communications (ISCC).

[5]  Rami Cohen,et al.  Cost-Effective Resource Allocation of Overlay Routing Relay Nodes , 2014, IEEE/ACM Transactions on Networking.

[6]  Jingyu Wang,et al.  Load-Balanced One-hop Overlay Multipath Routing with Path Diversity , 2014, KSII Trans. Internet Inf. Syst..

[7]  Jian Yu,et al.  Trust‐aware query routing in P2P social networks , 2012, Int. J. Commun. Syst..

[8]  Tao Chen,et al.  ABPS: An Accurate Backup Path Selecting Approach in Overlay Networks , 2012, 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems.

[9]  Xiaomin Zhu,et al.  Service Composition Based on Niching Particle Swarm Optimization in Service Overlay Networks , 2012, KSII Trans. Internet Inf. Syst..

[10]  Mourad Amad,et al.  GPM: A generic and scalable P2P model that optimizes tree depth for multicast communications , 2012, Int. J. Commun. Syst..

[11]  Wei Wu,et al.  Toward a multiplane framework of NGSON: a required guideline to achieve pervasive services and efficient resource utilization , 2012, IEEE Communications Magazine.

[12]  Kai Hwang,et al.  Churn-Resilient Protocol for Massive Data Dissemination in P2P Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[13]  Ebroul Izquierdo,et al.  Peer-to-peer streaming of scalable video in future Internet applications , 2011, IEEE Communications Magazine.

[14]  JongWon Kim,et al.  Media-Oriented Service Composition with Service Overlay Networks: Challenges, Approaches and Future Trends (Invited Paper) , 2010, J. Commun..

[15]  Akihiro Nakao,et al.  A Method of Constructing QoS Overlay Network and Its Evaluation , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[16]  Lili Qiu,et al.  On the Placement of Infrastructure Overlay Nodes , 2009, IEEE/ACM Transactions on Networking.

[17]  Christian Callegari,et al.  Design and performance evaluation of service overlay networks topologies , 2009, 2009 International Symposium on Performance Evaluation of Computer & Telecommunication Systems.

[18]  Antonio Capone,et al.  Routing and resource optimization in service overlay networks , 2009, Comput. Networks.

[19]  Ulrik Brandes,et al.  On variants of shortest-path betweenness centrality and their generic computation , 2008, Soc. Networks.

[20]  Shervin Shirmohammadi,et al.  A survey of application-layer multicast protocols , 2007, IEEE Communications Surveys & Tutorials.

[21]  Prasant Mohapatra,et al.  On investigating overlay service topologies , 2007, Comput. Networks.

[22]  Zhang Guoqiang,et al.  An Algorithm for Internet AS Graph Betweenness Centrality Based on Backtrack , 2006 .

[23]  Aman Shaikh,et al.  Placing Relay Nodes for Intra-Domain Path Diversity , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[24]  Mostafa H. Ammar,et al.  Dynamic Topology Configuration in Service Overlay Networks: A Study of Reconfiguration Policies , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[25]  Roch Guérin,et al.  How to Select a Good Alternate Path in Large Peer-to-Peer Systems? , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[26]  Aravind Srinivasan,et al.  Resilient multicast using overlays , 2003, IEEE/ACM Transactions on Networking.

[27]  Krishna P. Gummadi,et al.  Improving the Reliability of Internet Paths with One-hop Source Routing , 2004, OSDI.

[28]  Randy H. Katz,et al.  OverQoS: An Overlay Based Architecture for Enhancing Internet QoS , 2004, NSDI.

[29]  Anthony Young,et al.  Overlay mesh construction using interleaved spanning trees , 2004, IEEE INFOCOM 2004.

[30]  Prasant Mohapatra,et al.  QRON: QoS-aware routing in overlay networks , 2004, IEEE Journal on Selected Areas in Communications.

[31]  Akihiro Nakao,et al.  A routing underlay for overlay networks , 2003, SIGCOMM '03.

[32]  Randy H. Katz,et al.  Backup path allocation based on a correlated link failure probability model in overlay networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[33]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[34]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..