Load balancing for multiple traffic matrices using SDN hybrid routing

Classical traffic engineering (TE) methods calculate the optimal routing based on a single traffic matrix. However, they are unable to handle unexpected traffic changes. Thus, it is of interest to find a good routing configuration to accommodate multiple possible traffic scenarios. There are two major approaches to achieve load balancing for multiple traffic matrices: destination-based routing and explicit routing. It has been shown that explicit routing performs better than destination-based routing for multiple traffic matrices. However, explicit routing has high complexity and requires large Ternary Content Addressable Memory (TCAM) in the routers. Thus, it is power hungry and unscalable. This paper presents an approach called hybrid routing to achieve load balancing for multiple traffic matrices with low complexity and good scalability. Our basic idea is to complement destination-based routing with a small number of explicit routing forwarding entries to take advantage of both two routing approaches. Hybrid routing greatly reduces the number of forwarding entries compared with pure explicit routing. This has great value for practice in that the scheme requires very small TCAM to implement. Hybrid routing is very suitable for implementation using SDN. A heuristic algorithm is developed to obtain the near-optimal hybrid routing configuration. Extensive evaluation demonstrates the effectiveness of hybrid routing. The results show that hybrid routing achieves near-optimal load balancing compared with pure explicit routing. In particular, hybrid routing saves at least 84.6% TCAM resources in all practical networks used in our evaluation.

[1]  Ellen W. Zegura,et al.  Performance of hashing-based schemes for Internet load balancing , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[3]  Christian E. Hopps,et al.  Analysis of an Equal-Cost Multi-Path Algorithm , 2000, RFC.

[4]  Chin-Tau A. Lea,et al.  Optimal link weights for IP-based networks supporting hose-model VPNs , 2009, IEEE/ACM Trans. Netw..

[5]  Subhasis Banerjee,et al.  Compact TCAM: Flow Entry Compaction in TCAM for Power Aware SDN , 2013, ICDCN.

[6]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[8]  Donald F. Towsley,et al.  On optimal routing with multiple traffic matrices , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[9]  Murali S. Kodialam,et al.  Oblivious routing of highly variable traffic in service overlays and IP backbones , 2009, IEEE/ACM Trans. Netw..

[10]  Yin Zhang,et al.  Finding critical traffic matrices , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[11]  Liren Zhang,et al.  Optimizing Network Performance Using Weighted Multipath Routing , 2012, 2012 21st International Conference on Computer Communications and Networks (ICCCN).

[12]  Matthew Roughan.  First order characterization of Internet traffic matrices , 2005 .

[13]  H. Jonathan Chao,et al.  Dynamic hybrid routing: Achieve load balancing for changing traffic demands , 2014, 2014 IEEE 22nd International Symposium of Quality of Service (IWQoS).

[14]  Zheng Wang,et al.  Explicit routing algorithms for Internet traffic engineering , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[15]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.