Dynamic hybrid routing: Achieve load balancing for changing traffic demands

Classical TE methods calculate the optimal routing based on a known traffic matrix. However, they are unable to handle unexpected traffic changes. Thus, various methods were proposed in recent years, such as online dynamic TE and robust static routing TE. However, online dynamic TE requires additional overhead on routers for information dissemination and suffers from the transient disruptions during routing protocol convergence, while using one robust static routing to accommodate a wide range of traffic scenarios is unable to ensure near optimality of performance for each individual traffic scenario. This paper presents an approach called dynamic hybrid routing (DHR) to achieve load balancing for a wide range of traffic scenarios. Our basic idea is to configure several routing policies in advance and then dynamically rebalance traffic by applying different preconfigured routing policy to react to traffic fluctuations. Each routing policy composes of a common basic destination-based routing and a few complementary explicit routing forwarding entries for a small set of selected ingress/egress node pairs. We design a method to find the near-optimal dynamic hybrid routing configuration. Extensive evaluation demonstrates the effectiveness of DHR. We show that DHR achieves nearoptimal load balancing and thus obtain about at least 96% throughput compared to optimal routing for each individual traffic scenario with very low overhead.

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

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

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

[4]  Srikanth Kandula,et al.  Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.

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

[6]  H. Jonathan Chao,et al.  Load balancing for multiple traffic matrices using SDN hybrid routing , 2014, 2014 IEEE 15th International Conference on High Performance Switching and Routing (HPSR).

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

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

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

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

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

[12]  Martín Casado,et al.  Dynamic route recomputation considered harmful , 2010, CCRV.