Search-tree Based SDN Candidate Selection in Hybrid IP/SDN Network

The link failure recovery is important to the Internet. For improving the performance of link failure recovery in the IP network, the software defined networking (SDN) is applied to achieve this target. The SDN is effective on solving this kind of issue. However, considering the deployment cost, only a few IP routers can be replaced by the SDN switches. Thus, to minimize the number of SDN switches, the greedy-based approach is proposed to select the most appropriate deployment locations. But the greedy-based approach has disadvantages. For addressing these disadvantages, in this paper, we proposed the search-tree based SDN candidate selection (SCS) algorithm. In this algorithm, for achieving better performance than the greedy-based approach, three algorithms are proposed, which are the search-tree based feasible solutions calculation algorithm, the most appropriate feasible solution selection algorithm, and the most appropriate designated SDN switch selection algorithm. Based on these algorithms, the performance of the search-tree based SCS algorithm is improved greatly compared with the greedy-based algorithms.