Multi-nexthop routing algorithm based on spanning tree searching
一种基于支撑树搜索的多下一跳路由算法*

This paper proposed a novel multi-next-hop routing algorithm based on regulating potentials of network nodes with spanning tree searching. Then investigated four feasible implementing schemes. After regulating potentials with computing a spanning tree of the network, built a mass of source-destination paths for forwarding packets. So this algorithm is flexible in routing and effective in utilizing resources. Simulation results show this algorithm can increase network throughput and decrease packet losing rate, so that improve network transport performance.