WO2024022185A1 - Procédé et appareil de génération d'itinéraire, et support d'enregistrement - Google Patents

Procédé et appareil de génération d'itinéraire, et support d'enregistrement Download PDF

Info

Publication number
WO2024022185A1
WO2024022185A1 PCT/CN2023/108080 CN2023108080W WO2024022185A1 WO 2024022185 A1 WO2024022185 A1 WO 2024022185A1 CN 2023108080 W CN2023108080 W CN 2023108080W WO 2024022185 A1 WO2024022185 A1 WO 2024022185A1
Authority
WO
WIPO (PCT)
Prior art keywords
satellite
network
domain
routing information
hierarchical
Prior art date
Application number
PCT/CN2023/108080
Other languages
English (en)
Chinese (zh)
Inventor
赵鹏
刘江
朱士伟
赵喜凤
丁睿
Original Assignee
网络通信与安全紫金山实验室
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 网络通信与安全紫金山实验室 filed Critical 网络通信与安全紫金山实验室
Publication of WO2024022185A1 publication Critical patent/WO2024022185A1/fr

Links

Classifications

    • 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/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • 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/18513—Transmission in a satellite or space-based system
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present application relates to the technical field of satellite communications, and in particular to a route generation method, device, and storage medium.
  • the low-orbit satellite network consists of multiple orbital planes and satellites evenly distributed on the orbital plane.
  • the satellites are connected through inter-satellite links (each satellite includes two intra-orbital links and two inter-orbital links).
  • Satellite nodes before and after the connection and neighboring satellite nodes in adjacent orbits) realize satellite networking to solve the problem of limited ground station establishment and inability to provide network services, and can provide long-distance low-latency transmission.
  • Routing technology is a basic technology to ensure interconnection between satellite nodes. Due to the large scale of low-orbit satellite networks, rapid changes in inter-satellite link status, and limited on-board computing resources, traditional ground routing algorithms cannot be applied at all. Low Earth Orbit Satellite Network.
  • this application provides a route generation method, which method includes:
  • network hierarchical processing and network domain classification processing are performed on the low-orbit satellite network to obtain a plurality of hierarchical networks and the hierarchical network.
  • the routing information corresponding to the upper level network of the lowest level hierarchical network is updated according to the current routing information of each satellite; wherein, the triggering condition is the
  • the current routing information of the satellite causes the change amount of the routing information corresponding to the upper-level hierarchical network to be greater than or equal to the preset change amount threshold.
  • network hierarchical processing and network segmentation processing are performed on the low-orbit satellite network to obtain multiple A level-level network and the domain network corresponding to the level-level network include:
  • a plurality of levels of orbital dimension hierarchical networks are determined according to the first logarithmic result, or a plurality of levels of satellite dimension hierarchical networks are determined according to the second logarithmic result, wherein the plurality of levels of hierarchical networks are the multiple levels of hierarchical networks.
  • each of the level hierarchical networks and the domain network corresponding to each of the level hierarchical networks are determined.
  • determining each of the level hierarchical networks and the domain network corresponding to each of the level hierarchical networks based on the ratio of the first quantity to the second quantity includes:
  • determining the domain network corresponding to each of the orbital dimension hierarchical networks and the domain network corresponding to each of the satellite dimension hierarchical networks based on the ratio of the first quantity to the second quantity includes: :
  • the domain network corresponding to the next level network of the highest level hierarchical network is determined until the domain network of the four-point cyclic motif is obtained. until.
  • determining the domain network corresponding to each of the orbital dimension hierarchical networks and the domain network corresponding to each of the satellite dimension hierarchical networks based on the ratio of the first quantity to the second quantity includes: :
  • the domain network corresponding to the next level hierarchical network of the highest level hierarchical network is determined until the domain of the four-point cyclic motif is obtained. Until the Internet.
  • the last historical weight of the corresponding satellite is updated using a current weight that is smaller than the last historical weight
  • the first routing information is exchanged between the satellite whose weight has been updated and the satellite whose weight has not been updated to determine the satellite whose weight has been updated and the satellite whose weight has not been updated.
  • the second routing information is exchanged between the satellites whose weights have not been updated to determine the second optimized weights of the satellites whose weights have not been changed to obtain the current routing information.
  • updating the routing information corresponding to the upper-level hierarchical network based on the current routing information of each satellite includes:
  • the first optimization weight and/or the second optimization weight of the common satellite between two adjacent domain networks determine the third optimization weight corresponding to other satellites in the two domain networks except the public satellite, and provide The other satellite sends the third optimization weight and the identification of the destination satellite of the other satellite, wherein the current routing information includes the first optimization weight and/or the second optimization weight of the public satellite.
  • the method further includes:
  • the third optimization weight is updated to the routing information of the other satellite.
  • the method further includes:
  • the third optimization weight is used Replace the weight corresponding to the identity of the destination satellite.
  • obtaining the current weight of each satellite in the domain network corresponding to the lowest level network according to a preset time period includes:
  • the link length is used as the current weight of the corresponding satellite.
  • this application also provides a route generation device, which includes:
  • the determination module is configured to perform network hierarchical processing and network domain classification processing on the low-orbit satellite network based on the first number of orbits in the low-orbit satellite network and the second number of satellites in each orbit to obtain a multi-level hierarchical network.
  • the domain network corresponding to the level hierarchical network;
  • the acquisition module is set to obtain the current weight of each satellite in the domain network corresponding to the lowest level network according to the preset time period;
  • the first update module is configured to update the historical routing information of each satellite in the domain network corresponding to the lowest level hierarchical network to obtain the corresponding current routing information if there is a current weight that is smaller than the last historical weight, wherein, Historical routing information includes the last historical weight;
  • the second update module is configured to update the routing information corresponding to the upper level network of the lowest level hierarchical network according to the current routing information of each satellite if the current routing information of each of the satellites satisfies the triggering condition; wherein,
  • the triggering condition is that the current routing information of the satellite causes the change amount of the routing information corresponding to the upper level network to be greater than or equal to a preset change threshold value.
  • this application also provides a computer-readable storage medium.
  • the computer-readable storage medium has a computer program stored thereon, and when the computer program is executed by the processor, the following steps are implemented:
  • network hierarchical processing and network domain classification processing are performed on the low-orbit satellite network to obtain a plurality of hierarchical networks and the hierarchical network.
  • the routing information corresponding to the upper level network of the lowest level hierarchical network is updated according to the current routing information of each satellite; wherein, the triggering condition is the
  • the current routing information of the satellite causes the change amount of the routing information corresponding to the upper-level hierarchical network to be greater than or equal to the preset change amount threshold.
  • the above-mentioned route generation method, device, and storage medium perform network hierarchical processing and network segmentation processing on the low-orbit satellite network based on the first number of orbits in the low-orbit satellite network and the second number of satellites in each orbit, and obtain multiple The level-level network and the domain network corresponding to the level-level network. And obtain the current weight of each satellite in the domain network corresponding to the lowest level network. If there is a current weight that is smaller than the previous historical weight, update the historical routing information of each satellite in the domain network corresponding to the lowest level network. Get the corresponding current routing information.
  • the routing information corresponding to the upper level network of the lowest level hierarchical network is updated according to the current routing information of each satellite; where, the triggering condition is that the current routing information of the satellite makes the upper level hierarchical network
  • the change amount of the routing information corresponding to the first-level hierarchical network is greater than or equal to the preset change amount threshold.
  • routing information of the domain network corresponding to the lowest-level network affects the network one level above the lowest-level network, then update the domain network of the network one level above the lowest-level network and analyze it layer by layer. There is no need to All routing information of the entire low-orbit satellite network is updated, ensuring the rapid convergence of a large-scale low-orbit satellite network even with limited on-board computing resources.
  • Figure 1 is an application environment diagram of a route generation method in an embodiment
  • Figure 2 is a schematic flowchart of a route generation method in an embodiment
  • Figure 3 is a schematic flowchart of hierarchical domain division of a low-orbit satellite network in one embodiment
  • Figure 4 is a schematic diagram of route generation in one embodiment
  • Figure 5 is a schematic diagram of the hierarchical domain structure of the inclined orbit constellation in one embodiment
  • Figure 6 is a schematic diagram of the hierarchical domain structure of the polar orbit constellation in one embodiment
  • Figure 7 is a schematic diagram of satellite port identification in one embodiment
  • Figure 8 is a schematic diagram of the domain network self-healing of the four-point loop motif in one embodiment
  • Figure 9 is a schematic flowchart of determining current routing information in one embodiment
  • Figure 10 is a schematic diagram of hierarchical and domain identification of a low-orbit satellite network in one embodiment
  • Figure 11 is a schematic diagram of domain network route generation in one embodiment
  • Figure 12 is a schematic flowchart of determining routing information of adjacent domain networks in one embodiment
  • Figure 13 is a schematic diagram of adjacent domain network route generation in one embodiment
  • Figure 14 is a schematic flowchart of determining the current weight of a satellite in one embodiment
  • Figure 15 is a structural block diagram of a route generating device in an embodiment.
  • the route generation method provided by the embodiment of the present application can be applied in an application environment as shown in Figure 1.
  • the application environment includes satellites and inter-satellite links connecting each satellite.
  • node (x, y), node (x+1, y), node (x, y+1), node (x+1, y+1), etc. respectively represent different satellites.
  • x in node (x, y) represents the x-th orbit in the low-orbit satellite network
  • y represents the y-th satellite in each orbit, and the same applies to other nodes.
  • the satellite (x, y) and the satellite (x, y+1) are connected by an in-orbit link, and the satellite (x, y) and the satellite (x+1, y) are connected by an inter-orbit link.
  • Low-orbit satellite networking is realized through inter-satellite links between satellites.
  • the low-orbit satellite network can be divided into a polar orbit constellation and an inclined orbit constellation.
  • the orbital inclination of the polar orbit constellation is close to 90 degrees, that is, passing over the polar regions, there is a reverse seam between the orbital planes, and a stable inter-orbital gap cannot be established.
  • link when the satellite arrives near the polar regions, the satellites in the inter-orbital link will move at high speed, causing the inter-orbital link to break.
  • the Iridium system is a typical polar-orbiting constellation.
  • the tilted orbit constellation does not have reverse seams and does not pass through the polar regions, so it will not cause regular link disconnections, but it cannot achieve coverage in the polar regions. However, it can achieve multiple coverage on the ground near high latitudes and achieve signal Enhance.
  • Starlink which has begun to be deployed, is a representative of this type of constellation.
  • the time-varying network characteristics of the low-orbit satellite network are mainly reflected in the fact that the orbital speed of the low-orbit satellite network is as high as 7.2 kilometers/second, the network topology changes frequently, the intra-orbit link is relatively stable, the inter-orbit link has dynamic changes, and the reverse seam
  • the satellites on the side are moving at relatively high speed and cannot establish connections.
  • the time-varying network needs to be decomposed and converted into a non-time-varying network.
  • a route generation method is provided.
  • the application of this method to the satellite in Figure 1 is used as an example to illustrate, including the following steps:
  • the low-orbit satellite network is divided into multiple hierarchical networks and domain networks corresponding to the hierarchical networks.
  • Each hierarchical network includes multiple domain networks.
  • Each hierarchical network includes all satellites. Each satellite belong to a domain network at each level of the hierarchical network.
  • normal satellites include four inter-satellite links, which are respectively connected to four satellites in the orbit forward, in the orbit backward, in the inter-orbit forward and in the inter-orbit backward.
  • logarithmic calculations can be performed on the first number of orbits in the low-orbit satellite network and the second number of satellites in each orbit. According to the obtained pair The numerical results identify multiple levels of hierarchical networks.
  • the first number of orbits in the low-orbit satellite network and the second number of satellites in each orbit can be used.
  • the next highest-level hierarchical network is obtained by using the dichotomy method for the maximum value of the number of orbits and the number of satellites in each orbit.
  • the domain network corresponding to the hierarchical network is deduced in turn, so as to obtain the domain network corresponding to the hierarchical network at different levels.
  • the total number of satellites is divided according to different proportions, thereby obtaining domain networks corresponding to different levels of hierarchical networks.
  • the length of the inter-satellite link of each satellite in the domain network corresponding to the lowest level network can be obtained in real time according to the preset time period.
  • the length of the inter-satellite link reaches the preset inter-satellite link length, In this case, the length of the inter-satellite link of each satellite is used as the current weight of each satellite. It is also possible to periodically obtain the length of the inter-satellite link of each satellite in the domain network corresponding to the lowest level network, and use the length of the inter-satellite link of each satellite as the current weight of each satellite.
  • routing information includes satellites, destination satellites, and weights from satellites to destination satellites. If the current weight is smaller than the previous historical weight, the corresponding historical weight needs to be updated to obtain the current routing information of each satellite.
  • the domain network includes satellite A, satellite B, satellite C, and satellite D.
  • the historical routing information of satellite A includes the historical weight 0 from satellite A to destination satellite A, the historical weight 1.2 from satellite A to destination satellite B, the historical weight 1 from satellite A to destination satellite C, and the historical weight 1 from satellite A to destination satellite D.
  • the candidate routing information of satellite A is the candidate weight 0 from satellite A to destination satellite A, and the candidate weight from satellite A to destination satellite B.
  • the candidate weight from satellite A to destination satellite C is 0.8
  • the candidate weight from satellite A to destination satellite D is 1.
  • the same method is used for satellite B, satellite C and satellite D to obtain corresponding candidate routing information.
  • the candidate routing information corresponding to each satellite is used as the current routing information corresponding to each satellite.
  • the weights of satellites whose routing information changes can be synchronized to other satellites to obtain the current routing information of each satellite and complete the convergence of the domain network.
  • the current routing information of each satellite of the domain network will affect the corresponding weight of the upper level network of the lowest level network (that is, the current routing information of each satellite).
  • the routing information satisfies the triggering conditions), as shown in Figure 3. Assume that the preset change threshold is 0.2.
  • the upper-level hierarchical network of the lowest-level hierarchical network is composed of two adjacent domain networks
  • the upper-level hierarchical network can be configured based on the current routing information of each satellite after the two domain networks have converged respectively.
  • the corresponding routing information is updated.
  • the upper level network of the lowest level network is composed of four adjacent domain networks as shown in Figure 3, after the four domain networks have converged respectively, Motif(E) and The convergence of the two domain networks of Motif (S), the convergence of the two domain networks of Motif (E) and Motif (F), the convergence of the two domain networks of Motif (F) and Motif (G), the convergence of Motif (G) and Motif ( S) Convergence of the two domain networks.
  • the current routing information of each satellite does not affect the weight corresponding to the hierarchical network of the lowest level and the hierarchical network of the previous level, there is no need to continue to update the weight of the hierarchical network of the previous level of the lowest level network.
  • the first-level hierarchical network is the highest-level hierarchical network
  • the second-level hierarchical network is the next-level hierarchical network of the highest-level hierarchical network
  • the third-level hierarchical network is the lowest-level hierarchical network. If the current routing information of each satellite in the domain network of the third-level network does not affect the corresponding weight of the second-level network, there is no need to update the weight information of the second-level network.
  • this application obtains the current weight of each satellite in the domain network corresponding to the lowest level network according to the preset time period, and further executes the corresponding technical solutions of S203 and S204 based on the current weight.
  • the current weight of each satellite in the domain network corresponding to the lowest level network is reacquired, and the corresponding technical solutions of S203 and S204 are continued.
  • network hierarchical processing and network domain classification processing are performed on the low orbit satellite network to obtain multiple levels of hierarchical networks and The domain network corresponding to the hierarchical network. And obtain the current weight of each satellite in the domain network corresponding to the lowest level network. If there is a current weight that is smaller than the previous historical weight, update the historical routing information of each satellite in the domain network corresponding to the lowest level network. Get the corresponding current routing information.
  • the routing information corresponding to the upper level network of the lowest level hierarchical network is updated according to the current routing information of each satellite; where, the triggering condition is that the current routing information of the satellite makes the upper level network
  • the change amount of the routing information corresponding to the first-level hierarchical network is greater than or equal to the preset change amount threshold.
  • the domain network of the hierarchical network above the lowest-level hierarchical network will be updated and analyzed layer by layer. All routing information of the entire low-orbit satellite network needs to be updated to ensure rapid convergence of a large-scale low-orbit satellite network even with limited on-board computing resources.
  • FIG. 4 is a schematic flowchart of hierarchical domain division of a low-orbit satellite network in one embodiment. As shown in Figure 4, this embodiment of the present application relates to how to use the low-orbit satellite network according to the first number of orbits and the number of satellites in each orbit. The second number, perform network hierarchical processing and network domain processing on each low-orbit satellite network to obtain a possible implementation of multiple levels of hierarchical networks and domain networks corresponding to the hierarchical networks.
  • the above S201 may include the following step:
  • S401 Determine the first logarithmic result according to the first quantity, and determine the second logarithmic result according to the second quantity.
  • the first logarithmic result can be obtained by using 2 as the base and the first number of orbits as the real number.
  • the first logarithmic result can be obtained by using 10 as the base and the first number of orbits as the real number. Count the results.
  • S402. Determine multiple levels of orbit dimension hierarchical networks based on the first logarithmic result, or determine multiple levels of satellite dimension hierarchical networks based on the second logarithmic result, where the multiple level hierarchical networks are multiple levels of orbit dimension hierarchical networks. or multiple levels of satellite dimensional hierarchical networks.
  • the multi-level orbital dimension hierarchical network can be determined based on the first logarithmic result or the supremum of the first logarithmic result.
  • the first logarithmic result is an integer
  • the first logarithmic result is directly determined based on the first logarithmic result.
  • the first logarithm result is rounded up to determine the multi-level orbit dimension hierarchical network.
  • the inclined orbit constellation since the number of orbits is 16, it can be divided into 4 levels of orbit dimension hierarchical networks.
  • the black thick solid line is the first level (the highest level) orbital dimension hierarchical network
  • the black thick dotted line is the second level (the next highest level) orbital dimension hierarchical network
  • the black thin solid line is the third level (the lowest level above)
  • the thin black dotted line is the fourth level (lowest level) orbital dimension hierarchical network; since the number of satellites in each orbit is 8, there are multiple levels of satellite dimension hierarchical networks.
  • the black thick dotted line is the first level (highest level) satellite dimension hierarchical network
  • the black thin solid line is the second level (next to the highest level) satellite dimension hierarchical network
  • the black thin dotted line is the third level (lowest level) satellite dimension hierarchical network.
  • the black dotted line is the first level (highest level) orbital dimension hierarchical network
  • the black thin solid line is the second level (next level to the highest level) orbital dimension hierarchical network
  • the black thin dotted line is the third level (lowest level) orbital dimension network hierarchical network. Since the number of satellites in each orbit is 11, it can be divided into 4 levels of satellite dimension hierarchical networks.
  • the black thick solid line is the first level (the highest level) satellite dimension hierarchical network
  • the black thick dotted line is the second level (the next highest level) satellite dimension hierarchical network
  • the black thin solid line is the third level (the lowest level above)
  • the black thin dotted line is the fourth level (lowest level) satellite dimension hierarchical network.
  • S403 Determine hierarchical networks at each level and domain networks corresponding to the hierarchical networks at each level based on the ratio between the first number and the second number.
  • the ratio of the first quantity to the second quantity can be compared with 1. If the ratio is greater than 1, the number of orbits of the low-orbit satellite network is divided to obtain a domain network of the highest level network. If the ratio is less than 1, the number of satellites in the low-orbit satellite network is divided to obtain the domain network of the highest level network.
  • S403 determine the hierarchical network at each level and the domain network corresponding to the hierarchical network at each level according to the ratio between the first quantity and the second quantity. This can be achieved in the following three ways:
  • the first method If the absolute value of the difference between the ratio and 1 is less than or equal to the first preset difference, then divide the highest-level hierarchical network into a four-part domain network; according to the obtained four-part domain network The number of orbits and the number of satellites in each orbit determines the domain network corresponding to the next-level hierarchical network of the highest-level hierarchical network until the domain network of the four-point cyclic motif is obtained.
  • the domain network of the four-point cyclic motif is a closed-loop structure composed of four satellites and four inter-satellite links interconnecting each other.
  • satellite (x, y), satellite (x+1 , y), satellite (x, y+1), satellite (x+1, y+1) and the inter-orbital link and intra-orbital link connecting any two satellites constitute a domain network of four-point cyclic pattern.
  • any satellite belongs to four different domain networks of four-point cyclic motifs
  • any inter-satellite link belongs to two different domain networks of four-point cyclic motifs.
  • the domain network identification of the four-point cyclic motif is identified by the last satellite in the movement direction of the domain network of the four-point cyclic motif.
  • the satellites C and D , E and S and their inter-satellite links are identified by satellite E and expressed as Motif(E); among them, the domain network motion direction of the four-point cyclic motif not only refers to the reverse direction of the orbital plane caused by the rotation of the earth The direction of movement, and refers to the direction of movement of the satellite around the orbital plane.
  • the domain network of the four-point cyclic motif has stability, closure, completeness, self-healing and tendency.
  • Stability means that the relative relationship of the four inter-satellite link lengths of the four-point closed-loop model moving between high and low latitudes remains unchanged; according to the calculation formula of the intra-orbit link and the calculation formula of the inter-orbit link, it can be seen that the orbit at high latitudes
  • the length of the inter-orbital link is smaller than the length of the inter-orbital link at low latitudes, and the length of the intra-orbital link remains basically unchanged. Therefore, the domain network structure of the four-point cyclic motif moving between high and low latitudes is in a stable state.
  • Closeness means that the domain network of the four-point loop motif is a closed network. There are two routes between any two satellites. When an inter-satellite link fails, the four-point loop motif can always be connected to the four-point loop motif. A backup route is found within the domain network. Completeness means that all satellites and inter-satellite links in the low-orbit satellite network belong to a certain motif, and the union of satellites and inter-satellite links in all motifs is a complete low-orbit satellite network. As shown in Figure 8, self-healing means that any inter-satellite link failure can be Find the backup route in the module to which the inter-satellite link belongs and replace the faulty inter-satellite link. The trend means that the shorter inter-orbital links in the four-point loop pattern always point in the direction of high latitudes.
  • the first preset difference value may be 0.2, 0.1, etc., and this embodiment of the present application does not limit this.
  • the ratio between the first quantity and the second quantity can be in the range of 0.8 to 1.2.
  • the number of tracks in the highest level network is related to each
  • the number of satellites in orbit is equal.
  • the number of orbits and the number of satellites can be divided into two sub-domains respectively, that is, the highest-level network is divided into a four-sub-domain domain network.
  • the ratio between the number of orbits in the four-domain domain network and the number of satellites in each orbit is further judged, thereby determining the domain network corresponding to the next-level hierarchical network of the highest-level hierarchical network. If the number of orbits in the domain network corresponding to the next-level hierarchical network of the highest-level hierarchical network is almost the same as the number of satellites in each orbit, then the number of orbits and the number of satellites are divided into two sub-domains respectively until a four-point cyclic model is obtained. to the entire domain network.
  • the second method If the absolute value of the difference between the ratio and 2 is less than or equal to the second preset difference, the highest-level hierarchical network is divided into a bipartite domain network; according to the obtained bipartite domain domain network, the orbit number and the number of satellites in each orbit, determine the domain network corresponding to the next-level hierarchical network of the highest-level hierarchical network, until the domain network of the four-point cyclic motif is obtained.
  • the second preset difference value may be 0.2, 0.1, etc., and this embodiment of the present application does not limit this.
  • the ratio between the first quantity and the second quantity may be in the range of 1.7 to 2.3.
  • the number of orbits may be approximately twice the number of satellites in each orbit, or the number of satellites in each orbit may be approximately twice the number of orbits. If the number of orbits is approximately twice the number of satellites in each orbit, the number of orbits can be divided into two sub-domains, and the number of satellites is not divided into sub-domains. As shown in Figure 5 above, the number of orbits is 16, and the number of satellites in each orbit is 8.
  • the high-level hierarchical network can be divided into two sub-domains including 8 orbits and 8 satellites in each orbit.
  • the number of satellites in each orbit is approximately twice the number of orbits, the number of satellites can be divided into two sub-regions, and the number of orbits is not divided into regions. As shown in Figure 6 above, the number of orbits is 6, and the number of satellites in each orbit is 11, the high-level hierarchical network can be divided into two sub-domains including 6 orbits, 7 satellites in each orbit, and 6 orbits, and 6 satellites in each orbit.
  • the first number and the second number are used to divide the highest-level hierarchy into a domain network of two-part domains. According to the number of orbits in the obtained domain network of two-part domains and the number of satellites on each orbit, the two-part domain The domain network is further divided. As shown in Figure 5 above, the first-level hierarchical network is still the highest-level hierarchical network, the second-level hierarchical network is the next-level hierarchical network of the highest-level hierarchical network, and so on.
  • each domain network of the bipartite domain is divided into 4
  • the domain network of sub-domains, that is, the second level (thin black solid line) hierarchical network includes 8 sub-domains.
  • each domain network of 8 sub-domains is divided into a domain network of 4 sub-domains, that is, the third level (black thin solid line) hierarchical network includes 32 sub-domains until the fourth level is obtained (Thin black dotted line)
  • the domain network of the hierarchical network a total of 128 domain networks of four-point cyclic motifs.
  • the third method If the absolute value of the difference between the ratio and 3 is less than or equal to the third preset difference, then divide the highest-level hierarchical network into a three-domain domain network; according to the obtained three-domain domain network The number of orbits and the number of satellites in each orbit determines the domain network corresponding to the next-level hierarchical network of the highest-level hierarchical network until the domain network of the four-point cyclic motif is obtained.
  • the third preset difference value may be 0.2, 0.1, etc., and this embodiment of the present application does not limit this.
  • the first preset threshold, the second preset threshold and the third preset threshold may be the same or different.
  • the ratio of the first quantity to the second quantity can be in the range of 0.8 to 1.2.
  • the number of orbits can be approximately the number of satellites in each orbit. 3 times, or the number of satellites in each orbit is approximately 3 times the number of orbits. If the number of orbits is approximately three times the number of satellites in each orbit, the number of orbits can be divided into three sub-domains, and the number of satellites is not divided into sub-domains. For specific domain division methods, please refer to the second method above.
  • the first-level hierarchical network is still the highest-level hierarchical network
  • the second-level hierarchical network is the next-level hierarchical network of the highest-level hierarchical network, and so on.
  • the first level (thick black dotted line) hierarchical network divides the number of satellites to obtain a two-domain domain network.
  • the second level (black thin solid line) hierarchical network includes 8 domain networks
  • the third level (black thin solid line) hierarchical network includes 21 domain networks.
  • the domain networks in the third-level hierarchical network are already four-point cyclic motif domain networks
  • the domain networks in the third-level hierarchical network that have not yet obtained the four-point cyclic motif are hierarchically divided, and the fourth level (black Thin dotted line) hierarchical network
  • the fourth level hierarchical network has a total of 66 domain networks, and all 66 domain networks are domain networks of four-point cyclic motifs.
  • the ratio is between any two of the above three methods, any one of them will be used. For example, when the ratio is 1.5, either the first method or the second method can be used.
  • multiple levels of orbit dimension hierarchical networks or multiple levels of satellite dimension hierarchical networks are determined based on the first number and the second number, and each level hierarchical network is further determined based on the ratio between the first number and the second number.
  • the domain network corresponding to each level of hierarchical network is hierarchically divided into domains until a four-point cyclic pattern domain network is obtained, which lays an important foundation for the subsequent rapid convergence of the low-orbit satellite network.
  • Figure 9 is a schematic flowchart of determining current routing information in one embodiment. As shown in Figure 9, this embodiment of the present application involves how to update the historical routing information of each satellite in the domain network corresponding to the lowest level hierarchical network to obtain the corresponding current routing information.
  • the above-mentioned S203 of updating the historical routing information of each satellite in the domain network corresponding to the lowest level network to obtain the corresponding current routing information may include the following steps:
  • S901 Update the last historical weight of the corresponding satellite using a current weight that is smaller than the last historical weight.
  • the hierarchical domain identification method uses layer-by-layer (different levels) segmentation for identification.
  • Each segment identifies the domain network of a certain level hierarchical network, and the global network of any domain network.
  • the identification needs to be identified by the identification field of the local network and the field of the higher-level hierarchical network.
  • the identification of the domain network of the first-level hierarchical network is only identified by the identification field of the domain network of the first-level hierarchical network.
  • the identification field of the second-level hierarchical network is used.
  • the identification of the domain network needs to be identified by the identification field of the domain network of the first-level hierarchical network and the second-level hierarchical network, and so on.
  • the domain network of the four-point cyclic motif is the basic unit for hierarchical domain classification.
  • the orbits and satellites can be numbered.
  • the orbit number is first converted into a binary form, and different binary bit combinations of the orbit number and the in-orbit satellite number are selected to identify domain networks and satellites of different levels of hierarchical networks.
  • the constellation contains 16 orbits, each orbit contains 8 satellites.
  • the first level is divided into two sub-domains in terms of the number of orbits, and there is no sub-domain in terms of the number of satellites.
  • the set of domain networks of the first-level hierarchical network can be expressed as ⁇ 00, 10 ⁇ .
  • the set of domain networks of the second-level hierarchical network can be expressed as: ⁇ 0000, 0001, 0010, 0011, 1000, 1001, 1010, 1011 ⁇
  • the set of domain networks of the third-level hierarchical network can be expressed as: ⁇ 000000, 000001, 000010, 000011, 000100, 000101, 000110, 000111, 001000, 001001, 001010, 001011, 001100, 001101, 001110, 001111, 100000, 1000 01, 100010, 100011, 100100, 100101, 100110, 100111, 101000, 101001, 101010, 101011, 101100, 101101, 101110, 101111 ⁇ .
  • the set of domain networks of the fourth level hierarchical network can be expressed as: ⁇ 00000000, 00000001, 00000010
  • the constellation contains 5 orbits and 11 satellites in each orbit.
  • the set of domain networks of the first-level hierarchical network can be expressed as ⁇ 00, 01 ⁇ .
  • the set of domain networks of the second-level hierarchical network can be expressed as: ⁇ 0000, 0001, 0010, 0011, 0100, 0101, 0110, 0111 ⁇
  • the set of domain networks of the third-level hierarchical network can be expressed as: ⁇ 000000, 000001, 000010, 000011, 000100, 000101, 000110, 000111, 001000, 001100, 010000, 010001, 010010, 010011, 010100, 010101, 011000, 0110 10,011100 ⁇
  • the set of domain networks of the fourth level hierarchical network can be expressed as: ⁇ 00000000, 00000001, 00000010, 00000011, ..., 01110000, 01110001, 01110010, 01110011 ⁇ .
  • adjacent satellites establish a connection and exchange satellite identities, and based on the received satellite identities, it is determined whether the connected satellite is a physical neighbor satellite. If it is a physical neighbor satellite, the adjacent satellite establishes a connection and starts communication; otherwise, continues to search for the correct physical neighbor satellite.
  • the adjacent satellites that have communicated calculate the inter-satellite link length between each satellite.
  • the link length is used as the current weight of each satellite.
  • the routing information of satellite S, satellite C, satellite D and satellite E is shown in Table 1-Table 4 below:
  • the first routing information is exchanged between the satellite whose weight has been updated and the satellite whose weight has not been updated, to determine the first optimized weight of the satellite whose weight has been updated and the satellite whose weight has not been updated.
  • the satellites whose weights have been updated are satellite E and satellite S
  • the satellites whose weights have not been updated are satellites C and satellite D.
  • Exchange first routing information Therefore, satellite D and satellite E interact with the first routing information, and satellite C and satellite S interact with the first routing information.
  • the routing tables after adding the first routing information to satellite D and satellite E respectively are as shown in Table 9 and Table 10:
  • S903 Exchange second routing information between satellites whose weights have not been updated to determine the second optimized weights of satellites whose weights have not changed to obtain current routing information.
  • the second routing information is exchanged between satellites whose weights have not been updated. Therefore, the second routing information is exchanged between satellite C (Table 15) and satellite D (Table 16). Satellite C and satellite The results of D adding the second routing information are shown in Table 17 and Table 18 below:
  • the synchronization of routing information of each satellite in the domain network corresponding to the lowest-level hierarchical network (that is, the domain network of the four-point cyclic pattern) is completed. Since the weights of satellite C and satellite D to the destination satellite are on the optimal path, the interaction between satellite D and satellite E, the interaction between satellite E and satellite S, and the interaction between satellite C and satellite D are The routing information of satellites in the domain network corresponding to the lowest level network is not affected.
  • the first routing information is exchanged between the satellite whose weight has been updated and the satellite whose weight has not been updated, so as to Determine the first optimized weight of the satellite whose weight has been updated and the satellite whose weight has not been updated, and interact with the second routing information between the satellites whose weight has not been updated to determine the second optimized weight of the satellite whose weight has not changed, to obtain Current routing information.
  • This method controls the impact of inter-satellite link length changes to the smallest possible range, effectively reduces the impact of inter-satellite link changes on the entire network, and uses the four-point cycle pattern to achieve low self-healing of the domain network. Rapid convergence of orbital satellite networks.
  • Figure 12 is a schematic flowchart of determining the routing information of adjacent domain networks in one embodiment. As shown in Figure 12, this embodiment of the present application relates to how to update the routing information corresponding to the upper level network based on the current routing information of each satellite. As a possible implementation method, the above S204 includes the following steps:
  • the route generation method of two adjacent domain networks is a process in which the common satellites of the adjacent domain networks calculate the affected inter-satellite links and reselect new paths when intra-domain routes change.
  • the public satellite of the domain network calculates the minimum weight between other satellites (the third optimized weight), and sends the calculated minimum weight to the other satellites. If a satellite belongs to a public satellite of multiple hierarchical networks at the same time, it should only be used as a public satellite of the highest hierarchical network. Routing calculations for adjacent domain networks will not be performed between domain networks of lower hierarchical networks.
  • route convergence of higher-level hierarchical networks is triggered.
  • the route convergence process of higher-level hierarchical networks is the same as the convergence process of domain networks.
  • the public satellite routing information in Motif(S) and Motif(E) is split. After both Motif(E) and Motif(S) complete convergence, Motif(S)
  • Table 21-Table 24 The routing information of the satellite is shown in Table 21-Table 24 below:
  • satellite S calculates the weight between satellites in two adjacent domain networks. Since satellite S and satellite C are common satellites, the calculation is not performed.
  • the identification sum 2.1 of satellite E is sent to satellite A, and the identification sum 2.1 of satellite A is sent to satellite E; satellite S calculates satellite B and satellite D.
  • the identification sum of satellite D and 3.7 are sent to satellite B, and the identification sum of satellite B and 3.7 are sent to satellite D; satellite S calculates the third optimization weight between satellite B and satellite E.
  • the identification sum of satellite E and 3.7 are sent to satellite A, and the identification sum of satellite A and 3.7 are sent to satellite E;
  • satellite C calculates satellite B and satellite D.
  • the identification and 1.7 of satellite D are sent to B, and the identification and 1.7 of satellite B are sent to satellite D; satellite C calculates the third optimization weight between satellite B and satellite E.
  • the third optimization weight sent by the public satellite and the identification of the destination satellite of other satellites they check whether the satellite exists in the routing information of other satellites based on the identification of the destination satellite. For the corresponding destination satellite, if the destination satellite does not exist, the identifier of the destination satellite and the third optimization weight are added to the routing information.
  • satellite A, satellite B, satellite D and satellite E receive the third optimization weight and the identification of the destination satellite from satellite S, because satellite A and satellite B have not reached the destination, satellite D and satellite E
  • the routes of destination satellite E, satellite D and satellite E also do not have routes to destination satellite A and destination satellite B, so new routing information is added to the four satellites respectively.
  • the destination satellite is the received satellite identification
  • the next hop is the next hop to the public satellite
  • the weight is the received third optimized weight
  • the new routing information of satellite A, satellite B, satellite D and satellite E The updates are as shown in Table 29-Table 32 below:
  • the third optimization weight is used to replace the weight corresponding to the identification of the destination satellite.
  • the received third optimization weight needs to be The weight is compared with the weight corresponding to the identification of the destination satellite that already exists in the satellite, and the smallest weight between the two is selected as the weight between other satellites and the destination satellite.
  • the adjustment of the routing information of Satellite A, Satellite B, Satellite D and Satellite E is divided into two steps: adding routing information and merging routing information.
  • the new routing information of Satellite A, Satellite B, Satellite D and Satellite E are as shown in Table 33-Table 36 Shown:
  • the routing information after merging satellite A, satellite B, satellite D and satellite E is shown in Table 37-Table 40 below:
  • the third optimization weight of satellites other than the public satellite in the two domain networks is determined based on the first optimization weight and/or the second optimization weight of the public satellite between two adjacent domain networks, and Send the third optimized weight and the identification of the destination satellite of other satellites to other satellites, and further determine whether the identification of the destination satellite exists in the routing information of other satellites, thereby selecting the optimal weight to achieve convergence of the adjacent domain network.
  • This method changes the routing information of the upper level network after both adjacent domain networks have completed convergence, and expands it layer by layer and domain by domain, reducing the impact of inter-satellite links on the entire low-orbit satellite network, and only Involving some low-orbit satellites, the calculation speed is fast and it can respond quickly to changes in the low-orbit satellite network.
  • Figure 14 is a schematic flowchart of determining the current weight of a satellite in one embodiment. As shown in Figure 14, this embodiment of the present application relates to how to determine the current weight of a satellite based on the inter-satellite link length. Possible implementation methods include the following steps:
  • S1401 Obtain the inter-satellite link length between satellites in the domain network corresponding to the lowest level network according to the preset time length.
  • DPQ represents the link length between satellite P and satellite Q; R represents the distance from the center of the earth to the satellite; C represents the cosine of the geocentric angle POQ, O is the center of the earth; LatP represents the latitude of satellite P; LatQ represents the latitude of satellite Q; ⁇ represents the orbital inclination; u0 represents the initial phase angle of the satellite; ⁇ f represents the phase difference between satellites in the orbit; ⁇ represents the relative longitude difference between satellites P and Q; ⁇ represents the longitude of satellite P and satellite Q Absolute difference; ⁇ (u0) represents the longitude difference corresponding to the satellite phase angle.
  • p represents the phase offset of adjacent satellites in adjacent orbits
  • F represents the phase factor
  • Re represents the phase difference between adjacent orbital planes.
  • inter-satellite link length is greater than or equal to the preset change threshold, use the inter-satellite link length as the current weight of the corresponding satellite.
  • the preset change thresholds are 0.2, 0.1, 0, etc., which are not limited in this embodiment. Assume that the last historical in-orbit link length of satellite A and satellite D is 1, and the preset change threshold is 0.2. According to the above calculation formula, the current in-orbit link length is 1.2, then the in-orbit link length is 1.2 As the current weight of satellite A and satellite D at the current time. If the current in-orbit link length 1.1 is obtained according to the above calculation formula, then the last historical in-orbit link length 1 is used as the current current weight of satellite A and satellite D.
  • the inter-satellite link length is As the current weight of the corresponding satellite. Since the inter-satellite link does not change very much during the movement of the satellite, this method obtains the current weight of the satellite when the length of the inter-satellite link meets a certain condition, avoiding the network overhead caused by obtaining the weight of each satellite and updating routing information. Bandwidth resource consumption problem.
  • the method of the present application can be applied to update routing information of a low-orbit satellite network during its movement.
  • the routing update mechanism refers to the change in inter-satellite link length caused by the movement of satellites. Routing information needs to be updated regularly, level by level and domain by domain, so that the optimal path between any two points is maintained.
  • the timing of inter-satellite link length calculation is determined by the speed at which the length of the satellite link changes, and satellite time synchronization is not required.
  • the fault recovery mechanism means that when the inter-satellite link fails, the routing information of the domain network of the four-point loop module is changed, and it is expanded level by level and domain by domain, and finally achieves the convergence of the entire network routing.
  • This mechanism can Control the impact of inter-satellite link failures to the smallest possible range, and achieve rapid convergence of network-wide routing by utilizing the self-healing properties of the domain network using the four-point loop pattern.
  • the satellite sets the weight of the failed inter-satellite link to infinity, indicating that the inter-satellite link is unreachable, triggers the domain network of the four-point loop pattern to change the weight, and then changes the weight according to
  • the route generation method of the domain network corresponding to the lowest level hierarchical network completes the convergence of the domain network. If the routing information of the domain network corresponding to the lowest level hierarchical network does not affect the routing information of the domain network of the hierarchical network one level above the lowest level, stop updating the routing information of the domain network routing information of the hierarchical network one level above the lowest level.
  • the hierarchical network above the lowest level is triggered according to the route production method between two adjacent domain networks.
  • the routing information of the domain network is updated.
  • embodiments of the present application also provide a route generation device for implementing the above-mentioned route generation method.
  • the solution to the problem provided by this device is similar to the solution recorded in the above method. Therefore, for the specific limitations in one or more embodiments of the route generation device provided below, please refer to the limitations on the route generation method above. I won’t go into details here.
  • a route generation device including: a determination module 11, an acquisition module 12, a first update module 13 and a second update module 14, wherein:
  • the determination module 11 is configured to perform network hierarchical processing and network domain classification processing on the low-orbit satellite network based on the first number of orbits in the low-orbit satellite network and the second number of satellites in each orbit, so as to obtain multiple levels of hierarchical networks and The domain network corresponding to the hierarchical network;
  • the acquisition module 12 is configured to acquire the current weight of each satellite in the domain network corresponding to the lowest level hierarchical network according to a preset time period;
  • the first update module 13 is configured to update the historical routing information of each satellite in the domain network corresponding to the lowest level hierarchical network to obtain the corresponding current routing information if there is a current weight that is smaller than the last historical weight, where the historical routing information Includes the last historical weight;
  • the second update module 14 is configured to update the routing information corresponding to the upper level network of the lowest level hierarchical network according to the current routing information of each satellite if the current routing information of each satellite satisfies the triggering condition; wherein, the triggering condition is the
  • the current routing information causes the change amount of the routing information corresponding to the previous level network to be greater than or equal to the preset change threshold value.
  • the determination module includes:
  • a first determination unit configured to determine a first logarithmic result based on the first quantity, and to determine a second logarithmic result based on the second quantity;
  • the second determination unit is configured to determine multiple levels of orbital dimension hierarchical networks based on the first logarithmic result, or multiple levels of satellite dimension hierarchical networks determined based on the second logarithmic result, wherein the multiple level hierarchical networks are multiple A level orbital dimension hierarchical network or a multiple level satellite dimension hierarchical network;
  • the third determination unit is configured to determine hierarchical networks at each level and domain networks corresponding to the hierarchical networks at each level based on the ratio of the first quantity and the second quantity.
  • the third determination unit is further configured to divide the highest-level hierarchical network into four-domain domain networks when the absolute value of the difference between the ratio and 1 is less than or equal to the first preset difference. ; Based on the number of orbits in the obtained four-domain domain network and the number of satellites in each orbit, determine the domain network corresponding to the next level network of the highest level hierarchical network until the domain network of the four-point cyclic motif is obtained.
  • the third determination unit is further configured to divide the highest-level hierarchical network into a domain network of bipartite domains when the absolute value of the difference between the ratio and 2 is less than or equal to the second preset difference; According to the number of orbits in the obtained bipartite domain network and the number of satellites in each orbit, the domain network corresponding to the next level network of the highest level hierarchical network is determined until the domain network of the four-point cyclic motif is obtained.
  • the third determination unit is further configured to divide the highest-level hierarchical network into a three-domain domain network when the absolute value of the difference between the ratio and 3 is less than or equal to the third preset difference. ; Based on the number of orbits and the number of satellites in each orbit in the obtained three-domain domain network, determine the domain network corresponding to the next level network of the highest level hierarchical network until the domain network of the four-point cyclic motif is obtained.
  • the first update module includes:
  • the first update unit is configured to update the last historical weight of the corresponding satellite using a current weight that is smaller than the last historical weight
  • the fourth determination unit is configured to exchange first routing information between satellites whose weights have been updated and satellites whose weights have not been updated to determine the satellites whose weights have been updated.
  • the fifth determination unit is configured to exchange second routing information between satellites whose weights have not been updated to determine the second optimized weight of satellites whose weights have not changed to obtain current routing information.
  • the second update module includes:
  • the sixth determination unit is configured to determine the third optimization weight corresponding to other satellites in the two domain networks except the public satellite based on the first optimization weight and/or the second optimization weight of the common satellite between the two adjacent domain networks. , and sends the third optimization weight and the identification of the destination satellite of the other satellite to other satellites, where the current routing information includes the first optimization weight and/or the second optimization weight of the public satellite.
  • the second update module further includes:
  • the second update unit is configured to update the third optimization weight to the routing information of other satellites when the identification of the destination satellite does not exist in the routing information of other satellites.
  • the second update module further includes:
  • the replacement unit is configured to use the third optimization weight to replace the identity of the destination satellite when the identity of the destination satellite exists in the routing information of other satellites and the third optimization weight is smaller than the weight corresponding to the identity of the destination satellite that exists in the routing information. corresponding weight.
  • the acquisition module includes:
  • the acquisition unit is configured to acquire the link length between satellites in the domain network corresponding to the lowest level network according to the preset time period;
  • the seventh element of determination is set to use the link length as the current weight of the corresponding satellite when the change in the link length is greater than or equal to the preset change threshold.
  • Each module in the above-mentioned route generation device can be implemented in whole or in part by software, hardware and combinations thereof.
  • Each of the above modules may be embedded in or independent of the processor of the computer device in the form of hardware, or may be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.
  • a computer-readable storage medium is provided, on which a computer program is stored.
  • the steps of the route generation method provided in the above embodiment are implemented.
  • a computer program product including a computer program that, when executed by a processor, implements the steps of the route generation method provided in the above embodiment.
  • the user information including but not limited to user equipment information, user personal information, etc.
  • data including but not limited to data used for analysis, stored data, displayed data, etc.
  • the computer program can be stored in a non-volatile computer-readable storage.
  • the computer program when executed, may include the processes of the above method embodiments.
  • Any reference to memory, database or other media used in the embodiments provided in this application may include at least one of non-volatile and volatile memory.
  • Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive memory (ReRAM), magnetic variable memory (Magnetoresistive Random Access Memory (MRAM), ferroelectric memory (Ferroelectric Random Access Memory, FRAM), phase change memory (Phase Change Memory, PCM), graphene memory, etc.
  • Volatile memory may include random access memory (Random Access Memory, RAM) or external cache memory, etc.
  • RAM Random Access Memory
  • RAM random access memory
  • RAM Random Access Memory
  • the databases involved in the various embodiments provided in this application may include at least one of a relational database and a non-relational database.
  • Non-relational databases may include blockchain-based distributed databases, etc., but are not limited thereto.
  • the processors involved in the various embodiments provided in this application may be general-purpose processors, central processing units, graphics processors, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, etc., and are not limited to this.

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

La présente invention concerne un procédé et un appareil de génération d'itinéraire et un support de stockage. Selon un premier nombre d'orbites dans un réseau de satellites à orbite basse et un deuxième nombre de satellites sur les orbites, une hiérarchie de réseau et des divisions de domaine sont effectuées sur le réseau de satellites à orbite basse pour obtenir des niveaux multiples de réseaux hiérarchiques et de réseaux de domaine correspondant à ces niveaux de réseaux hiérarchiques. Des poids actuels de satellites dans le réseau de domaine correspondant au niveau le plus bas du réseau hiérarchique sont acquis, et si un poids actuel inférieur au poids historique précédent existe, des informations d'itinéraire historiques des satellites sont mises à jour pour obtenir des informations d'itinéraire actuel correspondantes. En outre, si les informations d'itinéraire actuelles des satellites amènent le changement des informations d'itinéraire correspondant au niveau précédent du réseau hiérarchique à être supérieur ou égal à un seuil de changement prédéfini, les informations d'itinéraire correspondant au niveau précédent du réseau hiérarchique sont mises à jour selon les informations d'itinéraire actuelles. Selon la présente invention, le réseau de satellites à orbite basse est analysé couche par couche, de sorte qu'une convergence rapide d'un réseau de satellites à orbite basse à grande échelle peut être réalisée même dans le cas de ressources informatiques transportées par satellite limitées.
PCT/CN2023/108080 2022-07-27 2023-07-19 Procédé et appareil de génération d'itinéraire, et support d'enregistrement WO2024022185A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210888341.1A CN114978979B (zh) 2022-07-27 2022-07-27 路由生成方法、装置、存储介质
CN202210888341.1 2022-07-27

Publications (1)

Publication Number Publication Date
WO2024022185A1 true WO2024022185A1 (fr) 2024-02-01

Family

ID=82969073

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/108080 WO2024022185A1 (fr) 2022-07-27 2023-07-19 Procédé et appareil de génération d'itinéraire, et support d'enregistrement

Country Status (2)

Country Link
CN (1) CN114978979B (fr)
WO (1) WO2024022185A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114978979B (zh) * 2022-07-27 2022-10-14 网络通信与安全紫金山实验室 路由生成方法、装置、存储介质

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104601363A (zh) * 2014-12-03 2015-05-06 上海交通大学 一种分轨分域的双层卫星网络系统及管理方法
CN104683016A (zh) * 2015-03-15 2015-06-03 西安电子科技大学 基于最小化时延的多层卫星网络最优业务分布路由方法
CN112019260A (zh) * 2020-09-14 2020-12-01 西安交通大学 一种低轨异构卫星网络路由方法及系统
CN112468206A (zh) * 2020-10-20 2021-03-09 清华大学 基于分区的星座卫星网络分布式路由方法及装置
CN114095067A (zh) * 2021-06-17 2022-02-25 北京邮电大学 一种多层卫星网络动态路由方法及系统
US20220209853A1 (en) * 2020-12-31 2022-06-30 Hughes Network Systems, Llc Dynamic inroute reconfiguration of satellite network communication systems
CN114978979A (zh) * 2022-07-27 2022-08-30 网络通信与安全紫金山实验室 路由生成方法、装置、存储介质

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102413535B (zh) * 2011-12-28 2014-04-16 南京邮电大学 一种多层次卫星通信系统的星际链路间认知路由方法
CN111490817B (zh) * 2020-04-08 2021-04-02 北京邮电大学 卫星网络传输方法、装置及电子设备
CN113572686B (zh) * 2021-07-19 2022-09-02 大连大学 一种基于SDN的天地一体化自适应动态QoS路由方法
CN113783600B (zh) * 2021-08-31 2023-06-02 西南电子技术研究所（中国电子科技集团公司第十研究所） 巨型低轨互联网星座路由方法

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104601363A (zh) * 2014-12-03 2015-05-06 上海交通大学 一种分轨分域的双层卫星网络系统及管理方法
CN104683016A (zh) * 2015-03-15 2015-06-03 西安电子科技大学 基于最小化时延的多层卫星网络最优业务分布路由方法
CN112019260A (zh) * 2020-09-14 2020-12-01 西安交通大学 一种低轨异构卫星网络路由方法及系统
CN112468206A (zh) * 2020-10-20 2021-03-09 清华大学 基于分区的星座卫星网络分布式路由方法及装置
US20220209853A1 (en) * 2020-12-31 2022-06-30 Hughes Network Systems, Llc Dynamic inroute reconfiguration of satellite network communication systems
CN114095067A (zh) * 2021-06-17 2022-02-25 北京邮电大学 一种多层卫星网络动态路由方法及系统
CN114978979A (zh) * 2022-07-27 2022-08-30 网络通信与安全紫金山实验室 路由生成方法、装置、存储介质

Also Published As

Publication number Publication date
CN114978979B (zh) 2022-10-14
CN114978979A (zh) 2022-08-30

Similar Documents

Publication Publication Date Title
Shi et al. Concurrent entanglement routing for quantum networks: Model and designs
WO2024022185A1 (fr) Procédé et appareil de génération d'itinéraire, et support d'enregistrement
CN108370255A (zh) 极性码连续消去列表解码器中的存储器管理和路径排序
US20220030031A1 (en) 3s-chain: smart, secure, and software-defined networking (sdn)-powered blockchain-powered networking and monitoring system
CN104202211A (zh) 主动和被动测量结合的自治系统级网络拓扑识别方法
WO2023065598A1 (fr) Procédé et appareil de mise en réseau coopérative satellite-sol
Voitalov et al. Geohyperbolic routing and addressing schemes
Lee et al. Hyper-star graph: A new interconnection network improving the network cost of the hypercube
Bistouni et al. Reliability analysis of Ethernet ring mesh networks
Liu et al. Quantum networks with multiple service providers: Transport layer protocols and research opportunities
CN107438026A (zh) 域间路由系统的失效恢复方法和装置
Jahanshahi et al. Reliable networking in Ethernet ring mesh networks using regular topologies
Avresky Embedding and reconfiguration of spanning trees in faulty hypercubes
Toda et al. Autonomous and distributed construction of locality aware skip graph
Zhou et al. Virtual network mapping for multi-domain data plane in software-defined networks
Gu et al. Recovery Routing Based on Q‐Learning for Satellite Network Faults
Senturk et al. A novel shortest path routing algorithm for wireless data collection in transportation networks
Toyonaga et al. Brain-inspired method for constructing a robust virtual wireless sensor network
Abrishamchi et al. A novel minimum set cover routing plane construction approach for random wireless IP access networks
Kulakov et al. Modified Method of Traffic Engineering in DCN with a Ramified Topology
Makikawa et al. Balance and proximity-aware Skip Graph construction
Dolev et al. Self-stabilizing and self-organizing virtual infrastructures for mobile networks
Liu et al. Performance evaluation of fault tolerant routing algorithm in data center networks
Mohanty Optimal Routing Algorithm in a Octagon-Cell Network.
Zhang et al. Scalable decentralized routing for Blockchain payment networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23845396

Country of ref document: EP

Kind code of ref document: A1