Representative Measurement Point Selection to Monitor Software-defined Networks

Network state monitoring is a fundamental task for network management. However, determining the full network state in Software defined Networks requires disproportionately too many resources. This stems from the discrepancy between the established methods used for state monitoring compared to the varying contribution in terms of information obtained from every additionally monitored network node. This relationship may even become more complicated depending on the network state information of interest. One solution to overcome bottlenecks by reducing the overall monitoring footprint is the use of spatial sampling, which allows the estimation of the network state based a fraction of the overall state.In this work, we propose schemes to place a small number of measurement points in the SDN network to maximize the obtained network state information. Considering different conditions, we utilize routing information and graph theoretic centrality metrics, respectively, to estimate the amount of information a node provides. Based on this knowledge, we, furthermore, develop a mechanism to place multiple measurement points while avoiding redundant measurements. For demonstration purpose, we use the developed mechanisms to estimate the Flow Size Distribution in SDN environments. An emulative evaluation taking several known topologies shows the effectiveness of spatial sampling using the proposed scheme.

[1]  Gunjan Tank,et al.  Software-Defined Networking-The New Norm for Networks , 2012 .

[2]  Stephen P. Borgatti,et al.  Identifying sets of key players in a social network , 2006, Comput. Math. Organ. Theory.

[3]  S. Borgatti,et al.  The centrality of groups and classes , 1999 .

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

[5]  Hyuk Lim,et al.  Scalable Traffic Sampling Using Centrality Measure on Software-Defined Networks , 2017, IEEE Communications Magazine.

[6]  Donald F. Towsley,et al.  Fisher information of sampled packets: an application to flow size estimation , 2006, IMC '06.

[7]  Hyunseung Choo,et al.  CentFlow: Centrality-Based Flow Balancing and Traffic Distribution for Higher Network Utilization , 2017, IEEE Access.

[8]  Alex C. Snoeren,et al.  Inside the Social Network's (Datacenter) Network , 2015, Comput. Commun. Rev..

[9]  Klara Nahrstedt,et al.  DistTM: Collaborative traffic matrix estimation in distributed SDN control planes , 2016, 2016 IFIP Networking Conference (IFIP Networking) and Workshops.

[10]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[11]  Zdravko Bozakov,et al.  Estimating traffic correlations from sampling and active network probing , 2012, 2013 IFIP Networking Conference.

[12]  Stanislav Lange,et al.  Heuristic Approaches to the Controller Placement Problem in Large Scale SDN Networks , 2015, IEEE Transactions on Network and Service Management.

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

[14]  Alexis Papadimitriou,et al.  Edge betweenness centrality: A novel algorithm for QoS-based topology control over wireless sensor networks , 2012, J. Netw. Comput. Appl..

[15]  Rob Sherwood,et al.  The controller placement problem , 2012, HotSDN@SIGCOMM.

[16]  Abhishek Kumar,et al.  Data streaming algorithms for efficient and accurate estimation of flow size distribution , 2004, SIGMETRICS '04/Performance '04.

[17]  Zdravko Bozakov,et al.  Measurement-based flow characterization in centrally controlled networks , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[18]  Carsten Lund,et al.  Estimating flow distributions from sampled flow statistics , 2003, SIGCOMM '03.

[19]  Matthew Roughan,et al.  The Internet Topology Zoo , 2011, IEEE Journal on Selected Areas in Communications.

[20]  Ramesh Govindan,et al.  SCREAM: sketch resource allocation for software-defined measurement , 2015, CoNEXT.

[21]  Ralf Steinmetz,et al.  Towards an adaptive selection of loss estimation techniques in software-defined networks , 2017, 2017 IFIP Networking Conference (IFIP Networking) and Workshops.

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

[23]  Raouf Boutaba,et al.  PayLess: A low cost network monitoring framework for Software Defined Networks , 2014, 2014 IEEE Network Operations and Management Symposium (NOMS).

[24]  Nicolas Hohn,et al.  Inverting sampled traffic , 2003, IMC '03.

[25]  Ahmed Toumanari,et al.  Survey of Security in Software-Defined Network , 2017 .

[26]  Darryl Veitch,et al.  Fisher Information in Flow Size Distribution Estimation , 2011, IEEE Transactions on Information Theory.

[27]  홍원기,et al.  A Flow-based Method for Abnormal Network Traffic Detection , 2004 .

[28]  Nick McKeown,et al.  A network in a laptop: rapid prototyping for software-defined networks , 2010, Hotnets-IX.

[29]  Harsha V. Madhyastha,et al.  FlowSense: Monitoring Network Utilization with Zero Measurement Cost , 2013, PAM.