A Distributed Hierarchical Heavy Hitter Detection Method in Software-Defined Networking

Software-defined networking (SDN) enables fast innovation in networks. The management and measurement features that we require can be easily implemented in SDN. However, when simplicity is introduced, SDN also faces some problems, of which the most challenging one is the scalability problem. As the foundation of the networking management, scalability of the traffic measurement is also important. Recently, many works have focused on TCAM-based measurement, which is considered to be scalable and efficient enough. In this paper, we propose a distributed hierarchical heavy hitter (HHH) detection method, which is also a TCAM-based method. Unlike previous works, this method focuses on optimizing the detection speed by dynamically controlling the resource allocated to each measurement task. We propose an efficient solution to solve the optimization problem. The simulation with network-wide tasks and diverse traffic has shown that this method can improve the detection speed when compared with other resource allocation methods, and it can work better under strict resource limitation.

[1]  Stanislav Lange,et al.  ZOOM: Lightweight SDN-Based Elephant Detection , 2016, 2016 28th International Teletraffic Congress (ITC 28).

[2]  Gabriel Maciá-Fernández,et al.  Anomaly-based network intrusion detection: Techniques, systems and challenges , 2009, Comput. Secur..

[3]  Olivier Bonaventure,et al.  A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks , 2015, SIGCOMM.

[4]  Divesh Srivastava,et al.  Diamond in the rough: finding Hierarchical Heavy Hitters in multi-dimensional data , 2004, SIGMOD '04.

[5]  Sujata Banerjee,et al.  DevoFlow: scaling flow management for high-performance networks , 2011, SIGCOMM 2011.

[6]  Gang Zeng,et al.  Quantitative Fault-Tolerance for Reliable Workflows on Heterogeneous IaaS Clouds , 2020, IEEE Transactions on Cloud Computing.

[7]  Minlan Yu,et al.  Online Measurement of Large Traffic Aggregates on Commodity Switches , 2011, Hot-ICE.

[8]  Nick McKeown,et al.  pFabric: minimal near-optimal datacenter transport , 2013, SIGCOMM.

[9]  Chun-Yu Lin,et al.  Elephant flow detection in datacenters using OpenFlow-based Hierarchical Statistics Pulling , 2014, 2014 IEEE Global Communications Conference.

[10]  Ke Ding,et al.  Sample and Fetch-Based Large Flow Detection Mechanism in Software Defined Networks , 2016, IEEE Communications Letters.

[11]  Sand Correa,et al.  Accurate online detection of bidimensional Hierarchical Heavy Hitters in software-defined networks , 2013, 2013 IEEE Latin-America Conference on Communications.

[12]  Ramesh Govindan,et al.  DREAM: dynamic resource allocation for software-defined measurement , 2015, SIGCOMM 2015.

[13]  Ming Zhang,et al.  MicroTE: fine grained traffic engineering for data centers , 2011, CoNEXT '11.

[14]  George Varghese,et al.  CONGA: distributed congestion-aware load balancing for datacenters , 2015, SIGCOMM.

[15]  Christos H. Papadimitriou,et al.  On the complexity of integer programming , 1981, JACM.

[16]  Bryan Ng,et al.  Heavy Hitter Detection and Identification in Software Defined Networking , 2016, 2016 25th International Conference on Computer Communication and Networks (ICCCN).

[17]  Rong Pan,et al.  AF-QCN: Approximate Fairness with Quantized Congestion Notification for Multi-tenanted Data Centers , 2010, 2010 18th IEEE Symposium on High Performance Interconnects.

[18]  Minlan Yu,et al.  Software Defined Traffic Measurement with OpenSketch , 2013, NSDI.

[19]  Soheil Ghiasi,et al.  Streaming Solutions for Fine-Grained Network Traffic Measurements and Analysis , 2011, IEEE/ACM Transactions on Networking.

[20]  Jim Esch,et al.  Software-Defined Networking: A Comprehensive Survey , 2015, Proc. IEEE.

[21]  Ramesh Govindan,et al.  Resource/accuracy tradeoffs in software-defined measurement , 2013, HotSDN '13.

[22]  Clarence Filsfils,et al.  The Segment Routing Architecture , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).