Low earth orbit satellite network multi-service allocation method based on srv6

Abstract

The application discloses a low-orbit satellite network multi-service distribution method based on SRv6, solves the problem that the flexibility of service distribution is low when the prior art needs to weigh and decide multiple service requirements, and the problem that the algorithm complexity is increased due to the mutual conflict or intersection between constraint conditions.The implementation steps of the application are as follows: 1, constructing a multi-level low-orbit satellite network topology structure; 2, calculating the SRv6 SID and Segment List forwarding path of the low-orbit satellite node; 3, calculating the shortest node path; 4, designing a service tunnel; 5, distributing the SRv6 TE Policy; and 6, generating a low-orbit satellite network routing table.The low-orbit satellite network generated by the application realizes a more flexible multi-service distribution mode and can fully meet the reliability requirement of the low-orbit satellite network routing.

Description

Technical Field

[0001] This invention belongs to the field of communication technology, and more specifically relates to a method for multi-service allocation in low-Earth orbit (LEO) satellite networks using Segment Routing over IPv6 (SRv6) within the field of satellite network communication technology. This invention plans service tunnels with different attributes based on the different service requirements of the LEO satellite network to ensure different network quality and service priority requirements such as bandwidth, latency, duration, and jitter, thereby providing differentiated LEO satellite network services. Background Technology

[0002] With the development of low-Earth orbit (LEO) satellite communication technology, LEO satellite networks have become a crucial means of wide-area communication and are widely used in various application scenarios. However, existing LEO satellite networks have some shortcomings in terms of service quality, failing to meet the specific needs of different services. For example, image data information services have high bandwidth requirements, collaborative control command information services pay more attention to duration and latency jitter, while tactical decision-making information services are more sensitive to latency. Therefore, a method for ensuring LEO satellite network service delivery that can provide differentiated services based on service requirements is needed.

[0003] Dalian University disclosed a multi-service routing optimization method for LEO (Low Earth Orbit) satellite networks based on multi-objective decision-making in its patent application, "Multi-service Routing Optimization Method for LEO Satellite Networks Based on Multi-objective Decision-Making" (Patent Application No. 201610404021.9, Publication No. CN 105897329 A). This method, after the satellite receives data transmission requests and obtains the topology time slice, can use service demand latency, bandwidth, and packet error rate to filter out a set of feasible links, thereby determining the most ideal data packet transmission path. While this method can select suitable paths for services based on current services and real-time link status, ensuring overall utilization of satellite network resources, its limitation lies in the fact that, due to the multi-objective decision-making method, it requires weighing and deciding on multiple service demands when filtering feasible link sets, thus restricting its flexibility in traffic control.

[0004] Xi'an Jiaotong University disclosed a method for multi-constraint QoS (Quality of Service) routing based on service classification in software-defined networks in its patent application, "A Method for Multi-Constraint QoS Routing Based on Service Classification in Software-Defined Networks" (Patent Application No. 201810432438.5, Publication No. CN 108833279 A). This method classifies network traffic according to their respective QoS requirements, then determines the weight values ​​of each type of service in terms of latency, jitter, and packet loss rate. The comprehensive weight value of the link is determined by the weight values ​​of each type of service in the QoS parameters, thus transforming the NP-complex problem of multiple constraints into a single hybrid metric parameter with low time complexity. While this method can significantly reduce time complexity and improve algorithm efficiency while ensuring that the multi-constraint QoS requirements of services are met, and to some extent reduces the possibility of network congestion, it still has shortcomings. Because constraints such as link bandwidth, network congestion, and latency often conflict or overlap, this leads to increased algorithm complexity, difficult computation and maintenance, long configuration and activation times, and the inability to achieve lightweight deployment. Summary of the Invention

[0005] The purpose of this invention is to address the shortcomings of the prior art by providing a multi-service allocation method for low-Earth orbit satellite networks using IPv6 segment routing SRv6. This method solves the problems of low flexibility in traffic control due to the need to weigh and decide on multiple service requirements, and increased algorithm complexity due to conflicts or overlaps between constraints.

