Routing method and related device

Abstract

This application provides a routing method and related equipment. The method includes: constructing a satellite link topology based on the spatial geometric attributes of an Earth orbit constellation acquired within an operational cycle; determining the satellites visible to a destination node within a frame based on the acquired service information of the source node and the topology; determining routing information based on the visibility of the source node to the destination node; and transmitting services based on the routing information. Embodiments of this application rationally plan the topology through inter-satellite spatial geometric relationships, establishing a dynamically changing topology matrix. Based on this dynamically changing topology matrix and relying on a routing mechanism that runs through the dynamic topology in the time domain, stable data transmission between nodes under a highly dynamic topology structure is achieved.

Description

Technical Field

[0001] This application relates to the field of routing technology, and in particular to a routing method and related equipment. Background Technology

[0002] With the rapid development of space laser communication technology, establishing laser links between satellites and between satellites and the ground, and building satellite optical networks based on laser communication technology to form a high-speed satellite internet, is the future trend of space information networks. Space laser communication, due to its advantages such as high transmission rate, large available bandwidth, high security, and strong resistance to electromagnetic interference, can be effectively used as a communication method between space nodes. Furthermore, in recent years, with the increasing demand from global users for high-speed transmission and seamless connectivity of communication services, traditional terrestrial networks, limited by the Earth's terrain, can no longer meet user needs.

[0003] Currently, in the laser link topology control routing layer for space-ground converged communication, there are still shortcomings such as separation of space dynamic networking and service routing, slow output of routing information, delayed communication response, high resource consumption, poor communication stability, and increased communication latency. Summary of the Invention

[0004] In view of this, the purpose of this application is to propose a routing method and related equipment.

[0005] For the purposes described above, this application provides a routing method, including:

[0006] Based on the spatial geometric properties of the Earth orbit constellation acquired during one operating cycle, the topology of the satellite links is constructed.

[0007] Based on the acquired source node's service information and the topology, determine the satellites within the domain visible to the destination node within a frame;

[0008] Based on the visibility of the source node to the destination node, routing information is determined, and services are transmitted based on the routing information.

[0009] In one possible implementation, constructing the satellite link topology based on the spatial geometric properties of the Earth orbit constellation acquired within an operational cycle includes:

[0010] Obtain the spatial geometric properties of the Earth orbit constellation during one operating cycle;

[0011] Obtain the visibility relationship between all satellites and the target node;

[0012] Based on the aforementioned spatial geometric properties and the aforementioned visibility relationships, establish inter-satellite visibility matrices and satellite-to-ground visibility matrices;

[0013] The permanent and intermittent links between satellites are determined based on the inter-satellite visibility matrix.

[0014] Based on the permanent links and the intermittent links, the satellite link topology is constructed in a dynamic network structure using a virtual topology method.

[0015] In one possible implementation, constructing the satellite link topology in a dynamic network structure using a virtual topology method based on the permanent link and the intermittent link includes:

[0016] Based on the permanent links and the intermittent links, a first link topology matrix is ​​constructed;

[0017] The positions of matrix elements between invisible satellites are set to zero according to the inter-satellite visibility matrix;

[0018] The terminal idle rate of all time slots in a frame of the first link topology matrix is ​​counted, and a link is established in the time slot with the highest terminal idle rate that meets the first link establishment criterion, thus constructing a second link topology matrix;

[0019] Based on the second link topology matrix, the satellite link topology is constructed in a dynamic network structure using the virtual topology method.

[0020] In one possible implementation, determining the intra-domain satellites visible to the destination node within a frame based on the acquired source node's service information and the topology includes:

[0021] Obtain the service information of the source node; the service information includes the service generation time;

[0022] Based on the service generation time and the satellite-to-ground visibility matrix, determine the satellites within the domain visible to the target node within a frame.

[0023] In one possible implementation, determining the routing information based on the visibility of the source node to the destination node includes:

[0024] Determine whether the source node is visible to the destination node;

[0025] In response to the source node being visible to the destination node, and the source node being an intra-domain satellite of the destination node, it is determined that the source node directly transmits the routing information to the destination node.

[0026] In response to the fact that the source node is not visible to the destination node and the source node is not a satellite within the domain of the destination node, the transmission time slot of the service corresponding to the source node is determined; the service route is searched based on the transmission time slot to determine the routing information.

[0027] In one possible implementation, the step of searching for service routes based on the transmission time slot to determine the routing information includes:

[0028] After the transmission time slot, traverse all first paths that can complete the transmission within one frame;

[0029] The path with the least time slot cost and the fewest hops in the first path is taken as the second path, and the second path is taken as the routing information.

[0030] In response to the failure to find the second path, a new first path is determined in the next frame, and a new second path is determined based on the new first path, and the new second path is used as the routing information.

[0031] In one possible implementation, the method further includes:

[0032] In response to multiple service transmissions occurring at the same source node in the same time slot, and the services being unable to be transmitted simultaneously in the same time slot, the high-priority services are transmitted according to the determined routing information. For low-priority services, the routing information is re-determined in the next time slot following the transmission time slot of the high-priority service.

[0033] Based on the same inventive concept, embodiments of this application also provide a routing device, including:

[0034] The building module is configured to construct the topology of satellite links based on the spatial geometry of the Earth orbit constellation acquired within a runtime period;

