A solution of splittable large flow scheduling based on MCMF in software defined network

Abstract

The Software Defined Network (SDN) is a new networking paradigm, which separates the control plane and data plane. In this paper, we study two efficient large flow scheduling problems using SDN. We firstly present problem definitions, then we propose two algorithms based on Minimize-Cost Maximize-Flow (MCMF) model. One is for static model and the other for dynamic model. We show how to determine the undetermined factors and then how to use those factors to design efficient algorithms. Simulation results demonstrates the effectiveness of our proposed algorithms.