Giant constellation network routing method and device based on containment control

Abstract

The invention discloses a giant constellation network routing method and device based on containment control, and belongs to the technical field of satellite network routing control, and the method comprises the steps: selecting a controller node and an associated node thereof in a giant constellation network; each controller node obtains the link weight and the flow information of the associated node of the controller node; taking one or more associated nodes with the maximum flow of each controller node as driving nodes; each controller node updates the weight of a link connected with a driving node of the controller node; and calculating path weights of all nodes in the giant constellation network, and selecting the path with the minimum weight to update the routing table. According to the method, the burden of routing state interaction in the giant constellation can be greatly reduced, the routing convergence time is shortened, and the requirements of large scale and high dynamic of the giant constellation network space on the routing method are met. Meanwhile, the method can be widely applied to various giant constellation networks.

Description

Technical Field

[0001] The present invention relates to the technical field of satellite network routing control, and in particular, to a routing method and device for a giant constellation network based on pinning control. Background Art

[0002] The satellite constellation communication network is an important part of the space-air-ground integrated information network in the space-based system and has long been widely concerned. In recent years, multiple giant satellite constellation projects such as Iridium Next, OneWeb, and Starlink systems have emerged one after another, and the research on LEO / MEO / GEO single-layer and multi-layer constellation networks has been endless. The topology structure of the giant constellation network and its dynamic changes are more complex than those of traditional constellations. The network topology is highly dynamic over time, which poses challenges to the design of routing and transmission protocols. Usually, existing routing selection methods periodically obtain link state information and calculate routes accordingly. However, frequent link state interactions and route updates consume a large amount of link bandwidth resources and affect the service life of satellites; moreover, the large-scale spatial characteristics of the giant constellation network make it difficult for routing methods to obtain the state information of the entire network. In addition, the high dynamicity of the network also poses higher requirements on the convergence time of routing methods. Summary of the Invention

[0003] The purpose of the present invention is to overcome the deficiencies in the prior art and provide a routing method and device for a giant constellation network based on pinning control, which can greatly reduce the burden of routing state interaction in the giant constellation, shorten the routing convergence time, and meet the requirements of the large-scale space and high dynamics of the giant constellation network for routing methods.

[0004] To achieve the above object, the present invention is implemented by the following technical solutions:

[0005] In a first aspect, the present invention provides a routing method for a giant constellation network based on pinning control, including:

[0006] Selecting controller nodes and their associated nodes in the giant constellation network;

[0007] Each of the controller nodes obtains the link weights and traffic information of its associated nodes;

[0008] Taking one or more associated nodes with the largest traffic of each controller node as driving nodes;

[0009] Each of the controller nodes updates the weights of the links connected to its driving nodes;

[0010] Calculating the path weights of all nodes in the giant constellation network and selecting the path with the smallest weight to update the routing table.

[0011] Optionally, selecting the controller node and its associated nodes in the giant constellation network includes:

[0012] If the selected controller node is a MEO satellite, the LEO satellites within the signal coverage of the MEO satellite are used as the associated nodes of the controller node;

[0013] If the selected controller node is a LEO satellite, the other LEO satellites in the same orbit as the LEO satellite are used as the associated nodes of the controller node.

[0014] Optionally, the controller node updates the weight of the link connected to its driving node as:

[0015]

[0016] where is the adjustment coefficient, , is the weight of the link connected to the driving node before and after the update.

[0017] Optionally, the giant constellation network routing method further includes:

[0018] Dividing the running time of the giant constellation network into equally spaced snapshots, and re-determining the driving node at the start of each snapshot.

[0019] Optionally, the step of using one or more associated nodes with the largest traffic of each controller node as the driving node further includes:

[0020] Each controller node selects the driving node one by one. After selecting the driving node, the neighbor nodes of the driving node are used as the following nodes, and the selection of the driving node is exited.

[0021] In a second aspect, the present invention provides a giant constellation network routing device based on pinning control, including:

[0022] An initial node selection module, configured to select a controller node and its associated nodes in the giant constellation network;

[0023] A node information acquisition module, configured to enable each controller node to acquire the link weight and traffic information of its associated nodes;

[0024] A driving node determination module, configured to use one or more associated nodes with the largest traffic of each controller node as the driving node;

[0025] A link weight update module, configured to enable each controller node to update the weight of the link connected to its driving node;

[0026] A network routing update module, configured to calculate the path weights of all nodes in a giant constellation network and select the path with the smallest weight to update the routing table.

[0027] In a third aspect, the present invention provides an electronic device, including a processor and a storage medium;

[0028] The storage medium is used to store instructions;

[0029] The processor is used to operate according to the instructions to execute the steps of the above method.

[0030] In a fourth aspect, the present invention provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the steps of the above method are implemented.