[0035] The determination module is configured to determine the satellites within the domain visible to the destination node within a frame based on the acquired service information of the source node and the topology.

[0036] The transmission module is configured to determine routing information based on the visibility of the source node to the destination node, and to transmit services based on the routing information.

[0037] Based on the same inventive concept, embodiments of this application also provide an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the routing method as described in any of the above.

[0038] Based on the same inventive concept, embodiments of this application also provide a non-transitory computer-readable storage medium storing computer instructions for causing the computer to execute any of the routing methods described above.

[0039] As can be seen from the above, the routing method and related equipment provided in this application construct the topology of the satellite link based on the spatial geometric attributes of the Earth orbit constellation within an operational cycle; based on the obtained service information of the source node and the topology, the satellites visible to the destination node within a frame are determined; based on the visibility of the source node to the destination node, routing information is determined, and services are transmitted based on the routing information. This application's embodiments analyze commonly used inter-satellite routing algorithms and integrate the satellite-to-ground communication system with the inter-satellite communication system, effectively improving data transmission efficiency. Furthermore, considering the high dynamism of satellites, a virtual topology approach is adopted, rationally planning the topology structure through inter-satellite spatial geometric relationships to establish a dynamically changing topology. The routing algorithm based on topology control effectively improves the data transmission stability of dynamic satellite optical networks. Efficient dynamic networking is achieved through analysis and statistics of inter-satellite spatial geometric attributes, and a routing algorithm based on the dual criteria of shortest traversal time slots and fewest hops is designed. This comprehensively considers the low latency requirements and low bit error rate requirements of data transmission, providing a reasonable path allocation scheme to help improve optical network performance. To address the issue of simultaneous multi-service transmission from the same source, a service queuing mechanism and a rerouting mechanism are proposed. These mechanisms can prevent massive traffic congestion caused by future surges in communication services and reduce end-to-end latency. The routing method proposed in this application is applicable to integrated air-ground network systems under various architectures, thus exhibiting high robustness. Attached Figure Description

[0040] To more clearly illustrate the technical solutions in this application or related technologies, the drawings used in the description of the embodiments or related technologies will be briefly introduced below. Obviously, the drawings described below are only embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0041] Figure 1 This is a schematic diagram of the routing method according to an embodiment of this application;

[0042] Figure 2 This is a schematic diagram of the intra-satellite laser link topology matrix according to an embodiment of this application;

[0043] Figure 3 This is a schematic diagram illustrating the detailed routing method of an embodiment of this application;

[0044] Figure 4 This is a schematic diagram of the optical network layer structure in a space communication node according to an embodiment of this application;

[0045] Figure 5 This is a schematic diagram of the routing device structure according to an embodiment of this application;

[0046] Figure 6This is a schematic diagram of the electronic device structure according to an embodiment of this application. Detailed Implementation

[0047] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with specific embodiments and the accompanying drawings.

[0048] It should be noted that, unless otherwise defined, the technical or scientific terms used in the embodiments of this application should have the ordinary meaning understood by one of ordinary skill in the art to which this application pertains. The terms "first," "second," and similar terms used in the embodiments of this application do not indicate any order, quantity, or importance, but are merely used to distinguish different components. Terms such as "comprising" or "including" mean that the element or object preceding the word encompasses the elements or objects listed after the word and their equivalents, without excluding other elements or objects. Terms such as "connected" or "linked" are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect. Terms such as "upper," "lower," "left," and "right" are only used to indicate relative positional relationships; when the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0049] It is understood that before using the technical solutions of the various embodiments in this disclosure, users will be informed of the type, scope of use, and usage scenarios of the personal information involved in an appropriate manner, and user authorization will be obtained.

[0050] For example, upon receiving a user's active request, a prompt message is sent to the user to explicitly inform them that the requested operation will require the acquisition and use of the user's personal information. This allows the user to independently choose, based on the prompt message, whether to provide personal information to the software or hardware such as electronic devices, applications, servers, or storage media performing the operations of this disclosed technical solution.

[0051] As an optional but not limited implementation, in response to a user's active request, sending a prompt message to the user can be done via a pop-up window, where the prompt message can be presented in text format. Furthermore, the pop-up window can also include a selection control allowing the user to choose "agree" or "disagree" to provide personal information to the electronic device.

[0052] It is understood that the above notification and user authorization process are merely illustrative and do not constitute a limitation on the implementation of this disclosure. Other methods that comply with relevant laws and regulations may also be applied to the implementation of this disclosure.

[0053] As described in the background section, with the rapid development of space laser communication technology, establishing laser links between satellites and between satellites and the ground, and building satellite optical networks based on laser communication technology to form a high-speed satellite internet, is the future trend of space information networks. Space laser communication, due to its advantages such as high transmission rate, large available bandwidth, high security, and strong resistance to electromagnetic interference, can be effectively used as a communication method between space nodes. Furthermore, in recent years, with the increasing demand from global users for high-speed transmission and seamless connectivity of communication services, traditional terrestrial networks, limited by the Earth's terrain, can no longer meet user needs.

[0054] Currently, in the laser link topology control routing layer for space-ground converged communication, there are still shortcomings such as separation of space dynamic networking and service routing, slow output of routing information, delayed communication response, high resource consumption, poor communication stability, and increased communication latency.

[0055] In summary, this application proposes a routing method that constructs a satellite link topology based on the spatial geometric attributes of the Earth orbit constellation acquired within an operational cycle. Based on the acquired service information of the source node and the topology, it determines the satellites visible to the destination node within a frame. Based on the visibility of the source node to the destination node, it determines routing information and transmits services based on this routing information. This application analyzes commonly used inter-satellite routing algorithms and integrates satellite-to-ground communication systems with inter-satellite communication systems, effectively improving data transmission efficiency. Furthermore, considering the high dynamism of satellites, a virtual topology approach is adopted, rationally planning the topology structure through inter-satellite spatial geometric relationships to establish a dynamically changing topology. The routing algorithm based on topology control effectively improves the data transmission stability of dynamic satellite optical networks. Efficient dynamic networking is achieved through analysis and statistics of inter-satellite spatial geometric attributes. A routing algorithm based on the dual criteria of shortest traversal time slots and fewest hops is designed, comprehensively considering low latency and low bit error rate requirements for data transmission, providing a reasonable path allocation scheme to enhance optical network performance. To address the issue of simultaneous multi-service transmission from the same source, a service queuing mechanism and a rerouting mechanism are proposed. These mechanisms can prevent massive traffic congestion caused by future surges in communication services and reduce end-to-end latency. The routing method proposed in this application is applicable to integrated air-ground network systems under various architectures, thus exhibiting high robustness.

[0056] The technical solutions of the embodiments of this application will be described in detail below through specific examples.

[0057] refer to Figure 1 The routing method of this application embodiment includes the following steps:

[0058] Step S101: Based on the spatial geometric properties of the Earth orbit constellation obtained within one operating cycle, construct the topology of the satellite link;

[0059] Step S102: Based on the obtained service information of the source node and the topology, determine the satellites within the domain that the destination node can see within a frame;

[0060] Step S103: Based on the visibility of the source node to the destination node, determine the routing information, and transmit the service based on the routing information.

[0061] refer to Figure 3 This is a schematic diagram illustrating the detailed routing method of an embodiment of this application.

[0062] refer to Figure 4 This is a schematic diagram of the optical network layer structure in a space communication node according to an embodiment of this application. The following is in conjunction with... Figure 1 , Figure 3 and Figure 4 The detailed steps of the embodiments of this application will be described below.

[0063] Regarding step S101, in some embodiments, constructing the satellite link topology based on the spatial geometric attributes of the Earth orbit constellation within an acquired operating cycle includes: acquiring the spatial geometric attributes of the Earth orbit constellation within an operating cycle; acquiring the visibility relationships between all satellites and the target node; establishing an inter-satellite visibility matrix and a satellite-to-ground visibility matrix based on the spatial geometric attributes and the visibility relationships; determining permanent and intermittent links between satellites based on the inter-satellite visibility matrix; and constructing the satellite link topology in a dynamic network structure using a virtual topology method based on the permanent and intermittent links.

[0064] In some embodiments, the step of constructing the satellite link topology in a dynamic network structure using a virtual topology method based on the permanent link and the intermittent link includes: constructing a first link topology matrix based on the permanent link and the intermittent link; setting the matrix element positions between invisible satellites to zero according to the inter-satellite visibility matrix; calculating the terminal idle rate of all time slots in a frame of the first link topology matrix, establishing a link in the time slot with the highest terminal idle rate that meets the first link establishment criterion, and constructing a second link topology matrix; and constructing the satellite link topology in a dynamic network structure using a virtual topology method based on the second link topology matrix.

[0065] In this embodiment, within the satellite optical network, ground station nodes utilize the symmetry characteristics of the Walker constellation to obtain spatial geometric attributes such as inter-satellite laser links, inter-satellite elevation angles, inter-satellite visible time periods, and inter-satellite visible durations for the Medium Earth Orbit (MEO) satellite constellation within an operational cycle, thereby acquiring the satellite-to-ground visibility relationship between all satellites and the ground station. An inter-satellite visibility matrix S and a satellite-to-ground visibility matrix T are then established.

[0066]

[0067] Where S represents the inter-satellite visibility matrix, and the element c ij When = 1, it indicates that satellite i and satellite j are continuously visible within this frame; element c ij When = 0, it means that satellite i and satellite j are not continuously visible within this frame;

[0068]

[0069] Where T m The matrix representing the visibility of stars and ground, with element d ij When = 1, it indicates that satellite i and ground station j are continuously visible within this frame; element d ij When = 0, it means that satellite i and ground station j are not continuously visible within this frame;

[0070] The satellite status within a time slot of a frame is considered stationary. The number of time slots in a frame depends on the number of inter-satellite visibilitys in the satellite optical network. The number of permanently visible and intermittently visible inter-satellite satellites is determined based on the statistics of inter-satellite visible time periods and inter-satellite visible durations, and then the permanent links and intermittent links are planned.

[0071] Within a frame, the establishment of permanent inter-satellite links is prioritized in time slots based on the short overlap of satellite pairs' visual time at ground stations, long inter-satellite laser link distances, and large elevation angles. The elevation angle calculation formula is as follows:

[0072]

[0073] Where ΔΩ represents satellite node S i and satellite node S j Longitude difference of the ascending node of the orbital plane; β i represents the initial phase of satellite i at the initial time; x represents the phase of satellite node at time t from its initial position.

