A Multi-next Hop Routing Algorithm Based on Spanning Tree

Traditional single-next-hop routing algorithms always chose the best path to routing, which often brought transport congestion. It can not sufficiently utilize network resource and can not flexibly distribute traffic. Compared to the traditional single-next hop routing, multi-next hop routing have more advantages. It can implement packets forwarding in parallel, while preserves the best-effort model of the network layer. In this paper, a novel multi-next hop routing algorithm named STSA is presented. After regulating code value with computing spanning tree of network, more paths are built for forwarding packets. Simulation results show that STSA algorithms can improve network throughput and decrease packet losing rate.