CN115297045A - Flooding topology construction method and device for low-earth-orbit satellite network and storage medium - Google Patents
Flooding topology construction method and device for low-earth-orbit satellite network and storage medium Download PDFInfo
- Publication number
- CN115297045A CN115297045A CN202210504071.XA CN202210504071A CN115297045A CN 115297045 A CN115297045 A CN 115297045A CN 202210504071 A CN202210504071 A CN 202210504071A CN 115297045 A CN115297045 A CN 115297045A
- Authority
- CN
- China
- Prior art keywords
- inter
- topology
- orbit
- flooding
- satellite
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000010276 construction Methods 0.000 title claims abstract description 14
- 238000000034 method Methods 0.000 claims abstract description 52
- 238000013138 pruning Methods 0.000 claims description 16
- 238000004590 computer program Methods 0.000 claims description 5
- 238000012546 transfer Methods 0.000 abstract description 3
- 230000008569 process Effects 0.000 description 20
- 238000004422 calculation algorithm Methods 0.000 description 18
- 238000004364 calculation method Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 12
- 230000008859 change Effects 0.000 description 10
- 230000007246 mechanism Effects 0.000 description 6
- 238000012545 processing Methods 0.000 description 6
- 230000033001 locomotion Effects 0.000 description 5
- 230000001788 irregular Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000002441 reversible effect Effects 0.000 description 3
- 238000007792 addition Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000000717 retained effect Effects 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000002159 abnormal effect Effects 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000013135 deep learning Methods 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 229910052741 iridium Inorganic materials 0.000 description 1
- GKOZUEZYRPOHIO-UHFFFAOYSA-N iridium atom Chemical compound [Ir] GKOZUEZYRPOHIO-UHFFFAOYSA-N 0.000 description 1
- 238000012417 linear regression Methods 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18519—Operations control, administration or maintenance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/32—Flooding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Radio Relay Systems (AREA)
Abstract
The invention provides a flooding topology construction method, a flooding topology construction device and a flooding topology storage medium for a low earth orbit satellite network, wherein the method comprises the following steps: selecting all intra-orbit inter-satellite links in the initial physical topology; selecting an inter-satellite link between every two adjacent orbits of a first half topology and a second half topology of the initial physical topology, and finding out all inter-orbit inter-satellite link selection schemes; calculating the flooding diameter of each link selection scheme, and selecting the inter-orbit inter-satellite link selection scheme with the minimum flooding diameter, wherein the flooding diameter is the shortest distance between two farthest nodes in the flooding topology; and constructing a flooding topology based on all the intra-orbit inter-satellite links in the initial physical topology and the inter-orbit inter-satellite link selection scheme with the minimum flooding diameter. The invention can reduce redundant flooding information transfer in the low-orbit satellite network, enables the route to be rapidly converged and improves the operation efficiency of the low-orbit satellite network.
Description
Technical Field
The invention relates to the technical field of dynamic routing, in particular to a flooding topology construction method and device and a storage medium for a low-earth-orbit satellite network.
Background
In recent years, satellite communication technology is continuously developed, on-board processing and on-board switching capabilities are increasingly enhanced, and a satellite network formed by satellite interconnection is an indispensable component in the satellite communication technology. The Low Earth Orbit (LEO) Low Earth orbit satellite network has the advantages of Low orbit height, a large number of satellite nodes, large ground surface coverage area, ultra-Low delay and the like, and is becoming a main research direction of the current satellite network. Currently, typical low earth orbit satellite networks include "iridium" systems, "globalstar" systems, and "star-link" systems.
The low earth orbit satellite network has the following characteristics: on one hand, the low-orbit satellite network has the characteristics of large scale and high density, and on the other hand, the low-orbit satellite network has topology change caused by continuous motion of low-orbit satellites. The topology change of the low earth orbit satellite network can be divided into two categories of regular topology change and irregular topology change. Regular topology changes result from periodic movement of the constellation, while irregular topology changes result from abnormal link failures and subsequent link recoveries. With the increasing density of low-orbit satellite network systems, the frequency of conventional topology changes of the low-orbit satellite systems is increasing, and the probability of occurrence of irregular topology changes is also increasing.
The above-described features of low-earth-orbit satellite networks pose significant challenges to the design of routing protocols. If an existing ground dynamic routing protocol, such as an Open Shortest Path First (OSPF), is directly applied to a low-earth satellite network, full-network flooding will be performed when irregular topology changes of the low-earth satellite network are handled, so that a large amount of redundant flooding information is transmitted on inter-satellite links, and each node needs to process multiple copies of the same flooding information, thereby reducing link bandwidth and delaying route convergence.
The OSPF protocol is taken as an example to illustrate the shortcomings of the direct application of terrestrial dynamic routing to low-orbit satellite networks:
the OSPF protocol is a routing protocol for IP networks. The protocol runs within a single Autonomous System (AS). The OSPF protocol belongs to the interior gateway protocol and is capable of distributing routing information to routers within an autonomous system. The OSPF protocol was proposed and developed by the Internet Engineering Task Force (IETF). It is designed specifically for TCP/IP internet environment, and includes explicit support for Classless Inter-Domain Routing (CIDR). The OSPF protocol performs routing according to the destination IP address in the IP packet header. The OSPF protocol itself is dynamic. This ensures that when the network topology of the autonomous system changes (such as the router interface failure), the OSPF protocol can quickly react and converge the route, and a new route is calculated after the route convergence is completed.
When the burst Link failure is faced, the OSPF protocol adopts a flooding routing protocol (flooding for short) to update a Link State Database (LSDB) of each router, and the flooding process is performed in the whole network topology. This flooding mechanism ensures that each router in the autonomous system establishes the same link state database. The flooding mechanism uses a Link State Update Packet (LSU) to flood Link State Update advertisements (LSAs), where each Link State Update advertisement carries certain route Update information. A link state update message may contain multiple link state update advertisements. Each Link State update advertisement must be acknowledged by a Link State acknowledgement (LSAck) message. The flooding process starts when a link failure is discovered and a link state update message is generated. After receiving the link state update message, each router forwards the message from other interfaces (except the interface receiving the message). When each router establishes the same link state database, the flooding process is complete. In general, the duration of the flooding process (i.e., the route convergence time) should be as short as possible.
When the burst link fails, the OSPF protocol performs routing update in a full-network flooding manner, and in a low-orbit satellite network scenario, due to the fact that the topology scale and complexity are continuously improved and frequent topology changes are caused by continuous movement of satellites, the full-network flooding manner causes a large amount of redundant flooding information to be transmitted in the low-orbit satellite network. The negative effects are: on one hand, the method occupies the bandwidth of expensive inter-satellite links, and extra route convergence messages can cause the links to be more congested, so that message queuing and even packet loss are caused, the user flow is influenced, and the route convergence time is increased; on the other hand, the processing overhead of the control plane on each satellite node is increased, and in the routing convergence process, each satellite receives a plurality of link state updating messages which are all sent to the control plane for routing protocol processing. Because the performance of the control plane is limited, excessive redundant link state update messages occupy all processing resources of the control plane, resulting in delay of the routing convergence process. In the worst case, if the flooding rate exceeds the route processing rate, the control plane will have to discard some link state update messages, and if the missing link state update messages are significant, the convergence time of the route will be further delayed. Under the topology of the LEO constellation of the whole network, a large number of link state updating messages can be copied to generate a large number of redundant routing updating messages. The larger the constellation size, the more redundant link state update messages are generated.
Therefore, how to provide a method and a device for reducing redundant flooding information transfer and enabling a route to be rapidly converged in a low-earth orbit satellite network is an urgent problem to be solved.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method, an apparatus, and a storage medium for constructing a flooding topology for a low-earth orbit satellite network, so as to obviate or mitigate one or more of the disadvantages in the prior art.
Two key factors need to be considered when constructing the optimal flooding topology: topology redundancy and flooding diameter. Wherein the flooding diameter is the shortest distance between the two farthest nodes in the flooding topology. Theoretically, we can prune the physical topology by using the minimum spanning tree to obtain the flooding topology of the connected graph containing the minimum links. However, when a link fails, the flooding topology generated based on the minimum spanning tree may be split into two disjoint parts, thereby affecting the flooding of the route update messages across the entire network. Therefore, the necessary redundant topology structure is added to the flooding topology based on the minimum spanning tree by reserving a plurality of redundant links in the pruning process, so that the flooding topology generated by the minimum spanning tree can be kept connected when the links are in failure. Meanwhile, the maximum flooding hop count should be as small as possible to reduce the route convergence time. However, pruning of redundant links also increases the maximum number of flooded hops due to the deletion of the link on the shortest path between two nodes. We define the flooding diameter as the shortest distance between the two farthest nodes in the flooding topology, and should avoid generating an excessively large flooding diameter during pruning. In conclusion: the principle of constructing the flooding topology of the invention is as follows: (1) the flooding topology needs to connect each node in the original satellite network topology to ensure the accessibility same as the original topology; (2) each node in the flooding topology needs to ensure the degree of guarantee to be at least 2, and the redundancy ensures that the flooding topology cannot generate single point failure (3) because intra-orbit inter-satellite links of the constellation are more stable than inter-orbit inter-satellite links, and the flooding topology selects and reserves all intra-orbit inter-satellite links which can provide 2 degrees of guarantee, namely the redundancy of the former link and the latter link; (4) to better balance topological redundancy and flooding diameter, we let each track connect 2 inter-track inter-satellite links to 2 adjacent tracks to reduce the flooding diameter as much as possible. This design does not introduce too many redundant links, but can effectively reduce the flooding diameter.
Based on this, one aspect of the present invention provides a flooding topology construction method for a low earth orbit satellite network, including the following steps:
selecting all intra-orbit interstellar links in the initial physical topology;
selecting an inter-satellite link between every two adjacent orbits of a first half topology and a second half topology of the initial physical topology, and finding out all inter-orbit inter-satellite link selection schemes;
calculating the flooding diameter of each link selection scheme, and selecting the inter-orbit inter-satellite link selection scheme with the minimum flooding diameter, wherein the flooding diameter is the shortest distance between two farthest nodes in the flooding topology;
and constructing a flooding topology based on all the intra-orbit inter-satellite links in the initial physical topology and the inter-orbit inter-satellite link selection scheme with the minimum flooding diameter.
In some embodiments of the invention, the first half-edge topology is a left half-edge topology and the second half-edge topology is a right half-edge topology.
In some embodiments of the present invention, the step of finding out all inter-orbit inter-satellite link selection schemes is implemented by constructing a search tree, where a root node of the search tree is a topology that only includes inter-orbit inter-satellite links; the nodes of the second layer of the search tree represent all the inter-orbit satellite link selection schemes which respectively select one inter-satellite link between the first orbit and the second orbit of the left half topology and the right half topology of the initial physical topology; each layer of the search tree is added with an inter-orbit satellite link selection scheme which represents the sequence and selects one more inter-satellite link between two adjacent orbits of the left half topology and the right half topology of the initial physical topology; each leaf node of the search tree represents an inter-orbital inter-satellite link selection scheme.
In some embodiments of the present invention, the step of selecting the inter-track inter-satellite link selection scheme with the smallest flooding diameter includes traversing and searching the whole search tree, and calculating the flooding diameter of each leaf node to find the leaf node with the smallest flooding diameter, where the leaf node with the smallest flooding diameter is the inter-track inter-satellite link selection scheme with the smallest flooding diameter.
In some embodiments of the invention, the step of selecting the inter-track inter-satellite link selection scheme with the smallest flooding diameter comprises a traversal search of the entire search tree with pruning operations comprising: calculating a maximum distance estimation value from the first track to the current layer for each layer of the search tree; and if the flooding diameter calculated by the current node positioned on the current layer is larger than the maximum distance estimation value, the subtree taking the current node as the root node is not searched in a traversing manner.
In some embodiments of the present invention, the flooding diameter includes a flooding diameter of a left half topology and a flooding diameter of a right half topology, and the step of calculating the flooding diameter of each link selection scheme includes calculating inter-satellite distances between adjacent tracks, and summing the inter-satellite distances between the adjacent tracks to obtain the flooding diameter; the step of calculating the distance between satellites in adjacent tracks calculates the distance between satellites from the ith track to the (i + 1) th track according to the following formula:
when the ratio of i =1, the ratio of the total of the number of the bits is set to be 1,
when 1< i < M-1,
SD 1 (i)＝|L i,1 -L i-1,1 l + inter-satellite link distance between the orbits;
SD 2 (i)＝|L i,2 -L i-1,2 l + inter-satellite link distance between tracks;
when i = M-1, the number of the terminals is increased,
wherein M is a track assemblyNumber, SD 1 (i) Distance between satellites from the ith track to the (i + 1) th track of the left half topology, SD 2 (i) The distance between satellites from the ith orbit to the (i + 1) th orbit in the right half-edge topology, D is the shortest distance between two satellite nodes connecting the first orbit and the second orbit, and D = | L i,1 -L i，2 L, P is satellite orbit perimeter, L i,1 Is an inter-orbital star link from the ith orbit to the (i + 1) th orbit of the left half-edge topology, L i-1,1 Is an inter-orbit inter-satellite link from the i-1 th orbit to the i-th orbit of the left half-edge topology, | L i,1 -L i-1,1 L is the shortest distance between two inter-track links, L i,2 Is an inter-orbit inter-satellite link from the ith orbit to the (i + 1) th orbit of the right half-edge topology, L i-1,2 Is an inter-orbit inter-star link from the i-1 th orbit to the i-th orbit of the right half-edge topology, | L i,1 -L i-1,1 And | is the shortest distance between inter-satellite links between orbits.
In some embodiments of the present invention, in the step of calculating the flooding diameter of each link selection scheme, the distance between inter-satellite links of all the in-orbit adjacent satellites is 1, and the distance between all the in-orbit inter-satellite links is 1.
In some embodiments of the invention, the built flooding topology is a sub-topology of the initial physical topology, which is retained, but the flooding information is only route-flooded on the built flooding topology.
Another aspect of the present invention provides a flooding topology building apparatus for a low-earth orbit satellite network, including a processor and a memory, wherein the memory stores computer instructions, and the processor is configured to execute the computer instructions stored in the memory, and when the computer instructions are executed by the processor, the apparatus implements the steps of any one of the above methods.
Another aspect of the invention provides a computer-readable storage medium, on which a computer program is stored, characterized in that the program, when executed by a processor, performs the steps of any of the methods described above.
The flooding topology construction method, the flooding topology construction device and the flooding topology storage medium for the low-orbit satellite network can reduce redundant flooding information transmission in the low-orbit satellite network, enable the routing to be fast converged and improve the operation efficiency of the low-orbit satellite network.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and drawings.
It will be appreciated by those skilled in the art that the objects and advantages that can be achieved with the present invention are not limited to the specific details set forth above, and that these and other objects that can be achieved with the present invention will be more clearly understood from the detailed description that follows.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the principles of the invention. In the drawings:
FIG. 1 is a flow chart of the flooding topology construction of the low earth orbit satellite network in an embodiment of the present invention
FIG. 2 is a diagram of a low-earth orbit satellite network topology according to an embodiment of the invention.
Fig. 3 is a schematic diagram of a search tree of an inter-orbit inter-satellite link selection scheme according to an embodiment of the present invention.
Fig. 4 is a schematic plan view of a first track according to an embodiment of the invention.
FIG. 5 is a schematic diagram of the i-1 st track, the i-th track and the i +1 th track according to an embodiment of the present invention.
FIG. 6 is a schematic diagram of the M-2 th track, the M-1 th track and the M-th track according to an embodiment of the present invention.
FIG. 7 is a graph comparing the time consumed in traversing a search tree completely with a search tree with pruning according to an embodiment of the present invention
Fig. 8 is a comparison diagram of the number of links between flooding topologies in an embodiment of the present invention.
FIG. 9 is a comparison of the number of LSU packets generated in accordance with one embodiment of the present invention.
Fig. 10 is a graph illustrating the location of LSAck packets generated according to the link loss according to an embodiment of the present invention.
FIG. 11 is a comparison graph of route convergence time versus broken link in accordance with an embodiment of the present invention.
Fig. 12 is a graph of the number of LSU packets generated versus topology size in accordance with an embodiment of the present invention.
Fig. 13 is a comparison graph of the number of LSAck packets generated according to the topology size in an embodiment of the invention.
FIG. 14 is a comparison graph of the topology size change of the routing convergence time in one embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail with reference to the following embodiments and accompanying drawings. The exemplary embodiments and descriptions of the present invention are provided to explain the present invention, but not to limit the present invention.
It should be noted that, in order to avoid obscuring the present invention with unnecessary details, only the structures and/or processing steps closely related to the scheme according to the present invention are shown in the drawings, and other details not so relevant to the present invention are omitted.
It should be emphasized that the term "comprises/comprising" when used herein, is taken to specify the presence of stated features, elements, steps or components, but does not preclude the presence or addition of one or more other features, elements, steps or components.
It is also noted herein that the term "coupled," if not specifically stated, may refer herein to not only a direct connection, but also an indirect connection in which an intermediate is present.
Hereinafter, embodiments of the present invention will be described with reference to the drawings. In the drawings, the same reference numerals denote the same or similar components, or the same or similar steps.
In order to achieve the aims of reducing redundant flooding information transfer and enabling routing to be fast converged under the low-orbit satellite network scene, the invention provides a method, a device and a storage medium for constructing the flooding topology of the low-orbit satellite network.
Fig. 1 is a flow chart of a flooding topology construction of a low earth orbit satellite network in an embodiment of the present invention, where the method includes the following steps:
s110, selecting all intra-orbit inter-satellite links in the initial physical topology;
s120, selecting an inter-satellite link between every two adjacent orbits of the first half topology and the second half topology of the initial physical topology, and finding out all inter-orbit inter-satellite link selection schemes;
s130: calculating the flooding diameter of each link selection scheme, selecting the inter-orbit inter-satellite link selection scheme with the minimum flooding diameter, wherein the flooding diameter is the shortest distance between two farthest nodes in the flooding topology;
s140: and constructing the flooding topology based on all the intra-orbit inter-satellite links in the initial physical topology and the found inter-orbit inter-satellite link selection scheme with the minimum flooding diameter.
In an embodiment of the present invention, the first half-edge topology is a left half-edge topology, and the second half-edge topology is a right half-edge topology.
FIG. 2 is a diagram of a low-earth orbit satellite network topology according to an embodiment of the invention. As shown in the topology of the M × N low-orbit satellite network (M =8, N = 12), the reverse seam divides the entire topology into two parts, and the satellites in the left half topology move from south to north, while the satellites in the right half topology move in the opposite directions. The satellite orbit is a ring, the left side s1 and the right side s1 in the figure are the same orbit, s1-1, s1-2, … and s1-12 all belong to satellites on the first orbit (or called orbit No. 1), the rest orbits are the same, and 8 orbits completely cover the earth. It should be noted that the direction of satellite motion is the same in low earth orbit, but different in orbit, although the satellite can reach a relatively stationary state during the time of route flooding, since the entire initial physical topology of the satellite varies with the satellite motion.
In an embodiment of the present invention, the step of finding out all the inter-orbit star link selection schemes is implemented by constructing a search tree, a root node of the search tree is a topology only including inter-orbit star links, a node of a second layer of the search tree represents all the inter-orbit star link selection schemes that respectively select one inter-star link only between a first orbit and a second orbit of a left half topology and a right half topology of an initial physical topology, each layer of the search tree is added with an inter-orbit star link selection scheme that respectively selects one more inter-star link between two adjacent orbits of the left half topology and the right half topology of the initial physical topology, and each leaf node of the obtained search tree represents one inter-orbit star link selection scheme.
In an embodiment of the present invention, the step of selecting the inter-track inter-satellite link selection scheme with the minimum flooding diameter includes traversing and searching the entire search tree, and calculating the flooding diameter of each leaf node to find the leaf node with the minimum flooding diameter, where the leaf node with the minimum flooding diameter is the inter-track inter-satellite link selection scheme with the minimum flooding diameter. It should be noted that the root node of the present invention is equivalent to a blank topology structure without selecting inter-track links and only reserving intra-track links, and each additional layer of child nodes on the basis of the root node is to select one more group of inter-track links, and the selection of the inter-track links is performed sequentially, that is, from the first track to the second track, and from the second track to the third track, no jump is performed.
Fig. 3 is a schematic diagram of a search tree of an inter-orbital inter-satellite link selection scheme in an embodiment of the present invention, where the diagram only shows a part of child nodes of the search tree, and the process of generating the search tree is demonstrated by taking fig. 3 as an example: in the first layer of child nodes, one of the inter-track link connections from all the first tracks to the second tracks in the left half topology and the right half topology of the initial physical topology is selected respectively, and each selection scheme forms a child node; similarly, performing similar operations on the next-level child node, selecting one … … each from all inter-orbit link connections from the second orbit to the third orbit in the left half topology and the right half topology of the initial physical topology, as the search tree is continuously expanded, more and more inter-orbit star links are added to the topology, and the number of possible link selection schemes also increases rapidly. Finally, the number of link selection schemes is equivalent to the number of leaf nodes.
In an embodiment of the present invention, a calculation formula for calculating the number of leaf nodes is as follows:
wherein n is i,1 Represents the number of inter-orbital inter-satellite links from track i to track i +1 in the left half topology, n i,2 Representing the number of inter-orbital star links from track i to track i +1 in the right half-topology. In the above inventive embodiments, the first layer has n 1,1 ×n 1,2 The children nodes, likewise, each of the children nodes of the root node also contains n 2,1 ×n 2,2 And (4) a child node.
In an embodiment of the invention, each leaf node of the search tree represents one possible link selection scheme, but different topologies in different leaf nodes have different flooding diameters, in which the invention requires finding the link selection scheme with the smallest flooding diameter. To achieve this, we need to search through the entire tree, calculate the flooding diameter of each leaf node to find the leaf node with the smallest flooding topology diameter.
In an embodiment of the present invention, the step of selecting the inter-track inter-satellite link selection scheme with the smallest flooding diameter includes a traversal search of the entire search tree with a pruning operation, where the pruning operation includes: and calculating the maximum distance estimation value from the first track to the current layer for each layer of the search tree, and if the flooding diameter calculated by the current node positioned on the current layer is greater than the maximum distance estimation value, not traversing and searching the subtree taking the current node as the root node. The reason is that the computational complexity of traversing the search through the tree is staggering. Fortunately, at some nodes of the tree, we find the flooding diameter from the first track to track i (i < M) too large, so there is no need to compute the flooding diameter from the first track to track j (i < j < M) any further. That is, we can go back from the unlikely branch directly without having to recompute the children of the current node. Such pruning methods can substantially reduce the time required for searching.
In one embodiment of the present invention, the solution of the maximum distance estimate may be achieved by calculating an average, linear regression analysis, or an algorithm based on rank statistics.
In an embodiment of the present invention, the process of solving the flooding diameter may perform machine learning or deep learning based on solving the geometric relationship between the satellite orbits on the coordinates to accurately calculate the inter-orbit distance.
In an embodiment of the present invention, the flooding diameter includes a flooding diameter of a left half topology and a flooding diameter of a right half topology, and the step of calculating the flooding diameter of each link selection scheme includes calculating inter-satellite distances between adjacent tracks, and summing the inter-satellite distances between the adjacent tracks to obtain the flooding diameter. Calculating the distance between satellites between adjacent tracks, and calculating the distance between satellites from the ith track to the (i + 1) th track according to the following formula:
when the ratio of i =1, the ratio of the total of the number of the bits is set to be 1,
when 1< i < M-1,
SD 1 (i)＝|L i,1 -L i-1,1 l + inter-satellite link distance between tracks;
SD 2 (i)＝|L i,2 -L i-1,2 l + inter-satellite link distance between tracks;
when i = M-1, the number of the terminals is increased,
wherein M is the total number of tracks, SD 1 (i) Distance between satellites from the ith track to the (i + 1) th track of the left half topology, SD 2 (i) Is the distance between satellites of the ith orbit to the (i + 1) th orbit of the right half-edge topology, D is the shortest distance between two satellite nodes connecting the first orbit and the second orbit, and D = | L i,1 -L i，2 L, P is satellite orbit perimeter, L i,1 Is an inter-orbital star link from the ith orbit to the (i + 1) th orbit of the left half-edge topology, L i-1,1 Is an inter-orbit inter-satellite link from the i-1 th orbit to the i-th orbit of the left half-edge topology, | L i,1 -L i-1,1 L is the shortest distance between two inter-track links, L i,2 Is an inter-orbit inter-satellite link from the ith orbit to the (i + 1) th orbit of the right half-edge topology, L i-1,2 Is an inter-orbit inter-star link from the i-1 th orbit to the i-th orbit of the right half-edge topology, | L i,1 -L i-1,1 And | is the shortest distance between inter-satellite links between orbits.
It should be noted that, in the calculation of the flooding diameter, due to the existence of the reverse seam, the flooding diameter is a distance from a certain satellite in the first orbit to a certain satellite in the mth orbit. Therefore, the calculation of the flooding diameter may be divided into calculating the distance from the first track to the second track, the distance from the second track to the third track, … …, and the distance from the M-1 th track to the mth track, the calculation of the flooding diameter is calculated by summing the inter-satellite distances between the adjacent tracks, and the step and method of calculating the inter-satellite distance between the adjacent tracks will be explained in detail below.
In an embodiment of the present invention, in the step of calculating the flooding diameter of each link selection scheme, the distances between inter-satellite links of adjacent satellites in all orbits are 1, and the distances between inter-satellite links of all orbits are 1, which is performed for the purpose of simplifying the calculation.
In one embodiment of the present invention, an algorithm for computing the distance between orbits is provided, the algorithm being input as an added inter-orbitThe inter-satellite link set L, the current ith orbit and the orbit perimeter P, and the algorithm output is the inter-orbit Satellite Distance (SD) between the left part and the right part 1 (i) And SD 2 (i) Inter-orbital intersatellite link set L is L as described above i,1 ，L i-1,1 … ….
The calculation of the inter-orbital satellite distance is divided into 3 cases, which are:
case 1: and calculating the distance between the satellites of the first orbit and the second orbit.
To explain the calculation of the satellite distance in this case with reference to fig. 4, fig. 4 is a schematic diagram of a first orbital plane in an embodiment of the present invention, in which hollow dots represent common satellite nodes, solid dots represent satellite nodes connecting the inter-orbital links of the first orbit and the second orbit, and shaded dots represent satellite nodes farthest from the inter-orbital links of the first orbit and the second orbit.
When 2 satellite nodes connecting the inter-orbital links are determined, the node furthest from the inter-orbital links of the first and second orbits is also determined. Since the satellite orbit is a ring, the node farthest from the inter-orbit link is 2 inter-orbit links L 1,1 And L 1,2 The midpoint of the longer path (node 6). Thus, the first orbital to second orbital inter-satellite distance is the distance from the furthest satellite node in the first orbit (node 6) to the satellite node connecting the inter-orbital link (node 2 or node 10), plus the distance 1 of the inter-orbital inter-satellite link itself. First, the algorithm calculates the shortest distance D between 2 satellite nodes connecting two inter-orbital links. Next, the algorithm takes the maximum of D and P-D to obtain the distance of the longer path between 2 satellite nodes connecting the inter-orbital link (node 2->Node 3->Node 4->…->The distance of the node 10). The maximum value obtained is divided by 2 to obtain the distance from the farthest satellite node (node 6) in the first orbit to the satellite node (node 2 or node 10) connected with the inter-orbit link. The result is added with the distance 1 of the inter-orbit link of the first orbit and the second orbit to obtain the inter-satellite distance from the first orbit to the second orbit.
Case 2: and (3) calculating the distance between the i-th track and the i +1 th track (1- <i- <M-1).
The calculation in this case is described with reference to fig. 5, and fig. 5 is a schematic diagram of the i-1 th track, the i-th track and the i +1 th track in an embodiment of the present invention. When the orbit i < M-1, the distance between the satellites of the i-th orbit and the i + 1-th orbit can be calculated in two steps. In the first step, the distance between the satellite connected to the inter-orbital link between the i-1 st orbit and the i-th orbit on the orbit i and the satellite connected to the inter-orbital link between the i-th orbit and the i +1 st orbit (e.g. the distance between node 1- > node 2 on the i-th orbit in fig. 5) is calculated. This step can be obtained by calculating the distance between the link between the i-1 th track and the i-th track and the link between the i-th track and the i +1 th track. And secondly, adding the result obtained by the calculation in the first step to the distance 1 of the inter-track link between the ith track and the (i + 1) th track, wherein the obtained result is the distance between the ith track and the (i + 1) th track satellite. Although both nodes 2 and 9 are located on the ith track in fig. 5, the two nodes are actually in different directions and located on both sides of the initial physical topology because the two nodes are located on both sides of the reverse seam.
Case 3: and calculating the distance between satellites from the M-1 st orbit to the M orbit.
The calculation in this case is described with reference to FIG. 6, which is a schematic diagram of the M-2 th track, the M-1 th track and the Mth track in an embodiment of the present invention. The calculation of the distance is the integration of the first two conditions and can be divided into the following three steps: the first step is to calculate the distance between the satellite in the M-1 th orbit connected to the inter-orbit link between the M-2 nd orbit and the M-1 st orbit and the satellite connected to the inter-orbit link between the M-1 st orbit and the M-1 th orbit (e.g. the distance between node 1- > node 2 in the M-1 th orbit in fig. 6). The second step calculates the distance from the farthest satellite node (node 5) in the mth orbit to the satellite node (node 1 or node 9) connecting the inter-orbit links. First, the shortest distance D of 2 satellite nodes connecting the links between the two orbits in the mth orbit is calculated. Then, the maximum value of D and P-D is taken to obtain the distance of a longer path between 2 satellite nodes connecting the inter-orbit links (the distance of node 1- > node 2- > node 3- > … - > node 9). The maximum value obtained is divided by 2 to obtain the distance from the farthest satellite node (node 5) on the Mth orbit to the satellite node (node 1 or node 9) connected with the inter-orbit link. And thirdly, adding the results obtained by the previous two steps of calculation, and adding the distance 1 of the link between the M-1 orbit and the Mth orbit to the obtained result, namely the distance between the M-1 orbit and the Mth orbit satellite.
In the embodiments of the present invention, fig. 4, 5 and 6, the satellite is rotated counterclockwise.
In an embodiment of the present invention, a complete flooding topology construction algorithm is provided, which is a process of searching on a solution space tree starting from a root node. The flooding topology with the smallest flooding diameter is sought by searching. The algorithm respectively records the distance between the satellites from the first orbit to the ith orbit in the left half topology and the right half topology in a database in the searching process by applying the inter-orbit satellite distance calculation algorithm, and the distance is used 1 And distance 2 To indicate. During the search process, the algorithm records the inter-track links that have been added into the flooding topology using the inter-track link set L, and when searching to the leaf nodes, the algorithm will construct the flooding topology using the inter-track link set L. distance 1 、distance 2 And L are initialized when traversing to the root node of the tree. Distance during traversal of the tree 1 、distance 2 And L will be continually updated as the route flooding path expands. However, when the inter-satellite distance of the first track to track i is too large, further expansion of the flooding path is meaningless. Therefore, the algorithm uses the maximum distance estimation function d (i) to estimate the maximum distance between satellites of the first orbit to orbit i. If the current distance is greater than the estimated maximum distance d (i), the algorithm will go back directly from the unlikely branch to reduce unnecessary computations and restart traversal from the parent of the current node. When the algorithm traverses to the leaf nodes, the algorithm will return a feasible solution to the flooding topology. The selection of the maximum distance estimation function is more diversified, a threshold value can be calculated through each layer, if the threshold value is larger than the threshold value, the distance is over large, backtracking is carried out from the node, a subtree taking the node as a root node is not traversed, and the traversal algorithm is realized based on recursion.
In an embodiment of the present invention, the constructed flooding topology is a sub-topology of the initial physical topology, and the initial physical topology is retained, but the flooding information is only route-flooded on the constructed flooding topology.
In some embodiments of the present invention, a lightweight routing flooding mechanism for a low earth orbit satellite network is provided, where the routing flooding mechanism performs lightweight routing flooding based on a flooding topology constructed by the method, the apparatus, and the storage medium provided by the present invention, and is combined with the routing flooding mechanism, so as to perform routing flooding well in a low earth orbit satellite network environment instead of an OSPF algorithm.
In some embodiments of the present invention, a flooding topology construction apparatus for a low-earth orbit satellite network is provided, which includes a processor and a memory, the memory stores computer instructions, the processor is configured to execute the computer instructions stored in the memory, and when the computer instructions are executed by the processor, the apparatus implements the steps of any one of the above methods.
In some embodiments of the invention, a computer-readable storage medium is provided, on which a computer program is stored which, when being executed by a processor, carries out the steps of any of the methods described above.
Next, the significant effect achieved by the present invention is demonstrated by comparing the initial physical topology based on OSPF with the flooding topology based on the above-described embodiments of the present invention.
Fig. 7 is a comparison graph of time consumed by completely traversing the search tree and the traversal search tree with pruning according to an embodiment of the present invention, which compares the time consumed by completely traversing the search tree without pruning and the time consumed by traversing the search tree with pruning under different scale constellation topologies (i.e., different numbers of satellites), and shows the superiority of pruning. In a 6 x 8 low-earth satellite network, the two operations do not have a large performance gap in terms of time consumption. For larger topologies, however, pruning effectively reduces algorithm time complexity. For example, in a 12 x 12 low earth orbit satellite network, the post-pruning search traversal is reduced by about 91.63% compared to the original search traversal. In larger scale topologies, the performance improvement brought by pruning will be more significant.
Fig. 8 is a comparison diagram of the number of links between the flooding topology satellites in an embodiment of the present invention, which compares the complexity difference between the initial physical topology and the flooding topology of the present invention under different satellite numbers. The method of the invention effectively reduces the complexity of the flooding topology. In a 12 x 14 satellite network, the flooding topology reduces 87 inter-satellite links, accounting for 31.4% of the total number of physical topology inter-satellite links. With the increase of the topological scale, the lightweight routing flooding mechanism provided by the invention can reduce more inter-satellite links.
Fig. 9 is a comparison graph of the number of LSU packets generated in an embodiment of the present invention, and it is proved that the present invention can reduce the overhead of flooding information by comparing the number of LSU packets generated by flooding based on the initial physical topology and the topology of the present invention. In this experiment, the number of LSU packets and LSAck packets in the flooding process of an 8 × 12 satellite network was measured. As shown in fig. 9, 418 LSU packets are generated in the flooding process based on the initial physical topology, whereas the flooding process based on the topology constructed by the method of the present invention generates only 246 LSU packets, which is reduced by about 41.15%.
Fig. 10 is a graph illustrating the location of LSAck packets generated according to the link loss according to an embodiment of the present invention. In addition, the number of LSAck packages generated in the flooding process based on the initial physical topology is between 280 and 350 (the average value is 291), and the number of LSAck packages generated in the flooding process based on the topology constructed by the method is between 150 and 230 (the average value is 197). On average, the two are reduced by 32.3% compared with the LSack packet number.
Fig. 11 is a comparison graph of the change of the route convergence time with the broken link according to an embodiment of the present invention, and when the positions of the broken links are different, the difference between the route convergence time of flooding based on the initial physical topology and the topology constructed by the method of the present invention is compared, and in an 8 × 12 satellite network, the route flooding convergence time based on the initial physical topology is about 1.4-1.6s (1.4894 s on average), while the route convergence time of the topology constructed by the present invention is about 1.2-1.4s (1.3401 s on average), which reduces the route convergence time by about 10.03%.
Fig. 12 is a graph illustrating the number of LSU packets generated according to the topology size in an embodiment of the present invention, and fig. 13 is a graph illustrating the number of LSAck packets generated according to the topology size in an embodiment of the present invention. With the change of the topological scale, namely the change of the number of satellites, the number of LSU packets and LSAck packets generated in the flooding process is increased, and compared with the flooding based on the initial physical topology, the topological flooding based on the invention can generate fewer LSU packets and LSAck packets. Specifically, for a 6 × 8 satellite network, topology flooding based on the present invention reduces LSU packets by 30.93% and LSAck packets by 31.34%, respectively. For a 12 x 14 satellite network, the topology flooding based on the invention reduces 45.19% LSU packets and 29.93% LSAck packets respectively. The contrast will be more apparent as the topology scale increases.
FIG. 14 is a comparison graph of the topology size change of the routing convergence time in one embodiment of the present invention. As the constellation topology scales up, the convergence time based on both flooding topologies will increase, but the route convergence time based on the flooding topology of the present invention is always less than the route convergence time based on the initial physical topology flooding. For a 6 x 8 satellite network, the route flooding based on the present invention reduces the convergence time by 4.29%, while for a 12 x 14 satellite network, the route flooding based on the present invention reduces the convergence time by 21.65%.
Correspondingly to the method, the invention also provides a flooding topology building device for a low-earth orbit satellite network, which comprises a computer device, wherein the computer device comprises a processor and a memory, the memory stores computer instructions, the processor is used for executing the computer instructions stored in the memory, and when the computer instructions are executed by the processor, the device realizes the steps of the method.
Embodiments of the present invention further provide a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the foregoing steps of the edge computing server deployment method. The computer readable storage medium may be a tangible storage medium such as Random Access Memory (RAM), memory, read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, floppy disks, hard disks, removable storage disks, CD-ROMs, or any other form of storage medium known in the art.
Those of ordinary skill in the art will appreciate that the various illustrative components, systems, and methods described in connection with the embodiments disclosed herein may be implemented as hardware, software, or combinations thereof. Whether this is done in hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention. When implemented in hardware, it may be, for example, an electronic circuit, an Application Specific Integrated Circuit (ASIC), suitable firmware, plug-in, function card, or the like. When implemented in software, the elements of the invention are the programs or code segments used to perform the required tasks. The program or code segments may be stored in a machine-readable medium or transmitted by a data signal carried in a carrier wave over a transmission medium or a communication link.
It is to be understood that the invention is not limited to the specific arrangements and instrumentality described above and shown in the drawings. A detailed description of known methods is omitted herein for the sake of brevity. In the above embodiments, several specific steps are described and shown as examples. However, the method processes of the present invention are not limited to the specific steps described and illustrated, and those skilled in the art can make various changes, modifications and additions or change the order between the steps after comprehending the spirit of the present invention.
Features that are described and/or illustrated with respect to one embodiment may be used in the same way or in a similar way in one or more other embodiments and/or in combination with or instead of the features of the other embodiments in the present invention.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made to the embodiment of the present invention by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A flooding topology construction method for a low earth orbit satellite network is characterized by comprising the following steps:
selecting all intra-orbit inter-satellite links in the initial physical topology;
selecting an inter-satellite link between every two adjacent orbits of a first half topology and a second half topology of the initial physical topology, and finding out all inter-orbit inter-satellite link selection schemes;
calculating the flooding diameter of each link selection scheme, and selecting the inter-orbit inter-satellite link selection scheme with the minimum flooding diameter, wherein the flooding diameter is the shortest distance between two farthest nodes in the flooding topology;
and constructing a flooding topology based on all the intra-orbit inter-satellite links in the initial physical topology and the inter-orbit inter-satellite link selection scheme with the minimum flooding diameter.
2. The method of claim 1, wherein the first half-edge topology is a left half-edge topology and the second half-edge topology is a right half-edge topology.
3. The method of claim 2, wherein said step of finding all inter-orbital inter-satellite link selection schemes is accomplished by constructing a search tree whose root node is a topology that contains only inter-orbital inter-satellite links;
the nodes of the second layer of the search tree represent all the inter-orbit satellite link selection schemes which respectively select one inter-satellite link between the first orbit and the second orbit of the left half topology and the right half topology of the initial physical topology;
each layer of the search tree is added with an inter-orbit satellite link selection scheme which represents the sequence and selects one more inter-satellite link between two adjacent orbits of the left half topology and the right half topology of the initial physical topology;
each leaf node of the search tree represents an inter-orbital inter-satellite link selection scheme.
4. The method of claim 3, wherein the step of selecting the inter-track inter-satellite link selection scheme with the smallest flooding diameter comprises traversing through the search tree, and calculating the flooding diameter of each leaf node to find the leaf node with the smallest flooding diameter, which is the inter-track inter-satellite link selection scheme with the smallest flooding diameter.
5. The method according to claim 4, wherein the step of selecting the inter-track inter-satellite link selection scheme with the smallest flooding diameter comprises a traversal search of the entire search tree with pruning operations comprising:
calculating a maximum distance estimation value from the first track to the current layer for each layer of the search tree;
and if the flooding diameter calculated by the current node positioned on the current layer is larger than the maximum distance estimation value, the subtree taking the current node as the root node is not searched in a traversing manner.
6. The method of claim 2, wherein the flooding diameters comprise a flooding diameter for a left half topology and a flooding diameter for a right half topology, and wherein the step of calculating the flooding diameter for each link selection scheme comprises calculating inter-satellite distances between adjacent tracks, and summing the inter-satellite distances between the adjacent tracks to obtain the flooding diameter;
the step of calculating the distance between satellites in adjacent tracks calculates the distance between satellites from the ith track to the (i + 1) th track according to the following formula:
when the ratio of i =1, the ratio of the total of the number of the bits is set to be 1,
when 1< i < M-1,
SD 1 (i)＝|L i,1 -L i-1,1 l + inter-satellite link distance between the orbits;
SD 2 (i)＝|L i,2 -L i-1,2 l + inter-satellite link distance between the orbits;
when i = M-1, the current value of the current,
wherein M is the total number of tracks, SD 1 (i) Distance between satellites from the ith track to the (i + 1) th track of the left half topology, SD 2 (i) The distance between satellites of the ith orbit to the (i + 1) th orbit of the right half-edge topology, D is the shortest distance between two satellite nodes connecting the first orbit and the second orbit, P is the perimeter of the satellite orbit, and L is the distance between the satellites i,1 Is an inter-orbital star link from the ith orbit to the (i + 1) th orbit of the left half-edge topology, L i-1,1 Is an inter-orbit inter-satellite link from the i-1 th orbit to the i-th orbit of the left half-edge topology, | L i,1 -L i-1,1 L is the shortest distance between two inter-track links, D = | L i,1 -L i，2 |，L i,2 Is an inter-orbit inter-satellite link from the ith orbit to the (i + 1) th orbit of the right half-edge topology, L i-1,2 Is an inter-orbit inter-star link from the i-1 th orbit to the i-th orbit of the right half-edge topology, | L i,1 -L i-1,1 And | is the shortest distance between inter-satellite links between orbits.
7. The method of claim 6, wherein the step of calculating the flooding diameter for each link selection scheme comprises the step of calculating the distance between the inter-satellite links of all the orbiting neighboring satellites as 1 and the distance between all the orbiting inter-satellite links as 1.
8. The method of claim 1, wherein the build-completed flooding topology is a child of an initial physical topology, the initial physical topology being preserved but the flooding information is only route-flooded on the build-completed flooding topology.
9. A flooding topology construction apparatus for a low-earth-orbit satellite network, comprising a processor and a memory, wherein the memory has stored therein computer instructions, the processor being configured to execute the computer instructions stored in the memory, and when the computer instructions are executed by the processor, the apparatus implementing the steps of the method according to any one of claims 1 to 8.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210504071.XA CN115297045A (en) | 2022-05-10 | 2022-05-10 | Flooding topology construction method and device for low-earth-orbit satellite network and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210504071.XA CN115297045A (en) | 2022-05-10 | 2022-05-10 | Flooding topology construction method and device for low-earth-orbit satellite network and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115297045A true CN115297045A (en) | 2022-11-04 |
Family
ID=83820828
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210504071.XA Pending CN115297045A (en) | 2022-05-10 | 2022-05-10 | Flooding topology construction method and device for low-earth-orbit satellite network and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115297045A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115776329A (en) * | 2022-11-17 | 2023-03-10 | 云南电网有限责任公司 | Inter-satellite link construction method and system |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050152333A1 (en) * | 2004-01-14 | 2005-07-14 | Nortel Networks Limited | Method and apparatus for controlling the dissemination of routing information on a communication network |
| CN103986512A (en) * | 2014-04-30 | 2014-08-13 | 南京邮电大学 | Satellite network inter-satellite link failure recovery method based on regional division |
| CN107181520A (en) * | 2017-04-21 | 2017-09-19 | 中国科学院光电研究院 | The network-building method and device of a kind of network topology structure |
| US20200162335A1 (en) * | 2018-04-04 | 2020-05-21 | Arista Networks, Inc. | Computation of network flooding topologies |
| CN111464225A (en) * | 2020-02-26 | 2020-07-28 | 重庆邮电大学 | Satellite routing load balancing algorithm based on source routing |
| WO2020165627A1 (en) * | 2019-02-12 | 2020-08-20 | Telefonaktiebolaget Lm Ericsson (Publ) | Limited flooding in dense graphs |
| CN112910536A (en) * | 2019-11-19 | 2021-06-04 | 北京最终前沿深空科技有限公司 | Control switching method and device for satellite network |
| US20210203562A1 (en) * | 2018-11-30 | 2021-07-01 | Huawei Technologies Co., Ltd. | System and method to recover from link or node failure in a network |
-
2022
- 2022-05-10 CN CN202210504071.XA patent/CN115297045A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050152333A1 (en) * | 2004-01-14 | 2005-07-14 | Nortel Networks Limited | Method and apparatus for controlling the dissemination of routing information on a communication network |
| CN103986512A (en) * | 2014-04-30 | 2014-08-13 | 南京邮电大学 | Satellite network inter-satellite link failure recovery method based on regional division |
| CN107181520A (en) * | 2017-04-21 | 2017-09-19 | 中国科学院光电研究院 | The network-building method and device of a kind of network topology structure |
| US20200162335A1 (en) * | 2018-04-04 | 2020-05-21 | Arista Networks, Inc. | Computation of network flooding topologies |
| US20210203562A1 (en) * | 2018-11-30 | 2021-07-01 | Huawei Technologies Co., Ltd. | System and method to recover from link or node failure in a network |
| WO2020165627A1 (en) * | 2019-02-12 | 2020-08-20 | Telefonaktiebolaget Lm Ericsson (Publ) | Limited flooding in dense graphs |
| CN112910536A (en) * | 2019-11-19 | 2021-06-04 | 北京最终前沿深空科技有限公司 | Control switching method and device for satellite network |
| CN111464225A (en) * | 2020-02-26 | 2020-07-28 | 重庆邮电大学 | Satellite routing load balancing algorithm based on source routing |
Non-Patent Citations (2)
| Title |
|---|
| 苑喆: "LEO/MEO双层卫星网的分层动态路由算法", 北京航空航天大学学报, vol. 32, no. 07 * |
| 蔡海东: "宽带多媒体LEO 卫星网络路由技术研究 蔡海", 《数字通信世界》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115776329A (en) * | 2022-11-17 | 2023-03-10 | 云南电网有限责任公司 | Inter-satellite link construction method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111953399B (en) | Inter-satellite routing method in low-earth-orbit satellite communication network | |
| Wood | Internetworking with satellite constellations | |
| Pan et al. | OPSPF: Orbit prediction shortest path first routing for resilient LEO satellite networks | |
| US8780928B2 (en) | Method and system for determination of routes in LEO satellite networks with bandwidth and priority awareness and adaptive rerouting | |
| US6392997B1 (en) | Technique for group-based routing update with limited per neighbor/adjacency customization | |
| Henderson et al. | On distributed, geographic-based packet routing for LEO satellite networks | |
| US4905233A (en) | Multiple path routing mechanism for packet communications network | |
| Donner et al. | MPLS-based satellite constellation networks | |
| Dong et al. | Load balancing routing algorithm based on extended link states in LEO constellation network | |
| CN113489528A (en) | Self-adaptive survivability method suitable for inter-satellite routing | |
| CN110518959B (en) | LEO satellite network communication method and system based on MPLS and DTN | |
| CN113067627B (en) | Self-adaptive survivable satellite routing method based on virtual nodes | |
| CN115297045A (en) | Flooding topology construction method and device for low-earth-orbit satellite network and storage medium | |
| CN115361335A (en) | SR-MPLS-based dynamic routing method for low-orbit satellite network | |
| Ruan et al. | Lightweight route flooding via flooding topology pruning for LEO satellite networks | |
| Gnawali et al. | Data centric, position-based routing in space networks | |
| CN116708271A (en) | Inter-satellite routing method and device for low-orbit constellation network | |
| CN115632692B (en) | Satellite dynamic topology routing method | |
| CN114222345B (en) | Routing path calculation method, device, electronic equipment and storage medium | |
| EP1673901B1 (en) | Method and apparatus for generating routing information in a data communications network | |
| Lu et al. | Quick routing response to link failure in low-earth orbit satellite networks | |
| Liu et al. | An Improved DTN Scheme for Large-Scale LEO Satellite Networks | |
| Na et al. | Agent-Based Distributed Routing Algorithm with Traffic Prediction for LEO Satellite Network [J] | |
| Westphal et al. | LEO Satellite Networking Relaunched: Survey and Current Research Challenges | |
| CN114024891B (en) | Naive Bayesian-assisted contact graph routing method and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |