An information transport dynamic load balancing policy based on software defined mobile networks

In the general architecture of software defined networks, controller often uses traditional OSPF (Open Shortest Path First) routing algorithm selecting the shortest path as the final single path when calculate networks' topology. This may cause the busy nodes will still receive large amount of transmission data requests when they had already blocked by current works. Especially in the environment of the mobile networks, the differences in data requests can suddenly cause some node data to be congested, while the other part is idle, both waste the resources of network and influence the quality of network service. This paper designs an all pairs shortest paths algorithm to calculate the topology information in the nodes of software defined networks regularly and put forward a congestion control strategy based on OpenFlow protocol to solve the problem of loading imbalanced of the data center networking of the software defined mobile networks. We elaborate on its overall framework and algorithm implementation process, and is proved by experimental simulation that the algorithm can relieve network congestion, improve network utilization and enhance the effectiveness of network stability.