[0006] The technical approach to achieving the objectives of this invention is as follows: First, the ground station generates the SRv6 SID and Segment List forwarding paths for the low-Earth orbit satellite nodes. Different tunnels are planned based on service requirements and network topology. Based on the content of the service tunnels, a corresponding SRv6 TE Policy is assigned to each service type. Finally, service data packets are transmitted according to the service type and TE Policy configuration. In the steps of setting up service tunnels and configuring SRv6 TE Policies, this invention designs different Traffic Engineering Policies (TE Policies) based on different service requirements, enabling packets of different service types to enter tunnels with different attributes. Various constraints, such as link bandwidth, latency, and packet loss rate, are set according to specific service requirements, resolving the problem of conflicting constraints that increase algorithm complexity. The SRv6 TE Policy in this invention provides a flexible forwarding path selection method, allowing different services to correspond to different planned tunnels and TEPolicy configurations, thus solving the problem of low flexibility in traffic control.

[0007] The steps of this invention to achieve the above objectives include the following:

[0008] Step 1: Construct a multi-layered low-Earth orbit satellite network topology;

[0009] Construct a multi-level low-orbit satellite network topology that includes three types of nodes: low-orbit satellites, ground stations, and user terminals, and represent the node connection relationship using an adjacency matrix;

[0010] Step 2: Calculate the SRv6 SID and Segment List forwarding path of the low-Earth orbit satellite node;

[0011] Based on the adjacency matrix generated in step 1, calculate the SRv6 SID and Segment List forwarding path of the low-Earth orbit satellite node;

[0012] Step 3: Calculate the shortest path between nodes;

[0013] The Dijkstra algorithm is used to calculate the shortest path from each low-Earth orbit satellite node to other nodes. The shortest path information of each low-Earth orbit satellite node is stored in a dictionary or table, recording the shortest path length and the sequence of nodes traversed by each node.

[0014] Step 4, design the business tunnel;

[0015] The ground station's entry node is designed with service tunnels corresponding to three service types: image data information service, collaborative control command information service, and tactical decision-making information service.

[0016] Step 5: Assign the corresponding SRv6 TE Policy;

[0017] 5a) Design the data structure of SRv6 TE Policy based on TTL and Segment List attributes;

[0018] 5b) Design the corresponding SRv6 TE Policy based on the requirements of each service type and the network topology;

[0019] 5c) Call the corresponding SRv6 TE Policy allocation function according to the business type to associate the SRv6 TE Policy with the business tunnel;

[0020] Step 6: Generate a routing table for the low-Earth orbit satellite network;

[0021] 6a) Initialize the routing table;

[0022] Create an empty routing table and use a dictionary or table-type data structure to store the routing information of the low-Earth orbit satellite nodes;

[0023] 6b) Generate routing table entries for low-Earth orbit satellite nodes;

[0024] 6c) Generate routing table entries for ground station nodes and user terminal nodes;

[0025] 6d) Configure the routing table;

[0026] Based on the generated routing table, the Open Shortest Path First (OSPF) algorithm is used to configure routes for each node. Depending on the node's type and location, the corresponding routing table entries are configured in the node's router or routing table.

[0027] 6e) Verification and testing;

[0028] By simulating the transmission of data packets and the forwarding process of routers, we can check whether the data packets are forwarded along the expected path and whether the router makes the correct forwarding decisions based on the routing table.

[0029] Compared with the prior art, the present invention has the following advantages:

[0030] First, because this invention provides a flexible forwarding path selection method through SRv6 TE Policy operations, it can meet different user forwarding needs. When there are multiple paths between the source and destination nodes in a segmented routing network, the reasonable use of SRv6 TE Policy to select the forwarding path overcomes the problem of low flexibility in service allocation in existing technologies when multiple service requirements need to be weighed and decided. This invention enables a more flexible multi-service allocation method for low-Earth orbit satellite networks.

[0031] Secondly, because this invention sets up service tunnels and allocates SRv6 TE policies, it assigns corresponding SRv6 TE policies and service tunnels to each service type for different service needs. The tunnel attributes can be adjusted according to service changes, and various constraints such as link bandwidth, latency, and packet loss rate can be set according to specific service needs. This overcomes the problem of increased algorithm complexity caused by mutual conflicts or overlaps between constraints in the prior art, making the low-orbit satellite network in this invention more efficient and reliable. Attached Figure Description

[0032] Figure 1 This is a schematic diagram of the working scenario of an embodiment of the present invention;

[0033] Figure 2 This is a schematic diagram of the overall implementation process of the present invention. Detailed Implementation

