CN115378863B - Space-based network topology design method based on average service performance and related equipment - Google Patents
Space-based network topology design method based on average service performance and related equipment Download PDFInfo
- Publication number
- CN115378863B CN115378863B CN202210793014.8A CN202210793014A CN115378863B CN 115378863 B CN115378863 B CN 115378863B CN 202210793014 A CN202210793014 A CN 202210793014A CN 115378863 B CN115378863 B CN 115378863B
- Authority
- CN
- China
- Prior art keywords
- track
- orbit
- link
- average
- communication
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
- H04B10/11—Arrangements specific to free-space transmission, i.e. transmission through air or vacuum
- H04B10/118—Arrangements specific to free-space transmission, i.e. transmission through air or vacuum specially adapted for satellite communication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- 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
Abstract
The invention discloses a space-based network topology design method based on average service performance and related equipment. Through more effective space-based satellite network topology design, the disadvantages of important network performances such as time delay, hop count and the like in a multi-region communication scene caused by the fact that the traditional cross satellite network cannot adapt to communication requirements of different regions are solved.
Description
The application is applied for 2022, 05 month and 18 days, 2022105369197 and has the patent name: the application of the low orbit satellite network topology planning method based on laser communication and related equipment is divided into application.
Technical Field
The present invention relates to the field of satellite network communication processing technologies, and in particular, to a method, a terminal, and a computer readable storage medium for designing a space-based network topology based on average service performance.
Background
At present, research institutions and satellite network operation companies in the industry mainly develop space-based satellite networking research and construction based on a cross structure, and the cross link topology structure is widely adopted, but the network structure is relatively compromise in overall network performance. In the cross network configuration, each satellite node is only linked with the front satellite and the rear satellite which are in the same orbit and the two satellites on the left and right of the adjacent orbit, so that the number of hops is high in long-distance communication across the region, and obvious disadvantages exist in the aspects of time delay of satellite communication, node congestion probability and robustness of end-to-end communication.
The traditional space-based satellite network cross topological structure is more beneficial to close-range communication because each node is only connected with adjacent satellite nodes; for a trans-regional long-distance communication scene, due to the increase of the hop count, the advantage of time delay performance compared with ground optical fiber communication is greatly reduced. In practice, the topology structure design of the satellite network needs to consider the distribution of actual communication hot spots on the ground, and the good topology structure can ensure that the performances such as communication time delay and the like of most communication hot spots on the ground are better, while the cross network topology configuration cannot achieve the aim.
Accordingly, the prior art is still in need of improvement and development.
Disclosure of Invention
The invention mainly aims to provide a space-based network topology design method, a terminal and a computer readable storage medium based on average service performance, and aims to solve the problem that the traditional cross satellite network in the prior art has the defects in important network performances such as time delay, hop count and the like in a long-distance communication scene.
In order to achieve the above object, the present invention provides a method for designing a space-based network topology based on average service performance, the method for designing a space-based network topology based on average service performance comprising the steps of:
calculating the distance distribution of communication service based on the service distribution in the ground coverage range by taking the ground coverage range of the satellite on each orbit as the basic region granularity;
based on the communication service distance distribution of each orbit and the coverage range of other orbit satellites, mapping the communication distance to the communication orbit type, and only reserving the different orbit communication type;
calculating the proportion of each communication orbit type of each orbit satellite based on the communication traffic of the satellites in each orbit on all the different orbits;
based on the farthest communication track of the optical transceiver, calculating the average proportion of the actual communication track types of all tracks of the whole network;
selecting a first track as a reference, uniformly distributing each link according to the proportion of the link types based on network homogenization requirements aiming at all nodes on the selected track, and performing topology optimization based on a shortest path algorithm;
traversing all orbits, and judging whether the difference value between the different-orbit 1 st orbit link type proportion of all orbit satellite communication and the whole network average different-orbit 1 st orbit link type proportion exceeds a set value;
if the difference value does not exceed the set value, simulating a complete satellite period, and counting the average time delay and the hop count of the whole network in the operation period based on a shortest path algorithm;
judging whether the comprehensive index value of the average time delay and the hop count of the whole network is smaller than the comprehensive index value of the cross topological structure;
if the comprehensive index value of the average time delay and the hop count of the whole network is not less than the comprehensive index value of the cross topological structure, modifying other different track link types into the link type of the 1 st track of the different track according to a preset principle; wherein the link type is adjacent first track, adjacent second track, adjacent nth track.
The method for designing the space-based network topology based on the average service performance, wherein the calculating the proportion of each communication orbit type of each orbit satellite based on the communication traffic of each orbit satellite on all different orbits further comprises the following steps:
all track type proportions exceeding the optical-to-terminal communication range are mapped onto the most distant track type within the optical-to-terminal communication range.
The method for designing the space-based network topology based on the average service performance includes the steps of judging whether the difference value between the different track 1 st track link type proportion of all the orbital satellite communication and the whole network average different track 1 st track link type proportion exceeds a set value, and then further includes:
if the difference value between the different track 1 st track link type proportion of all the orbital satellite communication and the whole network average different track 1 st track link type proportion exceeds a set value, converting the different track 1 st track link type proportion with other different track link type proportions, and completing the link topology optimization of the track with the average value of all the different track 1 st tracks-different track 1 st tracks being larger than the set value.
The method for designing the space-based network topology based on the average service performance, wherein the method for modifying other different track link types into the link type of the 1 st track of the different track according to a preset principle specifically comprises the following steps:
selecting a node with the link number of 3, adding one adjacent track link, and modifying all the link types of the nodes corresponding to other tracks into adjacent track links;
when the number of the nodes with the link number of 3 is 0, selecting one different-track link with the highest proportion according to the homogenization principle, modifying the different-track link into an adjacent-track link, and carrying out the same modification on the corresponding nodes of other tracks.
The method for designing the space-based network topology based on the average service performance, wherein the topology optimization is performed based on a shortest path algorithm, specifically comprises the following steps:
based on the shortest path algorithm, the network is subjected to layout fine adjustment under the condition of not changing the proportion of various link types, so that the comprehensive index of the whole network based on the average communication delay and hop count of service distribution and traffic is better.
According to the space-based network topology design method based on the average service performance, the satellite number-to-ratio difference meeting each orbit is not smaller than 1 when the set value is set.
In addition, to achieve the above object, the present invention also provides a terminal, wherein the terminal includes: the method comprises the steps of a memory, a processor and a space-based network topology design program based on average service performance, wherein the space-based network topology design program based on average service performance is stored in the memory and can run on the processor, and the space-based network topology design program based on average service performance realizes the space-based network topology design method based on average service performance when being executed by the processor.
In addition, in order to achieve the above object, the present invention also provides a computer readable storage medium storing a space-based network topology design program based on average service performance, which when executed by a processor, implements the steps of the space-based network topology design method based on average service performance as described above.
The invention uses a more effective network topology planning mechanism aiming at a space-based single constellation satellite network, so that performance indexes such as communication delay, hop count and the like of the space-based network are better than those of a traditional cross network, a new satellite network configuration design scheme takes the communication delay and hop count indexes corresponding to a satellite network hotspot communication area as the judgment basis of topology planning, and on the basis of keeping each satellite node connected with front and rear satellite nodes in the same orbit, the link connection relation between adjacent orbits and cross orbits is redesigned, so that the network topology meets the real communication service requirement, the comprehensive indexes of communication delay and hop count performance are improved compared with the traditional cross network topology, and the aim of optimizing the whole network communication service performance is fulfilled.
Drawings
FIG. 1 is a flow chart of a preferred embodiment of the method of designing a space-based network topology based on average traffic performance of the present invention;
FIG. 2 is a schematic diagram of the operating environment of a terminal according to a preferred embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more clear and clear, the present invention will be further described in detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
Since the inter-satellite communication needs to be based on a certain communication technology and equipment, and different communication technologies and equipment have large differences in the breadth and depth of communication, it is necessary to set related information in advance. The preconditions or constraints for the inter-satellite communication link in the scheme are as follows:
(1) The satellites are based on point-to-point laser communication optical end machines, and the maximum communication distance of each optical end machine is d;
(2) Current optical transceiver communication range: azimuth angle + -alpha DEG, pitch angle + -beta DEG;
(3) The number of optical terminals of each satellite node is less than or equal to 4, and the optical terminals are consistent with a cross topological structure.
When the service model and service distribution of the satellite network are clear, the space-based network topology needs to be designed around the ground service requirement. On the basis of meeting the precondition or constraint of the communication link between satellites, the service-based average communication delay and hop count index performance is guaranteed to be better. In the network topology design process, the front and rear 2 links of the same orbit satellite are kept unchanged, and only 2 different orbit links are optimized.
The method for designing the space-based network topology based on the average service performance according to the preferred embodiment of the present invention, as shown in fig. 1, comprises the following steps:
step S1, the ground coverage of the satellites on each orbit is taken as the basic area granularity, and the distance distribution of the communication service is calculated based on the service distribution (the service distribution is determined by the geographic position of service users and is an input condition in network design) in the ground coverage.
And S2, mapping the communication distance to the communication orbit type based on the communication service distance distribution of each orbit and the coverage range of other orbit satellites, and only reserving the different orbit communication type.
Specifically, mapping from communication distance to communication orbit type is performed based on the communication service distance distribution of each orbit and the coverage area of other orbit satellites, and only the off-orbit communication type is reserved, for example, the destination of a part of communication service under a certain orbit satellite is distributed in the coverage area of an adjacent orbit satellite, then the distance corresponding to the part of communication service is mapped to the "off-orbit 1 st orbit" type, and similarly, the communication distance with a part of distance being far is mapped to the "off-orbit X-th orbit" type.
And step S3, calculating the proportion of each communication orbit type of each orbit satellite based on the communication traffic of the satellites in each orbit on all the different orbits.
Specifically, based on the traffic of the satellites in each orbit on all the orbits of the different orbits, the proportion calculation of the orbit type is performed, and all the proportion of the orbit types exceeding the communication range of the optical transceiver are mapped to the orbit type furthest in the communication range of the optical transceiver.
For example, the communication traffic distribution of a satellite on a certain orbit L is:
different track 1 st track: x is X L1 ％；
Different track 2 nd track: x is X L2 ％；
...
Different track nth track: x is X LN ％。
Assuming that the farthest different track of the optical transceiver is the D-th track, the corresponding proportion of each track type is as follows:
different track 1 st track: x is X L1 ％；
Different track 2 nd track: x is X L2 ％；
...
Different track type D track: x'. LD ％＝(X LD ％+X LD+1 ％+...+X LN ％)
Note that: when the base satellite network is smaller in size and only 1 orbit is in the communication range of the optical transceiver, then D and 1 coincide, all orbit types are mapped to 1 orbit, and a cross network configuration is recommended in the case.
And S4, based on the farthest communication track of the optical transceiver, calculating the average proportion of the actual communication track types of all tracks of the whole network.
Specifically, the communication track types of all tracks of the whole network are counted, the communication track types are from the 1 st track of the different tracks to the farthest communication track in the communication range of the optical transceiver, the number of all tracks of the whole network is assumed to be N, and the farthest communication track in the communication range of the optical transceiver is assumed to be the D track.
Different track 1 st track: x is X 1.avg ＝(X 11 ％+X 21 ％+...+X N1 ％)/N；
Different track 2 nd track: x is X 2.avg ＝(X 12 ％+X 22 ％+...+X N2 ％)/N；
...
Different track type D track: x is X D.avg ＝(X’ 1D ％+X’ 2D ％+...+X’ ND ％)/N。
And S5, selecting a first track as a reference, carrying out homogenization distribution on each link according to the link type proportion based on network homogenization requirements aiming at all nodes on the selected track, and carrying out topology optimization based on a shortest path algorithm.
Specifically, a first track (other tracks can be selected) is selected as a reference, the total number of links of all nodes of the track in the selected direction is assumed to be T, the proportion of each track type is calculated by T, the corresponding quantity of each link type is calculated, then uniform arrangement is carried out according to the method of the step S6 in the first condition, after the arrangement is completed, the arrangement fine adjustment is carried out on the network based on Dijkstra algorithm under the condition that the proportion of each link type is not changed, and the comprehensive index of the whole network based on the average communication delay and hop count of service distribution and service volume is better.
And S6, traversing all orbits, and judging whether the difference value between the different-orbit 1 st orbit link type proportion of all orbit satellite communication and the whole network average different-orbit 1 st orbit link type proportion exceeds a set value.
When the user sets the "set value", the "satellite number of each orbit is guaranteed to be equal to or more than 1, and preferably equal to or more than 2.
If the difference between the off-track 1 st track link type proportion of all the orbital satellite communications and the overall network average off-track 1 st track link type proportion exceeds (is greater than) a set value, executing step S6 (a); if the difference between the off-track 1 st track link type proportion of all the orbital satellite communications and the overall network average off-track 1 st track link type proportion is not more than (less than) the set value, step S7 is executed.
And S6 (a), if the difference value between the link type proportion of the 1 st track of the different track and the link type proportion of the 1 st track of the average different track of the whole network exceeds a set value, converting the link type proportion of the 1 st track of the different track and the link type proportion of other different tracks, and completing the link topology optimization of the track with the average value of the 1 st track of the different track and the 1 st track of the different track being larger than the set value.
Specifically, the difference > the trajectory of the set value (difference is positive): selecting a track, assuming that the number of the 'hetero track 1 st track-hetero track 1 st track average' on the track is T, selecting hetero track types smaller than the average on the track, rounding and rounding the difference, and then sorting from large to small, and assuming that:
different rail L track: fewer than a tracks than the average;
different rail M-th rail: fewer B tracks than average;
...
different track nth track: c fewer tracks than average;
and the 'different track 1 st track' on the track is more than the 'set value' by T links, and the different track links are changed according to homogenization.
If T < A, changing all T 'off-track 1 st track' link types into 'off-track L' link types; if T < A+B+ & gt is the same, changing the link type of the A 'off-track 1 st track' into the link type of the 'off-track L' track ', and then changing the rest' off-track 1 st track 'link types into the link type of the' off-track M 'track' in sequence until all T tracks are transformed; if T > a+b+ & gt C, then all a+b+ & gt C "off-track 1 st track" link types are changed into "off-track L track", "off-track M track", "off-track L track" link types in order. After the track link type is changed, the links on the nodes with the link transformation are caused to exceed 5, and the off-track links exceeding 4 are deleted on the basis of keeping the newly modified links. Then based on Dijkstra algorithm, calculating average communication delay and hop count based on service distribution and traffic volume for the track and other different track related to link transformation, if the delay index is lifted relatively before modification, then retaining the modification; if the delay indicator drops, that pair of modifications is rolled back. According to the method, the link topology optimization of all the tracks with the average value of the 1 st track of the off-track and the 1 st track of the off-track being larger than the set value is completed.
For a track with difference < set point (difference negative): selecting a track, assuming that the number of the average value of the 'hetero track 1 st track-hetero track 1 st track' on the track is T, selecting hetero track types larger than the average value on the track, rounding and rounding the difference values, and then sorting from large to small, wherein the number is assumed to be:
different rail U-th track: e tracks more than the average;
different rail V track: f tracks more than the average;
...
different track W track: g more tracks than average;
and selecting T different track links from the links in order from large to small, and changing the different track first track link type according to the homogenization principle. If T < E, changing all T 'off-track U-th track' link types into 'off-track 1-th track' link types; if T < e+f+ & gt, +g, then changing the E "off-track, U-track" link type to an "off-track, 1-track" link type; then changing the rest 'different track V-th track' link type into 'different track 1-th track' link type until all T links are completely transformed; if T > e+f+ & gt, then all e+f+ & gt "off-track h track", "off-track h track" off-track link types are converted to "off-track h 1 track" link types. Also, after the track link type is changed, the links on the nodes of the link transformation are caused to exceed 5, and the off-track links exceeding 4 are deleted on the basis of keeping the newly modified links. After each link transformation and redundant link deletion of the node, calculating average communication delay and hop count based on service distribution and traffic for the track and other different track related to the link transformation based on Dijkstra algorithm, and if the delay index is improved relatively before modification, reserving the modification; if the delay indicator drops, that pair of modifications is rolled back. According to the method, the link topology optimization of all the tracks with the average value of the 1 st track of the different tracks, namely the 1 st track of the different tracks, which is larger than a set value is completed.
And S7, if the difference value does not exceed the set value, simulating a complete satellite period, and counting the average time delay and the hop count (comprehensive index) of the whole network in the operation period based on a shortest path algorithm.
And S8, judging whether the comprehensive index value of the average time delay and the hop count of the whole network is smaller than the comprehensive index value of the cross topological structure.
If the comprehensive index value of the average time delay and the hop count of the whole network is smaller than the comprehensive index value of the cross topological structure (namely, the comprehensive index of the time delay and the hop count is better than the cross network index), ending the flow; if the integrated index value of the average delay and hop count of the whole network is not less than the integrated index value of the cross topology (i.e. the integrated index of the delay and hop count is worse than the cross network index), step S8 (a) is performed.
And S8 (a), if the comprehensive index value of the whole network average time delay and the hop count is not less than the comprehensive index value of the cross topological structure, modifying other different track link types into the link type of the different track 1 st track according to a preset principle, wherein the link type is adjacent first track, adjacent second track and.
Specifically, first, selecting a node with 3 links (the goal of the optimization is to make the number of links of each node as 4 as possible, but in the process of optimization, a part of nodes may have the number of links of 3, in this case, the node is preferentially optimized, so that in the process of optimizing the other nodes with 4 links, more nodes with 3 links are formed), adding one adjacent track link, and modifying the link types of the nodes corresponding to other tracks to be adjacent track links, and then the flow jumps to step S7; when the number of the nodes with the link number of 3 is 0, one of the different track links with the highest proportion is selected according to the homogenization principle to be modified into the adjacent track link, the modification is copied to the corresponding node of the other track, and then the flow jumps to the step S8.
The network topology design scheme based on satellite network service performance has the advantages that:
(1) In the scheme, the communication distance distribution of the ground communication service is mapped to the communication track distance in the space-based network, so that the conversion of the ground service requirement to the space-based network topology design requirement is completed, and the method is specifically implemented in step S1 and step S2 of FIG. 2.
(2) The calculation of the type of the space-based satellite network link based on the traffic is a better match of the type of the link with the traffic on the ground, and is specifically implemented in steps S3 and S4 of fig. 2.
Further, as shown in fig. 2, the present invention also provides a terminal correspondingly, which includes a processor 10, a memory 20 and a display 30. Fig. 2 shows only some of the components of the terminal, but it should be understood that not all of the illustrated components are required to be implemented and that more or fewer components may alternatively be implemented.
The memory 20 may in some embodiments be an internal storage unit of the terminal, such as a hard disk or a memory of the terminal. The memory 20 may in other embodiments also be an external storage device of the terminal, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card) or the like, which are provided on the terminal. Further, the memory 20 may also include both an internal storage unit and an external storage device of the terminal. The memory 20 is used for storing application software installed in the terminal and various data, such as program codes of the installation terminal. The memory 20 may also be used to temporarily store data that has been output or is to be output. In an embodiment, the memory 20 stores a space-based network topology design program 40 based on average service performance, and the space-based network topology design program 40 based on average service performance can be executed by the processor 10, so as to implement the space-based network topology design method based on average service performance in the present application.
The processor 10 may in some embodiments be a central processing unit (Central Processing Unit, CPU), microprocessor or other data processing chip for executing program code or processing data stored in the memory 20, for example, for performing the method of designing an on-the-fly network topology based on average traffic performance.
The display 30 may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode) touch, or the like in some embodiments. The display 30 is used for displaying information at the terminal and for displaying a visual user interface. The components 10-30 of the terminal communicate with each other via a system bus.
In an embodiment, the steps of the method for designing a space-based network topology based on average traffic performance are implemented when the processor 10 executes the space-based network topology design program 40 based on average traffic performance in the memory 20.
The present invention also provides a computer readable storage medium, wherein the computer readable storage medium stores a space-based network topology design program based on average service performance, and the space-based network topology design program based on average service performance realizes the steps of the space-based network topology design method based on average service performance as described above when executed by a processor.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
It is to be understood that the invention is not limited in its application to the examples described above, but is capable of modification and variation in light of the above teachings by those skilled in the art, and that all such modifications and variations are intended to be included within the scope of the appended claims.
Claims (8)
1. The method for designing the space-based network topology based on the average service performance is characterized by comprising the following steps of:
calculating the distance distribution of communication service based on the service distribution in the ground coverage range by taking the ground coverage range of the satellite on each orbit as the basic region granularity;
based on the communication service distance distribution of each orbit and the coverage range of other orbit satellites, mapping the communication distance to the communication orbit type, and only reserving the different orbit communication type;
calculating the proportion of each communication orbit type of each orbit satellite based on the communication traffic of the satellites in each orbit on all the different orbits;
based on the farthest communication track of the optical transceiver, calculating the average proportion of the actual communication track types of all tracks of the whole network;
selecting a first track as a reference, uniformly distributing each link according to the proportion of the link types based on network homogenization requirements aiming at all nodes on the selected track, and performing topology optimization based on a shortest path algorithm;
traversing all orbits, and judging whether the difference value between the different-orbit 1 st orbit link type proportion of all orbit satellite communication and the whole network average different-orbit 1 st orbit link type proportion exceeds a set value;
if the difference value does not exceed the set value, simulating a complete satellite period, and counting the average time delay and the hop count of the whole network in the operation period based on a shortest path algorithm;
judging whether the comprehensive index value of the average time delay and the hop count of the whole network is smaller than the comprehensive index value of the cross topological structure;
if the comprehensive index value of the average time delay and the hop count of the whole network is not less than the comprehensive index value of the cross topological structure, modifying other different track link types into the link type of the 1 st track of the different track according to a preset principle; wherein the link type is adjacent first track, adjacent second track, adjacent nth track.
2. The method for designing a space-based network topology based on average traffic performance of claim 1, wherein the calculating the proportion of each communication orbit type of each orbiting satellite based on the traffic volume of each orbiting satellite on all orbits of different orbits further comprises:
all track type proportions exceeding the optical-to-terminal communication range are mapped onto the most distant track type within the optical-to-terminal communication range.
3. The method for designing an space-based network topology based on average service performance according to claim 1, wherein the determining whether the difference between the proportion of the types of the different 1 st orbit links of all orbital satellite communications and the proportion of the types of the same 1 st orbit links of the average different orbit of the whole network exceeds a set value further comprises:
if the difference value between the different track 1 st track link type proportion of all the orbital satellite communication and the whole network average different track 1 st track link type proportion exceeds a set value, converting the different track 1 st track link type proportion with other different track link type proportions, and completing the link topology optimization of the track with the average value of all the different track 1 st tracks-different track 1 st tracks being larger than the set value.
4. The method for designing the space-based network topology based on the average service performance according to claim 1, wherein the modifying other different track link types to the link type of the different track 1 st track according to the preset principle specifically comprises:
selecting a node with the link number of 3, adding one adjacent track link, and modifying all the link types of the nodes corresponding to other tracks into adjacent track links;
when the number of the nodes with the link number of 3 is 0, selecting one different-track link with the highest proportion according to the homogenization principle, modifying the different-track link into an adjacent-track link, and carrying out the same modification on the corresponding nodes of other tracks.
5. The method for designing the topology of the space-based network based on the average service performance according to claim 1, wherein the topology optimization is performed based on a shortest path algorithm, and specifically comprises:
based on the shortest path algorithm, the network is subjected to layout fine adjustment under the condition of not changing the proportion of various link types, so that the comprehensive index of the whole network based on the average communication delay and hop count of service distribution and traffic is better.
6. The method for designing a space-based network topology based on average traffic performance according to claim 1, wherein a satellite number-to-proportion difference satisfying each orbit is not less than 1 when the set value is set.
7. A terminal, the terminal comprising: memory, a processor and an average traffic performance based space-based network topology design program stored on the memory and executable on the processor, which when executed by the processor implements the steps of the average traffic performance based space-based network topology design method according to any of claims 1-6.
8. A computer readable storage medium, characterized in that the computer readable storage medium stores a space-based network topology design program based on average traffic performance, which when executed by a processor, implements the steps of the space-based network topology design method based on average traffic performance according to any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210793014.8A CN115378863B (en) | 2022-05-18 | 2022-05-18 | Space-based network topology design method based on average service performance and related equipment |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210536919.7A CN114640619B (en) | 2022-05-18 | 2022-05-18 | Space-based network topology design method based on average communication distance and related equipment |
| CN202210793014.8A CN115378863B (en) | 2022-05-18 | 2022-05-18 | Space-based network topology design method based on average service performance and related equipment |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210536919.7A Division CN114640619B (en) | 2022-05-18 | 2022-05-18 | Space-based network topology design method based on average communication distance and related equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115378863A CN115378863A (en) | 2022-11-22 |
| CN115378863B true CN115378863B (en) | 2023-04-25 |
Family
ID=81953307
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210536919.7A Active CN114640619B (en) | 2022-05-18 | 2022-05-18 | Space-based network topology design method based on average communication distance and related equipment |
| CN202210793014.8A Active CN115378863B (en) | 2022-05-18 | 2022-05-18 | Space-based network topology design method based on average service performance and related equipment |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210536919.7A Active CN114640619B (en) | 2022-05-18 | 2022-05-18 | Space-based network topology design method based on average communication distance and related equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN114640619B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105897329A (en) * | 2016-06-08 | 2016-08-24 | 大连大学 | Multi-service routing optimization method of LEO satellite network based on multi-objective decisions |
| CN111953512A (en) * | 2020-07-02 | 2020-11-17 | 西安电子科技大学 | Construction method, system and application of Mobius constellation topology configuration facing Walker constellation |
| CN113078940A (en) * | 2021-03-29 | 2021-07-06 | 中山大学 | Gateway station site selection method and system of broadband low-orbit satellite communication system |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8982856B2 (en) * | 1996-12-06 | 2015-03-17 | Ipco, Llc | Systems and methods for facilitating wireless network communication, satellite-based wireless network systems, and aircraft-based wireless network systems, and related methods |
| US7346056B2 (en) * | 2002-02-01 | 2008-03-18 | Fujitsu Limited | Optimizing path selection for multiple service classes in a network |
| CN106792961A (en) * | 2016-11-18 | 2017-05-31 | 华东师范大学 | A kind of double-deck topology method based on satellite communication network design |
| US10374695B2 (en) * | 2017-05-26 | 2019-08-06 | Loon Llc | Temporospatial software-defined networking for NGSO satellite networks |
| CN108282217A (en) * | 2017-12-05 | 2018-07-13 | 中国电子科技集团公司电子科学研究院 | Satellite Networking method based on analysis of networks topology and storage medium |
| EP3629627A1 (en) * | 2018-09-27 | 2020-04-01 | GomSpace A/S | Routing method for satellite constellations based on hop-by-hop autonomous decisions and minimizing the use of inter-plane links |
-
2022
- 2022-05-18 CN CN202210536919.7A patent/CN114640619B/en active Active
- 2022-05-18 CN CN202210793014.8A patent/CN115378863B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105897329A (en) * | 2016-06-08 | 2016-08-24 | 大连大学 | Multi-service routing optimization method of LEO satellite network based on multi-objective decisions |
| CN111953512A (en) * | 2020-07-02 | 2020-11-17 | 西安电子科技大学 | Construction method, system and application of Mobius constellation topology configuration facing Walker constellation |
| CN113078940A (en) * | 2021-03-29 | 2021-07-06 | 中山大学 | Gateway station site selection method and system of broadband low-orbit satellite communication system |
Non-Patent Citations (1)
| Title |
|---|
| 张泰江 ; 李勇军 ; 赵尚弘 ; .基于GEO/LEO双层卫星网络的路由算法优化设计.计算机工程.2020,(第07期),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114640619A (en) | 2022-06-17 |
| CN114640619B (en) | 2022-08-09 |
| CN115378863A (en) | 2022-11-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bögl et al. | The school bus routing and scheduling problem with transfers | |
| CN109391645B (en) | Block chain lightweight processing method, block chain node and storage medium | |
| CN110868434B (en) | Block chain consensus method and system of multilayer fragment architecture | |
| CN104617985B (en) | Power telecom network line optimization method and device based on ant group algorithm | |
| CN101635114A (en) | Method and system for updating road codes and map data server | |
| US8682583B2 (en) | Route search system | |
| CN103379032A (en) | Acquisition method and device for cross-domain end-to-end route and secondary route computation element | |
| CN104809601A (en) | Express delivery mutual aid system based on electronic map | |
| CN110490381B (en) | Bus trunk line planning method based on mixed integer planning | |
| CN109816361A (en) | A kind of block chain takes signature transfer account method without miner | |
| CN102404818A (en) | Method for generating and updating routing list of satellite network | |
| CN115378863B (en) | Space-based network topology design method based on average service performance and related equipment | |
| Liu et al. | RFID: Towards low latency and reliable DAG task scheduling over dynamic vehicular clouds | |
| Manshadi et al. | Strategic behavior of in-motion wireless charging aggregators in the electricity and transportation networks | |
| CN116989819A (en) | Path determination method and device based on model solution | |
| CN109963316B (en) | Multipath routing method and equipment for mobile satellite network | |
| CN101616085A (en) | A kind of constraint route generating method and device | |
| Zhang et al. | Resilience of space information network based on combination of complex networks and hypergraphs | |
| CN116934365A (en) | Semi-dynamic traffic flow-based method for participating in energy market bidding by charging station operators | |
| CN115333606B (en) | Distributed coded data downloading and repairing method for low-orbit constellation storage network | |
| Lin et al. | Scheduling algorithms for time-constrained big-file transfers in the Internet of Vehicles | |
| Ge et al. | Dynamic hierarchical caching resource allocation for 5G-ICN slice | |
| CN103716404A (en) | Remote data integrity authentication data structure in cloud environment and implement method thereof | |
| CN105591773B (en) | Method, device and system for concurrent processing of service creation and increment discovery | |
| CN108551439A (en) | A kind of improved method and device of policy template application |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |