CN115297045B - Low-orbit satellite network-oriented flooding topology construction method, device and storage medium - Google Patents
Low-orbit satellite network-oriented flooding topology construction method, device and storage medium Download PDFInfo
- Publication number
- CN115297045B CN115297045B CN202210504071.XA CN202210504071A CN115297045B CN 115297045 B CN115297045 B CN 115297045B CN 202210504071 A CN202210504071 A CN 202210504071A CN 115297045 B CN115297045 B CN 115297045B
- Authority
- CN
- China
- Prior art keywords
- inter
- orbit
- topology
- 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.)
- Active
Links
- 238000010276 construction Methods 0.000 title claims abstract description 10
- 238000000034 method Methods 0.000 claims abstract description 52
- 238000004364 calculation method Methods 0.000 claims description 16
- 238000013138 pruning Methods 0.000 claims description 15
- 238000004590 computer program Methods 0.000 claims description 4
- 230000005540 biological transmission Effects 0.000 abstract description 5
- 238000004422 calculation algorithm Methods 0.000 description 17
- 230000008569 process Effects 0.000 description 17
- 230000008859 change Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 230000007246 mechanism Effects 0.000 description 6
- 238000012545 processing Methods 0.000 description 6
- 230000033001 locomotion Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000001788 irregular Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 235000008694 Humulus lupulus Nutrition 0.000 description 2
- 238000007792 addition Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 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
- 230000001419 dependent effect Effects 0.000 description 1
- 238000002474 experimental method Methods 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
- 230000009191 jumping Effects 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
- 238000013341 scale-up Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
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 flood topology construction method, a device and a storage medium for a low-orbit satellite network, wherein the method comprises the following steps: selecting all inter-orbit inter-satellite links in an initial physical topology; selecting an inter-satellite link between every two adjacent tracks of the first half-edge topology and the second half-edge topology of the initial physical topology, and finding out all inter-track inter-satellite link selection schemes; calculating the flooding diameter of each link selection scheme, and selecting an inter-orbit inter-satellite link selection scheme with the smallest 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 inter-orbit inter-star links in the initial physical topology and the inter-orbit inter-star link selection scheme with the minimum flooding diameter. The invention can reduce redundant flooding information transmission in the low-orbit satellite network, ensure that the route is converged rapidly and improve the operation efficiency of the low-orbit satellite network.
Description
Technical Field
The present invention relates to the field of dynamic routing technologies, and in particular, to a method, an apparatus, and a storage medium for constructing a flooding topology for a low-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 integral part of the satellite communication technology. Among them, the low earth orbit (Low Earth Oribit, LEO) satellite network has the advantages of low orbit height, large satellite node number, large earth surface coverage area, ultra low delay and the like, and is becoming the main research direction of the current satellite network. Currently, typical low-orbit satellite networks include "iridium satellite" systems, "global satellite" systems, and "star-link" systems.
The low orbit satellite network has the following characteristics: on the one hand, the low-orbit satellite network has the characteristics of large scale and high density, and on the other hand, the topology change of the low-orbit satellite network caused by the continuous motion of the low-orbit satellites. Topology changes of low orbit satellite networks can be divided into two major categories, regular topology changes and irregular topology changes. Regular topology changes result from periodic movements of the constellation, whereas irregular topology changes are caused by abnormal link failures and subsequent link recovery. As the density of low orbit satellite network systems increases, the frequency of conventional topology changes in low orbit satellite systems increases, and the likelihood of non-conventional topology changes occurring increases.
The above-described features of low-orbit satellite networks present significant challenges to the design of routing protocols. Existing terrestrial dynamic routing protocols, such as the Open Shortest path first (Open Shortest PATH FIRST, OSPF) protocol, if applied directly to low-orbit satellite networks, will perform full-network flooding when dealing with irregular topology changes of the low-orbit satellite networks, resulting in a large amount of redundant flooding information being transferred over inter-satellite links, and each node needs to process multiple copies of the same flooding information, thereby reducing link bandwidth and delaying route convergence.
Taking the OSPF protocol as an example, the drawbacks when terrestrial dynamic routing is applied directly to low-orbit satellite networks are described:
The OSPF protocol is a routing protocol for IP networks. The protocol operates within a single autonomous system (Autonomous System, AS). The OSPF protocol belongs to an 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 (INTERNET ENGINEERING TASK Force, IETF). It is specifically designed for TCP/IP internet environments and includes explicit support for classless inter-Domain Routing (CIDR). The basis for routing is the destination IP address in the IP header. The OSPF protocol itself is dynamic. The OSPF protocol can quickly react and perform route convergence when the network topology of the autonomous system changes (such as the condition of router interface fault, etc.), and calculates a new route after the route convergence is completed.
When the burst link fault is faced, the OSPF protocol updates a link state Database (LINK STATE Database, LSDB) of each router by adopting a flooding routing protocol (simply referred to as flooding), and the flooding process is performed in the whole network topology. This flooding mechanism ensures that each router in the autonomous system builds the same link state database. The flooding mechanism uses link state Update messages (LINK STATE Update packets, LSUs) to flood link state Update advertisements (LINK STATE advertisement, LSAs), each of which carries certain route Update information. One link state update message may contain multiple link state update advertisements. Each link state update advertisement must be acknowledged by a link state acknowledgement message (LINK STATE Acknowledge, LSAck). The flooding process begins when a link failure is discovered and a link state update message is generated. After each router receives the link state update message, the message is forwarded from other interfaces (except the interface receiving the message). The flooding process ends when each router has established the same link state database. In general, the duration of the flooding procedure (i.e. route convergence time) should be as short as possible.
When the burst link fails, the OSPF protocol adopts a whole network flooding mode to update the route, and in the scene of the low-orbit satellite network, a large amount of redundant flooding information is transmitted in the low-orbit satellite network due to the fact that the topology scale and complexity of the low-orbit satellite network are continuously improved and frequent topology changes are caused by continuous movement of the satellite. Negative effects are: on one hand, the bandwidth of expensive inter-satellite links is occupied, and the links are more congested due to the additional routing convergence messages, so that messages are queued and even lost, which not only affects the user traffic, but also increases the routing convergence time; on the other hand, the processing cost of the control plane on each satellite node is increased, and in the process of route convergence, each satellite receives a plurality of link state update messages, and all the link state update messages are sent to the control plane for route protocol processing. Because of the limited performance of the control plane, excessive redundant link state update messages occupy all processing resources of the control plane, resulting in delay in the route convergence process. In the worst case, if the flooding rate exceeds the routing processing rate, the control plane will have to discard some link state update messages, and if the lost link state update messages are significant, the convergence time of the route will be further delayed. In the full-network LEO constellation topology, link state update messages are largely duplicated, resulting in a large number of redundant route update messages. The larger the constellation size, the more redundant link state update messages are generated.
Therefore, how to provide a method and apparatus for reducing redundant flooding information transmission and enabling fast route convergence in a low-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, apparatus, and storage medium for constructing a flooding topology for a low-orbit satellite network, so as to obviate or ameliorate one or more of the disadvantages of the prior art.
Two key factors need to be considered in constructing an 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. In theory, we can prune the physical topology using the minimum spanning tree to obtain a flooding topology with a connected graph of minimum links. However, when a link fails, the flooding topology generated based on the minimum spanning tree is split into two unconnected parts, thereby affecting the flooding of the routing update message across the network. Therefore, by reserving some redundant links in the pruning process, a necessary redundant topology structure is added for the flooding topology based on the minimum spanning tree, so that the flooding topology generated by the minimum spanning tree remains connected when the links fail. At the same time, the maximum number of flooding hops should be as small as possible to reduce the route convergence time. However, pruning of redundant links may also increase the maximum number of flooded hops due to the deletion of links on the shortest path between two nodes. We define the flooding diameter as the shortest distance between the two furthest nodes in the flooding topology, and excessive flooding diameter should be avoided during pruning. To sum up: the principle of constructing the flooding topology of the invention is as follows: ① The flooding topology needs to connect each node in the original satellite network topology to ensure that the original topology has the same reachability as the original topology; ② Each node in the flooding topology needs to have a guarantee of at least 2, and such redundancy ensures that single-point faults ③ cannot occur in the flooding topology 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 guarantees, namely a tandem link redundancy; ④ To better balance topological redundancy and flooding diameter, we let each track connect 2 inter-track inter-star links to 2 adjacent tracks to reduce the flooding diameter as much as possible. This design does not introduce excessive redundant links, but can effectively reduce the flooding diameter.
Based on this, an aspect of the present invention provides a method for constructing a flooding topology for a low-orbit satellite network, the method comprising the steps of:
selecting all inter-orbit inter-satellite links in an initial physical topology;
Selecting an inter-satellite link between every two adjacent tracks of the first half-edge topology and the second half-edge topology of the initial physical topology, and finding out all inter-track inter-satellite link selection schemes;
Calculating the flooding diameter of each link selection scheme, and selecting an inter-orbit inter-satellite link selection scheme with the smallest 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 inter-orbit inter-star links in the initial physical topology and the inter-orbit inter-star link selection scheme with the minimum flooding diameter.
In some embodiments of the invention, the first half topology is a left half topology and the second half topology is a right half topology.
In some embodiments of the present invention, the step of finding all inter-orbit inter-satellite link selection schemes is performed by constructing a search tree whose root node is a topology that includes only inter-orbit inter-satellite links; the nodes of the second layer of the search tree represent all inter-orbit inter-satellite link selection schemes which respectively select one inter-satellite link between a first orbit and a second orbit of the left half topology and the right half topology of the initial physical topology; each layer of the search tree is additionally provided with an inter-orbit inter-satellite link selection scheme for selecting one inter-satellite link between two adjacent orbits of the left half topology and the right half topology of the initial physical topology in a representative sequence; each leaf node of the search tree represents an inter-orbit inter-star link selection scheme.
In some embodiments of the present invention, the step of selecting the inter-orbit inter-satellite link selection scheme having the smallest flooding diameter includes traversing a search through the search tree, calculating the flooding diameter of each leaf node to find the leaf node having the smallest flooding diameter, which is the inter-orbit inter-satellite link selection scheme having the smallest flooding diameter.
In some embodiments of the invention, the step of selecting an inter-orbit inter-satellite link selection scheme having a minimum flooding diameter comprises a traversal search of the entire search tree with pruning operations comprising: calculating a maximum distance estimate from the first track to the current layer for each layer of the search tree; if the flooding diameter calculated by the current node at the current layer is larger than the maximum distance estimated value, the subtree with the current node as the root node is not searched.
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 an inter-satellite distance between adjacent orbits, and summing the inter-satellite distances between the adjacent orbits to obtain the flooding diameter; the step of calculating the distance between satellites in adjacent orbits calculates the distance between satellites from the ith orbit to the (i+1) th orbit, and the formula is as follows:
When i=1, the number of the cells,
When 1 is more than i and less than M-1,
SD 1(i)＝|Li,1-Li-1,1 |+ inter-orbit inter-satellite link distance;
SD 2(i)＝|Li,2-Li-1,2 |+ inter-orbit inter-satellite link distance;
when i=m-1,
Where M is the total number of orbits, SD 1 (i) is the inter-satellite distance from the i-th orbit to the i+1-th orbit of the left-half topology, SD 2 (i) is the inter-satellite distance from the i-th orbit to the i+1-th orbit of the right-half topology, D is the shortest distance between two satellite nodes connecting the first orbit and the second orbit, d= |l i,1-Li,2 |, P is the satellite orbit circumference, L i,1 is the inter-satellite link from the i-th orbit to the i+1-th orbit of the left-half topology, L i-1,1 is the inter-satellite link from the i-1 orbit to the i-th orbit of the left-half topology, L i,1-Li-1,1 |is the shortest distance between two inter-satellite links from the i-th orbit of the right-half topology, L i,2 is the inter-satellite link from the i-th orbit of the right-half topology, L i-1,2 is the shortest distance between inter-satellite links from the i-th orbit of the i-th orbit, and L i,1-Li-1,1 |is the inter-satellite link.
In some embodiments of the present invention, in the step of calculating the flooding diameter of each link selection scheme, the inter-satellite link distances of all the adjacent satellites in orbit are 1, and the inter-satellite link distances between all the orbits are 1.
In some embodiments of the invention, the constructed flooding topology is a sub-topology of the initial physical topology that is preserved, but the flooding information is only routed over the constructed flooding topology.
Another aspect of the present invention provides a low-orbit satellite network oriented flooding topology construction device, comprising a processor and a memory, characterized in that the memory has stored therein computer instructions, the processor being configured to execute the computer instructions stored in the memory, the device implementing the steps of any of the methods described above when the computer instructions are executed by the processor.
Another aspect of the invention provides a computer readable storage medium having stored thereon a computer program, characterized in that the program when executed by a processor implements the steps of any of the methods described above.
The method, the device and the storage medium for constructing the flooding topology for the low-orbit satellite network can reduce redundant flooding information transmission in the low-orbit satellite network, enable the route to be converged rapidly 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 may 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 above-described specific ones, and that the above and other objects that can be achieved with the present invention will be more clearly understood from the following detailed description.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this specification, illustrate and together with the description serve to explain the application. In the drawings:
FIG. 1 is a flow chart of a flooding topology construction of a low-orbit satellite network according to an embodiment of the invention
Fig. 2 is a topology of a low-orbit satellite network according to an embodiment of the invention.
FIG. 3 is a diagram of an inter-orbit inter-satellite link selection scheme search tree 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 view of the i-1 th 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 an M-2 track, an M-1 track, and an M track according to an embodiment of the present invention.
FIG. 7 is a graph showing the comparison of time spent traversing a search tree in its entirety and traversing a search tree with pruning according to one embodiment of the present invention
Fig. 8 is a graph of a comparison of the number of inter-star links of a flooding topology according to an embodiment of the present invention.
FIG. 9 is a graph showing the number of LSU packets generated in accordance with one embodiment of the present invention.
Fig. 10 is a graph showing the location of the generated LSAck packet as a function of the broken link according to an embodiment of the present invention.
Fig. 11 is a graph showing the change of the route convergence time with the broken link according to an embodiment of the present invention.
FIG. 12 is a graph showing the number of LSU packets generated as a function of topology scale according to an embodiment of the present invention.
Fig. 13 is a graph showing how the number of LSAck packets generated varies with topology scale according to an embodiment of the present invention.
Fig. 14 is a graph showing route convergence time topology scale change versus the present invention.
Detailed Description
The present invention will be described in further detail with reference to the following embodiments and the accompanying drawings, in order to make the objects, technical solutions and advantages of the present invention more apparent. The exemplary embodiments of the present invention and the descriptions thereof are used herein to explain the present invention, but are not intended to limit the invention.
It should be noted here that, in order to avoid obscuring the present invention due to unnecessary details, only structures and/or processing steps closely related to the solution according to the present invention are shown in the drawings, while other details not greatly related 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" may refer to not only a direct connection, but also an indirect connection in which an intermediate is present, unless otherwise specified.
Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings. In the drawings, the same reference numerals represent the same or similar components, or the same or similar steps.
In order to achieve the goal of reducing redundant flooding information transmission and enabling routing to converge rapidly under the condition of a low-orbit satellite network, the invention provides a flooding topology construction method, a device and a storage medium for the low-orbit satellite network.
Fig. 1 is a flow chart of a flooding topology construction of a low-orbit satellite network according to an embodiment of the present invention, the method comprises the following steps:
s110, selecting all inter-orbit inter-satellite links in an initial physical topology;
S120, selecting an inter-satellite link between every two adjacent tracks of a first half-edge topology and a second half-edge topology of an initial physical topology, and finding out all inter-track inter-satellite link selection schemes;
S130: calculating the flooding diameter of each link selection scheme, and selecting an inter-orbit inter-satellite link selection scheme with the smallest flooding diameter, wherein the flooding diameter is the shortest distance between two nodes farthest in the flooding topology;
s140: the flooding topology is constructed based on all intra-orbit inter-star links in the initial physical topology and the found inter-orbit inter-star link selection scheme with the smallest flooding diameter.
In one embodiment of the present invention, the first half topology is a left half topology and the second half topology is a right half topology.
Fig. 2 is a topology of a low-orbit satellite network according to an embodiment of the invention. As shown in the figure, which is a topology of an mxn low orbit satellite network (m=8, n=12), the reverse slot in the figure divides the entire topology into two parts, the satellites in the left half topology move from north to south, and the satellite in the right half topology move in 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 belong to satellites in a first orbit (or called 1 orbit), the rest orbits are the same, and 8 orbits completely cover the earth. It should be noted that the direction of satellite motion in low earth orbit is the same, but is different in orbit, and the satellite can reach a relatively stationary state during the time of route flooding, although the entire initial physical topology of the satellite varies with the satellite motion.
In an embodiment of the present invention, the step of finding all inter-orbit inter-satellite link selection schemes is implemented by constructing a search tree, a root node of the search tree is a topology including only inter-orbit inter-satellite links, nodes of a second layer of the search tree represent all inter-orbit inter-satellite link selection schemes selecting one inter-satellite link between a first orbit and a second orbit of only 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 inter-satellite link selection scheme selecting one inter-satellite link between two adjacent orbits of the left-half topology and the right-half topology in sequence, and each leaf node of the obtained search tree represents one inter-orbit inter-satellite link selection scheme.
In an embodiment of the present invention, the step of selecting the inter-orbit inter-satellite link selection scheme with the minimum 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 minimum flooding diameter, where the leaf node with the minimum flooding diameter is the inter-orbit 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 that only remains the intra-track links without inter-track link selection, and on the basis of the root node, each layer of child nodes is added to perform a group of inter-track link selection, and the inter-track link selection is performed sequentially, i.e. from the first track to the second track, from the second track to the third track, without jumping.
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, where only a part of sub-nodes of the search tree are shown, and the process of generating the search tree is illustrated in FIG. 3 as an example: in the first layer of sub-nodes, selecting one link connection between the first track and the second track from the left half topology and the right half topology of the initial physical topology, wherein each selection scheme forms one sub-node; likewise, similar operations are performed for the next level child node, each selection … … of inter-track link connections from all second tracks to third tracks in the left and right half topologies of the initial physical topology, as the search tree continues to expand, more and more inter-track inter-star links are added to the topology, and the number of possible link selection schemes also grows rapidly. Finally, the number of link selection schemes is equivalent to the number of leaf nodes.
In one embodiment of the present invention, the calculation formula for calculating the number of leaf nodes is as follows:
Where n i,1 represents the number of inter-orbit inter-star links from orbit i to orbit i+1 in the left half topology and n i,2 represents the number of inter-orbit inter-star links from orbit i to orbit i+1 in the right half topology. In the above embodiment of the invention, the first layer has n 1,1×n1,2 child nodes, and similarly, each child node of the root node also has n 2,1×n2,2 child nodes.
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 needs to find the link selection scheme with the smallest flooding diameter. To achieve this we need to walk through the entire tree, calculating the flooding diameter of each leaf node to find the leaf node with the smallest flooding topology diameter.
In one embodiment of the present invention, the step of selecting an inter-orbit inter-satellite link selection scheme with a minimum flooding diameter comprises a traversal search of the entire search tree with pruning operations comprising: and calculating a maximum distance estimated 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 at the current layer is larger than the maximum distance estimated value, not traversing the subtree with 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 that the flooding diameter from the first track to track i (i < M) is too large, so that no further calculation of the flooding diameter from the first track to track j (i < j < M) is required. That is, we can trace back directly from the impossible branches without having to recalculate the child node of the current node. Such pruning method can greatly reduce the time required for searching.
In one embodiment of the invention, the solution of the maximum distance estimate may be achieved by calculation of an average, linear regression analysis or an algorithm based on ranking statistics.
In one embodiment of the present invention, the process of solving the flooding diameter may perform machine learning or deep learning based on the geometric relationship between satellite orbits on the solving 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 a distance between satellites in adjacent orbits, and summing the distances between satellites in adjacent orbits to obtain the flooding diameter. A step of calculating the inter-satellite distance between adjacent orbits, wherein the inter-satellite distance from the ith orbit to the (i+1) th orbit is calculated by the following formula:
When i=1, the number of the cells,
When 1 is more than i and less than M-1,
SD 1(i)＝|Li,1-Li-1,1 |+ inter-orbit inter-satellite link distance;
SD 2(i)＝|Li,2-Li-1,2 |+ inter-orbit inter-satellite link distance;
when i=m-1,
Where M is the total number of orbits, SD 1 (i) is the inter-satellite distance from the i-th orbit to the i+1-th orbit of the left-half topology, SD 2 (i) is the inter-satellite distance from the i-th orbit to the i+1-th orbit of the right-half topology, D is the shortest distance between two satellite nodes connecting the first orbit and the second orbit, d= |l i,1-Li,2 |, P is the satellite orbit circumference, L i,1 is the inter-satellite link from the i-th orbit to the i+1-th orbit of the left-half topology, L i-1,1 is the inter-satellite link from the i-1 orbit to the i-th orbit of the left-half topology, L i,1-Li-1,1 |is the shortest distance between two inter-satellite links from the i-th orbit of the right-half topology, L i,2 is the inter-satellite link from the i-th orbit of the right-half topology, L i-1,2 is the shortest distance between inter-satellite links from the i-th orbit of the i-th orbit, and L i,1-Li-1,1 |is the inter-satellite link.
In the calculation of the flooding diameter, the flooding diameter is the distance from a certain satellite in the first orbit to a certain satellite in the mth orbit due to the existence of the reverse slot. Thus, the calculation of the flooding diameter can be divided into calculating the distance from the first orbit to the second orbit, the distance from the second orbit to the third orbit, … …, and the distance from the M-1 st orbit to the M-th orbit, and the calculation of the flooding diameter is calculated by summing the distances between adjacent satellites, and the steps and methods of calculating the distances between adjacent satellites 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 of inter-satellite links of adjacent satellites in all orbits are 1, and the distances of inter-satellite links in all orbits are 1, which is done for the purpose of simplifying the calculation.
In one embodiment of the present invention, an inter-orbit satellite distance calculation algorithm is proposed, which is input as the added inter-orbit satellite link set L, the current i-th orbit and the orbit circumference P, and the algorithm output as the left and right inter-orbit satellite distances (SD 1 (i) and SD 2 (i)), where the inter-orbit satellite link set L is the set of L i,1,Li-1,1 … … above.
The calculation of the inter-orbit satellite distance is divided into 3 cases, which are respectively:
case 1: the distance between the first orbit and the second orbit satellite is calculated.
In this case, the calculation of the satellite distance will be described with reference to fig. 4, where fig. 4 is a schematic plan view of a first orbit according to an embodiment of the present invention, in which the hollow dots represent common satellite nodes, the solid dots represent satellite nodes connecting the inter-orbit links of the first orbit and the second orbit, and the hatched dots represent satellite nodes farthest from the inter-orbit links of the first orbit and the second orbit.
When the satellite nodes of 2 inter-orbit links are determined, the node furthest from the inter-orbit links of the first and second orbits is also determined. Since the satellite orbit is a ring, the node furthest from the inter-orbit links is the midpoint of the longer path between the 2 inter-orbit links L 1,1 and L 1,2 (node 6). Thus, the first orbit to second orbit inter-satellite distance is the distance from the furthest satellite node on the first orbit (node 6) to the satellite node connecting the inter-orbit link (node 2 or node 10), plus the distance 1 of the inter-orbit inter-satellite link itself. First, the algorithm calculates the shortest distance D between 2 satellite nodes that connect two inter-orbit links. Next, the algorithm takes the maximum of D and P-D to get the distance of the longer path between 2 satellite nodes connecting the inter-orbit links (distance of node 2- > node 3- > node 4- > … - > node 10). Dividing the obtained maximum by 2 is the distance from the furthest satellite node in the first orbit (node 6) to the satellite node connecting the inter-orbit links (node 2 or node 10). The resulting result, plus the distance 1 of the inter-orbit link itself of the first orbit and the second orbit, yields the first orbit to second orbit satellite distance.
Case 2: the distance (1 < i < M-1) between the ith orbit and the (i+1) th orbit satellite is calculated.
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 calculation of the distance between the ith orbit and the (i+1) th orbit satellite can be divided into two steps. In a first step, the distance between the satellite in orbit i, which connects the i-1 th orbit with the inter-orbit link of the i-1 th orbit, and the satellite in orbit, which connects the i-1 th orbit with the inter-orbit link of the i+1 th orbit, is calculated (as the distance from node 1- > node 2 in the i-th orbit in fig. 5). This step can be obtained by calculating the distances of the links between the i-1 th track and the i-th track and between the i-th track and the i+1-th track. And the second step is to add the result obtained by the first step with the distance 1 of the inter-orbit link between the ith orbit and the (i+1) th orbit, and the obtained result is the inter-orbit distance between the ith orbit and the (i+1) th orbit satellite. In fig. 5, node 2 and node 9 are both on the ith track, but because they are on either side of the reverse slot, they are in fact in different directions, on either side of the original physical topology.
Case 3: and calculating the distance between the M-1 th orbit and the M th orbit satellite.
The calculation in this case is described with reference to fig. 6, and fig. 6 is a schematic diagram of the M-2 th track, the M-1 st track, and the M-th track in an embodiment of the present invention. The calculation of the distance is the combination of the first two cases, and can be divided into the following three steps: the first step calculates the distance between the satellite on the M-1 th orbit connecting the inter-orbit link of the M-2 th orbit and the M-1 th orbit to the satellite connecting the inter-orbit link of the M-1 th orbit and the M-1 th orbit (as the distance of the node 1- > node 2 on the M-1 th orbit in FIG. 6). The second step calculates the distance from the furthest satellite node in the mth orbit (node 5) to the satellite node connecting the inter-orbit links (node 1 or node 9). First, the shortest distance D of 2 satellite nodes on the mth orbit, which are connected to the links between the two orbits, is calculated. Next, the distance of the longer path between 2 satellite nodes connecting the inter-orbit links (distance of node 1- > node 2- > node 3- > … - > node 9) is obtained by taking the maximum value of D and P-D. Dividing the obtained maximum value by 2 is the distance from the furthest satellite node (node 5) on the mth orbit to the satellite node (node 1 or node 9) connecting the inter-orbit links. And thirdly, adding the results obtained by the calculation in the previous two steps, and adding the link distance 1 between the M-1 th orbit and the M th orbit to obtain the result which is the distance between the M-1 th orbit and the M th orbit satellite.
In the embodiment of the invention shown in fig. 4, 5 and 6, the satellites are rotated counterclockwise.
In one embodiment of the 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. It is intended to find the flooding topology with the smallest flooding diameter by searching. The algorithm records the distances between the satellites from the first orbit to the ith orbit in the left half topology and the right half topology in a database respectively in the searching process by applying an inter-orbit satellite distance calculation algorithm, and the distances are represented by distance 1 and distance 2. During the search, the algorithm uses inter-track link set L to record inter-track links that have been added into the flooding topology, and when searching to leaf nodes, the algorithm will construct the flooding topology using inter-track link set L. Both distance 1、distance2 and L are initialized when traversing to the root node of the tree. During traversal of the tree, distances 1、distance2 and L will be updated continuously as the route flooding path expands. But when the distance between satellites of the first orbit to orbit i is too large, further expansion of the flooding path is meaningless. Thus, the algorithm uses a 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 trace back directly from the impossible branches to reduce unnecessary computation and restart traversal from the parent node of the current node. When the algorithm traverses to the leaf node, 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 excessively large, the node is traced back, the subtree taking the node as the root node is not traversed any more, and the traversing 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, the initial physical topology is preserved, but the flooding information is only routed on the constructed flooding topology.
In some embodiments of the present invention, a low-orbit satellite network-oriented lightweight route flooding mechanism is provided, and the route flooding mechanism is based on a flooding topology constructed by the method, the device and the storage medium provided by the present invention, and combines with the route flooding mechanism to perform lightweight route flooding, so as to perform route flooding in a good place of an OSPF algorithm in a low-orbit satellite network environment.
In some embodiments of the present invention there is provided a low orbit satellite network oriented flooding topology building apparatus comprising a processor and a memory, the memory having stored therein computer instructions for executing the computer instructions stored in the memory, the apparatus implementing the steps of any of the methods described above when the computer instructions are executed by the processor.
In some embodiments of the present invention, a computer readable storage medium is provided, having stored thereon a computer program which when executed by a processor performs the steps of any of the methods described above.
Next, the remarkable 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 time comparison diagram of the time spent for a complete traversal of a search tree and a traversal of a search tree with pruning according to an embodiment of the invention, comparing the time spent for a complete traversal of a search tree without pruning operation with a traversal of a search tree with pruning operation under different scale constellation topologies (i.e., different satellite numbers), and embodying the superiority of pruning operation. In a 6 x 8 low-orbit satellite network, the two operations do not have a large difference in performance in terms of time consumption. Pruning effectively reduces algorithm time complexity for larger topologies. For example, in a 12 x 12 low-orbit satellite network, the pruned search traversal is reduced by about 91.63% of the time compared to the original search traversal. In larger scale topologies, the performance improvement by pruning will be more pronounced.
Fig. 8 is a graph comparing the number of links between the flooded topology satellites in accordance with an embodiment of the invention, comparing the difference between the initial physical topology and the complexity of the flooded topology of the invention for different satellite numbers. The method 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 inter-satellite links of the physical topology. With the increase of topology scale, the lightweight route flooding mechanism provided by the invention can reduce more inter-star links.
Fig. 9 is a graph showing the number of LSU packets generated according to an embodiment of the present invention, which demonstrates that the present invention can reduce the overhead of flooding information by comparing the number of LSU packets generated by flooding based on an initial physical topology with flooding based on the topology of the present invention. The number of LSU packets and LSAck packets during the flooding of an 8 x 12 satellite network was measured in this experiment. As shown in fig. 9, 418 LSU packets were generated during the flooding process based on the initial physical topology, while only 246 LSU packets were generated during the flooding process based on the topology constructed by the method of the present invention, which reduced the LSU packets by about 41.15%.
Fig. 10 is a graph showing the location of the generated LSAck packet as a function of the broken link according to an embodiment of the present invention. In addition, the number of LSAck packets generated during the flooding process based on the initial physical topology is between 280 and 350 (average value is 291), while the number of LSAck packets generated during the flooding process based on the topology constructed by the method of the present invention is between 150 and 230 (average value is 197). On average, both reduced the number of LSAck packets by 32.3%.
Fig. 11 is a comparison chart of the change of the route convergence time with the broken link according to an embodiment of the present invention, comparing the difference of the route convergence time of flooding based on the initial physical topology and the topology constructed by the method according to the present invention under the condition that the broken link positions are different, in an 8×12 satellite network, the route flooding convergence time based on the initial physical topology is about 1.4-1.6s (average 1.4894 s), and the route convergence time of the topology constructed according to the present invention is about 1.2-1.4s (average 1.3401 s), which reduces the route convergence time by about 10.03%.
Fig. 12 is a comparison chart of the number of LSU packets generated with the topology scale according to an embodiment of the present invention, and fig. 13 is a comparison chart of the number of LSAck packets generated with the topology scale according to an embodiment of the present invention. With the change of topology scale, namely the change of satellite quantity, the quantity of LSU packets and LSAck packets generated in the flooding process is increased, and compared with the topology flooding based on the initial physical topology, the topology flooding based on the invention can generate fewer LSU packets and LSAck packets. Specifically, for a 6×8 satellite network, the topology flooding based on the present invention reduces 30.93% LSU packets and 31.34% LSAck packets, respectively. For a 12×14 satellite network, 45.19% of LSU packets and 29.93% of LSAck packets are reduced, respectively, based on the topology flooding of the present invention. As topology scale increases, contrast will become more pronounced.
Fig. 14 is a graph showing route convergence time topology scale change versus the present invention. As the constellation topology scale up, the convergence time based on both flooding topologies will increase, but the route convergence time based on the inventive flooding topology is always less than the route convergence time based on the initial physical topology flooding. For a 6 x 8 satellite network, the routing flooding based on the present invention reduces the convergence time by 4.29%, while for a 12 x 14 satellite network, the routing flooding based on the present invention reduces the convergence time by 21.65%.
Correspondingly, the invention also provides a flooding topology construction device facing the low-orbit satellite network, which comprises a computer device, wherein the computer device comprises a processor and a memory, the memory is stored with computer instructions, the processor is used for executing the computer instructions stored in the memory, and the device realizes the steps of the method when the computer instructions are executed by the processor.
The embodiments of the present invention also provide a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the edge computing server deployment method described above. 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 disk, a removable memory disk, a CD-ROM, 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 can be implemented as hardware, software, or a combination of both. The particular implementation is hardware or software dependent on the specific application of the solution and the design constraints. 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, a plug-in, a 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 over transmission media or communication links by a data signal carried in a carrier wave.
It should be understood that the invention is not limited to the particular arrangements and instrumentality described above and shown in the drawings. For the sake of brevity, a detailed description of known methods is omitted here. In the above embodiments, several specific steps are described and shown as examples. The method processes of the present invention are not limited to the specific steps described and shown, but various changes, modifications and additions, or the order between steps may be made by those skilled in the art after appreciating the spirit of the present invention.
In this disclosure, 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.
The above description is only of the preferred embodiments of the present invention and is not intended to limit the present invention, and various modifications and variations can be made to the embodiments of the present invention by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. The method for constructing the flooding topology for the low-orbit satellite network is characterized by comprising the following steps of:
selecting all inter-orbit inter-satellite links in an initial physical topology;
Selecting an inter-satellite link between every two adjacent tracks of the first half-edge topology and the second half-edge topology of the initial physical topology, and finding out all inter-track inter-satellite link selection schemes;
Calculating the flooding diameter of each link selection scheme, and selecting an inter-orbit inter-satellite link selection scheme with the smallest 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 inter-orbit inter-star links in the initial physical topology and the inter-orbit inter-star link selection scheme with the minimum flooding diameter.
2. The method of claim 1, wherein the first half topology is a left half topology and the second half topology is a right half topology.
3. The method of claim 2, wherein the step of finding all inter-orbit inter-star link selection schemes is accomplished by constructing a search tree whose root node is a topology that includes only inter-orbit inter-star links;
the nodes of the second layer of the search tree represent all inter-orbit inter-satellite link selection schemes which respectively select one inter-satellite link between a first orbit and a second orbit of the left half topology and the right half topology of the initial physical topology;
each layer of the search tree is additionally provided with an inter-orbit inter-satellite link selection scheme for selecting one inter-satellite link between two adjacent orbits of the left half topology and the right half topology of the initial physical topology in a representative sequence;
Each leaf node of the search tree represents an inter-orbit inter-star link selection scheme.
4. A method according to claim 3, wherein the step of selecting the inter-orbit inter-satellite link selection scheme having the smallest flooding diameter comprises traversing a search through a search tree, calculating the flooding diameter of each leaf node to find the leaf node having the smallest flooding diameter, i.e. the inter-orbit inter-satellite link selection scheme having the smallest flooding diameter.
5. The method of claim 4, wherein the step of selecting an inter-orbit inter-satellite link selection scheme having a minimum flooding diameter comprises a traversal search of an entire search tree with pruning operations, the pruning operations comprising:
Calculating a maximum distance estimate from the first track to the current layer for each layer of the search tree;
if the flooding diameter calculated by the current node at the current layer is larger than the maximum distance estimated value, the subtree with the current node as the root node is not searched.
6. The method of claim 2, wherein the flooding diameter comprises a flooding diameter of a left half topology and a flooding diameter of a right half topology, and wherein the step of calculating the flooding diameter for each link selection scheme comprises calculating an inter-satellite distance between adjacent orbits, and summing the inter-satellite distances between the adjacent orbits to obtain the flooding diameter;
the step of calculating the distance between satellites in adjacent orbits calculates the distance between satellites from the ith orbit to the (i+1) th orbit, and the formula is as follows:
When i=1, the number of the cells,
When 1 is more than i and less than M-1,
SD 1(i)＝|Li,1-Li-1,1 |+ inter-orbit inter-satellite link distance;
SD 2(i)＝|Li,2-Li-1,2 |+ inter-orbit inter-satellite link distance;
when i=m-1,
Where M is the total number of orbits, SD 1 (i) is the inter-satellite distance from the i-th orbit to the i+1-th orbit of the left-half topology, SD 2 (i) is the inter-satellite distance from the i-th orbit to the i+1-th orbit of the right-half topology, D is the shortest distance between two satellite nodes connecting the first orbit and the second orbit, P is the satellite orbit perimeter, L i,1 is the inter-satellite link from the i-th orbit to the i+1-th orbit of the left-half topology, L i-1,1 is the inter-satellite link from the i-1-th orbit to the i-th orbit of the left-half topology, L i,1-Li-1,1 is the shortest distance between two inter-satellite links, d= |l i,1-Li,2|,Li,2 is the inter-satellite link from the i-th orbit to the i+1-th orbit of the right-half topology, L i-1,2 is the shortest distance between inter-satellite links from the i-1-th orbit of the right-half topology, L i,1-Li-1,1 |is the inter-satellite link.
7. The method of claim 6, wherein in the step of calculating the flooding diameter of each link selection scheme, in order to simplify the calculation, the calculation is performed such that the inter-satellite link distances of all the in-orbit adjacent satellites are 1, and the inter-orbit inter-satellite link distances are 1.
8. The method of claim 1, wherein the constructed flooding topology is a sub-topology of an initial physical topology that is preserved, but the flooding information is only route flooded on the constructed flooding topology.
9. A low orbit satellite network oriented flooding topology construction device comprising a processor and a memory, characterized in that said memory has stored therein computer instructions for executing the computer instructions stored in said memory, which device when executed by the processor realizes the steps of the method according to any of claims 1 to 8.
10. A computer readable storage medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements 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 CN115297045B (en) | 2022-05-10 | 2022-05-10 | Low-orbit satellite network-oriented flooding topology construction method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210504071.XA CN115297045B (en) | 2022-05-10 | 2022-05-10 | Low-orbit satellite network-oriented flooding topology construction method, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115297045A CN115297045A (en) | 2022-11-04 |
| CN115297045B true CN115297045B (en) | 2024-06-14 |
Family
ID=83820828
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210504071.XA Active CN115297045B (en) | 2022-05-10 | 2022-05-10 | Low-orbit satellite network-oriented flooding topology construction method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115297045B (en) |
Families Citing this family (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 (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107181520A (en) * | 2017-04-21 | 2017-09-19 | 中国科学院光电研究院 | The network-building method and device of a kind of network topology structure |
| CN111464225A (en) * | 2020-02-26 | 2020-07-28 | 重庆邮电大学 | Satellite routing load balancing algorithm based on source routing |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7697454B2 (en) * | 2004-01-14 | 2010-04-13 | Avaya, Inc. | Method and apparatus for controlling the dissemination of routing information on a communication network |
| CN103986512B (en) * | 2014-04-30 | 2017-05-03 | 南京邮电大学 | Satellite network inter-satellite link failure recovery method based on regional division |
| US11671329B2 (en) * | 2018-04-04 | 2023-06-06 | Arista Networks, Inc. | Computation of network flooding topologies |
| CN113261245B (en) * | 2018-11-30 | 2022-12-13 | 华为技术有限公司 | Recovery system and method for network link or node failure |
| WO2020165627A1 (en) * | 2019-02-12 | 2020-08-20 | Telefonaktiebolaget Lm Ericsson (Publ) | Limited flooding in dense graphs |
| CN112910536B (en) * | 2019-11-19 | 2023-01-24 | 北京最终前沿深空科技有限公司 | Control switching method and device for satellite network |
-
2022
- 2022-05-10 CN CN202210504071.XA patent/CN115297045B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107181520A (en) * | 2017-04-21 | 2017-09-19 | 中国科学院光电研究院 | The network-building method and device of a kind of network topology structure |
| CN111464225A (en) * | 2020-02-26 | 2020-07-28 | 重庆邮电大学 | Satellite routing load balancing algorithm based on source routing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115297045A (en) | 2022-11-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111953399B (en) | Inter-satellite routing method in low-earth-orbit satellite communication network | |
| JP5600215B2 (en) | Method and system for determining a route in an LEO satellite network using bandwidth and priority awareness and adaptive routing | |
| Bellur et al. | A reliable, efficient topology broadcast protocol for dynamic networks | |
| CN106411736B (en) | Node resource discovery strategy optimization method for software-defined satellite network | |
| US8559414B2 (en) | Automatically detecting best paths from shadow route reflectors | |
| CN113489528A (en) | Self-adaptive survivability method suitable for inter-satellite routing | |
| CN115297045B (en) | Low-orbit satellite network-oriented flooding topology construction method, device and storage medium | |
| US20240223497A1 (en) | System and methods for computing flooding topology | |
| Sheikhan et al. | High reliable disjoint path set selection in mobile ad-hoc network using hopfield neural network | |
| CN114222345B (en) | Routing path calculation method, device, electronic equipment and storage medium | |
| CN116708271A (en) | Inter-satellite routing method and device for low-orbit constellation network | |
| Mordjana et al. | A q-learning based forwarding strategy for named data networking | |
| EP1673901B1 (en) | Method and apparatus for generating routing information in a data communications network | |
| Akram et al. | Design and analysis of a breadth first search based connectivity robustness estimation approach in wireless sensor networks | |
| Berson et al. | Effect of mobility on Future Satellite Packet Networks routing protocols | |
| Dulal et al. | Experimental comparison between geohyperbolic and hyperbolic routing in ndn | |
| CN114827010B (en) | Intra-domain route protection method based on node forwarding probability | |
| CN116405088A (en) | Time slice-based on-board label forwarding method | |
| Li et al. | An OLSR-based Multipath Routing Algorithm for LEO Satellite Network | |
| Garg | Contact Graph Routing for Interplanetary Overlay Networks-DTSN | |
| Dimitriou et al. | GRAViTy: Geographic routing around voids in sensor networks | |
| MARTinez | Optimal Route Reflection Topology Design | |
| Xu et al. | Research on Routing Algorithm Based on Low Orbit Satellite Link Handover | |
| CN117424636A (en) | Giant constellation function domain-division routing method based on non-dominant sorting genetic algorithm | |
| CN117856872A (en) | Robust communication networking and path reconstruction method for dense low-orbit constellation network |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |