Zoning for hierarchical network optimization in software defined networks

Software defined networking (SDN) decouples control plane functionality from the data plane and features the presence of programmable dumb network devices, which have no or little intelligence and take control commands from a central controller at the control plane. The central controller is responsible for controlling data plane hardware and optimizing network operation. Centralized network optimization and control is impractical or infeasible when the network becomes too large in size or loading. Distributed network optimization comes into play under this circumstance. Fully distributed network optimization requires local intelligence at individual network elements, against the basic concept of SDN. In this paper we consider SDN-friendly zone-based distributed network optimization and studies the integral network zoning problem, that is, how to group network elements into zones such as to minimize the overhead of distributed network optimization. We give a mathematical formulation of the problem and show that it is NP complete. We then present three heuristic solutions and evaluate their performance through simulation.

[1]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[2]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[3]  Alberto Leon-Garcia,et al.  Software Defined Networks , 2015, Comput. Networks.

[4]  Berkant Barla Cambazoglu,et al.  Improving the Performance of IndependentTask Assignment Heuristics MinMin,MaxMin and Sufferage , 2014, IEEE Transactions on Parallel and Distributed Systems.

[5]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[7]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[8]  Martin J. Wainwright,et al.  Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling , 2010, IEEE Transactions on Automatic Control.

[9]  P.H.J. Chong,et al.  A survey of clustering schemes for mobile ad hoc networks , 2005, IEEE Communications Surveys & Tutorials.

[10]  Murali S. Kodialam,et al.  Traffic engineering in software defined networks , 2013, 2013 Proceedings IEEE INFOCOM.

[11]  Ulrich Elsner,et al.  Graph partitioning - a survey , 2005 .

[12]  Satish Rao,et al.  Geometry, flows, and graph-partitioning algorithms , 2008, Commun. ACM.

[13]  Makoto Takizawa,et al.  A Survey on Clustering Algorithms for Wireless Sensor Networks , 2010, 2010 13th International Conference on Network-Based Information Systems.

[14]  Wanjiun Liao,et al.  Software defined networks [Guest Editorial] , 2013, IEEE Communications Magazine.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[17]  Frank McSherry,et al.  Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.