A distributed routing algorithm based on available multi-nexthop in IP networks

Traditional routing algorithms have many drawbacks such as worse resource utilization and stability. Present investigations focus on how to mitigate them in traditional algorithms rather than design a new algorithm to terminate them. In this paper, a novel distributed routing algorithm based on available multi-nexthop is proposed. This is different from traditional single-nexthop schemes. The nodes are orderly planned (assign different heights to different nodes based on some node) by improved breadth-first search algorithm(IBFS). Then, the network topology form a directed acyclic graph based on one destination node and other nodes can forward packets to it by available multi-nexthop which is derived from different heights. Simulation results show that the proposed algorithm has low computation complexity and makes network traffic tend to equilibrium due to the reduction of the traffic fluctuation in links. So the algorithm has a high resource utilization rate and can mitigate network congestions greatly.