Towards accurate online traffic matrix estimation in software-defined networks

Traffic matrix measurement provides essential information for network design, operation and management. In today's networks, it is challenging to get accurate and timely traffic matrix due to the hard resource constraints of network devices. Recently, Software-Defined Networking (SDN) technique enables customizable traffic measurement, which can provide flexible and fine-grain visibility into network traffic. However, the existing software-defined traffic measurement solutions often suffer from feasibility and scalability issues. In this paper, we seek accurate, feasible and scalable traffic matrix estimation approaches. We propose two strategies, called Maximum Load Rule First (MLRF) and Large Flow First (LFF), to design feasible traffic measurement rules that can be installed in TCAM entries of SDN switches. The statistics of the measurement rules are collected by the controller to estimate fine-grained traffic matrix. Both MLRF and LFF satisfy the flow aggregation constraints (determined by associated routing policies) and have low-complexity. Extensive simulation results on real network and traffic traces reveal that MLRF and LFF can achieve high accuracy of traffic matrix estimation and high probability of heavy hitter detection.

[1]  Chen-Nee Chuah,et al.  Decentralizing Network Inference Problems With Multiple-Description Fusion Estimation (MDFE) , 2016, IEEE/ACM Transactions on Networking.

[2]  Walter Willinger,et al.  Spatio-Temporal Compressive Sensing and Internet Traffic Matrices (Extended Version) , 2012, IEEE/ACM Transactions on Networking.

[3]  Michal Pioro,et al.  CHAPTER 8 – Fair Networks , 2004 .

[4]  Xin Li,et al.  Distributed Collaborative Monitoring in Software Defined Networks , 2014, ArXiv.

[5]  Chen-Nee Chuah,et al.  Intelligent SDN based traffic (de)Aggregation and Measurement Paradigm (iSTAMP) , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[6]  George Varghese,et al.  New directions in traffic measurement and accounting , 2002, CCRV.

[7]  Albert G. Greenberg,et al.  Fast accurate computation of large-scale IP traffic matrices from link loads , 2003, SIGMETRICS '03.

[8]  Jun Luo,et al.  Cracking network monitoring in DCNs with SDN , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

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

[10]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[11]  Chen-Nee Chuah,et al.  ProgME: Towards Programmable Network MEasurement , 2007, IEEE/ACM Transactions on Networking.

[12]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[13]  Ramesh Govindan,et al.  DREAM , 2014, SIGCOMM.

[14]  Xin Li,et al.  Distributed and collaborative traffic monitoring in software defined networks , 2014, HotSDN.

[15]  Konstantina Papagiannaki,et al.  Traffic matrices: balancing measurements, inference and modeling , 2005, SIGMETRICS '05.

[16]  Xin Zhao,et al.  On the Aggregatability of Router Forwarding Tables , 2010, 2010 Proceedings IEEE INFOCOM.

[17]  Monia Ghobadi,et al.  OpenTM: Traffic Matrix Estimator for OpenFlow Networks , 2010, PAM.

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

[19]  Walter Willinger,et al.  Spatio-temporal compressive sensing and internet traffic matrices , 2009, SIGCOMM '09.

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

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