一种最大吞吐量的深空通信网络路由算法

Routing algorithm for deep space networks with a maximum throughput

针对深空通信网络中链路的高时延和间断连通性特征,提出了一种以路径吞吐量最大为准则的路由算法.该算法利用存储转发机制,构建端到端的多条路径;以最大化利用链路的连通时段为目标,依据路径中各链路的连通时序图及链路连通时段的吞吐量,确定链路的最大有效传输时间段,构建端到端多跳最大吞吐量路径.理论分析与仿真结果表明,与传统的路由算法相比,该算法支持非实时连通链路的端到端通信,并得到最大吞吐量的端到端路由.

The deep space network has several characteristics not commonly seen in terrestrial wireless networks.Important among them are the long delays and seldom continuous end-to-end paths which make conventional table-driven routing algorithms work inefficiently.To overcome these problems,a routing algorithm focusing on a maximum throughput is proposed.The algorithm constructs multiple end-to-end paths for non-real-time data delivery by utilizing the store-and-forward mechanism.According to intermittent connectivity phases and throughput of links,the available time intervals for data transmission of each link in a path are obtained which aims at maximizing the usage of link connectivity phases.The throughput of each path is calculated based on link available time intervals.The path with a maximum throughput is selected as the end-to-end route.Theoretical analysis and simulation results show that the routing algorithm is capable of supporting end-to-end communication with intermittent links and constructs the route with a maximum throughput.