[0074] The formula for calculating the distance of inter-satellite laser links is as follows:

[0075]

[0076] Where r represents the Earth's radius. Indicates the pitch angle between stars.

[0077] Within a frame, after the establishment and arrangement of permanent links, since the satellite pairs connected by intermittent links are not always in sight, intermittent links are preferentially arranged in the time slots within the frame based on the criteria of long inter-satellite visibility time, long inter-satellite laser link distance and large elevation angle.

[0078] Based on the establishment of permanent and intermittent links, a primary intra-frame satellite-to-satellite laser link topology matrix is ​​formed, and the matrix elements between invisible satellites are set to zero according to the inter-satellite visibility matrix.

[0079] The terminal idle rate of all time slots in a frame of the topology matrix is ​​statistically analyzed. Geostationary Orbit (GEO) satellites are prioritized for link establishment in time slots with higher terminal idle rates, based on the criteria of larger inter-satellite laser link distances and elevation angles. An intra-frame inter-satellite laser link topology matrix is ​​established, and the topology is built in a dynamic network structure using a virtual topology method.

[0080] Regarding step S102, in some embodiments, determining the intra-domain satellites visible to the destination node within a frame based on the acquired service information of the source node and the topology includes: acquiring the service information of the source node; the service information includes the service generation time; and determining the intra-domain satellites visible to the destination node within a frame based on the service generation time and the satellite-to-ground visibility matrix.

[0081] In this embodiment, the service is initiated by the satellite-to-ground service at the satellite optical network layer. The service initiating node uses the data collection and service statistics module to count the number of service frames, service priority, and service source node S. n Business destination ground station node Z n This includes service information such as service generation time. The source satellite node optical network layer uses the service generation time and the satellite-to-ground visibility matrix to count the satellites within a single frame based on ground station visibility.

[0082] In some embodiments, determining routing information based on the visibility of the source node to the destination node includes: determining whether the source node is visible to the destination node; in response to the source node being visible to the destination node, and the source node being an intra-domain satellite of the destination node, determining that the source node directly transmits the routing information to the destination node; in response to the source node not being visible to the destination node, and the source node not being an intra-domain satellite of the destination node, determining the transmission time slot of the service corresponding to the source node; and searching for service routes based on the transmission time slot to determine the routing information.

[0083] In some embodiments, the step of searching for service routes based on the transmission time slot and determining the routing information includes: traversing all first paths that can complete transmission within one frame after the transmission time slot; selecting the first path with the least time slot cost and the fewest hops as the second path, and using the second path as the routing information; in response to not finding the second path, determining a new first path in the next frame, and determining a new second path based on the new first path, and using the new second path as the routing information.

[0084] In this embodiment, the data analysis module of the source satellite node determines whether its own satellite node is a satellite within the ground station's domain. When the source satellite node is a satellite within the domain, the optical router can directly select to perform service routing and data downlink to the ground.

[0085] When the source satellite node is not a satellite within the domain, the node optical router sets the satellite within the domain of the ground station as the destination node D of the pre-service satellite within one frame after the service is generated. i The transmission frame F of the service is calculated based on the service generation time. n With the transmission slot X in the intra-frame inter-satellite laser link topology matrix m .

[0086] F n =floor(mod(T,F) t ))

[0087] X m =floor(mod(T,X) t ))-F n ×m

[0088] Where floor() represents rounding up, mod() represents modulo, T represents the business initiation time, and X represents the floor function. t This indicates the duration of a time slot, set to 2 seconds, F t The duration of a frame is indicated by the number of time slots within the frame, while m represents the total number of time slots within the frame, which depends on the number of visible satellites among MEO constellation satellites.

[0089] After the service transmission time slot, a service route search is performed, traversing all inter-satellite transmission paths that can be completed within one frame. From this, the R-level arrival matrix is ​​calculated to obtain R1, R2, ..., R. i When R i In the middle, all elements except the diagonal are 1 or R. i =R i+1 Route searching stops when the time is right. The elements in the R-level arrival matrix are defined as follows:

[0090]

[0091] Where matrix R i This represents the R-level arrival matrix, when element r ij =1, indicating that satellite i can transmit information to satellite j via R hops; when element r ij =0, indicating that satellite i cannot transmit information to satellite j via hop R;

[0092] When calculating the R-level arrival matrix, the minimum time slot cost 3D matrix is ​​updated synchronously to ensure that the path from the source node to the destination node with the fewest time slots is obtained during the pathfinding process. The elements in the minimum time slot cost matrix are defined as follows:

[0093]

[0094] Locate the set of elements (S) in the R-level arrival matrix. n D i When any element is equal to 1, all satellite paths are compared, and the path with the fewest hops among paths with the same time slot is selected, and the routing information is output. If it is not equal to 1, it means that no path was found for the service in this frame, and frame skipping is performed.

[0095] Jump the service to the next frame F n+1 In the first time slot S1, the route search is restarted, both matrices are updated, and the element (S) is located in the R-level arrival matrix. n D n If the element is equal to 1, it means that the service has found the path with the least time slot cost; if it is not equal to 1, cross-frame transmission processing is performed.

[0096] Locate the element (S) in the time slot table. n D k Let S = 1, (k>i). new =D k As a new source node, it then performs a new route search in the first time slot S1 of the next frame Fn+1, updating both matrices.

[0097] Locate the element (S) in the R-level arrival matrix. new D i When any element equals 1, compare all satellite paths. Among paths with the same time slot, select the path with the fewest hops and output the routing information. The first hop of the route is S. n To S new For inter-satellite transport services, routing can be performed directly, bypassing the search for intra-domain satellites.

[0098] In some embodiments, the method further includes: in response to multiple service transmissions occurring at the same source node in the same time slot, and the services being unable to be transmitted simultaneously in the same time slot, transmitting high-priority services according to the determined routing information, and for low-priority services, re-determining the routing information in the next time slot after the high-priority service transmission time slot.

[0099] In this embodiment, when multiple services are transmitted from the same source node within the same frame and time slot, service conflicts occur, triggering a queuing mechanism. If the total data volume of the services does not exceed the transmission capacity of the optical network layer in a single time slot, the services can be fully transmitted within the same time slot. In this case, services are transmitted sequentially according to their priority, with higher-priority services transmitted first and lower-priority services queuing for transmission. If the total data volume of the services exceeds the transmission capacity of the optical network layer in a single time slot, higher-priority services are transmitted according to their original routing plan. Lower-priority services then re-find their routes in the time slots following the time slots of higher-priority services, based on the routing algorithm.

[0100] As can be seen from the above embodiments, the routing method described in this application constructs a satellite link topology based on the spatial geometric attributes of the Earth orbit constellation within an operational cycle; determines the satellites visible to the destination node within a frame based on the acquired service information of the source node and the topology; determines routing information based on the visibility of the source node to the destination node; and transmits services based on the routing information. This application analyzes commonly used inter-satellite routing algorithms and integrates satellite-to-ground communication systems with inter-satellite communication systems, effectively improving data transmission efficiency. Furthermore, considering the high dynamism of satellites, a virtual topology approach is adopted, rationally planning the topology structure through inter-satellite spatial geometric relationships to establish a dynamically changing topology. The routing algorithm based on topology control effectively improves the data transmission stability of dynamic satellite optical networks. Efficient dynamic networking is achieved through analysis and statistics of inter-satellite spatial geometric attributes, and a routing algorithm based on the dual criteria of shortest traversal time slots and fewest hops is designed. This comprehensively considers the low latency and low bit error rate requirements of data transmission, providing a reasonable path allocation scheme to contribute to the improvement of optical network performance. To address the issue of simultaneous multi-service transmission from the same source, a service queuing mechanism and a rerouting mechanism are proposed. These mechanisms can prevent massive traffic congestion caused by future surges in communication services and reduce end-to-end latency. The routing method proposed in this application is applicable to integrated air-ground network systems under various architectures, thus exhibiting high robustness.

[0101] In another feasible embodiment, taking a satellite optical network consisting of 32 MEO satellites (32 / 4 / 1 Walker constellation), 6 GEO satellites (6 / 2 / 1 Walker constellation), and 1 Beijing ground station as an example, each space communication node in the satellite optical network needs to be numbered. The medium Earth orbit (MEO) satellites 1-32 are numbered TG1-32, the high Earth orbit (GEO) satellites 1-6 are numbered G1-6, and the ground station is numbered D0.

[0102] refer to Figure 2 This is a schematic diagram of the intra-satellite laser link topology matrix in an embodiment of this application.

[0103] During the satellite's operational cycle, spatial geometric parameters such as inter-satellite laser link distance, inter-satellite elevation angle, inter-satellite visibility time, satellite-to-ground visibility time, and intra-domain satellite visibility time are statistically analyzed. Based on inter-satellite visibility relationships, 8 permanent links and 20 intermittent links are identified. Based on the corresponding permanent link establishment rules and intermittent link establishment rules, the intra-frame inter-satellite laser link topology matrix of this constellation model is established using the virtual topology method.

[0104] Each row represents all the link establishment results of a single satellite within a frame, while each column represents the link establishment results of the entire satellite constellation within a time slot. For example, the element in the 8th row and 8th column of the matrix indicates that an inter-satellite laser link is established between TG18 and TG12 in the 8th time slot. Within a frame, the inter-satellite link changes with the time slot based on a dynamic topology control matrix.

[0105] The MEO satellite's operating cycle is 3 hours, 26 minutes, and 37 seconds. Assuming a transmission frame length of 1 Gbit, a service transmission rate of 50 Gbps, and a time slot length of 2 seconds, the transmission capacity of one time slot is calculated to be 100 transmission frames (100 Gbps). At network edge nodes, cross-regional services between satellite and ground stations are generated. At 17:46:44 on the first day of the operating cycle, the nadir position of remote sensing satellite TG28 is located in the Atlantic region (27°S, 20°W), making it an external satellite used for remote sensing of marine and meteorological observations. At 14:45:00 on the first day of the operating cycle, the nadir position of remote sensing satellite TG25 is located near the Iranian border (28°N, 63°E), making it an internal satellite used for remote sensing of strategic situations.

[0106] For the processing of the satellite-to-ground heterogeneous source 1 service, the service information of heterogeneous source service 1 can be extracted from the service processing module of the network edge node: the service data volume is 50G, the service priority is 2, the service transmission occurs in the 5th time slot of the first frame, the source node is TG28 (an external satellite), and the destination node is the Beijing ground station. The network edge node of the source satellite needs to traverse all routing paths to the intra-domain satellite based on the intra-frame inter-satellite laser link topology matrix using the routing TSP-TLTSC algorithm, selecting the routing path with the lowest time slot cost and the fewest hops as the criteria, and relaying the service to the intra-domain satellite of the Beijing station within the frame. The network edge node transmits the first routing table to the optical router, as shown in Table 1.

