Browse > Article
http://dx.doi.org/10.3837/tiis.2014.02.007

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

Liao, Jianxin (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications)
Tian, Shengwen (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications)
Wang, Jingyu (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications)
Li, Tonghong (Department of Computer Science, Technical University of Madrid)
Qi, Qi (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications)
Publication Information
KSII Transactions on Internet and Information Systems (TIIS) / v.8, no.2, 2014 , pp. 443-461 More about this Journal
Abstract
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.
Keywords
One-hop overlay routing; Load balancing; Linear programming; Betweenness centrality; Multipath; Path diversity;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 ILOG, Inc, "ILOG CPLEX: High-performance software for mathematical programming and optimization," 2006, Available: http://www.ilog.com/products/cplex/.
2 M. Faloutsos, P. Faloutsos, C. Faloutsos, "On power-law relationships of the Internet topology," ACM SIGCOMM Computer Commun. Rev. (CCR), vol. 29, no. 4, pp. 251-262, 1999.   DOI
3 B. M. Waxman, "Routing of multipoint connections," IEEE Journal on Selected Areas in Communication (JSAC) , vol. 6, no. 9, pp. 1617-1622, 1988.   DOI   ScienceOn
4 J. Liao, J. Wang, B. Wu, and W. Wu, "Toward a multiplane framework of NGSON: a required guideline to achieve pervasive services and efficient resource utilization," IEEE Communications Magazine, vol. 50, no. 1, pp. 90-97, 2012.
5 G. Lee and J. Choi, "A survey of multipath routing for traffic engineering," 2002. [Online]. Available: http://vega.icu.ac.kr/-gmlee/research/.
6 R. K. Singh, N. S. Chaudhari, and K. Saxena, "Load balancing in IP/MPLS networks: a survey," Communications and Networks, vol. 4, pp. 151-156, 2012.   DOI
7 Y. Yoshida and M. Kawarasaki, "Relay-node based proactive load balancing method in MPLS network with service differentiation," in Proc. of IEEE International Conference on Communications (ICC), pp.7050-7054, 2012.
8 E. Oki and A. Iwaki, "Load-balanced IP routing scheme based on shortest paths in hose model," IEEE Transactions on Communications (TOC) , vol. 58, no. 7, pp. 2088-2096, 2010.   DOI   ScienceOn
9 U. Brand, "On variants of shortest-path betweenness centrality and their genetic computation," Social Networks, vol. 30, no. 2, pp.136-145, 2008.   DOI   ScienceOn
10 G. Zhang, "An algorithm for Internet AS graph betweenness centrality based on Backtrack," Journal of Computer Research and Development, vol. 40, no. 10, pp. 1790-1796, 2006.
11 V. Padmanabhan, L. Qiu, and H. Wang, "Server-based inference of Internet link lossiness," in Proc. of the 22th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), vol. 1, no. 1, pp. 145-155, 2003.
12 A. Nakao, L. Peterson, and A. Bavier, "A routing underlay for Overlay Networks," in Proc. of ACM SIGCOMM, 2003.
13 V. Aggarwal, A. Feldmannn, and C. Scheideler, "Can ISPs and P2P users cooperate for improved performance?" ACM SIGCOMM Computer Commun. Rev. (CCR), vol. 37, no. 3, pp. 29-40, 2007.
14 H. Xie, Y. R. Yang, A. Krishnamurthy, Y. Liu and A. Silberschatz, "P4P: provider portal for applications," in Proc. of ACM SIGCOM, 2008.
15 K. Tutschku, T. Zinner, A. Nakao, and P. Tran-Gia, "Network virtualization: Implementation steps towards the future internet," in Proc. of the Workshop on Overlay and Network Virtualization at KiVS, March 2009.
16 GT-ITM: Modeling Topology of Large Internetworks [Online]. Available: http://www.cc.gatech.edu/projects/GT/.
17 T. G. Griffin and B. J. Premore, "An experimental analysis of BGP convergence time," in Proc. of the Ninth International Conference on Network Protocols (ICNP), pp. 53-61, November 11-14, 2001.
18 C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian, "Delayed Internet routing convergence," IEEE/ACM Transactions on Networking (TON), vol. 9, no. 3, pp. 293-306, 2001.   DOI   ScienceOn
19 C. Boutremans, G. Iannaccone, and C. Diot, "Impact of link failures on VoIP performance," in Proc. of Network and Operating System Support for Digital Audio and Video (NOSSDAV), May 12-14, 2002.
20 D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, "Resilient overlay network," in Proc. of ACM Symposium on Operating Systems Principles (SOSP), pp. 131-145, 2001.
21 R. Cohen, and D. Raz, "Cost effective resource allocation of overlay routing relay nodes," IEEE/ACM Transactions on Networking (TON), 2013.
22 X. Zhou, D. Guo, T. Chen and X. Luo, "Robust backup path selection in overlay routing with bloom filters," Transactions on Internet and Information Systems (KSII), pp. 1890-1910, 2013.
23 Z. Li and P. Mohapatra, "QRON: QoS-aware routing in overlay networks," IEEE Journal on Selected Areas in Communications (JSAC) , vol. 22, no. 1, pp. 29-40, 2004.   DOI   ScienceOn
24 K. P. Gummadi, H. Madhyastha, S. D. Gribble, H. M. Levy, and D. J. Wetherall, "Improving the reliability of internet paths with one-hop source routing," in Proc. of Symposium on Operating Systems Design and Implementation (OSDI), 2004.
25 S. Roy, H. Pucha, Z. Zhang, Y. C. Hu, and L. Qiu, "On the placement of infrastructure overlay nodes," IEEE/ACM Transactions on Networking (TON) , vol. 17, no. 4, pp. 1298-1311, 2009.   DOI   ScienceOn
26 R. Kawahara, S. Kamer, N. Kamiyama, H. Hasegawa, H. Yoshino, Eng Keong Lua and A. Nakao, "A method of constructing QoS overlay network and its evaluation," in Proc. of IEEE Global Telecommunications Conference (GLOBECOM), 2009.
27 S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson, "the end-to-end effects of internet path selection," in Proc. of ACM SIGCOM, pp. 289-299, 1999.
28 M. Cha, S. Moon, C. D. Park, and A. Shaikh, "Placing relay nodes for intra-domain path diversity," in Proc. of the 25th IEEE International Conference on Computer Communications (INFOCOM), April 2006.
29 A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C.-N. Chuah, and C. Diot, "Characterization of failures in an IP backbone," in Proc. of the 23th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), vol. 4, pp. 2307-2317, March 7-11, 2004.
30 M. Venkataraman and M. Chatterjee, "Quantifying video-QoE degradations of Internet links," IEEE/ACM Transaction on Networking (TON), vol. 20, no. 2, pp. 396-407, 2012.   DOI   ScienceOn