Incremental Deployment and Throughput Maximization Routing for a Hybrid SDN
Abstract: To explore the advantages of software defined network (SDN), while preserving the legacy networking systems, a natural deployment strategy is to deploy a hybrid SDN incrementally to improve the network performance. In this paper, we address two technical challenges: an incremental deployment strategy and a throughput-maximization maximization routing, for deploying a hybrid network incrementally. For incremental deployment, we pro propose pose a heuristic algorithm for deploying a hybrid SDN under the budget constraint, and prove the approximate factor of 1−1e . For throughput-maximization maximization routing, we apply a depth-first-search depth method and a randomized rounding mechanism to solve the multi multi-ccommodity h splittable flow routing problem in a hybrid SDN, where h h≥1 ≥1 . We also prove that our method has approximation ratio O(1logN) , where N is the number of links in a hybrid SDN. We then show, by both analysis and simulations, that our algorithms can n obtain significant performance gains and perform better than the theoretical worst-case case bound. For example, our incremental deployment scheme helps to enhance the throughout about 40% compared with the previous deployment scheme by deploying a small numb number er of SDN devices, and the proposed routing algorithm can improve the throughput about 31% compared with ECMP in hybrid networks.