It is assumed that the routing topology representing all the paths from one routing group to all other routing groups is a spanning tree.
用路由拓扑来表示从一个路由组到其他所有路由组的所有路径，并假定路由拓扑是一棵生成树。
Simulations show that the computing complexity and the tree cost are lower than the traditional multicast routing algorithm for LEO satellite networks.
仿真结果表明：与传统的LEO卫星网络组播路由算法相比，该算法具有较低的计算复杂度，生成的组播路由树具有较小的开销。
Simulations show that the computing complexity and the tree cost are lower than the traditional multicast routing algorithm for LEO satellite networks.
仿真结果表明：与传统的LEO卫星网络组播路由算法相比，该算法具有较低的计算复杂度，生成的组播路由树具有较小的开销。
应用推荐