[0034] The SRv6-based multi-service allocation method for low-Earth orbit satellite networks allows different service types of messages to enter tunnels with different attributes according to the SRv6 TE Policy. The services are divided into three categories: for image data transmission services, the invention dynamically allocates a tunnel with the maximum bandwidth; for coordinated control command information transmission services, it allocates a tunnel with the longest duration and the least jitter; and for tactical decision information transmission services, it allocates a tunnel with the least latency.

[0035] The present invention will now be described in further detail with reference to the accompanying drawings and embodiments.

[0036] Reference Figure 1 The working scenario of the embodiments of the present invention will be described in further detail below.

[0037] The working scenario of this invention is a multi-layered low-Earth orbit (LEO) satellite network composed of three types of nodes: LEO satellites, ground stations, and user terminals. LEO satellites are responsible for data forwarding, ground stations are responsible for coordinating and controlling data transmission, and user terminals are responsible for sending and receiving data packets. This LEO satellite network consists of m LEO satellites, a ground stations, and b user terminals. All satellites in the network are evenly distributed across n orbital planes, with the total number of satellites on each orbital plane being k = m / n. Here, m represents the total number of LEO satellite nodes (10 ≤ m ≤ 100000), a represents the total number of ground station nodes (2 ≤ a ≤ 100), b represents the total number of user terminal nodes (2 ≤ b ≤ 100), n represents the total number of orbital planes (6 ≤ n ≤ 12), and k represents the total number of satellites on each orbital plane.

[0038] The low-Earth orbit satellite network of this invention consists of 72 low-Earth orbit satellite nodes, 10 ground station nodes and 10 user terminal nodes, with 12 satellites distributed evenly across 6 orbital planes.

[0039] Reference Figure 2 The implementation steps of the embodiments of the present invention will be described in further detail below.

[0040] Step 1: Construct a multi-layered low-Earth orbit (LEO) satellite network topology that includes three types of nodes: LEO satellites, ground stations, and user terminals.

[0041] A star topology is formed by m low-Earth orbit (LEO) satellite nodes, a ground station nodes, and b user terminal nodes. Each LEO satellite node establishes a link with all user terminal nodes, and each LEO satellite node establishes a link with all ground station nodes. Each user terminal node establishes a link with all ground station nodes. Here, m represents the total number of LEO satellite nodes, 10 ≤ m ≤ 100000, a represents the total number of ground station nodes, 2 ≤ a ≤ 100, and b represents the total number of user terminal nodes, 2 ≤ b ≤ 100.

[0042] In this embodiment of the invention, a multi-layered network topology for low-Earth orbit (LEO) satellites is constructed, comprising three types of nodes: LEO satellites, ground stations, and user terminals. A star topology is formed with 72 LEO satellite nodes, a star topology with 10 ground station nodes, and a mesh topology with 10 user terminal nodes. Each LEO satellite node establishes a link with all user terminal nodes, and each LEO satellite node establishes a link with all ground station nodes. Similarly, each user terminal node establishes a link with all ground station nodes.

[0043] Step 2: Calculate the SRv6 SID and Segment List forwarding path of the low-Earth orbit satellite node using the generated adjacency matrix.

[0044] The steps for generating the adjacency matrix are as follows:

[0045] In the entire topology, the connections between the three types of nodes are described using an adjacency matrix. The m low-Earth orbit satellite nodes are numbered from 1 to m, the a ground station nodes are numbered from m+1 to m+a, and the b user terminal nodes are numbered from m+a+1 to m+a+b. The adjacency matrix is ​​designed as follows:

[0046] The first step is to create a matrix of size (m+a+b)×(m+a+b).

[0047] The second step involves defining the first m rows and columns of the matrix as the connections between low-Earth orbit (LEO) satellite nodes, with each row and column corresponding to one LEO satellite node; the (m+1)th row to the (m+a)th row and the (m+1)th column to the (m+a)th column as the connections between ground station nodes, with each row and column corresponding to one ground station node; and the (m+a+1)th row to the (m+a+b)th row and the (m+a+1)th column to the (m+a+b)th column as the connections between user terminal nodes, with each row and column corresponding to one user terminal node.

[0048] The third step involves defining the connection between the low-Earth orbit satellite nodes and the ground station nodes using the first m rows and columns (m+1 to m+a) of the matrix. The second step involves defining the connection between the low-Earth orbit satellite nodes and the user terminal nodes using the first m rows and columns (m+a+1 to m+a+b). The third step involves defining the connection between the ground station nodes and the user terminal nodes using the first m rows and columns (m+a+1 to m+a+b).

