Multi-attribute constraint segmentation routing method for giant low-orbit satellite constellation
Through the multi-attribute constraint segmented routing method, the problems of low-orbit satellite giant constellations are solved, and efficient routing management and multi-attribute constraint routing are realized, which is suitable for multi-service coexistence scenarios.
Patent Information
- Application Number
- CN202410951622.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-16
- Publication Date
- 2024-11-22
AI Technical Summary
The giant constellations of low-orbit satellites have problems with low routing efficiency and high routing computing overhead when routing, especially in the future Internet networking scenarios that integrate space, space, earth and sea.
Using the multi-attribute constraint segment routing method, the initial routing path between the current node and the destination node is obtained by obtaining the destination communication data and the corresponding destination segment domain, and the target routing path is determined through the principle of multi-attribute consistency iteration. , reduce the amount of routing calculation and iteration delay.
It improves the routing efficiency of low-orbit satellite giant constellations, reduces routing computing overhead, and realizes efficient node management and multi-attribute constraint routing to meet the needs of multi-service coexistence scenarios.
Smart Images

Figure CN119010983A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of satellite communication technology, and in particular to a multi-attribute constellation segment routing method for a low-orbit satellite giant constellation. Background Art
[0002] In the future low-orbit satellite giant constellation interconnection networking scenario that integrates air, space, land and sea, due to the large-scale nodes in the network structure and its highly dynamic topological characteristics, the existing low-orbit satellite constellations have problems with low routing efficiency and high routing calculation overhead when performing routing.
[0003] Therefore, how to improve the routing efficiency of LEO satellite giant constellations and reduce routing calculation overhead has become a pressing issue to be addressed.
[0004] The above contents are only used to assist in understanding the technical solution of the present application and do not constitute an admission that the above contents are prior art. Summary of the invention
[0005] The main purpose of this application is to provide a multi-attribute constellation segment routing method for a low-orbit satellite giant constellation, aiming to solve the technical problem of how to improve the routing efficiency of a low-orbit satellite giant constellation and reduce the routing calculation overhead.
[0006] To achieve the above object, the present application provides a multi-attribute constrained segment routing method for a low-orbit satellite giant constellation, the method being applied to a low-orbit satellite giant constellation network, the low-orbit satellite giant constellation network comprising a plurality of segment domains, the method comprising:
[0007] Acquire a destination node corresponding to the target communication data, and determine a destination segment domain corresponding to the destination node;
[0008] Obtaining an initial routing path corresponding to the current node and the destination node;
[0009] Determine the target routing path through the multi-attribute consistency iteration principle, the target segment domain and the initial routing path;
[0010] The target communication data is sent to the destination node according to the target routing path.
[0011] In one embodiment, the step of determining the target routing path through the multi-attribute consistency iteration principle, the destination segment domain and the initial routing path includes:
[0012] When it is detected that the destination segment domain is the current segment domain, the initial routing path is screened according to a multi-attribute consistency iteration principle to determine a dominant routing path;
[0013] A target routing path is determined through the dominant routing path.
[0014] In one embodiment, the step of screening the initial routing path according to the multi-attribute consistency iteration principle to determine the dominant routing path includes:
[0015] Obtaining an initial path tuple corresponding to the initial routing path;
[0016] Traversing the initial path tuple to determine whether there is a constrained routing tuple that complies with the multi-attribute consistency iteration principle;
[0017] If so, the routing path corresponding to the constrained routing tuple is used as the dominant routing path.
[0018] In one embodiment, the step of determining the target routing path through the dominant routing path includes:
[0019] Obtaining a target service demand indicator; the target demand indicator includes a delay indicator, a throughput indicator or a reliability indicator;
[0020] A target routing path is determined according to the target service requirement indicator and the dominant routing path.
[0021] In one embodiment, each of the plurality of segment domains corresponds to a representative node; and the step of determining the target routing path by using the multi-attribute consistency iteration principle, the target segment domain and the initial routing path further includes:
[0022] When it is detected that the destination segment domain is not the current segment domain, obtaining a destination representative node corresponding to the destination segment domain;
[0023] Get the current representative node corresponding to the current segment domain;
[0024] A target routing path is determined according to the current representative node, the destination representative node, a multi-attribute consistency iteration principle and the initial routing path.
[0025] In one embodiment, the step of determining the target routing path according to the current representative node, the destination representative node, the multi-attribute consistency iteration principle and the initial routing path includes:
[0026] Screening the initial routing path according to the destination segment domain and a preset path evaluation function to determine a target inter-domain routing path between the current segment domain and the destination segment domain;
[0027] Obtaining the intermediate segment domain and the intermediate border node corresponding to the target inter-domain routing path;
[0028] The target routing path is determined by the current representative node, the intermediate segment domain, the intermediate boundary node, the destination representative node and a multi-attribute consistency iteration principle.
[0029] In one embodiment, before obtaining the destination node corresponding to the target communication data, the method further includes:
[0030] Obtaining target structure parameters corresponding to the low-orbit satellite giant constellation network;
[0031] constructing an initial time-varying graph according to the target structural parameters;
[0032] The low-orbit satellite giant constellation network is divided into the plurality of segment domains based on a routing update indicator and the target time-varying graph.
[0033] In addition, to achieve the above-mentioned purpose, the present application also proposes a multi-attribute constrained segment routing device for a low-orbit satellite giant constellation, the device is applied to a low-orbit satellite giant constellation network, the low-orbit satellite giant constellation network includes a plurality of segment domains, and the multi-attribute constellation constellation The multi-attribute constellation routing device for the low-orbit satellite giant constellation includes:
[0034] A segment domain determination module, used to obtain a destination node corresponding to target communication data, and determine a destination segment domain corresponding to the destination node;
[0035] An initial routing module, used to obtain an initial routing path corresponding to the current node and the destination node;
[0036] A routing screening module, used for determining a target routing path through a multi-attribute consistency iteration principle, the target segment domain and the initial routing path;
[0037] A target routing module is used to send the target communication data to the destination node according to the target routing path.
[0038] In addition, to achieve the above-mentioned objectives, the present application also proposes a multi-attribute constrained segment routing device for a low-orbit satellite giant constellation, the device comprising: a memory, a processor, and a multi-attribute constrained segment routing program for a low-orbit satellite giant constellation stored in the memory and executable on the processor, the multi-attribute constellation constellation multi-attribute constellation segment routing program being configured to implement the steps of the multi-attribute constellation segment routing method for a low-orbit satellite giant constellation as described above.
[0039] In addition, to achieve the above-mentioned purpose, the present application also proposes a storage medium, on which a multi-attribute constrained segment routing program for a low-orbit satellite giant constellation is stored. When the multi-attribute constellation constellation multi-attribute constellation segment routing program is executed by a processor, the steps of the multi-attribute constellation segment routing method for a low-orbit satellite giant constellation as described above are implemented.
[0040] The present application discloses a multi-attribute constrained segment routing method for a giant low-orbit satellite constellation, the method comprising: obtaining the destination node corresponding to the target communication data, and determining the destination segment domain corresponding to the destination node; obtaining the initial routing path corresponding to the current node and the destination node; determining the target routing path through the multi-attribute consistency iteration principle, the destination segment domain and the initial routing path; and sending the target communication data to the destination node according to the target routing path. The present application divides the giant low-orbit satellite constellation into non-overlapping network segment domains, thereby performing segment routing based on different segment domains, reducing the amount of routing calculations and reducing routing iteration delays; and performing multi-attribute consistent constraint routing, selecting the best routing path that meets multiple indicator constraints, thereby improving routing efficiency and reducing routing overhead. BRIEF DESCRIPTION OF THE DRAWINGS
[0041] Figure 1 This is a first flow chart of the first embodiment of the multi-attribute constellation segment routing method of the low-orbit satellite giant constellation of the present application;
[0042] Figure 2 A schematic diagram of the structure of a low-orbit satellite mega-constellation according to the first embodiment of the multi-attribute constellation segment routing method for a low-orbit satellite mega-constellation of the present application;
[0043] Figure 3 This is a second flow chart of the first embodiment of the multi-attribute constellation segment routing method for a LEO satellite giant constellation of the present application;
[0044] Figure 4 A schematic diagram of satellite network segment domain division of the first embodiment of the multi-attribute constellation segment routing method for a low-orbit satellite giant constellation of the present application;
[0045] Figure 5 A schematic diagram of satellite distribution in a segmented domain of the first embodiment of a multi-attribute constellation segmented routing method for a LEO satellite giant constellation of the present application;
[0046] Figure 6 This is a schematic diagram of the segment domain partitioning process of the first embodiment of the multi-attribute constellation segment routing method of the low-orbit satellite giant constellation of the present application;
[0047] Figure 7 This is a third flow chart of the first embodiment of the multi-attribute constellation segment routing method for a LEO satellite giant constellation of the present application;
[0048] Figure 8 This is a fourth flow chart of the first embodiment of the multi-attribute constellation segment routing method for a LEO satellite giant constellation of the present application;
[0049] Fig. 9 A schematic diagram of path tuple comparison of the first embodiment of the multi-attribute constellation segment routing method for a LEO satellite giant constellation of the present application;
[0050] Fig.10 This is a schematic diagram of the first process of the second embodiment of the multi-attribute constellation segment routing method of the low-orbit satellite giant constellation of the present application;
[0051] Fig.11 A schematic diagram of representative node distribution of the second embodiment of the multi-attribute constrained segment routing method of the low-orbit satellite giant constellation of the present application;
[0052] Fig.12 This is a second flow chart of the second embodiment of the multi-attribute constellation segment routing method of the low-orbit satellite giant constellation of the present application;
[0053] Fig.13 This is a schematic diagram of inter-domain segment routing of the second embodiment of the multi-attribute constellation segment routing method of the low-orbit satellite giant constellation of the present application;
[0054] Fig.14 This is a schematic diagram of the module structure of a multi-attribute constellation segment routing device for a low-orbit satellite giant constellation according to an embodiment of the present application;
[0055] Fig.15 Schematic diagram of the device structure of the hardware operating environment involved in the multi-attribute constellation segment routing method of the low-orbit satellite giant constellation in the embodiment of the present application.
[0056] The realization of the purpose, functional features and advantages of this application will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION
[0057] It should be understood that the specific embodiments described herein are only used to explain the technical solutions of the present application and are not used to limit the present application.
[0058] In order to better understand the technical solution of the present application, a detailed description will be given below in conjunction with the accompanying drawings and specific implementation methods.
[0059] The main solution of this application is: obtain the destination node corresponding to the target communication data, and determine the destination segment domain corresponding to the destination node; obtain the initial routing path corresponding to the current node and the destination node; determine the target routing path through the multi-attribute consistency iteration principle, the destination segment domain and the initial routing path; send the target communication data to the destination node according to the target routing path.
[0060] The existing routing strategies in low-orbit satellite constellations can be divided into centralized and distributed. The centralized strategy usually uses virtual topology or virtual node methods to transform the satellite topology into a static topology, and the shortest path algorithm can be executed on the static topology to obtain the routing path with the minimum propagation delay, but the routing calculation overhead of this scheme is large. Compared with the centralized strategy, the distributed routing strategy can make more flexible and adaptive routing decisions based on the collected global or local network information. When the global network information is used for routing, each satellite maintains a real-time database that describes the status information of the entire network. To ensure the real-time nature of the database, it is necessary to flood the status information of each satellite through the network, such as available link ports, satellite load, etc. However, due to the tens of milliseconds of delay in inter-satellite links (ISLs), flooding the entire network between large-scale satellite nodes will result in a long routing convergence time.
[0061] In response to the deficiencies in the above-mentioned prior art, the present application provides a low-complexity multi-attribute constellation segmented routing method for a low-orbit satellite giant constellation, which divides the entire network into segmented domains, and selects a routing method that meets the multi-attribute constraints through step-by-step routing between segmented domains, thereby achieving efficient node management and reducing routing calculation overhead.
[0062] It should be noted that the execution subject of this embodiment can be a computing service device with data processing, data transmission, program running and mobile routing functions, such as a tablet computer, a personal computer, a mobile phone, etc., or a data-intensive application that can realize the above functions, etc., and this embodiment does not specifically limit this. The following takes the multi-attribute constrained segment routing device (referred to as the routing device) of the low-orbit satellite giant constellation as an example of the execution subject to illustrate this embodiment and the following embodiments.
[0063] Based on this, the embodiment of the present application provides a multi-attribute constraint segment routing method for a giant constellation of low-orbit satellites, referring to Figure 1 , Figure 1 This is a first flow chart of the first embodiment of the multi-attribute constellation segment routing method for a low-orbit satellite giant constellation of the present application.
[0064] In this embodiment, the multi-attribute constrained segment routing method of the low-orbit satellite giant constellation is applied to the low-orbit satellite giant constellation network, and the low-orbit satellite giant constellation network includes a plurality of segment domains. The multi-attribute constellation constellation segment routing method of the low-orbit satellite giant constellation includes steps S10 to S40:
[0065] Step S10, obtaining a destination node corresponding to the target communication data, and determining a destination segment domain corresponding to the destination node;
[0066] For ease of understanding, this embodiment takes a single-layer satellite constellation as an example. Considering that ground services are unevenly distributed geographically and concentrated in mid-latitudes, a Walker-Delta constellation structure with good multiple coverage in mid-latitudes can be used as the above-mentioned low-orbit satellite giant constellation. The satellite orbits in the low-orbit satellite giant constellation can be circular orbits, with each orbit plane evenly distributed and satellites in the orbit evenly distributed. Its structure can be as follows: Figure 2 As shown, Figure 2 This is a schematic diagram of the structure of a low-orbit satellite mega-constellation according to the first embodiment of the multi-attribute constellation segment routing method of the low-orbit satellite mega-constellation of the present application.
[0067] like Figure 2 As shown in the figure, the LEO satellite mega-constellation structure can adopt an inclined Walker-delta constellation and define N O There are N tracks on each track. P satellites, the network topology of the entire low-orbit satellite giant constellation can include N = N O ×N P Satellites are interconnected by intersatellite lasers. Each satellite node has four FSO-ISLs (Free-Space Optical—Inter-Satellite Links), including two intra-orbit links and two inter-orbit links, for inter-satellite communication. A large number of low-orbit satellites are interconnected by ISLs, thus establishing the above-mentioned giant low-orbit satellite constellation.
[0068] It should be understood that in order to reduce the routing convergence time of the low-orbit satellite giant constellation, the present embodiment can divide the network structure of the low-orbit satellite giant constellation to obtain several segmented domains, that is, multiple low-orbit satellite sub-networks. Different from the prior art, the existing regional division strategy usually only considers uniform partitioning, which increases the complexity of the border area routing algorithm and does not fully consider the coordinated optimization of intra-regional routing and inter-regional routing.
[0069] Therefore, the present application aims to minimize the inter-domain routing update time within the joint domain, and divides the entire network into segments based on the constellation parameters to achieve efficient node management and reduce routing calculation overhead. Figure 3 , Figure 3 This is a second flow chart of the first embodiment of the multi-attribute constrained segment routing method for a LEO satellite giant constellation of the present application. Steps A1 to A3 may be included before step S10:
[0070] Step A1, obtaining target structural parameters corresponding to the low-orbit satellite giant constellation network;
[0071] Step A2, constructing an initial time-varying graph according to the target structure parameters;
[0072] Step A3: dividing the low-orbit satellite giant constellation network into the plurality of segment domains based on the routing update index and the target time-varying graph.
[0073] It is easy to understand that most of the current partitioning methods consider the geometric parameters and motion state of the satellite network topology, but lack consideration of routing performance, such as routing update time, which can refer to the process in which after the network topology changes, the topology change information is flooded to each node in the network, and finally the information of all nodes is synchronized and returns to a stable state. Therefore, this embodiment can perform regional division based on routing update time, thereby further reducing the satellite routing iteration delay and improving routing efficiency.
[0074] It can be understood that the present application can obtain the target structural parameters corresponding to the low-orbit satellite giant constellation network, that is, the geometric parameters of the satellite network topology (total number of nodes, number of orbits and number of orbital satellites) and the initial time-varying graph for motion state modeling, and construct the target time-varying graph in combination with the routing update cycle of the satellite network. The target time-varying graph can be a weighted undirected connected graph G(V,E) within the time interval, and the weight of ISL can be the link budget in the target time-varying graph.
[0075] For ease of understanding, combined Figure 4 The following example illustrates the division of segment domains. Figure 4 This is a schematic diagram of satellite network segment domain division of the first embodiment of the multi-attribute constellation segment routing method for a low-orbit satellite giant constellation of the present application, Figure 4 The left side in the middle is the initial time-varying graph constructed based on the target structural parameters of the LEO satellite giant constellation network. Figure 4 The right side is a time-varying graph of the target after the segment domains are divided in combination with the routing update index. The grid structure of the satellite network has good symmetry and regularity. Based on this, the present embodiment can divide the entire network into several segment domains, such as Figure 4 Different segment domains are marked with different colors. These segment domains cover all nodes in the satellite network and do not overlap with each other. It can be understood that although Figure 4 The size structure of each segment domain is the same, but in actual process, the size structure of each segment domain may be different. The specific division standard is determined according to actual situation, and this embodiment does not impose any limitation on this.
[0076] It should be understood that the above-mentioned routing update indicator can be the joint intra-domain and inter-domain routing update time T of the low-orbit satellite giant constellation. Cov , combined with Figure 4 In this embodiment, the inter-domain routing update time T can be defined by combining the domains. Cov , and minimize the routing update time T CovAs a measure of the effectiveness of segment domain division, segment domain division is performed in combination with the geometric structure parameters of the constellation (total number of nodes, number of orbits and number of orbital satellites).
[0077] In the specific implementation, it is assumed that the low-orbit satellite giant constellation consists of T = Q × P satellites, where Q is the number of satellites on each orbit and P is the number of orbits. The entire constellation is divided into several segment domains, each of which contains L × K satellites. L is the number of satellites on the same orbit in each segment domain, and K is the number of orbits contained in the segment domain. We use the form of (L, K) value pairs to represent the size of the segment domain. The specific division structure can be as follows Figure 5 As shown, each segment domain may include a segment domain boundary satellite node, a segment domain member satellite node, and an adjacent segment domain neighboring node. Figure 5 This is a schematic diagram of the distribution of satellites in the segmented domain of the first embodiment of the multi-attribute constellation segmented routing method of the low-orbit satellite giant constellation of the present application.
[0078] It is easy to understand that when the total number and structure of constellation nodes are determined, the number and size of segment domains are negatively correlated. When the number of segment domains is large, the intra-segment domain routing update time and computational complexity can be reduced; however, when the number of segment domains is large, the computational complexity of inter-domain routing and the number of information exchanges increase, and vice versa. Based on the above situation, this embodiment can define the intra-domain and inter-domain routing update time T Cov As shown below:
[0079] T Cov =r×(T SPF +T Flood );
[0080] Where r is the number of segment domains; T SPF is the computation time of the shortest path in the domain; T Flood It is the flooding time of information in the domain.
[0081] Then, in this embodiment, the routing device can minimize the routing update time T Cov As a measure of the effectiveness of segmentation, the LEO satellite giant constellation is segmented. The optimization goal of segmentation is to minimize the inter-domain routing update time T in the joint domain. Cov , that is, the segmentation domain division must meet the following indicators:
[0082] min{T Cov}=min{r×(T SPF +T Flood )};
[0083] Understandably, T Flood It can be approximated as the delay between the two farthest nodes. The farthest nodes in each segment domain are the two diagonal nodes, and their delay can be expressed as:
[0084] T Flood ≈L×T x +K×T y ;
[0085] Where, T x With T y They represent the average delays of the inter-satellite links within the orbital plane and the inter-orbital planes, respectively.
[0086] In addition, it is known that when L×T x =K×T y When other conditions remain unchanged, when the number of satellites in the constellation gradually increases, the satellite density in the constellation increases, so the inter-satellite link length gradually decreases, and we can approximately have T x ≈T y Therefore, when L and K are close to each other, that is, the segment domain is approximately the same length and width, the minimum T Flood Considering that L and K are both positive integers, the number of segmented domains after division is also a positive integer, so the most convenient way is to make them close to the common factors of Q and P, otherwise rounding leaves a margin.
[0087] Combined with the above analysis process, it can be seen that when a given low-orbit satellite network is segmented, the inter-domain routing update time T in the joint domain can be minimized. Cov As the target, combined with the target structure parameters, in this embodiment, the detailed process of segmentation domain division can be as follows Figure 6 As shown, Figure 6 This is a schematic diagram of the segment domain partitioning process of the first embodiment of the multi-attribute constellation segment routing method of the low-orbit satellite giant constellation of the present application.
[0088] like Figure 6 As shown, in this embodiment, when performing segment domain division, the default segment area can be initialized based on the target structure parameters such as the constellation parameters, the initial time-varying graph is obtained, and the initial inter-domain routing update time T corresponding to the initial joint domain is calculated. cov 0 Then, the routing device can traverse various segment domain division methods to adjust the area parameters K and L after the update, and calculate the updated inter-domain routing update time T after the update of the joint domain. cov 1 , and determine whether T is satisfied cov 1 ≤T cov 0 If so, then the inter-domain routing update time T cov 1 Covers the initial inter-domain routing update time T within the joint domain cov 0 , that is, Tcov 0 ←T cov 1 , and proceed to the next traversal; if not, proceed directly to the next traversal. After the traversal is detected to be completed, the minimum intra-domain and inter-domain routing update time T obtained by the Nth traversal is calculated. cov N The corresponding division method divides the low-orbit satellite giant constellation into segmented domains.
[0089] Step S20, obtaining an initial routing path corresponding to the current node and the destination node;
[0090] It can be understood that when communicating between satellites, the target communication data needs to be sent from the satellite corresponding to the current node to the satellite corresponding to the destination node. Since the low-orbit satellite giant constellation contains large-scale nodes, there may be more than one routing path from the current node to the destination node, and the above-mentioned initial routing path can be a feasible routing path between the current node and the destination node.
[0091] It should be noted that, since the low-orbit satellite giant constellation is divided into several segment domains in this embodiment, further, in this embodiment, when the destination node and the current node are located in the same segment domain, the above-mentioned initial routing path can be directly all feasible links between the destination node and the current node; and when the destination node and the current node are not located in the same segment domain, the above-mentioned initial routing path can be directly the segment domain routing path between the destination segment domain and the current segment domain, instead of directly obtaining all feasible links between the destination node and the current node, thereby effectively reducing the amount of routing calculations and improving routing efficiency.
[0092] For ease of understanding, assume that in a network that has been divided into segmented domains, satellite V i The index number can be expressed as:
[0093] V i =N P Q m +X n ;
[0094] Among them, Q m ∈{0,1,2,...,N O -1} is the track number index, indicating that it is located at Q m Track.X n ∈{0,1,2,...,N P -1} indicates the satellite number index in the orbit, indicating the Xth satellite in the orbit n satellites.
[0095] According to the segment division method, assuming that the number of segments of the target routing path is r, the kth segment domain is defined as S k , segment domain S k The number of satellites in is defined as Where k∈{1,2,...,r} and satisfies the following formula:
[0096]
[0097] Therefore, this embodiment can be combined with the use of satellite node set V = {V i |0≤i≤N-1}, ISL set E={E (i,j) |0≤i≤N-1,0≤j≤N-1,i≠j}, segment domain set S={S k |1≤k≤r} to represent the satellite network topology of the dynamic time-varying graph within the time interval.
[0098] Based on the above principle, assuming that V s and V d They represent the current (satellite) node and the destination (satellite) node respectively, and assuming that the determined initial routing path will pass through n segment domains, the above-mentioned initially determined initial routing path can be: S s -S 2 -...-S d , ds=n.
[0099] Step S30, determining the target routing path through the multi-attribute consistency iteration principle, the target segment domain and the initial routing path;
[0100] In one possible implementation, refer to Figure 7 , Figure 7 This is a third flow chart of the first embodiment of the multi-attribute constrained segment routing method for a LEO satellite giant constellation of the present application. Step S30 may include steps B1 to B2:
[0101] Step B1, when it is detected that the destination segment domain is the current segment domain, the initial routing path is screened according to a multi-attribute consistency iteration principle to determine a dominant routing path;
[0102] It can be understood that from the above analysis, in this embodiment, routing can be divided into intra-domain routing and inter-domain routing. When the destination segment domain is the current segment domain, it is intra-domain routing. At this time, this embodiment can directly use all feasible links between the destination node and the current node as the initial routing path, and screen the initial routing path to determine the dominant routing path.
[0103] In one possible implementation, refer to Figure 8 , Figure 8This is a fourth flow chart of the first embodiment of the multi-attribute constrained segment routing method for a LEO satellite giant constellation of the present application. Step B1 may include steps B11 to B13:
[0104] Step B11, obtaining an initial path tuple corresponding to the initial routing path;
[0105] It should be noted that the above initial path tuple can be the link weights corresponding to all feasible links between the destination node and the current node, and this embodiment can perform routing screening based on the link weights in this form. It is understandable that in a network where multiple services coexist, existing routing algorithms usually perform weighted sorting on multiple attributes, or a single calculation is only for a single service, which cannot be applied to the coexistence of multiple types of services in the future low-orbit satellite giant constellation.
[0106] For example, in 3GPP, business-critical MC services are divided into three categories, namely MCPTT services, MCData services, and MCVideo services. MCPTT is a voice type service whose data rate can range from 20kbps to 70kbps, depending on the codec and PTT implementation. MCData includes services such as short data services, file distribution, and data streaming for remote control of robots and drones. The data rate range of MCData is 10kbps to 1Mbps. MCVideo includes three different video modes: emergency real-time video, non-emergency real-time video, and non-real-time video. Depending on the required video quality, the data rate requirements of the MCVideo service may vary from 150kbps to 5Mbps. The Quality of Service (QoS) characteristics of MCPTT, MCData, and MCVideo are defined by 3GPP, including packet delay budget and packet error rate, which are used as guidelines for end-to-end QoS traffic forwarding processing. For example, the packet delay budget allowed for the MCPTT service is 75ms, and the packet error rate (PER) upper limit is 10-2; the packet delay budget allowed for the MCData service is 200ms, and the PER upper limit is 10-6; the packet delay budget allowed for the MCVideo service is 100ms, and the PER upper limit is 10-3.
[0107] In the future, giant constellation networks may include different application scenarios, such as smart home, interactive data services, industrial manufacturing, and the Internet of Things (IoT). At the same time, different application scenarios contain multiple services, and the requirements for QoS are also diverse. The main difference between these services lies in their sensitivity and priority to QoS requirements.
[0108] For example, interactive data services and immersive services such as virtual reality (VR) in smart home scenarios are very sensitive to latency, while video-on-demand services have strict requirements on packet loss rate and latency. In contrast, a large number of data transmission services pay more attention to link utilization and packet loss rate to ensure fast and accurate data transmission. Therefore, this embodiment can classify the above-mentioned different business services into three types: latency-sensitive (LS), throughput-sensitive (TS) and high-reliability (HR).
[0109] In addition, the packet delay budget defines the allowed delay for packet transmission between user equipment and the core network, and the packet error rate defines the upper limit of the non-congestion related packet loss rate. Network congestion and network jitter caused by satellite movement are key factors leading to packet loss.
[0110] Therefore, based on the above principle, this embodiment can use three attributes of link propagation delay, link available buffer and jitter to represent the link weight:
[0111] ① Link propagation delay D: It is determined by the actual ISL link length between the two satellite nodes and the time required for data packet transmission;
[0112] ② Link available buffer A: For an ISL connecting two satellites, let bt represent the buffer queue length at time slot t, and B represent the maximum length of the buffer queue. The available buffer occupancy can be calculated by the following formula:
[0113]
[0114] ③ Jitter J: The delay variation of the ISL link between the current moment and the previous moment. The variation is an absolute value with no positive or negative sign.
[0115] Therefore, in the path calculation of this embodiment, according to these three attributes, the link weight is modeled as a basic path tuple and expressed as {D, A, J}, which correspondingly contains three attributes.
[0116] It is easy to understand that there may be more than one node between the current node and the destination node, so the basic path tuple can be gradually expanded to obtain the initial path tuple that finally corresponds to the current node and the destination node.
[0117] Exemplarily, the expansion operation of the tuple can be defined as follows in this embodiment: D, A and J are expanded by addition and minimum and maximum operators respectively, that is, the basic tuple {D 1 ,A 1 ,J 1} and the basic tuple {D 2 ,A2 ,J 2 The extended tuple of} can be {D 1 +D 2 ,min(A 1 ,A 2 ),max(J 1 ,J 2 )}, based on this principle, this embodiment can obtain the initial path tuples corresponding to all feasible links between the current node and the destination node.
[0118] Step B12, traversing the initial path tuple to determine whether there is a constrained routing tuple that complies with the multi-attribute consistency iteration principle;
[0119] Step B13: If yes, the routing path corresponding to the constraint routing tuple is used as the dominant routing path.
[0120] Furthermore, during route calculation, this embodiment can iteratively calculate the path tuples of any two paths with the same current node and destination node. At the same time, in order to meet the above-mentioned diverse business needs, this embodiment is based on the iterative calculation delay, available cache and multi-attribute consistency between jitter indicators, and selects the dominant routing path by screening the path tuples according to the multi-attribute consistency, and then selects the optimal path that meets the conditions.
[0121] Therefore, this embodiment can compare the initial path tuples according to the path tuples and extensions corresponding to the links between the nodes, and use the multi-attribute consistency iteration principle to obtain the optimal routing path based on the comparison results, including the destination satellite logical address and the next-hop satellite logical address corresponding to the destination node.
[0122] It should be noted that, due to the presence of multiple attributes in the ISL path tuple, when designing the routing algorithm, it is not possible to directly compare the size of the paths under the constraints of multiple attributes to determine the quality of the paths. Only when all attributes are better, the path tuple is considered better. Because if a path between two nodes achieves multi-attribute consistency, then their relative preference remains unchanged after being expanded by the third path tuple. If the two paths do not achieve multi-attribute consistency, then their relative preference may change after being expanded by the third path tuple.
[0123] Therefore, in this embodiment, under multi-attribute constraints, such as the constraints corresponding to the above three attributes, for any two paths between the current node and the destination node, if all attributes in the extended path tuple of one of the paths are better than the other, then it achieves multi-attribute consistency and complies with the above-mentioned multi-attribute consistency iteration principle; otherwise, it is determined that both paths have not achieved multi-attribute consistency, and both paths can be retained as dominant paths.
[0124] For example, Fig. 9 As shown, Fig. 9 This is a schematic diagram of path tuple comparison of the first embodiment of the multi-attribute constellation segment routing method for a LEO satellite giant constellation of the present application. Fig. 9 The path tuple in the green area (D 2 ,A 2 ,J 2 ) are better than the red area (D 1 ,A 1 ,J 1 ) is better because D 1 >D 2 ,A 1 2 ,J 1 >J 2 , the ISL tuple in the green area has lower propagation delay, higher available buffer and lower network jitter. At this time, it can be determined that the path tuple corresponding to the green area is a constraint routing tuple that meets the requirements, and the routing path corresponding to the green area can be the dominant routing path mentioned above.
[0125] Therefore, in order to select a routing path suitable for the business in the routing calculation stage, this embodiment can perform routing selection operations based on the multi-attribute consistency iteration principle, compare path tuples through attribute consistency, and select a routing path from the current node to the destination node.
[0126] Specifically, in this embodiment, the process of calculating the dominant path in the segment domain according to the multi-attribute consistency can be as follows:
[0127] 1) Assuming that there are n satellites in the segment domain, before the calculation begins, define the set T = {s1, s2, s3, ..., sn} as the satellite nodes that have not been calculated. Initially, select a satellite as the starting node, such as s1. Define the set p as the dominant path from s1 to other nodes in the segment domain obtained by iteratively calculating the extended path tuple and according to the consistency of multiple attributes.
[0128] 2) Select s1 from the set T as the calculation satellite, let the set R represent the candidate calculation satellites in each calculation step, initialize R = {sn}, let the set U represent the adjacent satellites of the calculated satellite, and it needs to satisfy U belongs to T but not to R, initialized to U = φ.
[0129] 3) Then, determine the dominant path p from s1 to its neighboring satellites. If the neighboring satellites are in T but not in U, add them to U.
[0130] 4) Otherwise, if the neighboring satellites are not in T and there are new paths added to the dominant paths from s1 to the neighboring satellites, they are selected again as computational satellites.
[0131] 5) Then, s1 is deleted from T and R, and T = {s2, s3, ..., sn} and R = φ are updated.
[0132] 6) When performing the next iteration, if R = φ, let R = U and U = φ.
[0133] The above routing calculation process is iterated, and each time a satellite in R is selected as the calculation satellite until T = φ. Finally, the dominant path set p from s1 to other satellites can be obtained.
[0134] Step B2: determining a target routing path through the dominant routing path.
[0135] It can be understood that the above dominant routing paths are the routing paths that are initially optimized based on multi-attribute consistency screening. When the number of dominant routing paths is greater than or equal to one, this embodiment can further screen them to determine the optimal routing path between the current node and the destination node.
[0136] In a feasible implementation manner, in this embodiment, step B2 may include steps B21 to B22:
[0137] Step B21, obtaining a target service demand indicator; the target demand indicator includes a delay indicator, a throughput indicator or a reliability indicator;
[0138] Step B22: determining a target routing path according to the target service demand indicator and the dominant routing path.
[0139] In addition, considering that there will be different services in the actual constellation network, the routing strategy design can jointly consider multiple network indicators. For example, for delay-sensitive services LS, the priority can be the end-to-end delay; for high-throughput services TS, the priority can be the throughput size; for high-reliability services HR, the priority can be the packet loss rate. Traditional routing protocols such as link state protocols and distance vector protocols usually only consider a single attribute indicator, such as bandwidth, when running. Or the existing routing algorithms optimize different parameters according to different services, rather than optimizing multiple parameters at the same time. Therefore, when the existing routing algorithms are applied to scenarios where multiple services coexist, they will generate a large routing calculation overhead.
[0140] Therefore, in order to improve user experience and reduce routing calculation overhead, this embodiment can further screen the dominant routing path based on the user's business needs. It should be understood that the above-mentioned target business demand index can be a business preference index determined by the user, so that the best route selection can be based on it to meet the user's different business needs.
[0141] For example, in this embodiment, after obtaining the dominant path p from s1 to other satellites, the best routing path can be selected from p according to the preference attributes of LS, TS and HR. The steps can be as follows:
[0142] A) If the dominant path set p has only one path, then the dominant path is selected as the target routing path.
[0143] B) If there are multiple paths in the dominant path set p, the target routing path is selected based on the attribute preferences of different services:
[0144] b1) For example, for delay-sensitive LS services, the path with the smallest delay D in the extended path tuple is preferentially selected from the dominant path set;
[0145] b2) For throughput-sensitive TS services, the path with the larger available buffer A in the extended path tuple is preferentially selected from the dominant path set;
[0146] b3) For HR services with higher reliability requirements, the available buffer A and jitter J in the extended path tuple are comprehensively considered, and the path with jitter J < 15ms can be selected first. If there are multiple paths, the path with larger available buffer is selected.
[0147] In summary, for routing within a segmented domain, this embodiment can obtain the best target routing path by distributed calculation based on link attributes by nodes within the segmented domain. Specifically, in response to the needs of diversified services, this embodiment can set the multi-attribute consistency of latency, available cache and jitter indicators, iteratively calculate and select the optimal path that can meet the conditions, and realize routing for three different task business needs: latency-sensitive (LS), throughput-sensitive (TS) and / or high-reliability (HR).
[0148] It is easy to understand that if the current node and the destination node are located in the same segment domain, the above-mentioned multi-attribute consistency iteration principle can be used to directly find the destination satellite; if the current satellite and the destination satellite are in different segment domains, the routing calculation will be further performed based on the initial routing path and the multi-attribute consistency iteration principle.
[0149] Step S40: sending the target communication data to the destination node according to the target routing path.
[0150] It is easy to understand that after determining the target routing path, this embodiment can gradually forward the target communication data to the destination node according to the links corresponding to the target routing path.
[0151] In this implementation, for a single-layer satellite constellation of large-scale satellite nodes, multi-attribute constrained segment routing (MCSR) is used, and the inter-domain routing update time T is defined. Cov , to minimize the routing update time T Cov As a measure of the effectiveness of segmentation domain division, the constellation structure parameters (total number of nodes, number of orbits and number of orbital satellites) are combined to construct disjoint network segmentation domains, and then multi-attribute constrained routing operations are performed based on the segmentation domains to achieve personalized routing operations and reduce routing calculation overhead.
[0152] When calculating the route within the segmented domain, this embodiment can use the satellite nodes within the segmented domain as the basic unit, and each node can complete the intra-domain routing through distributed calculation. Specifically, in order to meet the needs of coexistence of multiple services, this embodiment comprehensively considers the constraints of the three attributes of delay D, available buffer A and jitter J, and forms the three service indicators into a basic path tuple {D, A, J}, and uses this as the ISL link weight. When calculating the path within the segmented domain, the optimal routing path that meets the conditions is selected based on the expansion operation of the path tuple and the consistency iteration of multiple attributes, thereby effectively reducing the routing iteration delay, improving routing efficiency, and reducing routing overhead.
[0153] This embodiment discloses a multi-attribute constrained segment routing method for a low-orbit satellite giant constellation. The method is applied to a low-orbit satellite giant constellation network. This embodiment obtains the target structure parameters corresponding to the low-orbit satellite giant constellation network; constructs an initial time-varying graph according to the target structure parameters; and divides the low-orbit satellite giant constellation network into several segment domains based on the routing update index and the target time-varying graph. Therefore, in this embodiment, for a single-layer satellite constellation of large-scale satellite nodes, the inter-domain routing update time within the joint domain is defined through segment routing with multi-attribute constraints, and the minimization of the routing update time is used as a measure of the effectiveness of the segment domain division. The constellation structure parameters (total number of nodes, number of orbits, and number of orbital satellites) are combined to construct non-overlapping network segment domains, thereby performing segment routing based on the segment domain, reducing the amount of routing calculations, and reducing the routing iteration delay.
[0154] At the same time, this embodiment obtains the destination node corresponding to the target communication data, and determines the destination segmentation domain corresponding to the destination node; obtains the initial routing path corresponding to the current node and the destination node; when it is detected that the destination segmentation domain is the current segmentation domain, obtains the initial path tuple corresponding to the initial routing path; traverses the initial path tuple to determine whether there is a constraint routing tuple that meets the multi-attribute consistency iteration principle; if so, the routing path corresponding to the constraint routing tuple is used as the dominant routing path. Obtain the target business demand index; the target demand index includes a delay index, a throughput index or a reliability index; determine the target routing path according to the target business demand index and the dominant routing path. Send the target communication data to the destination node according to the target routing path. This embodiment further performs routing operations with multi-attribute constraints based on the segmentation domain, selects the best routing path that meets multiple indicator constraints, implements personalized routing operations, and reduces routing calculation overhead.
[0155] In addition, when performing intra-segment domain routing calculations, this embodiment can use the satellite nodes in the segment domain as the basic unit, and each node can perform distributed computing to complete the intra-domain routing. Specifically, in order to meet the needs of coexistence of multiple services, this embodiment comprehensively considers the constraints of the three attributes of delay, available buffer and jitter, forms the three service indicators into a basic path tuple, and uses this as the link weight of the inter-satellite link. When calculating the intra-segment domain path, the optimal routing path that meets the conditions is selected based on the expansion operation of the path tuple and the consistency iteration of multiple attributes, thereby effectively reducing the routing iteration delay, improving routing efficiency, and reducing routing overhead.
[0156] Based on the first embodiment of the present application, in the second embodiment of the present application, the same or similar contents as those in the above-mentioned embodiment 1 can be referred to the above introduction and will not be repeated later.
[0157] It should be understood that in order to reduce the increased computational complexity of the boundary area caused by the segmentation of the domain, a segmentation domain boundary collaboration mechanism is designed, and specific nodes are selected as representatives within the segmentation domain and bridges for cross-segment routing calculations to achieve collaborative optimization of intra-domain routing and inter-domain routing.
[0158] Therefore, in this embodiment, the satellite nodes in the segment domain can be divided into boundary nodes and member nodes in the segment domain. The two nodes have different functions. The boundary nodes collect detailed inter-domain link status information of the segment domain and notify the member nodes in the domain; the member nodes only need to actively perceive the status information of the four directly connected ISLs. For a satellite network that has completed segment domain division, a specific satellite node can determine which orbit it is located in, which satellite number, and the segment domain and node type it is in.
[0159] At the same time, in order to reduce the computational complexity on the segment domain boundary and the number of information interactions between segment domains, a segment domain boundary cooperation mechanism is designed. Under this mechanism, the boundary nodes of each segment domain will vote to select a designated boundary satellite node (DS, Designed Satellite) as a representative to summarize and calculate the average ISL information of the segment domain boundary, and combine the heuristic strategy to calculate the routing path between domains. The DS node is the representative node.
[0160] Therefore, refer to Fig.10 , Fig.10 This is a first flow chart of the second embodiment of the multi-attribute constrained segment routing method for a LEO satellite giant constellation of the present application. In this embodiment, each of the several segment domains corresponds to a representative node; step S30 includes steps C1 to C3:
[0161] Step C1, when it is detected that the destination segment domain is not the current segment domain, obtaining a destination representative node corresponding to the destination segment domain;
[0162] Step C2, obtaining the current representative node corresponding to the current segment domain;
[0163] It is easy to understand that the division of segmented domains will increase the complexity of the boundary area. In order to reduce the computational complexity on the segmented domain boundary and the number of information interactions between segmented domains, a segmented domain boundary cooperation mechanism is designed. In this embodiment, the mechanism can be set as follows:
[0164] The boundary nodes of each segment domain can vote to select a designated boundary satellite node (DesignedSatellite, DS) as the segment domain representative to collect and calculate the average ISL information of the boundary, combine the heuristic strategy to calculate the optimal routing path between domains, and generate the Constellation Segmentation InformationBase (CSIB). The CSIB can be calculated and generated by the DS nodes of each segment domain and announced to the nodes in the domain and maintained regularly. It records the optimal inter-domain routing path from the segment domain to the other segment domains so that it can be called in time when performing inter-domain routing to reduce routing time.
[0165] It should be noted that the selection rule of the above DS node can be: the upper right corner boundary node of the segment domain is used as the initial representative node, and then the best DS node is selected as the representative of the segment domain based on the comparison of the inter-domain link tuples of the boundary nodes in the time snapshot, such as Fig.11 As shown, Fig.11 Schematic diagram of representative node distribution of the second embodiment of the multi-attribute constrained segment routing method for a LEO satellite giant constellation of the present application. Fig.11 The blue node in the upper right corner may be the above-mentioned DS node.
[0166] Step C3, determining a target routing path according to the current representative node, the destination representative node, a multi-attribute consistency iteration principle and the initial routing path.
[0167] It can be understood that in the low-orbit satellite network of this embodiment, the data packet corresponding to the target communication data can be sent along the path from the current node V s To the destination node V d The ISL transmission path between According to the division of segment domains, assuming that this path passes through n segment domains, the path can be expressed as:
[0168]
[0169] in Indicates the path from source to destination In the segment domain S k The path within.
[0170] It should be noted that the above initial routing path may include all feasible inter-domain paths from the segment domain corresponding to the current node to the segment domain of the destination node as shown above, and this embodiment needs to screen them to select the optimal cross-domain path. Finally, the optimal cross-domain routing path and the optimal intra-domain routing path determined by the intra-domain routing method based on the multi-attribute consistency iteration principle are combined to generate the final target routing path.
[0171] It should be understood that in this embodiment, the segment domain can be used as the basic unit, and the DS nodes of each segment domain complete the segment domain routing calculation. Each DS node can be responsible for collecting the average ISL propagation delay between domains in the segment domain, combining heuristic search to calculate the inter-domain routing path, forming the constellation segment information base CSIB, and notifying it to the nodes in the segment domain.
[0172] In addition, according to Fig.11 It can be seen from the satellite network structure divided by segment domains shown in that a segment domain can have four neighboring segment domains, and there are four options when selecting the next segment domain. Therefore, this embodiment can combine heuristic search rules to find the next hop segment domain. Specifically, this embodiment can define an inter-domain path evaluation function during the search process to measure the distance relationship between the current segment domain and the destination segment domain, so that the segment domain selected by the next hop gradually approaches the destination segment domain, thereby improving the routing calculation efficiency.
[0173] Therefore, in a feasible implementation mode, referring to Fig.12 , Fig.12 This is a second flow chart of the second embodiment of the multi-attribute constrained segment routing method for a LEO satellite giant constellation of the present application. In this embodiment, step C3 includes steps C31 to C33:
[0174] Step C31, screening the initial routing path according to the destination segment domain and a preset path evaluation function, and determining a target inter-domain routing path between the current segment domain and the destination segment domain;
[0175] Step C32, obtaining the intermediate segment domain and the intermediate border node corresponding to the target inter-domain routing path;
[0176] Step C33, determining the target routing path through the current representative node, the intermediate segment domain, the intermediate boundary node, the destination representative node and the multi-attribute consistency iteration principle.
[0177] It can be understood that when the current node and the destination node are located in different segment domains, this embodiment can first determine which segment domains the best path between the segment domain where the current node is located and the segment domain where the destination node is located needs to pass through based on the path weight between the segment domains (i.e., the average delay between domains). Then, this embodiment can consider the average propagation delay attribute in combination with the inter-domain link attribute to determine the destination neighboring segment domain among the four neighbor segment domains. In this embodiment, the above-mentioned average propagation delay between domains can be expressed as:
[0178] Average inter-domain propagation delay I = number of ISLs between segment domains;
[0179] Therefore, this embodiment can use the segment domain as a basic unit. When the current segment domain determines the next segment domain to go to, it is necessary to evaluate the four possible neighbor segment domains to be reached and determine which segment domain to go to first. Preferably, this embodiment can be evaluated based on an evaluation function. For any segment domain x, its preset path evaluation function is as follows:
[0180] f(x)=g(x)+h(x);
[0181] Where g(x) is the actual path cost from the segment domain where the starting node is located to the current segment domain, that is, the average propagation delay between domains; h(x) is the minimum path cost estimate from the current segment domain to the destination segment domain, and the arc path length calculated using the average longitude and latitude of the nodes in the domain is used as an estimate, that is, the estimated delay.
[0182] Therefore, in this embodiment, each boundary DS node can calculate the f(x) value of each of its neighbor segment domains starting from the starting segment domain according to the preset path evaluation function, and select the segment domain with the smallest value as the optimal neighbor segment domain, that is, the next segment domain, and put the remaining nodes into the candidate node set, and iterate back and forth until the segment domain where the destination node is located is found, and finally determine the best cross-domain routing path based on all the optimal neighbor segment domains, that is, the target inter-domain routing path between the current segment domain and the destination segment domain mentioned above.
[0183] Based on the above principle, after determining the target inter-domain routing path, this embodiment can determine all segment domains contained in the target inter-domain routing path, except the current segment domain and the destination segment domain, that is, the above intermediate segment domains, and determine the intermediate boundary nodes corresponding to each intermediate segment domain. Further, the intermediate representative nodes corresponding to each intermediate segment domain can also be determined.
[0184] Then, based on the current representative node, the intermediate representative node and the destination representative node, the inter-domain routing path from the current segment domain to the destination segment domain can be determined accurately to the node, so that the routing path between the current node and the destination node can be segmented, and the segment information corresponding to the segment domain that needs to be passed is attached to the header of the data packet. Therefore, when the target communication data is transmitted across partitions, the present embodiment can clearly know in advance which segment domains need to be passed through the segment path, thereby improving the data transmission efficiency.
[0185] The specific routing path within the segment domain can be determined by the above-mentioned current node and current representative node, intermediate representative node and member nodes within the intermediate segment domain, destination representative node and destination node according to the above-mentioned intra-domain routing principle, and finally the target routing path is determined based on the target inter-domain routing path and the target intra-domain routing, and is routed step by step from the current node to the destination node according to the target routing path. For example, the inter-domain routing segmentation diagram can be as follows: Fig.13 As shown, Fig.13 This is a schematic diagram of inter-domain segment routing of the second embodiment of the multi-attribute constellation segment routing method for the low-orbit satellite giant constellation of the present application, as shown in FIG. Fig.13 As shown, this embodiment can be Fig.13 The current node or source satellite node V in segment domain 7 s , gradually routed to Fig.13 The destination node or destination satellite node V in segment domain 3 d , the target routing path can be and can be segmented into
[0186] It is easy to understand that Fig.13 When the routing process enters the segment domain, multi-attribute consistency iterative calculation is performed according to the actual ISL link attributes in the segment domain to select the best path, thereby effectively avoiding congested links in real time and avoiding congestion, which can effectively achieve load balancing and improve packet delivery rate.
[0187] In this embodiment, several segment domains correspond to representative nodes; in this embodiment, when it is detected that the destination segment domain is not the current segment domain, the destination representative node corresponding to the destination segment domain is obtained; the current representative node corresponding to the current segment domain is obtained; the destination neighboring segment domain is determined according to the destination segment domain and the preset path evaluation function; the neighboring boundary node corresponding to the destination neighboring segment domain is obtained; the initial routing path is screened by the current representative node, the neighboring boundary node, the destination representative node and the multi-attribute consistency iteration principle to determine the target routing path. In this embodiment, when routing between domains, routing can be performed based on the representative nodes of each segment domain to reduce the complexity of routing calculations; and the shortest latency routing is performed between domains based on the preset path evaluation function to improve routing efficiency, thereby effectively achieving load balancing and improving packet delivery rate.
[0188] It should be noted that the above examples are only used to understand the present application and do not constitute a limitation on the multi-attribute constrained segment routing method of the low-orbit satellite giant constellation of the present application. More forms of simple transformations based on this technical concept are all within the scope of protection of the present application.
[0189] This application also provides a multi-attribute constellation segment routing device for a low-orbit satellite giant constellation. Fig.14 , Fig.14 Schematic diagram of the module structure of the multi-attribute constellation segment routing device of the low-orbit satellite giant constellation according to the embodiment of the present application. Fig.14 As shown, the multi-attribute constrained segment routing device of the low-orbit satellite giant constellation is applied to the low-orbit satellite giant constellation network, and the low-orbit satellite giant constellation network includes a plurality of segment domains. The multi-attribute constellation constellation segment routing device of the low-orbit satellite giant constellation includes:
[0190] The segment domain determination module T1 is used to obtain the destination node corresponding to the target communication data and determine the destination segment domain corresponding to the destination node;
[0191] The initial routing module T2 is used to obtain the initial routing path corresponding to the current node and the destination node;
[0192] A routing screening module T3, used for determining a target routing path through a multi-attribute consistency iteration principle, the destination segment domain and the initial routing path;
[0193] The target routing module T4 is used to send the target communication data to the destination node according to the target routing path.
[0194] In one possible implementation, in this embodiment, the routing screening module T3 is further used to screen the initial routing path according to the multi-attribute consistency iteration principle to determine the dominant routing path when it is detected that the destination segment domain is the current segment domain;
[0195] The routing screening module T3 is further used to determine the target routing path through the dominant routing path.
[0196] In one possible implementation, in this embodiment, the routing screening module T3 is further used to obtain an initial path tuple corresponding to the initial routing path;
[0197] The routing screening module T3 is further used to traverse the initial path tuple to determine whether there is a constrained routing tuple that complies with the multi-attribute consistency iteration principle;
[0198] The routing screening module T3 is further configured to: if yes, use the routing path corresponding to the constraint routing tuple as the dominant routing path.
[0199] In one possible implementation mode, in this embodiment, the routing screening module T3 is further used to obtain a target service demand indicator; the target demand indicator includes a delay indicator, a throughput indicator or a reliability indicator;
[0200] The routing screening module T3 is further used to determine a target routing path according to the target service demand indicator and the dominant routing path.
[0201] In one possible implementation, in this embodiment, the plurality of segment domains each correspond to a representative node; the routing screening module T3 is further used to obtain the destination representative node corresponding to the destination segment domain when it is detected that the destination segment domain is not the current segment domain;
[0202] The routing screening module T3 is also used to obtain the current representative node corresponding to the current segment domain;
[0203] The routing screening module T3 is further used to determine the target routing path according to the current representative node, the destination representative node, the multi-attribute consistency iteration principle and the initial routing path.
[0204] In one possible implementation, in this embodiment, the routing screening module T3 is further used to screen the initial routing path according to the destination segment domain and a preset path evaluation function to determine a target inter-domain routing path between the current segment domain and the destination segment domain;
[0205] The routing screening module T3 is further used to obtain the intermediate segment domain and the intermediate boundary node corresponding to the target inter-domain routing path;
[0206] The routing screening module T3 is further used to determine the target routing path through the current representative node, the intermediate segment domain, the intermediate boundary node, the destination representative node and the multi-attribute consistency iteration principle.
[0207] In one possible implementation, in this embodiment, the segment domain determination module T1 is further used to obtain target structure parameters corresponding to the low-orbit satellite giant constellation network;
[0208] The segmentation domain determination module T1 is also used to construct an initial time-varying graph according to the target structure parameters;
[0209] The segment domain determination module T1 is further used to divide the low-orbit satellite giant constellation network into the plurality of segment domains based on the routing update index and the target time-varying graph.
[0210] The multi-attribute constrained segment routing device for a giant low-orbit satellite constellation provided by the present application adopts the multi-attribute constrained segment routing method for a giant low-orbit satellite constellation in the above-mentioned embodiment, and can solve the technical problem of how to achieve high-reliability and low-energy information transmission between satellites and ground information sources in the satellite Internet of Things. Compared with the prior art, the beneficial effects of the multi-attribute constrained segment routing device for a giant low-orbit satellite constellation provided by the present application are the same as the beneficial effects of the multi-attribute constrained segment routing method for a giant low-orbit satellite constellation provided by the above-mentioned embodiment, and other technical features in the multi-attribute constellation of a giant low-orbit satellite constellation are the same as the features disclosed in the above-mentioned embodiment method, which will not be repeated here.
[0211] The present application provides a multi-attribute constrained segment routing device for a low-orbit satellite giant constellation, and the multi-attribute constrained segment routing device for a low-orbit satellite giant constellation includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the multi-attribute constellation segment routing method for the low-orbit satellite giant constellation in the above-mentioned embodiment 1.
[0212] Reference below Fig.15 , which shows a schematic diagram of the structure of a multi-attribute constrained segment routing device suitable for implementing the low-orbit satellite giant constellation in the embodiment of the present application. The multi-attribute constrained segment routing device of the low-orbit satellite giant constellation in the embodiment of the present application may include but is not limited to mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Fig.15The multi-attribute constrained segment routing device for the low-orbit satellite giant constellation shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.
[0213] like Fig.15 As shown, the multi-attribute constrained segment routing device of the LEO satellite giant constellation may include a processing device 1001 (such as a central processing unit, a graphics processor, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM: Read Only Memory) 1002 or a program loaded from a storage device 1003 to a random access memory (RAM: Random Access Memory) 1004. Various programs and data required for the operation of the multi-attribute constellation of LEO satellites are also stored in RAM1004. The processing device 1001, ROM1002 and RAM1004 are connected to each other via a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Typically, the following systems may be connected to the I / O interface 1006: input devices 1007 including, for example, a touch screen, a touchpad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 1003 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 1009. The communication device 1009 may allow the multi-attribute constrained segment routing device of the low-orbit satellite giant constellation to communicate wirelessly or wired with other devices to exchange data. Although the figure shows a multi-attribute constellation of low-orbit satellite giant constellations with various systems, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems may be implemented or have instead.
[0214] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.
[0215] The multi-attribute constrained segment routing device for a giant low-orbit satellite constellation provided by the present application adopts the multi-attribute constrained segment routing method for a giant low-orbit satellite constellation in the above-mentioned embodiment, which can solve the technical problems of improving the routing efficiency of a giant low-orbit satellite constellation and reducing the routing calculation overhead. Compared with the prior art, the beneficial effects of the multi-attribute constrained segment routing device for a giant low-orbit satellite constellation provided by the present application are the same as the beneficial effects of the multi-attribute constrained segment routing method for a giant low-orbit satellite constellation provided by the above-mentioned embodiment, and the other technical features in the multi-attribute constellation constellation constellation are the same as the features disclosed in the method of the previous embodiment, which will not be repeated here.
[0216] It should be understood that the various parts disclosed in this application can be implemented by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.
[0217] The above are only specific implementations of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.
[0218] The present application provides a storage medium having computer-readable program instructions (i.e., computer programs) stored thereon, and the computer-readable program instructions are used to execute the multi-attribute constellation segment routing method for a low-orbit satellite giant constellation in the above-mentioned embodiment.
[0219] The storage medium provided in the present application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination of the above. More specific examples of storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this embodiment, the storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, system or device. The program code contained on the storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination of the above.
[0220] The above storage medium may be included in the multi-attribute constrained segment routing device of the low-orbit satellite giant constellation; or may exist independently without being assembled into the multi-attribute constellation constellation of the low-orbit satellite giant constellation.
[0221] The above-mentioned storage medium carries one or more programs. When the above-mentioned one or more programs are executed by the multi-attribute constrained segment routing device of the low-orbit satellite giant constellation, the multi-attribute constrained segment routing device of the low-orbit satellite giant constellation enables: multi-attribute constrained segment routing of the low-orbit satellite giant constellation.
[0222] Computer program code for performing the operations of the present application may be written in one or more programming languages or a combination thereof, including object-oriented programming languages such as Java, Smalltalk, C++, and conventional procedural programming languages such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).
[0223] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.
[0224] The modules involved in the embodiments described in this application may be implemented by software or hardware, wherein the name of the module does not constitute a limitation on the unit itself in some cases.
[0225] The readable storage medium provided by the present application is a storage medium, which stores computer-readable program instructions (i.e., computer programs) for executing the multi-attribute constrained segment routing method of the above-mentioned LEO satellite giant constellation, and can solve the technical problem of multi-attribute constrained segment routing of the LEO satellite giant constellation. Compared with the prior art, the beneficial effects of the storage medium provided by the present application are the same as the beneficial effects of the multi-attribute constrained segment routing method of the LEO satellite giant constellation provided by the above-mentioned embodiment, and will not be repeated here.
[0226] The above are only some embodiments of the present application, and are not intended to limit the patent scope of the present application. All equivalent structural changes made using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect application in other related technical fields are included in the patent protection scope of the present application.
Claims
1. A multi-attribute constrained segment routing method for a low-orbit satellite giant constellation, characterized in that: The method is applied to a low-orbit satellite giant constellation network, wherein the low-orbit satellite giant constellation network includes a plurality of segment domains, and the method comprises: Acquire a destination node corresponding to the target communication data, and determine a destination segment domain corresponding to the destination node; Obtaining an initial routing path corresponding to the current node and the destination node; Determine the target routing path through the multi-attribute consistency iteration principle, the target segment domain and the initial routing path; The target communication data is sent to the destination node according to the target routing path.
2. The multi-attribute constrained segment routing method for a LEO satellite giant constellation as claimed in claim 1, characterized in that: The step of determining the target routing path through the multi-attribute consistency iteration principle, the target segment domain and the initial routing path includes: When it is detected that the destination segment domain is the current segment domain, the initial routing path is screened according to a multi-attribute consistency iteration principle to determine a dominant routing path; A target routing path is determined through the dominant routing path.
3. The multi-attribute constrained segment routing method for a LEO satellite giant constellation as claimed in claim 2, characterized in that: The step of screening the initial routing path according to the multi-attribute consistency iteration principle to determine the dominant routing path includes: Obtaining an initial path tuple corresponding to the initial routing path; Traversing the initial path tuple to determine whether there is a constrained routing tuple that complies with the multi-attribute consistency iteration principle; If so, the routing path corresponding to the constrained routing tuple is used as the dominant routing path.
4. The multi-attribute constrained segment routing method for a LEO satellite giant constellation as claimed in claim 2, characterized in that: The step of determining the target routing path through the dominant routing path comprises: Obtaining a target service demand indicator; the target demand indicator includes a delay indicator, a throughput indicator or a reliability indicator; A target routing path is determined according to the target service requirement indicator and the dominant routing path.
5. The multi-attribute constrained segment routing method for a LEO satellite giant constellation as claimed in claim 1, characterized in that: Each of the several segment domains corresponds to a representative node; The step of determining the target routing path through the multi-attribute consistency iteration principle, the target segment domain and the initial routing path also includes: When it is detected that the destination segment domain is not the current segment domain, obtaining a destination representative node corresponding to the destination segment domain; Get the current representative node corresponding to the current segment domain; A target routing path is determined according to the current representative node, the destination representative node, a multi-attribute consistency iteration principle and the initial routing path.
6. The multi-attribute constrained segment routing method for a LEO satellite giant constellation as claimed in claim 4, characterized in that: The step of determining the target routing path according to the current representative node, the destination representative node, the multi-attribute consistency iteration principle and the initial routing path includes: Screening the initial routing path according to the destination segment domain and a preset path evaluation function to determine a target inter-domain routing path between the current segment domain and the destination segment domain; Obtaining the intermediate segment domain and the intermediate border node corresponding to the target inter-domain routing path; The target routing path is determined by the current representative node, the intermediate segment domain, the intermediate boundary node, the destination representative node and a multi-attribute consistency iteration principle.
7. The multi-attribute constrained segment routing method for a LEO satellite giant constellation as claimed in claim 1, characterized in that: Before acquiring the destination node corresponding to the target communication data, the method further includes: Obtaining target structure parameters corresponding to the low-orbit satellite giant constellation network; constructing an initial time-varying graph according to the target structural parameters; The low-orbit satellite giant constellation network is divided into the plurality of segment domains based on a routing update indicator and the target time-varying graph.
8. A multi-attribute constrained segment routing device for a low-orbit satellite giant constellation, characterized in that: The device is applied to a low-orbit satellite giant constellation network, wherein the low-orbit satellite giant constellation network includes a plurality of segment domains, and the device includes: A segment domain determination module, used to obtain a destination node corresponding to target communication data, and determine a destination segment domain corresponding to the destination node; An initial routing module, used to obtain an initial routing path corresponding to the current node and the destination node; A routing screening module, used for determining a target routing path through a multi-attribute consistency iteration principle, the target segment domain and the initial routing path; A target routing module is used to send the target communication data to the destination node according to the target routing path.
9. A multi-attribute constrained segment routing device for a giant low-orbit satellite constellation, characterized in that: The device includes: a memory, a processor, and a multi-attribute constrained segment routing program for a low-orbit satellite giant constellation stored in the memory and executable on the processor, wherein the multi-attribute constrained segment routing program for a low-orbit satellite giant constellation is configured to implement the steps of the multi-attribute constellation constellation multi-attribute constellation routing method according to any one of claims 1 to 7.
10. A storage medium, characterized in that: The storage medium stores a multi-attribute constrained segment routing program for a low-orbit satellite giant constellation. When the multi-attribute constrained segment routing program for the low-orbit satellite giant constellation is executed by a processor, the steps of the multi-attribute constellation constellation segment routing method for the low-orbit satellite giant constellation as described in any one of claims 1 to 7 are implemented.
