FORMALIZATION OF THE PROBLEM OF THE SDN NETWORK PARTITIONING INTO ROUTING ZONES

On of the key goals that should be solved to efficiently organize network routing is splitting the network to, in some sense, optimal set of routing zones. The work considers generalized mathematical formalization of the graph partition problem. Graph defines SDN network topology. According to this topology possible objective functions and constraints were formulated. Objective functions take into account cut parameters, subgraphs andor cuts boundary vertices characteristics. Constraints take into account weights and probabilities .