[0031] In a fifth aspect, the present invention provides a computer program product, including a computer program / instructions, and when the computer program / instructions are executed by a processor, the steps of the above method are implemented.

[0032] Compared with the prior art, the beneficial effects achieved by the present invention:

[0033] The present invention provides a routing method and device for a giant constellation network based on pinning control. By selecting driving nodes as key nodes from the giant constellation network according to the obtained traffic information, pinning control is performed on several key nodes, and then scalable routing is realized by means of the connection coupling relationship of the network topology itself. This method can greatly reduce the burden of routing state interaction in the giant constellation, shorten the routing convergence time, and meet the requirements of the large scale and high dynamics of the giant constellation network for the routing method. The invention can be widely applied to various giant constellation networks. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] Figure 1 is a schematic flow chart of a routing method for a giant constellation network based on pinning control provided by an embodiment of the present invention;

[0035] Figure 2 is a schematic diagram of the processing of a routing method with a MEO satellite as a controller node provided by an embodiment of the present invention;

[0036] Figure 3 is a schematic diagram of the processing of a routing method with a LEO satellite as a controller node provided by an embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0037] The present invention will be further described below with reference to the accompanying drawings. The following embodiments are only used to more clearly illustrate the technical solutions of the present invention and cannot be used to limit the protection scope of the present invention.

[0038] Embodiment 1:

[0039] As Figure 1 shown, an embodiment of the present invention provides a routing method for a giant constellation network based on drag control, including the following steps:

[0040] Step S1: Select a controller node and its associated nodes in the giant constellation network.

[0041] As Figure 2 shown, if the selected controller node is a MEO satellite, the LEO satellites within the signal coverage range of the MEO satellite are used as the associated nodes of the controller node.

[0042] As Figure 3 shown, if the selected controller node is a LEO satellite, the other LEO satellites in the same orbit as the LEO satellite are used as the associated nodes of the controller node.

[0043] Step S2: Each controller node obtains the link weights and traffic information of its associated nodes.

[0044] Step S3: Use one or more associated nodes with the largest traffic of each controller node as drive nodes.

[0045] Let the number of controller nodes be , the number of drive nodes to be selected be , the set of associated nodes of the controller node be , , be the th associated node of the th controller node, be the total number of associated nodes of the th controller node; the traffic information collected by each controller node is stored in the set , be the traffic information of the th associated node of the th controller node.

[0046] For each controller node , perform the following steps: Sort the nodes in in descending order of their traffic in . Select the node with the largest traffic in as the drive node, and the neighbor nodes of the drive node are denoted as follower nodes. Exit the selection of the drive node to avoid a connection relationship between the drive nodes selected by two controller nodes. Repeat the above process to select a total of as the drive node, and the neighbor nodes of the drive node are denoted as follower nodes. Exit the selection of the drive node to avoid a connection relationship between the drive nodes selected by two controller nodes. Repeat the above process to select a total of drive nodes.

[0047] Step S4: Each controller node updates the weight of the link connected to its drive node.

[0048] The update process is as follows:

[0049]

[0050] In the formula, is the adjustment coefficient, , is the weight of the link connected by the driving nodes before and after the update.

[0051] It is equivalent to increasing the link weight. In routing calculation, the path with the smaller weight will be selected. Increasing the link weight will reduce the traffic flowing through this link, thereby achieving traffic balance and avoiding congestion and packet loss.

[0052] Step S5: Calculate the path weights of all nodes in the giant constellation network, and select the path with the smallest weight to update the routing table.

[0053] During the execution of the routing method for the giant constellation network, the running time of the giant constellation network is divided into equally spaced snapshots. At the beginning of each snapshot, step S3, step S4, and step S5 are executed to perform dynamic updates.

[0054] A routing method for a giant constellation network based on pinning control provided by an embodiment of the present invention utilizes the connection coupling relationship of the network topology itself to achieve efficient routing by controlling several key nodes in the giant constellation network, thereby reducing the burden of routing state interaction and realizing scalable routing. This method divides the satellite nodes of the giant constellation into two categories: driving nodes and following nodes. The driving nodes are the key nodes, which can represent the running situation of the giant constellation and are selected using the pinning control theory; the remaining satellite nodes are following nodes. The constellation network collects the link and traffic information of the driving nodes and updates their link weights. Since other nodes are connected to these driving nodes, their routes are automatically updated when selecting paths, and thus are indirectly controlled to achieve the routing update of the entire network.

[0055] Embodiment 2:

[0056] An embodiment of the present invention provides a routing device for a giant constellation network based on pinning control, including:

[0057] An initial node selection module, configured to select a controller node and its associated nodes in the giant constellation network;

[0058] A node information acquisition module, configured to enable each controller node to acquire the link weight and traffic information of its associated nodes;

