CAJ | 학술논문

针对空间网络具有距离远、延时大、周期性间歇连接的特点，提出了一种适用于空间网络的多路径最大吞吐量的路由算法（SMMT）。该算法是对最小费用最大流算法的改进，经过多次最小费用路径查找和残留网络的构造过程，最终可以找出所有满足传输条件的转发路径。仿真实验表明，和传统的ASCOT和S-OSFP单路径路由算法相比，SMMT算法明显提高了网络的吞吐量，减少了数据包的传输时延，使得网络的资源得到充分的利用。
침대공간망락구유거리원、연시대、주기성간헐련접적특점，제출료일충괄용우공간망락적다로경최대탄토량적로유산법（SMMT）。해산법시대최소비용최대류산법적개진，경과다차최소비용로경사조화잔류망락적구조과정，최종가이조출소유만족전수조건적전발로경。방진실험표명，화전통적ASCOT화S-OSFP단로경로유산법상비，SMMT산법명현제고료망락적탄토량，감소료수거포적전수시연，사득망락적자원득도충분적이용。
Aiming at long propagation delay and intermittent network connection of deep-space networks, this paper proposes a noval multi-path routing algorithm(SMMT) that could achieve maximum throughput. SMMT is an upgrade of minimum cost and maximum flow algorithm. By repeatedly searching minimum cost and constructing residual network, one would find all forwording path that could meet the transmission requirement. Simulations and comparisons with traditional ASCOT and S-OSPF algorithm indicate that SMMT algorithm could significantly improve the network throunghput, reduce the packet transmission delay and make full use of the network resource.