[0049] Fourth step: If there is a connection between two nodes, the element at the corresponding position is 1; otherwise, it is 0.

[0050] In this embodiment of the invention, the connection relationships between the three types of nodes in the entire topology are described using an adjacency matrix. The 72 low-Earth orbit satellite nodes are numbered 1 to 72, the 10 ground station nodes are numbered 73 to 82, and the 10 user terminal nodes are numbered 83 to 92. The adjacency matrix is ​​designed as follows:

[0051] The first step is to create a 92×92 matrix.

[0052] The second step involves the first 72 rows and columns of the matrix representing the connections between low-Earth orbit (LEO) satellite nodes, with each row and column corresponding to one LEO satellite node; rows 73 to 82 and columns 73 to 82 represent the connections between ground station nodes, with each row and column corresponding to one ground station node; and rows 83 to 92 and columns 83 to 92 represent the connections between user terminal nodes, with each row and column corresponding to one user terminal node.

[0053] The third step involves the first 72 rows and columns 73 to 82 of the matrix representing the connection between the low-Earth orbit satellite node and the ground station node; the first 72 rows and columns 83 to 92 of the matrix representing the connection between the low-Earth orbit satellite node and the user terminal node; and the columns 73 to 82 and columns 83 to 92 of the matrix representing the connection between the ground station node and the user terminal node.

[0054] Fourth step: If there is a connection between two nodes, the element at the corresponding position is 1; otherwise, it is 0.

[0055] The steps for calculating the SRv6 SID and Segment List forwarding path of the low-Earth orbit satellite node are as follows:

[0056] The first step is to combine the node number with a fixed prefix using an encoding scheme. If the fixed prefix is ​​set to "2001:db8::", then the SRv6 SID of low-Earth orbit satellite node 1 is "2001:db8::1", the SRv6 SID of low-Earth orbit satellite node 2 is "2001:db8::2", and so on.

[0057] The second step is to use the depth-first search (DFS) algorithm to calculate the forwarding paths of the segment list.

[0058] The third step is to initialize the current node's SRv6 SID as the node number and add the current node number to the forwarding path of SegmentList.

[0059] The fourth step involves searching the adjacency matrix for all nodes directly connected to the current node, adding the connected node numbers to the forwarding paths in the Segment List, updating the current node's SRv6 SID to the current node's SRv6 SID plus the connected node numbers, marking the current satellite node, and then proceeding to the fifth step. If no connection exists, the search continues for the next connected node.

[0060] Fifth step: Determine if there are any unmarked satellite nodes in the adjacency matrix. If so, proceed to step two; otherwise, proceed to step six.

[0061] The sixth step is to store the SRv6 SID and Segment List forwarding path information of each low-Earth orbit satellite node into a dictionary or table.

[0062] Step 3: Calculate the shortest node path.

[0063] Dijkstra's algorithm is used to calculate the shortest path from each LEO satellite node to other nodes. The shortest path information of each LEO satellite node is stored in a dictionary or table, recording the shortest path length and the sequence of nodes traversed by each node.

[0064] The specific steps of Dijkstra's algorithm are as follows:

[0065] The first step is to obtain the connection relationships between LEO satellite nodes, ground station nodes, and user terminal nodes based on the adjacency matrix generated in step 1. A dictionary or table is created to store the shortest path information for each LEO satellite node. The path length of all nodes is initialized to infinity (indicating that the shortest path has not yet been calculated), and the path length of the starting node is set to 0.

[0066] The second step involves starting from the initial node and sequentially traversing its adjacent nodes, updating the path length and path information accordingly. This process is repeated until the shortest paths for all nodes have been calculated. Next, the shortest path information for each LEO satellite node is stored in a dictionary or table. For each node, its shortest path length and the sequence of nodes traversed are recorded to obtain the shortest paths from each LEO satellite node to other nodes.

[0067] Step 4: The ground station sets up service tunnels corresponding to the three service types.

[0068] To meet the different needs of the three services, three types of tunnels need to be designed, one for transmitting image data information, the other for transmitting collaborative control command information, and the third for transmitting tactical decision-making information. The specific implementation steps are as follows:

[0069] From the bandwidth information of the shortest paths from all low-Earth orbit satellite nodes to other nodes, find the path that matches the bandwidth of image data transmission, and the ground station sets the sequence of low-Earth orbit satellite nodes on that path as the image data transmission service tunnel.

[0070] From the duration and jitter information of the shortest paths from all LEO satellite nodes to other nodes, find the path whose duration and jitter match the transmission coordination control command. The ground station then identifies the sequence of LEO satellite nodes on this path as the transmission coordination control command service tunnel.

[0071] From the latency information of the shortest paths from all low-Earth orbit satellite nodes to other nodes, find the path that matches the latency of tactical decision information transmission. The ground station then identifies the sequence of low-Earth orbit satellite nodes along that path as the service tunnel for tactical decision information transmission.

[0072] Step 5: Assign the corresponding SRv6 TE Policy.

[0073] The first step is to design the data structure of the SRv6 TE Policy, which includes TTL and Segment List attributes.

[0074] The second step is to assign SRv6 TE policies corresponding to the three service types. The specific implementation steps are as follows:

[0075] Set the TTL for the image data transmission service to 128, and set the Segment List to the tunnel path corresponding to the image data service; in the SRv6 TE Policy, specify the sequence of low-Earth orbit satellite nodes on this path, and the data packets of the image data service will be transmitted according to the mode set in the SRv6 TE Policy.

[0076] Set the TTL of the service transmitting coordinated control commands to 32, and set the Segment List to the tunnel path corresponding to the service transmitting coordinated control commands. In the SRv6 TE Policy, specify the sequence of low-Earth orbit satellite nodes on this path, and transmit the data packets of the service transmitting coordinated control commands according to the mode set in the SRv6 TE Policy.

[0077] Set the TTL of the service transmitting tactical decision information to 64, and set the Segment List to the tunnel path corresponding to the service transmitting tactical decision information; in the SRv6 TE Policy, specify the sequence of low-Earth orbit satellite nodes on this path, and transmit the data packets of the service transmitting tactical decision information according to the mode set in the SRv6 TE Policy.

[0078] The third step is to associate the designed SRv6 TE Policy with the corresponding business tunnel.

[0079] In the business tunnel allocation algorithm function, the corresponding SRv6 TE Policy allocation function is called according to the business type to associate the SRv6 TE Policy with the business tunnel.

[0080] Step 6: Generate a routing table for the low-Earth orbit satellite network.

[0081] The first step is to initialize the routing table.

[0082] Create an empty routing table and use a dictionary or table-type data structure to store the routing information of the low-Earth orbit satellite nodes.

[0083] The second step is to generate routing table entries for the low-Earth orbit satellite nodes.

[0084] Create a routing table entry for each low-Earth orbit satellite node, setting the node's SRv6 SID as the destination address. Based on the Segment List forwarding path information, add the nodes along the path as next-hop addresses to the next-hop address list of the routing table entry. Use the ground station node identifier or interface number to represent the outgoing interface of the routing table entry and add the entry to the routing table.

[0085] The third step is to generate routing table entries for ground station nodes and user terminal nodes.

[0086] Create a routing table entry for each ground station node and user terminal node. Set the node's identifier or address as the destination address in the routing table entry. Based on connectivity, add adjacent nodes as next-hop addresses to the next-hop address list of the routing table entry. Use the identifier or interface number of the ground station node or user terminal node to represent the outgoing interface of the routing table entry and add the routing table entry accordingly.

[0087] The fourth step is to configure the routing table.

[0088] Based on the generated routing table, the Open Shortest Path First (OSPF) algorithm is used to configure routes for each node. Depending on the node's type and location, the corresponding routing table entries are configured in the node's router or routing table.

[0089] Step 5: Verification and testing.

[0090] By simulating the transmission of data packets and the forwarding process of routers, we can check whether the data packets are forwarded along the expected path and whether the router makes the correct forwarding decisions based on the routing table.

[0091] The above design can meet the different network quality and service priorities of various services such as image data, collaborative control commands, and tactical decision-making information in terms of bandwidth, latency, duration, jitter, etc., and provide them with differentiated low-orbit satellite network services.

