Routing Method Based on SD-WAN

In recent years, the rapid development of the Internet industry has made the network traffic show a diversified trend. Different application services have different characteristics and have different requirements on network performance. Software-Defined Wide Area Network (SD-WAN) successfully extends the principle of software-defined network (SDN) to the wide area network (WAN), making the scheduling of WAN traffic more flexible. In this paper, the routing methods of SD-WAN are studied, and three schemes are proposed, namely, the routing methods based on controller master-slave control, fair competition and polling control. The three proposed schemes are simulated by Dijkstra algorithm, Floyd algorithm and KSP algorithm. The results verify the validity of SD-WAN routing method, and further enhance the stability of routing between different domains, which can effectively improve the flexibility of network operation and resource utilization.