CN117240346A - Low-orbit satellite network load balancing routing method, device, equipment and medium - Google Patents
Low-orbit satellite network load balancing routing method, device, equipment and medium Download PDFInfo
- Publication number
- CN117240346A CN117240346A CN202311433969.3A CN202311433969A CN117240346A CN 117240346 A CN117240346 A CN 117240346A CN 202311433969 A CN202311433969 A CN 202311433969A CN 117240346 A CN117240346 A CN 117240346A
- Authority
- CN
- China
- Prior art keywords
- satellite
- hop count
- hop
- track
- calculating
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 235000008694 Humulus lupulus Nutrition 0.000 claims abstract description 45
- 230000005540 biological transmission Effects 0.000 claims abstract description 41
- 238000009825 accumulation Methods 0.000 claims abstract description 13
- 238000012216 screening Methods 0.000 claims description 9
- 238000003860 storage Methods 0.000 claims description 9
- 238000004590 computer program Methods 0.000 claims description 7
- 238000004364 calculation method Methods 0.000 claims description 5
- 230000001174 ascending effect Effects 0.000 claims description 4
- 238000005457 optimization Methods 0.000 claims description 3
- 238000002360 preparation method Methods 0.000 claims description 3
- 238000012546 transfer Methods 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 14
- 238000012545 processing Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000009826 distribution Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 239000004020 conductor Substances 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000644 propagated effect Effects 0.000 description 1
- 230000000630 rising effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- 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 application provides a low-orbit satellite network load balancing routing method, a device, equipment and a medium, wherein the method comprises the following steps: step 1, calculating the number of hops between track surfaces and the number of hops in track surfaces; step 2, calculating the minimum comprehensive hop count of the link according to the hop count between track surfaces and the hop count in the track surfaces, and determining the propagation direction between the source satellite and the target satellite according to the minimum comprehensive hop count; step 3, determining a plurality of candidate satellites in the propagation direction of the current satellite, calculating the hop count time delay backlog from the candidate satellites to the target satellite, calculating the accumulation and pressure difference between each candidate satellite and the current satellite according to the hop count time delay backlog, and calculating the minimum comprehensive hop count from each candidate satellite to the target satellite; step 4, selecting a next-hop satellite from the candidate satellites according to the differential pressure and the minimum comprehensive hop count, and distributing transmission rate for the data stream; and 5, repeatedly executing the steps 2 to 4, taking the next-hop satellite as the current satellite of the lower wheel, and forming a transmission path after reaching the target satellite.
Description
Technical Field
The present application relates to the field of satellite communications technologies, and in particular, to a low-orbit satellite network load balancing routing method, apparatus, device, and medium.
Background
The satellite network has the characteristics of wide coverage and large communication capacity, becomes an important component of the heaven-earth integrated network, but with the continuous expansion of the scale of users, the problem of unbalanced load of the low-orbit satellite caused by time burstiness of network traffic and non-uniformity of geographic distribution of the users is more and more remarkable.
In the related technology, various routing strategies are provided aiming at the problem of low orbit satellite network load balancing, traditional strategies such as a state-aware balancing strategy, a hybrid global-local balancing strategy and a predictive balancing strategy are focused on the design of a centralized routing scheme of a satellite network, and resource unbalance under the condition of network load is difficult to process; the backpressure routing method processes routing traffic through congestion gradients of data packet queues among nodes, can fit a multi-hop transmission mechanism followed by data packets in a low-orbit satellite network, but the low-orbit satellite network topology is a Manhattan network, the nodes in the network are far away, huge end-to-end delay and calculation storage overhead are caused, and processing delay can be ignored when only considering the distance in an inclined orbit constellation.
By combining the analysis of the development status in the technical field, the scheme in the prior art lacks a load balancing routing strategy for considering the processing delay backlog related to the residual hop count.
Disclosure of Invention
The application aims to provide a low-orbit satellite network load balancing routing method, device, equipment and medium, and aims to solve the problems in the prior art.
According to a first aspect of an embodiment of the present application, there is provided a low-orbit satellite network load balancing routing method, including:
step 1, calculating the track surface hop count and track surface hop count of a link between a source satellite and a destination satellite;
step 2, calculating the minimum comprehensive hop count of the link according to the hop count between track surfaces and the hop count in the track surfaces, and determining the propagation direction between the source satellite and the target satellite according to the minimum comprehensive hop count;
step 3, determining a plurality of candidate satellites of the next hop of data transmission in the propagation direction of the current satellite, calculating the hop count time delay backlog from the candidate satellite to the target satellite, calculating the accumulation and difference between each candidate satellite and the current satellite according to the hop count time delay backlog, and calculating the minimum comprehensive hop count from each candidate satellite to the target satellite;
step 4, selecting a next-hop satellite from the candidate satellites according to the product pressure difference and the minimum comprehensive hop count, and distributing the transmission rate from the current satellite to the next-hop satellite for data stream;
and 5, repeatedly executing the steps 2 to 4, taking the next-hop satellite as the current satellite executed in the next round, and forming a transmission path after reaching the target satellite.
According to a second aspect of an embodiment of the present application, there is provided a low-orbit satellite network load balancing routing device, including:
the preparation module is used for calculating the inter-track-plane hop count and the intra-track-plane hop count of the link between the source satellite and the destination satellite;
the propagation direction determining module is used for calculating the minimum comprehensive hop count of the link according to the hop count between the track surfaces and the hop count in the track surfaces, and determining the propagation direction between the source satellite and the destination satellite according to the minimum comprehensive hop count;
the pressure difference calculation module is used for determining a plurality of candidate satellites of the next hop of data transmission in the propagation direction of the current satellite, calculating the hop count time delay backlog from the candidate satellite to the target satellite, calculating the pressure difference between each candidate satellite and the current satellite according to the hop count time delay backlog, and calculating the minimum comprehensive hop count from each candidate satellite to the target satellite;
the next hop selection module is used for selecting a next hop satellite from the candidate satellites according to the product pressure difference and the minimum comprehensive hop number, and distributing the transmission rate from the current satellite to the next hop satellite for data flow;
the iteration module is used for repeatedly calling the propagation direction determining module, the backlog difference calculating module and the next hop selecting module, taking the next hop satellite as the current satellite executed in the next round, and forming a transmission path after reaching the target satellite.
According to a third aspect of an embodiment of the present application, there is provided an electronic apparatus including: a memory, a processor, and a computer program stored on the memory and executable on the processor, which when executed by the processor, performs the steps of the low-orbit satellite network load balancing routing method as provided in the first aspect of the present disclosure.
According to a fourth aspect of embodiments of the present application, there is provided a computer readable storage medium having stored thereon a program for implementing information transfer, which when executed by a processor implements the steps of the low-orbit satellite network load balancing routing method provided in the first aspect of the present disclosure.
The technical scheme provided by the embodiment of the application has the following beneficial effects: determining the propagation direction of the data transmission avoids a large amount of computation time; the result of the next hop satellite screening is dynamically determined through the accumulation pressure difference and the minimum comprehensive hop count, wherein the accumulation of the hop count time delay for calculating the accumulation pressure difference considers the accumulation of the processing time delay of each hop, so that the dynamic screening and rate distribution of the next hop satellite are more accurate and reasonable, the balance of the network flow overhead of the low orbit satellite is finally realized, and the network congestion under the high load condition is relieved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
For a clearer description of one or more embodiments of the present description or of the solutions of the prior art, the drawings that are necessary for the description of the embodiments or of the prior art will be briefly described, it being apparent that the drawings in the description that follow are only some of the embodiments described in the description, from which, for a person skilled in the art, other drawings can be obtained without inventive faculty.
FIG. 1 is a flow chart of a low-orbit satellite network load balancing routing method according to an embodiment of the present application;
fig. 2 is a schematic diagram of a low orbit satellite network constellation configuration according to an embodiment of the present application;
FIG. 3 is a schematic diagram of an inter-satellite link according to an embodiment of the application;
fig. 4 is a schematic diagram of a low-orbit giant constellation undershot trajectory according to an embodiment of the present application;
FIG. 5 is a schematic diagram of hop count delay backlog computation according to an embodiment of the present application;
FIG. 6 is a schematic illustration of rectangular area formation in accordance with an embodiment of the present application;
FIG. 7 is a schematic diagram of a low-orbit satellite network load balancing routing device according to an embodiment of the present application;
fig. 8 is a schematic diagram of an electronic device according to an embodiment of the application.
Detailed Description
In order to enable a person skilled in the art to better understand the technical solutions in one or more embodiments of the present specification, the technical solutions in one or more embodiments of the present specification will be clearly and completely described below with reference to the drawings in one or more embodiments of the present specification, and it is obvious that the described embodiments are only some embodiments of the present specification, not all embodiments. All other embodiments, which can be made by one or more embodiments of the present disclosure without inventive faculty, are intended to be within the scope of the present disclosure.
Method embodiment
According to an embodiment of the present application, a low-orbit satellite network load balancing routing method is provided, and fig. 1 is a flowchart of the low-orbit satellite network load balancing routing method according to the embodiment of the present application, as shown in fig. 1, the low-orbit satellite network load balancing routing method according to the embodiment of the present application specifically includes:
in step S110, in a predetermined low-orbit satellite constellation configuration, the inter-orbit plane hop count and intra-orbit plane hop count of the link between the source satellite and the destination satellite are calculated, and fig. 2 is a schematic diagram of a low-orbit satellite network constellation configuration according to an embodiment of the present application, as shown in fig. 2, in which the embodiment of the present application uses a Walker-delta constellation, and is composed of N inclined orbit planes. The method specifically comprises the following steps:
the longitude difference of the rising intersection point between the source satellite and the destination satellite is calculated by equation 1:
ΔL 0 ＝(L 0,2 -L 0,1 )mod 2π∈[0,2π]equation 1;
wherein DeltaL 0 A longitude difference L representing the coverage of the orbit surface of the destination satellite from the orbit surface of the source satellite node to the east 0,1 Longitude value of up-cross point representing source satellite, L 0,2 The longitude value of the intersection point of the ascending, mod, representing the target satellite is a function of the remainder.
By calculating the ratio of the longitude difference to the adjacent direction longitude difference, the western track inter-face hop count and the eastern track inter-face hop count are obtained, and since each hop from one plane to the next covers an angle ΔΩ, the track inter-face hop count is calculated using equation 2:
wherein,indicates the number of hops between the western track surfaces, < >>Represents the number of hops between the eastern track surfaces, ΔΩ represents the right-way difference between the ascending points of the adjacent track surfaces, Δl 0 Longitude angle, which represents the coverage of the track surface of the destination satellite from the track surface of the source satellite node to the east>The variable x is rounded to the nearest integer.
Calculating the phase difference between the source satellite and the destination satellite, wherein the phase angle of each jump in-plane jump increases by ΔΦ, the phase angle of each jump in-plane jump increases by Δf, fig. 3 is a schematic diagram of an inter-satellite link according to an embodiment of the present application, as shown in fig. 3, the phase difference between adjacent satellites in adjacent orbits is Δf, fig. 4 is a schematic diagram of a low-orbit giant constellation sub-satellite trajectory according to an embodiment of the present application, as shown in fig. 4, illustrating the schematic diagrams of the phase angles corresponding to the source satellite and the destination satellite, and using formula 3 to represent the phase angle of the destination satellite:
wherein u is j Indicating the phase angle of the target satellite, u i Representing the source satellite phase angle, the phase angle difference is calculated to obtain the number of in-plane hops, i.e. Δu=u j -u i ，Expressing the track in-plane jump number in the northeast direction, the eastbound in-plane phase difference and the western in-plane phase difference were calculated using equation 4:
because the satellite runs on the orbit in two modes, namely uplink and downlink, the uplink is from southwest to northwest, the downlink is from northwest to southwest, and the track in-plane hop numbers in northwest, northeast, southwest and southwest directions are obtained according to the phase difference through a formula 5:
wherein,track number in plane indicating northwest direction,/->Indicates the number of hops in the track plane in the northeast direction,track in-plane hop count in southwest direction,/->Indicating the number of hops in the track plane in the southwest direction.
In step S120, the minimum total number of hops of the link is calculated based on the number of hops between the track surfaces and the number of hops in the track surfaces, and the propagation direction between the source satellite and the destination satellite is determined based on the minimum total number of hops. The method specifically comprises the following steps:
adding the number of hops between the northwest track surfaces and the number of hops in the track surface corresponding to the northwest direction to obtain the comprehensive number of hops in the northwest direction; adding the number of hops between the southwest track surfaces and the number of hops in the track surface corresponding to the southwest direction to obtain the comprehensive number of hops in the southwest direction; adding the number of hops between the eastern track surfaces and the number of hops in the track surface corresponding to the northeast direction to obtain the comprehensive number of hops in the northeast direction; adding the number of hops between the eastern track surfaces and the number of hops in the track surface corresponding to the southeast direction to obtain the comprehensive number of hops in the southeast direction; the value with the smallest hop count is taken as the smallest integrated hop count through a formula 6:
wherein, H represents the minimum integrated hop count, and the direction corresponding to the minimum integrated hop count is taken as the propagation direction between the source satellite and the target satellite.
In step S130, a plurality of candidate satellites for next hop of data transmission are determined in the propagation direction of the current satellite, the hop count delay backlog from the candidate satellite to the target satellite is calculated, the difference of the backlog of each candidate satellite and the current satellite is calculated according to the hop count delay backlog, and the minimum comprehensive hop count from each candidate satellite to the target satellite is calculated. The method specifically comprises the following steps:
each candidate satellite has a plurality of data streams to the target satellite, and the hop count and time delay backlog of the different data streams from the candidate satellite to the target satellite is calculated through a formula 7:
where i denotes the data stream index, b denotes the index of the candidate satellite,representing the hop count delay backlog of data stream i at time t on candidate satellite b, +.>Representing the number of packets in data stream i at candidate satellite b at time t, H (p) representing the hop delay from the satellite node to the destination satellite, < >>A set of packets representing a data stream i at a satellite node, p representing a packet of data.
Taking the difference between the hop count time delay backlog of the current satellite data stream and the hop count time delay backlog of the data stream corresponding to the alternative satellite to obtain the difference value corresponding to each data stream, calculating the backlog difference between each alternative satellite and the current satellite through a formula 8, namely selecting the data stream capable of obtaining the maximum difference value from each alternative satellite, and taking the backlog difference corresponding to the data stream as the backlog difference between the alternative satellite and the current satellite:
wherein,representing the backlog difference between candidate satellite b and current satellite a, max representing the selected maximum, ++>Representing the hop count delay backlog of data stream i at time t on the current satellite, i (a, b) representing data stream i on link (a, b).
In step S140, a next-hop satellite is selected from the candidate satellites according to the product pressure difference and the minimum integrated hop count, and a transmission rate from the current satellite to the next-hop satellite is allocated to the data stream. The method specifically comprises the following steps:
screening out the candidate satellite with the minimum comprehensive hop value, and taking the candidate satellite as the next hop satellite if only one candidate satellite is screened out;
and if a plurality of candidate satellites are screened, taking any one of the candidate satellites with the largest pressure difference with the current satellite as the next-hop satellite.
Fig. 5 is a schematic diagram of hop count delay backlog calculation according to an embodiment of the present application, as shown in fig. 5, when a data packet arrives at node a, one of the data packets needs to be determined B, E, F as a next hop satellite, and a data packet queue and a virtual hop count delay backlog queue are maintained in each satellite node at the same time, so as to calculate a hop count delay backlog, and the minimum comprehensive hop count from node B to destination node d is minimum, so that candidate satellite B is taken as the next hop satellite.
If the minimum comprehensive hops from the satellite B and the satellite F to the destination node are assumed to be minimum, the hop count time delay backlog from the satellite B to the destination satellite is 4, the hop count time delay backlog from the satellite F to the destination satellite is 5, and the hop count time delay backlog from the current satellite to the destination satellite is 6, so that the product pressure difference between the satellite A and the satellite B, F is 2 and 1 respectively, and the satellite B is taken as the next hop satellite.
The transmission rate from the current satellite to the next hop satellite is allocated for the data stream, the allocated transmission rate satisfying equation 9:
wherein r is ab (t) represents the transmission rate allocated on the link (a, b) for the data stream to be allocated, where r ab (t)∈Γ s(t) ，Γ s(t) Including all available transmission rate matrices in the network topology, maximum represents maximum optimization and N represents the number of satellite nodes in the low orbit satellite network.
In step S150, steps S120 to S140 are repeatedly performed, and the next-hop satellite is used as the current satellite to be executed next, and a transmission path is formed after reaching the target satellite.
The method further comprises the steps of:
in step S160, a rectangular area in which data can be propagated is formed according to the source satellite, the destination satellite and the transmission path, fig. 6 is a schematic diagram of forming a rectangular area in which the available propagation distance is limited in the rectangular area formed by the source node S and the destination node d, n represents one of the satellite nodes, and b represents the next hop corresponding to the node n, as shown in fig. 6.
In summary, in view of the problems existing in the present situation, the above technical solution of the present application provides a low-orbit satellite network load balancing routing method, and the propagation direction of data transmission is predetermined to avoid a lot of computation time consumption; the result of the next hop satellite screening is dynamically determined through the accumulation difference and the minimum comprehensive hop count, wherein the accumulation of the processing time delay of each hop is considered by the hop count time delay backlog for calculating the accumulation difference, and compared with the situation that only the distance between nodes is considered in the inclined orbit constellation, the processing time delay is considered more accurately, so that the dynamic screening and the rate allocation of the next hop satellite are more reasonable; the range of the data packet which can be transmitted is formed after the propagation path is obtained, network delay caused by overlarge propagation area range is avoided, link redundancy caused by Manhattan network characteristics is reduced, balance of low-orbit satellite network traffic overhead is finally realized, and network congestion under high-load conditions is relieved.
Device embodiment
According to an embodiment of the present application, a low-orbit satellite network load balancing routing device is provided, and fig. 7 is a schematic diagram of the low-orbit satellite network load balancing routing device according to the embodiment of the present application, as shown in fig. 7, where the low-orbit satellite network load balancing routing device according to the embodiment of the present application specifically includes:
a preparation module 70 is provided for calculating the inter-track-plane hops and intra-track-plane hops of the link between the source satellite and the destination satellite. The method is particularly used for:
calculating the longitude difference of the ascending intersection point between the source satellite and the target satellite, and obtaining the western track inter-plane hop count and the eastern track inter-plane hop count by calculating the ratio of the longitude difference to the adjacent direction longitude difference;
and calculating the phase difference between the source satellite and the target satellite, and obtaining the track in-plane hops in the northwest direction, the northeast direction, the southwest direction and the southwest direction according to the phase difference.
The propagation direction determining module 72 is configured to calculate a minimum integrated hop count of the link according to the inter-track-plane hop count and the intra-track-plane hop count, and determine a propagation direction between the source satellite and the destination satellite according to the minimum integrated hop count. The method is particularly used for:
adding the number of hops between the northwest track surfaces and the number of hops in the track surface corresponding to the northwest direction to obtain the comprehensive number of hops in the northwest direction; adding the number of hops between the southwest track surfaces and the number of hops in the track surface corresponding to the southwest direction to obtain the comprehensive number of hops in the southwest direction; adding the number of hops between the eastern track surfaces and the number of hops in the track surface corresponding to the northeast direction to obtain the comprehensive number of hops in the northeast direction; adding the number of hops between the eastern track surfaces and the number of hops in the track surface corresponding to the southeast direction to obtain the comprehensive number of hops in the southeast direction; and taking the value with the minimum comprehensive hop count as the minimum comprehensive hop count, and taking the direction corresponding to the minimum comprehensive hop count as the propagation direction between the source satellite and the target satellite.
The backlog calculation module 74 is configured to determine a plurality of candidate satellites for a next hop of data transmission in a propagation direction of the current satellite, calculate a backlog of a hop count time delay from the candidate satellite to the target satellite, calculate a backlog of each candidate satellite and the current satellite according to the backlog of the hop count time delay, and calculate a minimum integrated hop count from each candidate satellite to the target satellite. The method is particularly used for:
calculating the hop count time delay backlog of different data streams from the candidate satellite to the target satellite through a formula 1:
where i denotes the data stream index, b denotes the index of the candidate satellite,representing the hop count delay backlog of data stream i at time t on candidate satellite b, +.>Representing the number of packets in data stream i at candidate satellite b at time t, H (p) representing the hop delay from the satellite node to the destination satellite, < >>A set of packets representing a data stream i at a satellite node, p representing a packet of data.
The hop count time delay backlog of the current satellite data stream is differenced with the hop count time delay backlog of the data stream corresponding to the alternative satellite, so that the difference value corresponding to each data stream is obtained, and the backlog difference between each alternative satellite and the current satellite is calculated through a formula 2:
wherein,representing the backlog difference between candidate satellite b and current satellite a, max representing the selected maximum, ++>Representing the hop count delay backlog of data stream i at time t on the current satellite, i (a, b) representing data stream i on link (a, b).
The next hop selection module 76 is configured to select a next hop satellite from the candidate satellites according to the integrated pressure difference and the minimum integrated hop count, and allocate a transmission rate from the current satellite to the next hop satellite for the data stream. The method is particularly used for:
screening out the candidate satellite with the minimum comprehensive hop value, and taking the candidate satellite as the next hop satellite if only one candidate satellite is screened out; and if a plurality of candidate satellites are screened, taking any one of the candidate satellites with the largest pressure difference with the current satellite as the next-hop satellite.
The transmission rate from the current satellite to the next hop satellite is allocated for the data stream, and the allocated transmission rate satisfies equation 3:
wherein r is ab (t) represents the transmission rate allocated on the link (a, b) for the data stream to be allocated, where r ab (t)∈Γ s(t) ，Γ s(t) Including all available transmission rate matrices in the network topology, maximum represents maximum optimization and N represents the number of satellite nodes in the low orbit satellite network.
The iteration module 78 is configured to repeatedly invoke the propagation direction determining module 70, the backlog difference calculating module 72, and the next hop selecting module 74, and take the next hop satellite as the current satellite executed in the next round, and form a transmission path after reaching the target satellite.
The apparatus further comprises:
the region forming module 710 is configured to form a rectangular region in which data can propagate according to a source satellite, a destination satellite, and a transmission path.
In summary, in view of the problems existing in the present situation, the above technical solution of the present application provides a low-orbit satellite network load balancing routing device, where determining the propagation direction of data transmission in advance avoids a lot of computation time consumption; the result of the next hop satellite screening is dynamically determined through the accumulation difference and the minimum comprehensive hop count, wherein the accumulation of the processing time delay of each hop is considered by the hop count time delay backlog for calculating the accumulation difference, and compared with the situation that only the distance between nodes is considered in the inclined orbit constellation, the processing time delay is considered more accurately, so that the dynamic screening and the rate allocation of the next hop satellite are more reasonable; the range of the data packet which can be transmitted is formed after the propagation path is obtained, network delay caused by overlarge propagation area range is avoided, link redundancy caused by Manhattan network characteristics is reduced, balance of low-orbit satellite network traffic overhead is finally realized, and network congestion under high-load conditions is relieved.
Electronic device embodiment
Fig. 8 is a schematic diagram of an electronic device according to an embodiment of the application. The electronic device 800 may include at least one processor 810 and memory 820. Processor 810 may execute instructions stored in memory 820. The processor 810 is communicatively coupled to the memory 820 via a data bus. In addition to memory 820, processor 810 may also be communicatively coupled to input device 830, output device 840, and communication device 850 via a data bus.
The processor 810 may be any conventional processor, such as a commercially available CPU. The processor may also include, for example, an image processor (Graphic Process Unit, GPU), a field programmable gate array (Field Programmable Gate Array, FPGA), a System On Chip (SOC), an application specific integrated Chip (Application Specific Integrated Circuit, ASIC), or a combination thereof.
The memory 820 may be implemented by any type or combination of volatile or nonvolatile memory devices such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disk.
In the embodiment of the present disclosure, the memory 820 stores executable instructions, and the processor 810 may read the executable instructions from the memory 820 and execute the instructions to implement all or part of the steps of the low-orbit satellite network load balancing routing method in any of the above-described exemplary embodiments.
Computer-readable storage medium embodiments
In addition to the methods and apparatus described above, exemplary embodiments of the present disclosure may also be a computer program product or a computer-readable storage medium storing the computer program product, the computer program product including computer program instructions executable by a processor to implement all or part of the steps described in the low-orbit satellite network load balancing routing method of any of the exemplary embodiments described above.
The computer program product may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages, as well as scripting languages (e.g., python). The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server.
A computer readable storage medium may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may include, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the readable storage medium include: a Static Random Access Memory (SRAM), an electrically erasable programmable read-only memory (EEPROM), an erasable programmable read-only memory (EPROM), a programmable read-only memory (PROM), a read-only memory (ROM), a magnetic memory, a flash memory, a magnetic or optical disk, or any suitable combination of the foregoing having one or more electrical conductors.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the application.
Claims (10)
1. A low-orbit satellite network load balancing routing method, comprising:
step 1, calculating the track surface hop count and track surface hop count of a link between a source satellite and a destination satellite;
step 2, calculating the minimum comprehensive hop count of a link according to the hop count between the track surfaces and the hop count in the track surfaces, and determining the propagation direction between a source satellite and a target satellite according to the minimum comprehensive hop count;
step 3, determining a plurality of alternative satellites of the next hop of data transmission in the propagation direction of the current satellite, calculating the hop count time delay backlog from the alternative satellites to the target satellite, calculating the accumulation and difference between each alternative satellite and the current satellite according to the hop count time delay backlog, and calculating the minimum comprehensive hop count from each alternative satellite to the target satellite;
step 4, selecting a next-hop satellite from the candidate satellites according to the product pressure difference and the minimum comprehensive hop count, and distributing a transmission rate for transmitting from a current satellite to the next-hop satellite for data streams;
and 5, repeatedly executing the step 2 to the step 4, taking the next-hop satellite as the current satellite executed in the next round, and forming a transmission path after reaching the target satellite.
2. The method according to claim 1, wherein the method further comprises: and forming a rectangular area in which data can be transmitted according to the source satellite, the destination satellite and the transmission path.
3. The method of claim 1, wherein the calculating the inter-track-plane hops and intra-track-plane hops of the link between the source satellite and the destination satellite comprises:
calculating the longitude difference of the ascending intersection point between the source satellite and the destination satellite, and obtaining the western track inter-plane hop count and the eastern track inter-plane hop count by calculating the ratio of the longitude difference to the adjacent direction longitude difference;
and calculating the phase difference between the source satellite and the target satellite, and obtaining the track in-plane hops in the northwest direction, the northeast direction, the southwest direction and the southwest direction according to the phase difference.
4. A method according to claim 3, wherein said calculating a minimum integrated hop count for the link based on said inter-track-plane hop count and said intra-track-plane hop count, and determining a propagation direction between the source satellite and the destination satellite based on said minimum integrated hop count comprises:
adding the inter-track-surface hop count in the west direction and the intra-track-surface hop count corresponding to the northwest direction to obtain the comprehensive hop count in the northwest direction; adding the inter-track-plane hops in the southwest direction and the intra-track-plane hops corresponding to the southwest direction to obtain the comprehensive hops in the southwest direction; adding the inter-track-face hop count and the intra-track-face hop count corresponding to the northeast direction to obtain the comprehensive hop count in the northeast direction; adding the inter-track-face hop count in the southeast direction with the intra-track-face hop count corresponding to the southeast direction to obtain the comprehensive hop count in the southeast direction; and taking the value with the minimum comprehensive hop count as the minimum comprehensive hop count, and taking the direction corresponding to the minimum comprehensive hop count as the propagation direction between the source satellite and the destination satellite.
5. The method of claim 1, wherein calculating the hop count delay backlog of the candidate satellites to the destination satellite, and calculating the backlog difference between each candidate satellite and the current satellite based on the hop count delay backlog specifically comprises:
calculating the hop count time delay backlog of different data streams from the candidate satellite to the target satellite through a formula 1:
where i denotes the data stream index, b denotes the index of the candidate satellite,representing the hop count delay backlog of data stream i at time t on candidate satellite b, +.>Representing the number of packets in data stream i at candidate satellite b at time t, H (p) representing the hop delay from the satellite node to the destination satellite, < >>Packet set representing data flow i at satellite node, p representing a dataGrouping packets;
the hop count time delay backlog of the current satellite data stream is differenced with the hop count time delay backlog of the data stream corresponding to the alternative satellite, so that the difference value corresponding to each data stream is obtained, and the backlog difference between each alternative satellite and the current satellite is calculated through a formula 2:
wherein,representing the backlog difference between candidate satellite b and current satellite a, max representing the selected maximum, ++>Representing the hop count delay backlog of data stream i at time t on the current satellite, i (a, b) representing data stream i on link (a, b).
6. The method according to claim 1, wherein said selecting a next hop satellite from said candidate satellites based on said product pressure difference and said minimum integrated hop count, assigning a transmission rate for a data stream from a current satellite to said next hop satellite, comprises:
screening out the candidate satellite with the minimum comprehensive hop value, and taking the candidate satellite as the next hop satellite if only one candidate satellite is screened out; and if a plurality of candidate satellites are screened, taking any one of the candidate satellites with the largest pressure difference with the current satellite as the next-hop satellite.
7. The method of claim 5, wherein the assigning a transmission rate for the data stream from the current satellite to the next hop satellite comprises:
the transmission rate from the current satellite to the next hop satellite is allocated for the data stream, and the allocated transmission rate satisfies equation 3:
wherein,representing the backlog difference between the candidate satellite b and the current satellite a, r ab (t) represents the transmission rate allocated on the link (a, b) for the data stream to be allocated, where r ab (t)∈Γ s(t) ，Γ s(t) Including all available transmission rate matrices in the network topology, maximum represents maximum optimization and N represents the number of satellite nodes in the low orbit satellite network.
8. A low-orbit satellite network load balancing routing device, comprising:
the preparation module is used for calculating the inter-track-plane hop count and the intra-track-plane hop count of the link between the source satellite and the destination satellite;
the propagation direction determining module is used for calculating the minimum comprehensive hop count of the link according to the hop count between the track surfaces and the hop count in the track surfaces, and determining the propagation direction between the source satellite and the destination satellite according to the minimum comprehensive hop count;
the pressure difference calculation module is used for determining a plurality of alternative satellites of the next hop of data transmission in the propagation direction of the current satellite, calculating the hop count time delay backlog of the alternative satellites to the target satellite, calculating the pressure difference between each alternative satellite and the current satellite according to the hop count time delay backlog, and calculating the minimum comprehensive hop count of each alternative satellite to the target satellite;
the next hop selection module is used for selecting a next hop satellite from the candidate satellites according to the accumulated pressure difference and the minimum comprehensive hop count, and distributing a transmission rate from a current satellite to the next hop satellite for data flow;
and the iteration module is used for repeatedly calling the propagation direction determining module, the backlog difference calculating module and the next hop selecting module, taking the next hop satellite as a current satellite executed in the next round, and forming a transmission path after reaching a target satellite.
9. An electronic device, comprising: memory, a processor and a computer program stored on the memory and executable on the processor, which when executed by the processor, performs the steps of the low-orbit satellite network load balancing routing method according to any one of claims 1 to 7.
10. A computer readable storage medium, characterized in that it has stored thereon a program for implementing information transfer, which when executed by a processor implements the steps of the low-orbit satellite network load balancing routing method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311433969.3A CN117240346A (en) | 2023-10-31 | 2023-10-31 | Low-orbit satellite network load balancing routing method, device, equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311433969.3A CN117240346A (en) | 2023-10-31 | 2023-10-31 | Low-orbit satellite network load balancing routing method, device, equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117240346A true CN117240346A (en) | 2023-12-15 |
Family
ID=89086227
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311433969.3A Pending CN117240346A (en) | 2023-10-31 | 2023-10-31 | Low-orbit satellite network load balancing routing method, device, equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117240346A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6609002B1 (en) * | 1999-09-15 | 2003-08-19 | Hrl Laboratories, Llc | Method and apparatus for predictive QoS routing for broad band low earth satellite networks |
| CN111953399A (en) * | 2020-07-10 | 2020-11-17 | 东南大学 | Inter-satellite routing method in low-earth-orbit satellite communication network |
| US20230047613A1 (en) * | 2021-08-13 | 2023-02-16 | Ciena Corporation | Express mesh intersatellite optical coherent networking |
| CN116405102A (en) * | 2023-06-09 | 2023-07-07 | 中国人民解放军战略支援部队航天工程大学 | LEO constellation network end-to-end hop count calculation method and device |
| CN116708271A (en) * | 2023-07-11 | 2023-09-05 | 北京星移联信科技发展有限公司 | Inter-satellite routing method and device for low-orbit constellation network |
-
2023
- 2023-10-31 CN CN202311433969.3A patent/CN117240346A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6609002B1 (en) * | 1999-09-15 | 2003-08-19 | Hrl Laboratories, Llc | Method and apparatus for predictive QoS routing for broad band low earth satellite networks |
| CN111953399A (en) * | 2020-07-10 | 2020-11-17 | 东南大学 | Inter-satellite routing method in low-earth-orbit satellite communication network |
| US20230047613A1 (en) * | 2021-08-13 | 2023-02-16 | Ciena Corporation | Express mesh intersatellite optical coherent networking |
| CN116405102A (en) * | 2023-06-09 | 2023-07-07 | 中国人民解放军战略支援部队航天工程大学 | LEO constellation network end-to-end hop count calculation method and device |
| CN116708271A (en) * | 2023-07-11 | 2023-09-05 | 北京星移联信科技发展有限公司 | Inter-satellite routing method and device for low-orbit constellation network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kawamoto et al. | A traffic distribution technique to minimize packet delivery delay in multilayered satellite networks | |
| US5233604A (en) | Methods and apparatus for optimum path selection in packet transmission networks | |
| CN109257091B (en) | Global load balancing satellite-ground cooperative network networking device and method | |
| US9674073B2 (en) | Method and arrangement for route cost determination and selection with link cost interaction | |
| US7502371B2 (en) | Distributed connection admission-control | |
| AU2021104939A4 (en) | Method and device for allocating resources | |
| CN112272381B (en) | Satellite network task deployment method and system | |
| CN111130858A (en) | Dynamic multi-target virtual network mapping method under SD-WAN scene | |
| CN111447005A (en) | Link planning method and device for software defined satellite network | |
| CN116390164A (en) | Low orbit satellite network trusted load balancing routing method, system, equipment and medium | |
| RU2636665C1 (en) | Method of multipath routing using data traffic flow splitting | |
| CN116346208A (en) | SDN-based satellite network routing method and device and electronic equipment | |
| CN113259993A (en) | Cross-layer routing method and communication system based on MEO/LEO double-layer satellite network | |
| CN117240346A (en) | Low-orbit satellite network load balancing routing method, device, equipment and medium | |
| CN103236987A (en) | Improvement method of distributed routing algorithm for back propagation-based satellite | |
| Yan et al. | Local information-based congestion control scheme for space delay/disruption tolerant networks | |
| Kucukates et al. | Minimum flow maximum residual routing in LEO satellite networks using routing set | |
| Kawamoto et al. | Assessing packet delivery delay in multi-layered satellite networks | |
| CN117119043A (en) | Micro-service deployment method for edge network topology perception | |
| Zhu et al. | Improvement of contact graph routing algorithm in LEO satellite DTN network | |
| Thongpook | Load balancing of adaptive zone routing in ad hoc networks | |
| Anastasopoulos et al. | Call admission control scheme for multiclass services under rain fading for satellite networks | |
| Cain et al. | A" near-optimum" multiple path routing algorithm for space-based sdi networks | |
| Kuang et al. | Congestion avoidance routing algorithm for topology‐inhomogeneous low earth orbit satellite navigation augmentation network | |
| CN112867085B (en) | Topology information convergence method, device and system of satellite communication network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |