Software-defined networks (SDNs) are improving the controllability and flexibility of networks as an innovative network architecture paradigm. Segment routing (SR) exploits an end-to-end logical path and is composed of a sequence of segments as an effective routing strategy. Each segment is represented by a middle point. The combination of SR and SDN can meet the differentiated business needs of users and can quickly deploy applications. In this paper, we propose two routing algorithms based on SR in SDN. The algorithms aim to save the cost of the path, alleviate the congestion of networks, and formulate the selection strategy by comprehensively evaluating the value of paths. The simulation results show that compared with existing algorithms, the two proposed algorithms can effectively reduce the consumption of paths and better balance the load of the network. Furthermore, the proposed algorithms take into account the preferences of users, actualize differentiated business networks, and achieve a larger comprehensive evaluation value of the path compared with other algorithms.
Software-defined network (SDN) is a new paradigm that separates control and forwarding. With the growth of SDN deployment scale, the centralized control plane becomes a bottleneck restricting the expansion of SDN networks. To avoid the problem of limited processing power in wide area network (WAN), we focus on the multi-controller deployment in hierarchical architecture for software-defined WAN (SDWAN). The hierarchical architecture divides the control plane into multiple levels. The root controller has a global view. The domain controller is only responsible for the control in local networks. In this paper, we use the improved Louvain algorithm to discover the hierarchical community structure. Considering the load balancing and request delay in each partition and reliability of the control plane, we formulate the modeling and propose a hierarchical multi-controller deployment algorithm for the scalability of SDWAN. The simulation results show that compared with the traditional algorithms, the proposed algorithm not only reduces the average request delay to a certain extent and effectively improves the performance of load balancing in each partition, but also efficiently enhances the reliability of the control plane in SDWAN and achieves good effect on the execution efficiency.
Software-defined networks(SDNs) are improving the controllability and flexibility of networks as an innovative network architecture paradigm. The reasonable placement of the controller in SDN would effectively improve the performance of entire network. In this paper, we study clustering-based controller placement algorithm. The clustering by fast search and find of density peaks (CFSFDP) algorithm is a density-based clustering algorithm with less initial parameters and faster execution speed. However, the CFSFDP algorithm does not consider other performance indicators in the network and the number of the clustering centers needs to be manually determined. In this paper, we propose a controller placement algorithm in SDN to reduce propagation delay and communication consumption in the intra-controller and inter-controller. And the number and the location of controllers are discovered automatically through the inflection point of decision graph. We evaluate the performance of the proposed algorithm on internet2 OS3E network topology. The experimental results show that the proposed algorithm provides better performance than the traditional approaches in terms of communication consumption and propagation delay.
Network virtualization (NV) is widely considered as one of the key technologies for future networks, which allows multiple virtual networks (VNs) to run on the same substrate network simultaneously. Software defined networking (SDN) can be used as a platform to realize NV. Therefore, the NV-based SDN has attracted intensive attention from both academic and industry in recent years. In this article, we focus on virtual network embedding (VNE) problem, which is one of the most important technologies of NV. Specifically, resource situation of underlying network (RSUN) is not considered in previous VNE algorithms, which seriously affects the efficiency of VNE. To solve this problem, we develop two heuristic algorithms to select the appropriate VNE according to RSUN. Our proposed algorithms adopt a novel node-ranking method, which fully considers the node topology and resource attributes, to sort physical nodes. In addition, two sorting approaches for virtual nodes and the global matching embedding (GME) approach are proposed. Our numerical analyses validate our proposed schemes and algorithms in terms of the average revenue to cost ratio, the average revenue, and the average VN request acceptance ratio.