Weighted space-time graph-based aerospace information network routing method

Abstract

The invention proposes a weighted space-time graph-based aerospace information network routing method. According to the weighted space-time graph-based aerospace information network routing method, onthe basis that the orbital operation of a node has periodicity and regularity, the motion cycle of a spacecraft is divided into a plurality of static topologies according to the ephemeris; and a weighted space-time graph model is constructed with link bandwidth, delay, storage and other resources used as weights; a route is intelligently selected from a policy library on the basis of topology models, and therefore, routing can be more efficient, and efficient and reliable data transmission in an aerospace information network can be realized.

Description

technical field [0001] The invention belongs to the technical field of aerospace information, relates to a topology model and a routing algorithm in an aerospace environment, and specifically relates to a routing method for an aerospace information network based on a weighted space-time graph, thereby ensuring rapid transmission of real-time information and reliable transmission of key information and high-efficiency transmission of large-flow information. Background technique [0002] The spatial information network has the ability of global coverage, can guarantee high-speed transmission and wide bandwidth, and supports flexible and large-scale network structure. It is very different from the Internet based on infrastructure in terms of networking methods, communication modes, and resource capabilities. The spatial scale and time scale of the network are complex, and it is difficult to borrow the relatively mature networking technologies of the current Internet, telecommun...

AI Technical Summary

Problems solved by technology

[0004] Due to the limitation of resources such as spectrum and orbit, as well as the network topology structure with large space-time span, and the network environment with high dynamic and intermittent connectivity, routing convergence is difficult and maintenance costs are high, which is bound to compete for limited network resources. In addition, satellite nodes customize a simplified architecture. It further makes the traditional routing mechanism difficult to apply, and poses new problems and challenges for the routing algorithm of the aerospace information network

[0005] Among the existing routing algorithms, message copy routing algorithms include single-copy routing algorithms and multi-copy routing algorithms, but the former cannot guarantee successful delivery, and the latter tends to waste bandwidth and energy resources. At the same time, in the topology model after time slice division, it is necessary to consider Different Routing Strategies for Connected and Disconnected Networks

Images