[0107] Table 1 First Routing Table

[0108]

[0109] As shown in the routing table above, TG28 is currently an external satellite. Service transmission occurs in the 5th time slot of the first frame, transmitting from TG28 to the destination satellite node TG14 in just one hop. TG14 temporarily leaves the inter-satellite topology matrix to directly transmit image data to the Beijing ground station, and reconnects to the matrix before the next time slot. The service transmission takes one time slot. The calculated path delay is 6.64 seconds. Path delay T f The specific formula is as follows:

[0110]

[0111] Where n represents the number of time slots the service traverses from the source node to the destination node, and T s The time slot length is represented by the intra-frame inter-satellite laser link topology matrix, and 2 seconds represents the time d taken for link switching and photoelectric conversion between time slots. i Let c represent the length of the satellite-to-ground link, and c represent the speed of laser propagation in a vacuum, with a value of 3 × 10⁻⁶. 8 m / s. R b Represented as the transmission rate of the service, C s Represented as the transmission frame length, L d This represents the total number of transmission frames for the service.

[0112] For the processing of the satellite-to-ground heterogeneous source 2 service, the service information of heterogeneous source service 1 can be extracted from the service processing module of the network edge node: the service data volume is 50G, the service priority is 2, the service transmission occurs in the 4th time slot of the first frame (satellite orbital nature), the source node is TG25 (internal satellite), and the destination node is the Beijing ground station. At this time, the source node satellite can directly transmit the data to the Beijing ground station. The network edge node transmits the second routing table information to the optical router, as shown in Table 2.

[0113] Table 2 Second Routing Table

[0114]

[0115] As can be seen from the above routing table, since the TG25 satellite is an intra-domain satellite for the Beijing ground station at this time, the satellite service does not need to carry out inter-satellite service transmission. The TG25 temporarily leaves the inter-satellite topology matrix to directly transmit image data to the ground to the Beijing ground station, and reconnects to the matrix before the next time slot. The entire route has no inter-satellite hops, and the total delay only includes the satellite-to-ground part and the link switching part, with a delay of 2.64s.

[0116] Inter-satellite source service generation (data volume less than network layer transmission capacity) On the first day of the operation cycle at 4:00:28, the source satellite node was defined as TG38, with four priorities of 1, 2, 3, and 4, and four destination satellite nodes as TG45 (different orbit satellite), TG11 (different orbit satellite), TG25 (different orbit satellite), and TG31 (permanently invisible satellite). Each service has 20 transmission frames, for a total of 80 transmission frames.

[0117] For inter-satellite same-source services (data volume less than network layer transmission capacity), four types of same-source service information can be extracted from the service processing module of the network edge node: all service data volume is 50G, service priorities are 1, 2, 3, and 4 respectively, service transmission occurs in the 8th time slot of the first frame (satellite orbital period nature), source node is TG38, and destination nodes are TG45, TG11, TG25, and TG31 respectively. The network edge node searches for routing paths for the four types of services according to the routing TSP-TLTSC algorithm, and transmits the third routing table information to the optical router in priority order, as shown in Table 3.

[0118] Table 3 Third Routing Table

[0119]

[0120] As can be seen from the routing table above, service 1 has the highest priority and is transmitted first. It starts in the 8th time slot of the first frame and ends in the 9th time slot of the first frame. It takes 2 hops to travel from TG38 to the destination satellite node TG45. The service transmission takes 2 time slots, as shown in Table 4.

[0121] Table 4 Fourth Routing Table

[0122]

[0123] According to the fourth routing table, the transmission of Service 2 begins in the 8th time slot of the first frame and ends in the 10th time slot of the first frame. After 3 hops, it is transmitted from TG38 to the destination satellite node TG11. The service transmission takes 3 time slots.

[0124] According to the fifth routing table, service 3 is not transmitted in the 8th and 9th time slots. The transmission starts in the 10th time slot of the first frame and ends in the 10th time slot of the first frame. After one hop, it is transmitted from TG38 to the destination satellite node TG25. The service transmission takes one time slot.

[0125] Table 5 Fifth Routing Table

[0126]

[0127] Table 6 Sixth Routing Table

[0128]

[0129] As can be seen from the routing table, service 4 has the lowest priority and is transmitted last. It starts in the 8th time slot of the first frame and ends in the 11th time slot of the first frame. After 3 hops, it is transmitted from TG38 to the destination satellite node TG31. The service transmission takes 4 time slots.

[0130] For inter-satellite services originating from the same source (data volume exceeding network layer transmission capacity), both TG12 have service transmission requirements starting from the second time slot of the first frame, with priorities of 1 and 2 respectively. The destination satellite nodes are TG17 (permanently visible satellite) and TG31 (different orbit satellite). The number of transmission frames for the two services is 60 each, for a total of 120 transmission frames.

[0131] Inter-satellite same-source service processing (data volume greater than network layer transmission capacity): Based on the service processing module of the network edge node, two types of same-source service information can be extracted: both service data volume is 60G, service priorities are 1 and 2 respectively, service transmission occurs in the second time slot of the first frame, source node is TG12, and destination nodes are TG17 and TG31 respectively. The network edge node searches for routing paths for the two types of services according to the routing TSP-TLTSC algorithm. Due to service conflicts and the total transmitted data volume exceeding the network transmission capacity, the service with priority 2 undergoes rerouting based on the TSP-TLTSC algorithm. Subsequently, the seventh routing table is transmitted to the optical router according to priority order, as shown in Table 7.

[0132] Table 7 Seventh Routing Table

[0133]

[0134] According to the routing table, service 1 has the highest priority and is transmitted first. The transmission occurs in the second time slot of the first frame and ends in the fourth time slot of the first frame. After three hops, it is transmitted from TG12 to the destination satellite node TG31. The service transmission takes three time slots.

[0135] Table 8 Eighth Routing Table

[0136]

[0137] As shown in the eighth routing table, service 2 has the lowest priority and is transmitted last. Due to service conflicts and the number of frames exceeding the time slot capacity, a new route needs to be found for this service. Transmission occurs in the third time slot of the first frame and ends in the fifth time slot of the first frame, taking two hops to reach the destination satellite node TG17. The service transmission spans three time slots. Compared to the original route for this service in Table 9 below, the original route only requires one hop and one time slot to complete the service transmission task. This new route has an increased number of hops, which increases the service information latency.

[0138] Table 9. Ninth Routing Table

[0139]

[0140] It should be noted that the method in this embodiment can be executed by a single device, such as a computer or server. The method can also be applied in a distributed scenario, where multiple devices cooperate to complete the task. In such a distributed scenario, one of these devices may execute only one or more steps of the method in this embodiment, and the multiple devices will interact with each other to complete the method described.

[0141] It should be noted that the above description describes some embodiments of this application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in a different order than that shown in the above embodiments and still achieve the desired result. Furthermore, the processes depicted in the drawings do not necessarily require a specific or sequential order to achieve the desired result. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0142] Based on the same inventive concept, corresponding to any of the above embodiments, this application also provides a routing device.

[0143] refer to Figure 5 The routing device includes:

[0144] Module 51 is configured to construct the topology of satellite links based on the spatial geometric properties of the Earth orbit constellation acquired within a runtime period.

[0145] The determination module 52 is configured to determine the satellites within the domain visible to the destination node within a frame based on the acquired service information of the source node and the topology.

[0146] The transmission module 53 is configured to determine routing information based on the visibility of the source node to the destination node, and to transmit services based on the routing information.

[0147] For ease of description, the above devices are described in terms of function, divided into various modules. Of course, in implementing this application, the functions of each module can be implemented in one or more software and / or hardware.

[0148] The apparatus of the above embodiments is used to implement the corresponding routing method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0149] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the routing method described in any of the above embodiments.

[0150] Figure 6 This embodiment illustrates a more specific hardware structure of an electronic device, which may include a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, memory 1020, input / output interface 1030, and communication interface 1040 are interconnected internally via the bus 1050.

[0151] The processor 1010 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0152] The memory 1020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 can store the operating system and other applications. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program code is stored in the memory 1020 and is called and executed by the processor 1010.

[0153] The input / output interface 1030 is used to connect input / output modules to realize information input and output. Input / output modules can be configured as components within the device (not shown in the figure) or externally connected to the device to provide corresponding functions. Input devices may include keyboards, mice, touchscreens, microphones, various sensors, etc., while output devices may include displays, speakers, vibrators, indicator lights, etc.

[0154] The communication interface 1040 is used to connect a communication module (not shown in the figure) to enable communication between this device and other devices. The communication module can communicate via wired means (such as USB, Ethernet cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).

[0155] Bus 1050 includes a pathway for transmitting information between various components of the device, such as processor 1010, memory 1020, input / output interface 1030, and communication interface 1040.

[0156] It should be noted that although the above-described device only shows the processor 1010, memory 1020, input / output interface 1030, communication interface 1040, and bus 1050, in specific implementations, the device may also include other components necessary for normal operation. Furthermore, those skilled in the art will understand that the above-described device may only include the components necessary for implementing the embodiments of this specification, and not necessarily all the components shown in the figures.

[0157] The electronic devices described above are used to implement the corresponding routing methods in any of the foregoing embodiments and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0158] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides a non-transitory computer-readable storage medium that stores computer instructions for causing the computer to execute the routing method as described in any of the above embodiments.

[0159] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0160] The computer instructions stored in the storage medium of the above embodiments are used to cause the computer to execute the routing method as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0161] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of this application (including the claims) is limited to these examples; within the framework of this application, the technical features of the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other variations of different aspects of the embodiments of this application as described above, which are not provided in the details for the sake of brevity.

[0162] Additionally, to simplify the description and discussion, and to avoid obscuring the embodiments of this application, the well-known power / ground connections to integrated circuit (IC) chips and other components may or may not be shown in the provided drawings. Furthermore, the apparatus may be shown in block diagram form to avoid obscuring the embodiments of this application, and this also takes into account the fact that the details of the implementation of these block diagram apparatuses are highly dependent on the platform on which the embodiments of this application will be implemented (i.e., these details should be fully understood by those skilled in the art). While specific details (e.g., circuits) have been set forth to describe exemplary embodiments of this application, it will be apparent to those skilled in the art that the embodiments of this application can be implemented without these specific details or with variations thereof. Therefore, these descriptions should be considered illustrative rather than restrictive.

