| Popis: |
With the development of smart grids, the scale of network services and data traffic has exploded. Software-defined network has been widely used in power communication network due to its advantages such as separation of data forwarding, centralized control. In network design, routing algorithm is an important part. In this paper, the multi-path routing problem is converted into a k Max-Min problem, and a multi-path routing algorithm is proposed under the constraints of link bandwidth. The algorithm is divided into two stages. In the first stage, the modified Dijkstra shortest path algorithm is used to find a set of candidate paths between the source node and the destination node. In the second stage, the greedy algorithm is used to select k link separation paths from the set of candidate paths obtained in the first stage. In the simulation experiments, the Waxman random graph was used as the test data set, and the shortest path first algorithm (SPF) and the First k-Max bandwidth separation path algorithm were compared. The simulation results show that the multipath algorithm is significantly better than the other two algorithms in improving the throughput of MPTCP streams. |