[0092] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A method for multi-service allocation in a low-Earth orbit satellite network based on SRv6, characterized in that, The ground station sets up three types of service tunnels, assigns corresponding SRv6 TE policies, and generates a low-Earth orbit satellite network routing table. The steps of this assignment method include the following: Step 1: Construct a multi-layered low-Earth orbit satellite network topology: Construct a multi-level low-orbit satellite network topology that includes three types of nodes: low-orbit satellites, ground stations, and user terminals, and represent the node connection relationship using an adjacency matrix; Step 2, calculate the SRv6 SID and Segment List forwarding path of the low-Earth orbit satellite node: Based on the adjacency matrix generated in step 1, calculate the SRv6 SID and Segment List forwarding path of the low-Earth orbit satellite node; Step 3, calculate the shortest path between nodes: The Dijkstra algorithm is used to calculate the shortest path from each low-Earth orbit satellite node to other nodes. The shortest path information of each low-Earth orbit satellite node is stored in a dictionary or table, recording the shortest path length and the sequence of nodes traversed by each node. Step 4, Design the business tunnel: Design service tunnels at the entry nodes of ground stations for three service types: image data information service, collaborative control command information service, and tactical decision information service. Step 5, assign the corresponding SRv6 TE Policy: 5a) Design the data structure for the SRv6 TE Policy based on the TTL and Segment List attributes; 5b) Design the corresponding SRv6 TE Policy based on the requirements of each service type and the network topology; 5c) Call the corresponding SRv6 TE Policy allocation function according to the business type to associate the SRv6 TE Policy with the business tunnel; Step 6: Generate a routing table for the low-Earth orbit satellite network. 6a) Initialize the routing table: Create an empty routing table and use a dictionary or table-type data structure to store the routing information of the low-Earth orbit satellite nodes; 6b) Generate routing table entries for low-Earth orbit satellite nodes; 6c) Generate routing table entries for ground station nodes and user terminal nodes; 6d) Configure the routing table: Based on the generated routing table, the Open Shortest Path First (OSPF) algorithm is used to configure routes for each node; according to the node's type and location, the corresponding routing table entries are configured into the node's router or routing table.

2. The method for multi-service allocation in low-Earth orbit satellite networks based on SRv6 according to claim 1, characterized in that, The multi-layered low-Earth orbit satellite network topology described in step 1 is generated according to the following steps: A star topology is formed by several low-Earth orbit satellite nodes. The ground station nodes form a star topology. Each user terminal node forms a mesh topology. Each low-Earth orbit (LEO) satellite node establishes a link with all user terminal nodes, each LEO satellite node establishes a link with all ground station nodes, and each user terminal node establishes a link with all ground station nodes. This represents the total number of low-Earth orbit satellite nodes. , This represents the total number of ground station nodes. , This represents the total number of user terminal nodes. .

3. The method for multi-service allocation in low-Earth orbit satellite networks based on SRv6 according to claim 1, characterized in that, The steps for generating the adjacency matrix in step 2 are as follows: In the entire topology, the connection relationships between the three types of nodes are described by the adjacency matrix; The low-orbit satellite nodes are numbered from 1 to... , The ground station node number is arrive , The user terminal node number is arrive The specific design is as follows: The first step is to create a size of × matrix; The second step is to examine the matrix's front... line and front The columns represent the connections between low-Earth orbit (LEO) satellite nodes, with each row and column corresponding to one LEO satellite node; the matrix's [number] [column] ... Arrive at the row and number Listed to number The columns represent the connection relationships between ground station nodes, with each row and column corresponding to one ground station node; the matrix's [number]th column represents the [connection] relationship between ground station nodes. Arrive at the row and number Listed to number The columns represent the connection relationships between user terminal nodes, with each row and each column corresponding to one user terminal node; The third step is the front of the matrix. row and number Listed to number The columns represent the connection relationships between low-Earth orbit satellite nodes and ground station nodes; the first column of the matrix... row and number Listed to number The columns represent the connection relationships between low-Earth orbit satellite nodes and user terminal nodes; the matrix's first column represents the connection relationship between low-Earth orbit satellite nodes and user terminal nodes. Arrive at the row and number Listed to number The columns represent ground station nodes and user terminal nodes; Fourth step: If there is a connection between two nodes, the element at the corresponding position is 1; otherwise, it is 0.