[0163] Although this application has been described in conjunction with specific embodiments thereof, many substitutions, modifications, and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may be used with the embodiments discussed.

[0164] The embodiments of this application are intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the embodiments of this application should be included within the protection scope of this application.

Claims

1. A routing method, characterized in that, include: Based on the spatial geometric properties of the Earth orbit constellation acquired during one operating cycle, the topology of the satellite links is constructed. Based on the acquired source node's service information and the topology, determine the satellites within the domain visible to the destination node within a frame; Based on the visibility of the source node to the destination node, routing information is determined, and services are transmitted based on the routing information; The construction of the satellite link topology based on the spatial geometric properties of the Earth orbit constellation within an acquired operating cycle includes: Obtain the spatial geometric properties of the Earth orbit constellation during one operating cycle; Obtain the visibility relationship between all satellites and the target node; Based on the aforementioned spatial geometric properties and the aforementioned visibility relationships, establish inter-satellite visibility matrices and satellite-to-ground visibility matrices; The permanent and intermittent links between satellites are determined based on the inter-satellite visibility matrix. Based on the permanent links and the intermittent links, a first link topology matrix is ​​constructed; The positions of matrix elements between invisible satellites are set to zero according to the inter-satellite visibility matrix; The terminal idle rate of all time slots in a frame of the first link topology matrix is ​​counted, and a link is established in the time slot with the highest terminal idle rate that meets the first link establishment criterion, thereby constructing a second link topology matrix; Based on the second link topology matrix, the satellite link topology is constructed in a dynamic network structure using the virtual topology method; The step of determining routing information based on the visibility of the source node to the destination node includes: Determine whether the source node is visible to the destination node; In response to the source node being visible to the destination node, and the source node being an intra-domain satellite of the destination node, it is determined that the source node directly transmits the routing information to the destination node. In response to the fact that the source node is not visible to the destination node and the source node is not a satellite within the domain of the destination node, the transmission time slot of the service corresponding to the source node is determined; After the transmission time slot, traverse all first paths that can complete the transmission within one frame; The path with the lowest time slot cost and the fewest hops in the first path is selected as the second path, and the second path is used as the routing information. In response to the failure to find the second path, a new first path is determined in the next frame, and a new second path is determined based on the new first path, and the new second path is used as the routing information.

2. The method according to claim 1, characterized in that, The process of determining the intra-domain satellites visible to the destination node within a frame, based on the acquired source node's service information and the topology, includes: Obtain the service information of the source node; the service information includes the service generation time; Based on the service generation time and the satellite-to-ground visibility matrix, determine the satellites within the domain visible to the target node within a frame.

3. The method according to claim 1, characterized in that, The method further includes: In response to multiple service transmissions occurring at the same source node in the same time slot, and the services being unable to be transmitted simultaneously in the same time slot, the high-priority services are transmitted according to the determined routing information. For low-priority services, the routing information is re-determined in the next time slot following the transmission time slot of the high-priority service.

4. A routing device, characterized in that, include: The building module is configured to construct the topology of satellite links based on the spatial geometry of the Earth orbit constellation acquired within a runtime period; The determination module is configured to determine the satellites within the domain visible to the destination node within a frame based on the acquired service information of the source node and the topology. The transmission module is configured to determine routing information based on the visibility of the source node to the destination node, and to transmit services based on the routing information. The building module is further configured as follows: Obtain the spatial geometric properties of the Earth orbit constellation during one operating cycle; Obtain the visibility relationship between all satellites and the target node; Based on the aforementioned spatial geometric properties and the aforementioned visibility relationships, establish inter-satellite visibility matrices and satellite-to-ground visibility matrices; The permanent and intermittent links between satellites are determined based on the inter-satellite visibility matrix. Based on the permanent links and the intermittent links, a first link topology matrix is ​​constructed; The positions of matrix elements between invisible satellites are set to zero according to the inter-satellite visibility matrix; The terminal idle rate of all time slots in a frame of the first link topology matrix is ​​counted, and a link is established in the time slot with the highest terminal idle rate that meets the first link establishment criterion, thereby constructing a second link topology matrix; Based on the second link topology matrix, the satellite link topology is constructed in a dynamic network structure using the virtual topology method; The transmission module is further configured as follows: Determine whether the source node is visible to the destination node; In response to the source node being visible to the destination node, and the source node being an intra-domain satellite of the destination node, it is determined that the source node directly transmits the routing information to the destination node. In response to the fact that the source node is not visible to the destination node and the source node is not a satellite within the domain of the destination node, the transmission time slot of the service corresponding to the source node is determined; After the transmission time slot, traverse all first paths that can complete the transmission within one frame; The path with the lowest time slot cost and the fewest hops in the first path is selected as the second path, and the second path is used as the routing information. In response to the failure to find the second path, a new first path is determined in the next frame, and a new second path is determined based on the new first path, and the new second path is used as the routing information.

5. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the method as described in any one of claims 1 to 3.

6. A non-transitory computer-readable storage medium storing computer instructions, characterized in that, The computer instructions are used to cause the computer to perform the method according to any one of claims 1 to 3.

Images