This page has only limited features, please log in for full access.
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.
Xiaolan Hou; Muqing Wu; Min Zhao. An Optimization Routing Algorithm Based on Segment Routing in Software-Defined Networks. Sensors 2018, 19, 49 .
AMA StyleXiaolan Hou, Muqing Wu, Min Zhao. An Optimization Routing Algorithm Based on Segment Routing in Software-Defined Networks. Sensors. 2018; 19 (1):49.
Chicago/Turabian StyleXiaolan Hou; Muqing Wu; Min Zhao. 2018. "An Optimization Routing Algorithm Based on Segment Routing in Software-Defined Networks." Sensors 19, no. 1: 49.