Load-Balanced One-hop Overlay Multipath Routing with Path Diversity

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. For one-hop overlay source routing, when a given primary path suffers from the link failure or performance degradation, the source can reroute the traffic to the destination via a strategically placed relay node. However, the over-heavy traffic passing through the same relay node may cause frequent package loss and delay jitter, which can degrade the throughput and utilization of the network. To overcome this problem, we propose a Load-Balanced One-hop Overlay Multipath Routing algorithm (LB-OOMR), in which the traffic is first split at the source edge nodes and then transmitted along multiple one-hop overlay paths. In order to determine an optimal split ratio for the traffic, we formulate the problem as a linear programming (LP) formulation, whose goal is to minimize the worse-case network congestion ratio. Since it is difficult to solve this LP problem in practical time, a heuristic algorithm is introduced to select the relay nodes for constructing the disjoint one-hop overlay paths, which greatly reduces the computational complexity of the LP algorithm. Simulations based on a real ISP network and a synthetic Internet topology show that our proposed algorithm can reduce the network congestion ratio dramatically, and achieve high-quality overlay routing service.

[1]  Ki-Ryong Kwon,et al.  Geometric Multiple Watermarking Scheme for Mobile 3D Content Based on Anonymous Buyer-Seller Watermarking Protocol , 2014, KSII Trans. Internet Inf. Syst..

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

[3]  Helen J. Wang,et al.  Server-based inference of Internet link lossiness , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

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

[6]  Athina Markopoulou,et al.  Characterization of failures in an IP backbone , 2004, IEEE INFOCOM 2004.

[7]  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.

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

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

[10]  Jin Seek Choi,et al.  A survey of multipath routing for traffic engineering , 2002 .

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

[12]  Christian Scheideler,et al.  Can ISPS and P2P users cooperate for improved performance? , 2007, CCRV.

[13]  Abraham Silberschatz,et al.  P4p: provider portal for applications , 2008, SIGCOMM '08.

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

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

[16]  Mainak Chatterjee,et al.  Quantifying Video-QoE Degradations of Internet Links , 2012, IEEE/ACM Transactions on Networking.

[17]  Robert Tappan Morris,et al.  Resilient overlay networks , 2001, SOSP.

[18]  Timothy G. Griffin,et al.  An experimental analysis of BGP convergence time , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

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

[20]  Stefan Savage,et al.  The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.

[21]  Rami Cohen,et al.  Cost effective resource allocation of overlay routing relay nodes , 2011, 2011 Proceedings IEEE INFOCOM.

[22]  Narendra S. Chaudhari,et al.  Load Balancing in IP/MPLS Networks: A Survey , 2012 .

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

[24]  Masatoshi Kawarasaki,et al.  Relay-node based proactive load balancing method in MPLS network with service differentiation , 2012, 2012 IEEE International Conference on Communications (ICC).

[25]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[26]  Phuoc Tran-Gia,et al.  Network Virtualization: Implementation Steps Towards the Future Internet , 2009, KiVS 2009.

[27]  Christophe Diot,et al.  Impact of link failures on VoIP performance , 2002, NOSSDAV '02.

[28]  Tao Chen,et al.  Robust Backup Path Selection in Overlay Routing with Bloom Filters , 2013, KSII Trans. Internet Inf. Syst..

[29]  Eiji Oki,et al.  Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model , 2010, IEEE Trans. Commun..

[30]  Abhijit Bose,et al.  Delayed Internet routing convergence , 2000, SIGCOMM.

[31]  Yanbing Xue,et al.  Human Action Recognition Using Pyramid Histograms of Oriented Gradients and Collaborative Multi-task Learning , 2014, KSII Trans. Internet Inf. Syst..

[32]  Akihiro Nakao,et al.  Network Virtualization: Implementation Steps Towards the Future Internet , 2009, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..