4. The method for multi-service allocation in low-Earth orbit satellite networks based on SRv6 according to claim 1, characterized in that, The steps for calculating the SRv6 SID and Segment List forwarding path of the low-Earth orbit satellite node in step 2 are as follows: The first step is to combine the node number with a fixed prefix using an encoding scheme. If the fixed prefix is ​​set to "2001:db8::", then the SRv6 SID of low-Earth orbit satellite node 1 is "2001:db8::1", the SRv6 SID of low-Earth orbit satellite node 2 is "2001:db8::2", and so on. The second step is to use the depth-first search (DFS) algorithm to calculate the forwarding paths of the Segment List; The third step is to initialize the current node's SRv6 SID as the node number and add the current node number to the forwarding path of SegmentList; The fourth step is to search for all nodes directly connected to the current node in the adjacency matrix, add the connected node numbers to the forwarding path of the Segment List, update the current node's SRv6 SID to the current node's SRv6 SID plus the connected node numbers, and then mark the current satellite node before proceeding to the fifth step. If no connection exists, continue searching for the next connected node. Fifth step: Determine if there are any unmarked satellite nodes in the adjacency matrix. If so, proceed to step two; otherwise, proceed to step six. The sixth step is to store the SRv6 SID and Segment List forwarding path information of each low-Earth orbit satellite node into a dictionary or table.

5. The method for multi-service allocation in low-Earth orbit satellite networks based on SRv6 according to claim 1, characterized in that, The service tunnels corresponding to the three service types mentioned in step 4 are as follows: From the bandwidth information of the shortest paths from all low-Earth orbit satellite nodes to other nodes, find the path that matches the bandwidth of image data transmission, and the ground station sets the sequence of low-Earth orbit satellite nodes on that path as the image data transmission service tunnel. From the duration and jitter information of the shortest path from all low-Earth orbit satellite nodes to other nodes, find the path that matches the duration and jitter of the transmission coordination control command. The ground station then determines the sequence of low-Earth orbit satellite nodes on this path as the transmission coordination control command service tunnel. From the latency information of the shortest paths from all low-Earth orbit satellite nodes to other nodes, find the path that matches the latency of tactical decision information transmission. The ground station then identifies the sequence of low-Earth orbit satellite nodes along that path as the service tunnel for tactical decision information transmission.

6. The method for multi-service allocation in low-Earth orbit satellite networks based on SRv6 according to claim 1, characterized in that, The SRv6 TE Policy assigned in step 5 is as follows: Set the TTL for the image data transmission service to 128, and set the Segment List to the tunnel path corresponding to the image data service; in the SRv6 TE Policy, specify the sequence of low-Earth orbit satellite nodes on this path, and the data packets of the image data service are transmitted according to the mode set in the SRv6 TE Policy; Set the TTL of the service that transmits cooperative control commands to 32, and set the Segment List to the tunnel path corresponding to the service that transmits cooperative control commands. In the SRv6 TE Policy, the sequence of low-Earth orbit satellite nodes on this path is specified, and the data packets for transmitting cooperative control command services are transmitted according to the mode set in the SRv6 TE Policy; Set the TTL of the service transmitting tactical decision information to 64, and set the Segment List to the tunnel path corresponding to the service transmitting tactical decision information. In the SRv6 TE Policy, the sequence of low-Earth orbit satellite nodes on this path is specified, and data packets for transmitting tactical decision information services are transmitted according to the mode set in the SRv6 TE Policy.

7. The method for multi-service allocation in low-Earth orbit satellite networks based on SRv6 according to claim 1, characterized in that, The routing table entries for the low-Earth orbit satellite nodes described in step 6b) are generated as follows: a routing table entry is created for each low-Earth orbit satellite node, and the SRv6 SID of the node is set as the destination address of the routing table entry; according to the forwarding path information, the nodes on the path are added as next-hop addresses to the next-hop address list of the routing table entry in turn. The routing table entries for low-Earth orbit satellite nodes are added to the routing table by using the ground station node identifier or interface number to indicate the outgoing interface of the routing table entry.

8. The method for multi-service allocation in low-Earth orbit satellite networks based on SRv6 according to claim 1, characterized in that, The generation of routing table entries for ground station nodes and user terminal nodes in step 6c) is as follows: Create a routing table entry for each ground station node and user terminal node, and set the node's identifier or address as the destination address in the routing table entry; according to the connection relationship, add the adjacent nodes as next-hop addresses to the next-hop address list of the routing table entry. Use the identifier or interface number of the ground station node or user terminal node to indicate the outgoing interface of the routing table entry, and add the routing table entries of the ground station node and user terminal node to the routing table.

9. The method for multi-service allocation in low-Earth orbit satellite networks based on SRv6 according to claim 1, characterized in that, The routing table configuration mentioned in step 6d) refers to: using the Open Shortest Path First (OSPF) algorithm to configure routes for each node in the routing table; and configuring the corresponding routing table entries into the node's routing table according to the node's type and location.

Images