[0059] A driving node determination module, configured to use one or more associated nodes with the largest traffic of each controller node as driving nodes;

[0060] A link weight update module, configured to make each controller node update the weight of the link connected to its driving node;

[0061] A network routing update module, configured to calculate the path weights of all nodes in the giant constellation network and select the path with the smallest weight to update the routing table.

[0062] Embodiment III:

[0063] Based on the giant constellation network routing method provided in Embodiment I, an embodiment of the present invention provides an electronic device, including a processor and a storage medium;

[0064] The storage medium is used to store instructions;

[0065] The processor is used to operate according to the instructions to execute the steps of the above method.

[0066] Embodiment IV:

[0067] Based on the giant constellation network routing method provided in Embodiment I, an embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the steps of the above method are implemented.

[0068] Embodiment V:

[0069] Based on the giant constellation network routing method provided in Embodiment I, an embodiment of the present invention provides a computer program product, including a computer program / instructions, and when the computer program / instructions are executed by a processor, the steps of the above method are implemented.

[0070] Those skilled in the art should understand that the embodiments of the present invention can be provided as a method, a system, or a computer program product. Therefore, the present invention can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present invention can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0071] The present invention is described with reference to the flowcharts and / or block diagrams of methods, apparatuses (systems), and computer program products according to embodiments of the present invention. It should be understood that each flow and / or block in the flowchart and / or block diagram, and the combination of flows and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing devices generate for implementation in the processFigure 1 means for the functions specified in one or more processes and / or blocks Figure 1 or blocks.

[0072] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce a manufacture including an instruction means that implements the functions specified in one Figure 1 or more processes and / or blocks Figure 1 or blocks.

[0073] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable apparatus provide steps for implementing the functions specified in one Figure 1 or more processes and / or blocks Figure 1 or blocks.

[0074] The above are only the preferred embodiments of the present invention. It should be noted that for those of ordinary skill in the art, without departing from the technical principle of the present invention, several improvements and modifications can be made, and these improvements and modifications should also be regarded as the protection scope of the present invention.

Claims

1. A routing method for a giant constellation network based on pinning control, characterized in that including: selecting a controller node and its associated nodes in a giant constellation network; each of the controller nodes obtaining the link weights and traffic information of its associated nodes; taking one or more associated nodes with the largest traffic of each of the controller nodes as driving nodes; each of the controller nodes updating the weights of the links connected to its driving nodes; calculating the path weights of all nodes in the giant constellation network and selecting the path with the smallest weight to update the routing table.

2. The routing method for a giant constellation network based on pinning control according to claim 1, characterized in that The selecting a controller node and its associated nodes in a giant constellation network includes: if the selected controller node is a MEO satellite, taking the LEO satellites within the signal coverage of the MEO satellite as the associated nodes of the controller node; if the selected controller node is a LEO satellite, taking other LEO satellites in the same orbit as the LEO satellite as the associated nodes of the controller node.

3. The routing method for a giant constellation network based on pinning control according to claim 1, wherein The controller node updating the weights of the links connected to its driving nodes is: ； In the formula, is the adjustment coefficient, , is the weight of the link connected by the drive node before and after the update.

4. The routing method for a giant constellation network based on pinning control according to claim 1, characterized in that, The giant constellation network routing method further includes: dividing the running time of the giant constellation network into equally spaced snapshots and re-determining the driving nodes at the start of each snapshot.

5. The routing method for a giant constellation network based on pinning control according to claim 1, wherein The taking one or more associated nodes with the largest traffic of each of the controller nodes as driving nodes further includes: each of the controller nodes selecting a driving node one by one, and after selecting the driving node, taking the neighbor nodes of the driving node as following nodes and exiting the selection of the driving node.

6. A routing device for a giant constellation network based on pinning control, characterized in that, including: an initial node selection module configured to select a controller node and its associated nodes in a giant constellation network; a node information acquisition module configured to cause each of the controller nodes to obtain the link weights and traffic information of its associated nodes; a driving node determination module configured to take one or more associated nodes with the largest traffic among the associated nodes of each of the controller nodes as driving nodes; a link weight update module configured to cause each of the controller nodes to update the weights of the links connected to its driving nodes; a network routing update module configured to calculate the path weights of all nodes in the giant constellation network and select the path with the smallest weight to update the routing table.

7. An electronic device, characterized in that, including a processor and a storage medium; the storage medium is used for storing instructions; the processor is used for operating according to the instructions to execute the steps of the method according to any one of claims 1-5.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the steps of the method according to any one of claims 1-5.

9. A computer program product, comprising a computer program / instructions, characterized in that, When the computer program / instructions are executed by the processor, it implements the steps of the method according to any one of claims 1-5.

Images