Balanced Domain Partitioning for Software Defined Networks

Software Defined Networking (SDN) has been widely adopted to enable the network programmability by decoupling controller logic from data plane. Domain partitioning is essential for SDN-enabled communication networks partition oversized topology into controllable and administrative domains. Existing domain algorithms failed take connectivity, balance constraint, compactness, traffic cohesion consideration simultaneously which are required SDN communications. This paper formulates problem proposed a novel balanced (BaDoP) algorithm, can enhance of partitioned domains, optimize compactness with connectivity constraint always guaranteed. BaDoP employs Bubble algorithm find initial partitioning, improves iteratively moving border nodes among domains guided negative cycles or shortest paths on an auxiliary graph abstract view current partitioning. The simulation results indicates that our outperforms previous achieve significant improvement