CN112566142B - QoS guarantee-based LEO satellite network reliability routing method - Google Patents

QoS guarantee-based LEO satellite network reliability routing method Download PDF

Info

Publication number
CN112566142B
CN112566142B CN202011389101.4A CN202011389101A CN112566142B CN 112566142 B CN112566142 B CN 112566142B CN 202011389101 A CN202011389101 A CN 202011389101A CN 112566142 B CN112566142 B CN 112566142B
Authority
CN
China
Prior art keywords
satellite
cost
link state
link
path
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
Application number
CN202011389101.4A
Other languages
Chinese (zh)
Other versions
CN112566142A (en
Inventor
王文滔
杨凡德
廖丹
简平
李航
李慧
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of Electronic Science and Technology of China
Peoples Liberation Army Strategic Support Force Aerospace Engineering University
Original Assignee
University of Electronic Science and Technology of China
Peoples Liberation Army Strategic Support Force Aerospace Engineering University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by University of Electronic Science and Technology of China, Peoples Liberation Army Strategic Support Force Aerospace Engineering University filed Critical University of Electronic Science and Technology of China
Priority to CN202011389101.4A priority Critical patent/CN112566142B/en
Publication of CN112566142A publication Critical patent/CN112566142A/en
Application granted granted Critical
Publication of CN112566142B publication Critical patent/CN112566142B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/22—Traffic simulation tools or models
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0268—Traffic management, e.g. flow control or congestion control using specific QoS parameters for wireless networks, e.g. QoS class identifier [QCI] or guaranteed bit rate [GBR]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0289—Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/04—Large scale networks; Deep hierarchical networks
    • H04W84/06—Airborne or Satellite Networks

Abstract

The invention discloses a QoS guarantee-based LEO satellite network reliability routing method, which is used for completing searching of inter-satellite routing paths by guiding the flow of a hot spot area to transfer to a non-hot spot area and designing strict QoS (quality of service) constraint during routing so as to ensure that the found paths have the optimal service quality, reduce the probability of satellite congestion, further reduce the packet loss rate and improve the reliability of routing forwarding paths by passing through a satellite with a light-weight load task as much as possible.

Description

QoS guarantee-based LEO satellite network reliability routing method
Technical Field
The invention belongs to the technical field of LEO satellite communication, and particularly relates to a design of a LEO satellite network reliability routing method based on QoS guarantee.
Background
With the rapid development of the spatial information technology, a Low Earth Orbit (LEO) satellite communication system plays an increasingly important role in the aspects of global communication, navigation positioning, weather prediction, disaster monitoring, military application and the like, and an inter-satellite routing algorithm serving as one of the key technologies of the LEO satellite communication network is a core factor for improving the performance of the whole satellite communication network. However, since the environment of the outer space satellite network is relatively harsh and complex, and conditions such as frequent and dynamic changes of network topology, unbalanced satellite load, electromagnetic interference, and easy failures of satellite nodes and links exist, an optimal routing path needs to be selected to complete efficient transmission of data packets between source and destination satellites in order to ensure reliable and effective communication service for ground users and obtain better user experience.
Disclosure of Invention
The invention aims to provide a reliable routing method of an LEO satellite network based on QoS guarantee, so that the LEO satellite network can provide a stable and reliable communication service with high quality experience for a user, and routing forwarding of data packets between source satellites and target satellites is completed.
The technical scheme of the invention is as follows: the LEO satellite network reliability routing method based on QoS guarantee comprises the following steps:
and S1, constructing the LEO satellite network, and periodically updating the link state information base of the whole network in the LEO satellite network.
S2, let LEO satellites in the LEO satellite network wait to trigger routing.
S3, judging whether the ground user has new call or call switching arrival, if yes, entering step S4, otherwise returning to step S2.
And S4, constructing a multi-constraint QoS optimal path routing model.
S5, utilizing the minimum bandwidth constraint of the link to carry out pruning pretreatment on the satellite topology, and simplifying the multi-constraint QoS optimal path routing model into a time delay constraint minimum path cost routing model.
S6, solving the delay constraint minimum path cost routing model according to the synthetic cost based Lagrange relaxation algorithm to obtain the optimal routing path p*。
S7, judging the optimal routing path p*If yes, the process proceeds to step S8, otherwise, the process proceeds to step S9.
S8, passing through the optimal routing path p*And finishing the inter-satellite reliable routing communication of the LEO satellite network, and ending the process.
And S9, rejecting the routing request and ending the process.
Further, step S1 includes the following substeps:
and S11, constructing the LEO satellite network by M multiplied by N LEO satellites, wherein M is the number of orbital planes of the LEO satellite network, and N is the number of satellites on each orbital plane.
And S12, selecting the orbital speaker satellite of each orbital plane.
And S13, collecting satellite link state reports of all other satellites in the corresponding orbital plane through the orbital speaker satellite of each orbital plane, and summarizing the satellite link state reports with the satellite link state reports to form the orbital plane link state report of the orbital plane.
And S14, transmitting the orbit plane link state report of the orbit plane to the adjacent orbit planes through the orbit speaker satellite of each orbit plane.
And S15, receiving the track plane link state reports from other track planes through the track speaker satellite of each track plane, and completing the construction of the link state information base of the whole network through collection.
And S16, each satellite receives the latest whole-network link state information base sent by the satellite of the orbit speaker on the orbit plane where the satellite is located, and the periodic updating of the whole-network link state information base is realized.
Further, step S13 includes the following substeps:
s131, in each orbit plane, calculating a satellite link state report of each satellite, and sending the satellite link state report to an adjacent satellite closest to the orbit speaker satellite.
And S132, after receiving the satellite link state report, the adjacent satellite judges whether the satellite link state report is received once, if so, the satellite link state report is discarded, the adjacent satellite continues to wait for receiving the satellite link state reports sent by other satellites, and otherwise, the step S133 is carried out.
S133, judging whether the satellite link state report of the adjacent satellite is sent or not, if so, only sending the satellite link state report received by the adjacent satellite to the next adjacent satellite, and entering the step S134, otherwise, sending the satellite link state report of the adjacent satellite and the satellite link state report received by the adjacent satellite to the next adjacent satellite together, and entering the step S134.
And S134, repeating the steps S131 to S133 until the satellite of the orbit speaker acquires the satellite link state reports of all other satellites in the orbit plane, and summarizing the satellite link state reports and the satellite link state reports to form the orbit plane link state report of the orbit plane.
Further, step S15 includes the following substeps:
and S151, receiving the orbital plane link state report from other orbital planes through each satellite in each orbital plane.
S152, determining whether the track surface link status report has been received, if yes, discarding the track surface link status report, returning to step S151 to continue waiting for receiving track surface link status reports from other track surfaces, otherwise, entering step S153.
S153, determining whether the satellite receiving the orbital plane link status report is the orbital speaker satellite of the orbital plane, if so, going to step S154, otherwise, forwarding the orbital plane link status report to the orbital speaker satellite of the orbital plane, and returning to step S151.
And S154, storing the track surface link state report and forwarding the track surface link state report to the next adjacent track surface.
And S155, repeating the steps S151 to S154 until the orbital speaker satellite of each orbital plane receives the orbital plane link state reports from all other orbital planes in the LEO satellite network, summarizing the orbital plane link state reports, and completing the construction of the link state information base of the whole network.
Further, the calculation formula of the satellite link status report is as follows:
Figure BDA0002811877170000031
the calculation formula of the track surface link state report is as follows:
p _ lsa (m) { S _ lsa (x) | x is a satellite on the orbital plane m }
Where S _ lsa (i) represents a link state report for satellite i,
Figure BDA0002811877170000032
represents the current logical address of the neighbor satellite x of the satellite i, 0 ≦ mx≤M-1,0≤nx≤N-1，TDixIndicating the existence of a link ISL between satellite i and its neighbor satellite xi→xThe Band (i, x) represents the available bandwidth of the link between the satellite i and its neighbor satellite x, γixRepresents the link cost correction factor between satellite i and its neighbor satellite x, P _ lsa (m) represents the link state report for orbital plane m, S _ lsa (x) represents the link state report for satellite x on orbital plane m.
Further, the calculation formula of the multi-constraint QoS optimal path routing model in step S4 is as follows:
min Cost(p)
Figure BDA0002811877170000033
Figure BDA0002811877170000034
where p (s, d) represents an available path p between the source satellite node s and the destination satellite node d, cost (p) represents a total cost value for the path p, and:
Figure BDA0002811877170000035
wherein CostijRepresenting a link cost function between satellite i and satellite jAnd, and:
Costij＝γij×TDij
wherein TDijIndicating the existence of a link between satellite i and satellite j
Figure BDA0002811877170000036
The calculation formula of the composite delay cost function is as follows:
TDij(t)＝PDij(t)+QDij(t)
wherein TDij(t) denotes a link
Figure BDA0002811877170000041
Total time delay of (PD)ij(t) denotes a link
Figure BDA0002811877170000042
Propagation delay of (QD)ij(t) denotes a link
Figure BDA0002811877170000043
And:
Figure BDA0002811877170000044
Figure BDA0002811877170000045
wherein
Figure BDA0002811877170000046
Representing the physical distance between a satellite i and a satellite j, c is the speed of light, t represents t time, delta t represents the time interval for updating the link state information base of the whole network by the LEO satellite network, q (y) represents the number of transmission packets in an output queue at time y, and PavgThe average length of the transmission packets in the output queue is shown, and the BW represents the link capacity between the satellites; TD (p) represents the cumulative delay of path p, TDmaxMaximum tolerated delay representing the user traffic requirements; band (R)(i, j) represents the available bandwidth of the link between satellite i and satellite j, and is calculated by the formula:
Figure BDA0002811877170000047
wherein
Figure BDA0002811877170000048
Representing the total bandwidth of the link between satellite i and satellite j,
Figure BDA0002811877170000049
indicating the bandwidth used by the link between satellite i and satellite j; band (p) denotes the actual available bandwidth of path p, BandminRepresenting the minimum required available bandwidth of the user communication service; gamma rayijAnd representing a link cost correction factor between the satellite i and the satellite j, wherein the calculation formula is as follows:
Figure BDA00028118771700000410
wherein latiIndicating the latitude, lon, of the satellite iiRepresenting the longitude of satellite i.
Further, step S5 includes the following substeps:
s51, using the Band with minimum requirement available bandwidth of user communication serviceminPerforming pruning pretreatment on inter-satellite links which do not meet the minimum bandwidth constraint of the links in the current global network state topological graph G (V, E) of the source node satellite to obtain the global network state topological graph G after the pruning pretreatment*(V*,E*) Wherein V and V*Each representing a set of satellite nodes, E and E, in a LEO satellite network*Each represents a collection of links in a LEO satellite network.
S52, global network state topological graph G after pruning pretreatment*(V*,E*) In the above, the multi-constraint QoS optimal path routing model is simplified into the delay constraint minimum path cost routing model:
p*＝min{Cost(p):p∈p(s,d)&TD(p)≤TDmax}
wherein p is*Representing the optimal routing path.
Further, step S6 includes the following substeps:
s61, constraining the time delay to the minimum path cost routing model p*Conversion into a routing model L*：
Figure BDA0002811877170000051
Wherein L (θ) represents a new linear function formed by absorbing the delay constraint into the objective function, and:
L(θ)＝min{Costθ(p)-θTDmax:p∈p(s,d)}
＝{Costθ(p):p∈p(s,d)}-θTDmax
where θ represents the Lagrangian multiplier, Costθ(p) represents the sum of the composite link costs contained by path p, and:
Figure BDA0002811877170000052
wherein Costθ＝Costij+θTDijRepresenting the composite link cost function.
S62, making Lagrange multiplier theta equal to 0, and making the link CostijAs the input of Dijkstra algorithm, calculating to obtain the shortest path pcost。
S63, judging shortest path pcostTime delay TD (p)cost) Whether TD (p) is satisfiedcost)≤TDmaxIf yes, the shortest path p iscostAs the optimal routing path p*Otherwise, the process proceeds to step S64.
S64, compounding time delay cost TDijCalculating to obtain the shortest path p for the input of Dijkstra algorithmTD。
S65, judging shortest path pTDTime delay TD (p)TD) Whether or not TD is satisfied(pTD)≤TDmaxIf yes, go to step S66, otherwise, go to the optimal routing path p*If not, the flow proceeds to step S7.
S66, replacing shortest path p by iterationcostAnd shortest path pTDFinding the shortest path pcostAnd the shortest path pTDOf the composite link Cost function CostθLagrange multiplier θ that takes the minimum value and makes the linear function L (θ) take the maximum value:
Figure BDA0002811877170000061
where Cost (p)cost) Representing shortest paths pcostCost value of, Cost (p)TD) Representing shortest paths pTDThe cost value of (2).
S67, substituting Lagrange multiplier theta into synthetic link Cost function CostθAnd synthesizing the link Cost function CostθAnd calculating to obtain the shortest path r as the input of the Dijkstra algorithm.
S68, judging sum Cost of composite link Cost of shortest path rθ(r) whether or not Cost is satisfiedθ(r)＝Costθ(pcost) If yes, the shortest path p isTDAs the optimal routing path p*Otherwise, the process proceeds to step S69.
S69, judging whether the time delay TD (r) of the shortest path r meets the condition that TD (r) is less than or equal to TDmaxIf yes, the shortest path r is taken as pTDOtherwise the shortest path r is taken as pcostUntil the optimal routing path p satisfying the condition is calculated, repeating the steps S66-S68*。
The invention has the beneficial effects that:
(1) the invention reduces the risk of all the invalid satellite routing functions in the local range by sharing the routing calculation pressure by the distributed satellite routing table calculation executors, so that the user can independently calculate the routing forwarding table by accessing the satellite (namely the source satellite).
(2) According to the invention, by guiding the flow of the hot spot region to transfer to the non-hot spot region, the global flow balance distribution is realized, the load pressure of the satellite flow of the whole network can be lightened, the probability of the satellite congestion is reduced, and the packet loss rate is reduced.
(3) The invention ensures the service quality of the search path by setting the high service quality QoS constraint, so that the congestion probability of the route path is extremely low, and the reliability in the route forwarding process is improved.
In conclusion, the invention enables the LEO satellite network to provide a stable and reliable communication service with high quality experience for users, thereby completing the routing forwarding of data packets between the source and target satellites.
Drawings
Fig. 1 is a flowchart illustrating a method for reliability routing of a LEO satellite network based on QoS guarantee according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of a Walker star constellation model according to an embodiment of the present invention.
Fig. 3 is a global hotspot zone profile provided by an embodiment of the invention.
Fig. 4 is a schematic diagram illustrating establishment of track plane routing state information according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will now be described in detail with reference to the accompanying drawings. It is to be understood that the embodiments shown and described in the drawings are merely exemplary and are intended to illustrate the principles and spirit of the invention, not to limit the scope of the invention.
Before describing particular embodiments of the present invention, some abbreviations that appear in the present invention are first explained in order to better understand the present invention:
LEO: low Earth Orbit, Low Earth Orbit;
QoS: quality of Service;
ISL: Inter-Satellite Link, Inter-Satellite Link;
s _ LSA: satellite Link State Advertisement, Satellite Link State report;
p _ LSA: plane Link State Advertisement, track Plane Link status report;
NSB: network State Base, full Network status information Base;
LARAC: lagrange Relaxation based Aggregated Cost, lagrangian Relaxation algorithm based on Cost-of-synthesis Cost.
The embodiment of the invention provides a QoS guarantee-based LEO satellite network reliability routing method, which comprises the following steps of S1-S9 as shown in FIG. 1:
and S1, constructing the LEO satellite network, and periodically updating the link state information base of the whole network in the LEO satellite network.
The step S1 includes the following substeps S11-S16:
and S11, constructing the LEO satellite network by M multiplied by N LEO satellites, wherein M is the number of orbital planes of the LEO satellite network, and N is the number of satellites on each orbital plane.
In the embodiment of the invention, a Walker star constellation model is used as an experimental scene to construct an LEO satellite network, as shown in figure 2, a total of M multiplied by N satellites are set in the satellite network, in order to simplify the routing addressing design problem caused by topology dynamic change due to periodic motion of the satellites, a logic address concept is introduced to mark the routing forwarding address of each satellite, and the logic address uses Sm,nWherein M represents the mth orbital plane, N represents the nth satellite on the mth orbital plane, and M is greater than or equal to 0 and less than or equal to M-1, N is greater than or equal to 0 and less than or equal to N-1, and M and N are positive integers. Based on the design concept of the logical address, after the periodic link state information of the satellite network is updated every time, the topology of the satellite network at the moment can be regarded as a static logical plane for calibrating the satellite routing address by the logical address, so that the design of a subsequent routing algorithm is facilitated.
The link ISL in a satellite communication network comprises: intra-orbit Inter-satellite links (Intra-Plane ISL) and Inter-orbit Inter-satellite links (Inter-Plane ISL), each satellite normally has four Inter-satellite links, two Intra-orbit ISLs and two Inter-orbit ISLs. However, there are two special cases, one of which is that the antenna system is located in a polar region (i.e., a region having a latitude exceeding 70 degrees), it is difficult for the antenna system to track the position of the satellite in real time due to the high-speed movement of the satellite, and the inter-orbit ISL needs to be disconnected because the user communication link demand in the polar region is also very small, so that the satellite located in the polar region has only two intra-orbit ISLs; and secondly, the satellites are positioned at two sides of a reverse seam of the satellite network, and because the relative speeds of the satellites at two sides of the reverse seam are extremely high, inter-satellite links at two sides of the seam are not established, so that the satellite at the position only has three inter-satellite links. Meanwhile, it should be noted that the length of the inter-satellite link in the orbit is constant, the connection is stable, and the length of the inter-satellite link in the orbit decreases with the increase of the latitude.
And S12, selecting an orbital speaker satellite (Orbit spoke) of each orbital plane.
In the embodiment of the invention, for the actual selection of the orbit speaker satellite, the following factors need to be considered: (1) as shown in fig. 3, the distribution of global hot spot areas is unbalanced, the northern hemisphere has dense service demands, and the southern hemisphere has relatively low service demands, so that the collection and distribution of routing state information in the network do not affect the quality of the satellite network in the hot spot areas; (2) meanwhile, in the Walker star constellation, the inter-orbit inter-satellite link is disconnected when the satellite enters a polar region; (3) the interstellar links between satellite orbits near the equator are also longer. Thus, embodiments of the present invention limit the duty of an orbiting speaker satellite to a less loaded satellite in the southern hemisphere that travels from north to south. Meanwhile, in order to avoid the frequent condition that the satellite enters the polar region to transfer the orbital speaker duties, the orbital speaker satellites at the two ends of the broken link transfer the orbital speaker duties to the satellite moving from north to south and located at the lowest latitude of the southern hemisphere. Because the movement of the satellite is periodic and predictable, the satellite can accurately acquire the geographic locations of other satellites, and thus can know to which particular satellite the orbital speaker's duties should be handed over.
And S13, collecting satellite link state reports of all other satellites in the corresponding orbital plane through the orbital speaker satellite of each orbital plane, and summarizing the satellite link state reports with the satellite link state reports to form the orbital plane link state report of the orbital plane.
Step S13 includes the following substeps S131 to S134:
s131, in each orbit plane, calculating a satellite link state report of each satellite, and sending the satellite link state report to an adjacent satellite closest to the orbit speaker satellite.
And S132, after receiving the satellite link state report, the adjacent satellite judges whether the satellite link state report is received once, if so, the satellite link state report is discarded, the adjacent satellite continues to wait for receiving the satellite link state reports sent by other satellites, and otherwise, the step S133 is carried out.
S133, judging whether the satellite link state report of the adjacent satellite is sent or not, if so, only sending the satellite link state report received by the adjacent satellite to the next adjacent satellite, and entering the step S134, otherwise, sending the satellite link state report of the adjacent satellite and the satellite link state report received by the adjacent satellite to the next adjacent satellite together, and entering the step S134.
And S134, repeating the steps S131 to S133 until the satellite of the orbit speaker acquires the satellite link state reports of all other satellites in the orbit plane, and summarizing the satellite link state reports and the satellite link state reports to form the orbit plane link state report of the orbit plane.
In the embodiment of the present invention, for the collection of the routing state information on each orbital plane, the routing state information (satellite link state report S _ LSA) of all other satellites in the corresponding orbital plane is collected by each orbital plane orbital speaker satellite, and is aggregated with the routing state information of the satellite, so as to form a set of all satellite link state report information (orbital plane link state report P _ LSA) on the orbital plane, and meanwhile, each satellite also sends the self S _ LSA to the orbital speaker satellite at a certain frequency. Next, with reference to fig. 4 as an example, how the orbital speaker satellite collects S _ LSAs of other satellites on the orbital plane, and generates a P _ LSA is explained. After calculating the satellite link state report S _ lsa (U), the satellite U may send S _ lsa (U) to its neighboring satellites V or W, and specifically, whether the satellite V or the satellite W is sent to the satellite V or the satellite W depends on which of the two neighboring satellites V and W is closest to the orbital speaker satellite in the orbital plane, as shown in fig. 4, the satellite V is closest to the orbital speaker satellite, and then the satellite U sends S _ lsa (U) to the satellite V. After receiving the S _ lsa (u), the satellite V first checks whether it has received the information, and if so, discards the information. If satellite V has not received this information and its S _ lsa (V) has not yet been sent, then its own satellite link state report is sent to the next adjacent satellite along with the received satellite link state report for satellite U, otherwise, only the S _ lsa (U) for satellite U is sent to the next adjacent satellite. Thus, after a limited time, the orbital speaker satellite acquires satellite link state reports of all other satellites in the orbit, and generates an orbital plane link state report P _ LSA of the orbital plane by combining the satellite link state report of the orbital speaker satellite.
And S14, transmitting the orbit plane link state report of the orbit plane to the adjacent orbit planes through the orbit speaker satellite of each orbit plane.
And S15, receiving the track plane link state reports from other track planes through the track speaker satellite of each track plane, and completing the construction of the link state information base of the whole network through collection.
Step S15 includes the following substeps S151 to S155:
and S151, receiving the orbital plane link state report from other orbital planes through each satellite in each orbital plane.
S152, determining whether the track surface link status report has been received, if yes, discarding the track surface link status report, returning to step S151 to continue waiting for receiving track surface link status reports from other track surfaces, otherwise, entering step S153.
S153, determining whether the satellite receiving the orbital plane link status report is the orbital speaker satellite of the orbital plane, if so, going to step S154, otherwise, forwarding the orbital plane link status report to the orbital speaker satellite of the orbital plane, and returning to step S151.
And S154, storing the track surface link state report and forwarding the track surface link state report to the next adjacent track surface.
And S155, repeating the steps S151 to S154 until the orbital speaker satellite of each orbital plane receives the orbital plane link state reports from all other orbital planes in the LEO satellite network, summarizing the orbital plane link state reports, and completing the construction of the link state information base of the whole network.
In the embodiment of the invention, the calculation formula of the satellite link state report is as follows:
Figure BDA0002811877170000101
the calculation formula of the track surface link state report is as follows:
p _ lsa (m) { S _ lsa (x) | x is a satellite on the orbital plane m }
Where S _ lsa (i) represents a link state report for satellite i,
Figure BDA0002811877170000102
represents the current logical address of the neighbor satellite x of the satellite i, 0 ≦ mx≤M-1,0≤nx≤N-1，TDixIndicating the existence of a link ISL between satellite i and its neighbor satellite xi→xThe Band (i, x) represents the available bandwidth of the link between the satellite i and its neighbor satellite x, γixRepresents the link cost correction factor between satellite i and its neighbor satellite x, P _ lsa (m) represents the link state report for orbital plane m, S _ lsa (x) represents the link state report for satellite x on orbital plane m.
And S16, each satellite receives the latest whole-network link state information base sent by the satellite of the orbit speaker on the orbit plane where the satellite is located, and the periodic updating of the whole-network link state information base is realized.
In the embodiment of the invention, after each orbit speaker satellite completes NSB updating, the periodically updated NSB is distributed and transmitted to each satellite of the orbit surface through the in-orbit ISL, so that each satellite in the LEO satellite network can update and acquire the NSB in real time with low cost, thereby preparing for the calculation of later-stage specific routing table items.
S2, let LEO satellites in the LEO satellite network wait to trigger routing.
S3, judging whether the ground user has new call or call switching arrival, if yes, entering step S4, otherwise returning to step S2.
And S4, constructing a multi-constraint QoS optimal path routing model.
The calculation formula of the multi-constraint QoS optimal path routing model is as follows:
min Cost(p)
Figure BDA0002811877170000103
Figure BDA0002811877170000104
the multi-constraint QoS optimal path routing model provided by the embodiment of the invention realizes that global data flow is guided to be distributed uniformly as much as possible on the premise of meeting two important QoS parameter constraints of time delay and bandwidth, namely ensuring the service quality of a routing transmission path p, the probability of satellite congestion is reduced, the packet loss rate of data transmission is reduced, and the reliability of satellite network data transmission is improved. Where p (s, d) represents an available path p between the source satellite node s and the destination satellite node d, cost (p) represents a total cost value for the path p, and:
Figure BDA0002811877170000105
wherein CostijRepresents a link cost function between satellite i and satellite j, and:
Costij＝γij×TDij
wherein TDijIndicating the existence of a link between satellite i and satellite j
Figure BDA0002811877170000111
The composite delay cost function of (1) is calculated by：
TDij(t)＝PDij(t)+QDij(t)
In the embodiment of the invention, in view of the continuous change of the satellite network topology and the traffic load, selecting a proper path to calculate the cost metric has a great influence on the performance of the routing algorithm, so a reasonable inter-satellite link composite time delay cost function needs to be designed, wherein the propagation time delay only reflects the physical connection change of the network topology, and the queue time delay only reflects the situation of the network traffic change. Wherein TDij(t) denotes a link
Figure BDA0002811877170000112
Total time delay of (PD)ij(t) denotes a link
Figure BDA0002811877170000113
Propagation delay of (QD)ij(t) denotes a link
Figure BDA0002811877170000114
And:
Figure BDA0002811877170000115
Figure BDA0002811877170000116
wherein
Figure BDA0002811877170000117
The physical distance between a satellite i and a satellite j is represented, c is the speed of light and represents the transmission rate (neglecting interference) of a wireless signal or a laser signal, t represents the time t, and delta t represents the whole network operation of the LEO satellite networkThe time interval at which the link state information base is updated, q (y) representing the number of transmitted packets in the output queue at time y, PavgThe average length of the transmission packets in the output queue is shown, and the BW represents the link capacity between the satellites; TD (p) represents the cumulative delay of path p, TDmaxMaximum tolerated delay representing the user traffic requirements; band (i, j) represents the available bandwidth of the link between satellite i and satellite j, and is calculated by the formula:
Figure BDA0002811877170000118
the usable bandwidth of the inter-satellite link, namely the link residual bandwidth, is a concavity measurement parameter, and the larger the link residual bandwidth is, the better the service performance is, and the less the link is prone to link blockage, packet loss and the like. Wherein
Figure BDA0002811877170000119
Representing the total bandwidth of the link between satellite i and satellite j,
Figure BDA00028118771700001110
indicating the bandwidth used by the link between satellite i and satellite j; band (p) denotes the actual available bandwidth of path p, BandminRepresenting the minimum required available bandwidth of the user communication service; gamma rayijAnd representing a link cost correction factor between the satellite i and the satellite j, wherein the calculation formula is as follows:
Figure BDA0002811877170000121
wherein latiIndicating the latitude, lon, of the satellite iiRepresenting the longitude of satellite i.
Most of the global hotspots are distributed in the range between the equator and 50 ° N, so that satellites covering the 0 ° N to 50 ° N area generally become more crowded and busy, but satellites in other areas are not fully utilized. Due to factors such as population distribution, economic and technical development, the traffic load of a satellite covering the air above the southern hemisphere is much lighter than that of a satellite covering the air above the northern hemisphere. As shown in the global hotspot zone estimation profile of fig. 3, embodiments of the present invention treat regions in the southern hemisphere as non-hotspot regions, while north america, europe, the middle east, and east asia regions in the northern hemisphere are considered as hotspot regions, and other regions in the northern hemisphere are classified as non-hotspot regions.
Aiming at the problem of global traffic distribution imbalance, the geographical position factor of a satellite is introduced into the link cost calculation, namely a link cost correction factor gamma is introducedijTherefore, the difference between the link cost passing through the hot spot area and the link cost passing through the non-hot spot area is enhanced, the traffic of the hot spot area is guided to the non-hot spot area for transmission, the balanced distribution of the traffic is realized, the pressure and the possibility of congestion of the overhead satellite of the hot spot area are reduced, the QoS (quality of service) when the satellite route forwards the data packet is ensured, and the utilization rate of the overhead satellite of the non-hot spot area is also effectively improved.
S5, utilizing the minimum bandwidth constraint of the link to carry out pruning pretreatment on the satellite topology, and simplifying the multi-constraint QoS optimal path routing model into a Delay constraint minimum path Cost routing (DCLC) model.
Because the parameter of the available bandwidth Band (i, j) of the link exists in the established multi-constraint QoS optimal path routing model, and the parameter is a concavity measurement parameter, in order to reduce the difficulty and complexity of the routing model solution, each access satellite needs to perform pruning preprocessing on the satellite topology before performing specific routing calculation after obtaining a ground communication user routing request and obtaining a specific QoS requirement constraint parameter, so that the multi-constraint QoS optimal path routing model is simplified into a minimum delay constraint path cost routing model.
The step S5 includes the following substeps S51-S52:
s51, using the Band with minimum requirement available bandwidth of user communication serviceminPerforming pruning pretreatment on inter-satellite links which do not meet the minimum bandwidth constraint of the links in the current global network state topological graph G (V, E) of the source node satellite to obtain the global network state topological graph G after the pruning pretreatment*(V*,E*) Wherein V and V*Each representing a set of satellite nodes, E and E, in a LEO satellite network*Each represents a collection of links in a LEO satellite network.
In a new global satellite network topology G*(V*,E*) When the routing path required by the user is searched, the constraint condition of the bandwidth does not need to be considered any more, and the constraint condition of the bandwidth is certainly met after pruning preprocessing.
S52, global network state topological graph G after pruning pretreatment*(V*,E*) In the above, the multi-constraint QoS optimal path routing model is simplified into the delay constraint minimum path cost routing model:
p*＝min{Cost(p):p∈p(s,d)&TD(p)≤TDmax}
wherein p is*Representing the optimal routing path.
S6, solving the delay constraint minimum path cost routing model according to the synthetic cost based Lagrange relaxation algorithm to obtain the optimal routing path p*。
Although the constraint of the bandwidth condition has been removed in step S5, which reduces the difficulty of solving the routing model to a certain extent, the DCLC problem still cannot solve an accurate solution within polynomial time, and it has been proved to be an NP _ hard problem, so the embodiment of the present invention proposes to use a heuristic algorithm to complete the solution of the delay constraint minimum path cost routing model and calculate an approximate solution of the solution problem. In practical design, the embodiment of the invention finally selects a heuristic algorithm based on Lagrange relaxation to complete the calculation of the optimal routing path.
The Lagrange relaxation algorithm is a method for solving the lower bound of a problem, has lower time complexity and better calculation performance, and has the main idea that constraint conditions are absorbed into an objective function, the calculation complexity of an original problem is reduced by reducing the constraint conditions, and finally the problem with the reduced constraint conditions can obtain the optimal solution of the problem in polynomial time.
The step S6 includes the following substeps S61-S69:
s61, converting the delay constraint minimum path cost routing model into a routing model L*：
Figure BDA0002811877170000131
Wherein L (θ) represents a new linear function formed by absorbing the delay constraint into the objective function, and:
L(θ)＝min{Costθ(p)-θTDmax:p∈p(s,d)}
＝{Costθ(p):p∈p(s,d)}-θTDmax
where θ represents the Lagrangian multiplier, Costθ(p) represents the sum of the composite link costs contained by path p, and:
Figure BDA0002811877170000132
wherein Costθ＝Costij+θTDijRepresenting the composite link cost function.
As evidenced by the relevant theorem of the lagrangian relaxation algorithm,
Figure BDA0002811877170000141
it is also easy to see that L (θ) is p*(i.e., min Cost (p)) to more closely approximate p*It is necessary to find the maximum value L of L (theta)*Then L*Is p*When the value of the lagrange multiplier theta is determined so that the function L (theta) takes the maximum value and is taken as p*(i.e. the lower bound of the objective function cost (p)), the path p obtained at this time is the path p satisfying the minimum new link cost under the time delay constraint condition*. By solving to obtain the maximum value of the function L (θ), the lower bound of the optimization problem can be obtained.
S62, making Lagrange multiplier theta equal to 0, and making the link CostijAs the input of Dijkstra algorithm, calculating to obtain the shortest path pcost。
S63, judging shortest path pcostTime delay TD (p)cost) Whether TD (p) is satisfiedcost)≤TDmaxIf yes, the shortest path p iscostAs the optimal routing path p*Otherwise, the process proceeds to step S64.
S64, compounding time delay cost TDijCalculating to obtain the shortest path p for the input of Dijkstra algorithmTD。
S65, judging shortest path pTDTime delay TD (p)TD) Whether TD (p) is satisfiedTD)≤TDmaxIf yes, go to step S66, otherwise, go to the optimal routing path p*If not, the flow proceeds to step S7.
S66, replacing shortest path p by iterationcostAnd shortest path pTDFinding the shortest path pcostAnd the shortest path pTDOf the composite link Cost function CostθLagrange multiplier θ that takes the minimum value and makes the linear function L (θ) take the maximum value:
Figure BDA0002811877170000142
where Cost (p)cost) Representing shortest paths pcostCost value of, Cost (p)TD) Representing shortest paths pTDThe cost value of (2).
S67, substituting Lagrange multiplier theta into synthetic link Cost function CostθAnd synthesizing the link Cost function CostθAnd calculating to obtain the shortest path r as the input of the Dijkstra algorithm.
S68, judging sum Cost of composite link Cost of shortest path rθ(r) whether or not Cost is satisfiedθ(r)＝Costθ(pcost) If yes, the shortest path p isTDAs the optimal routing path p*Otherwise, the process proceeds to step S69.
S69, judging whether the time delay TD (r) of the shortest path r meets the condition that TD (r) is less than or equal to TDmaxIf yes, the shortest path r is taken as pTDOtherwise the shortest path r is taken as pcostUntil the optimal routing path p satisfying the condition is calculated, repeating the steps S66-S68*。
In the embodiment of the invention, for the DCLC problem, the target function is solved through a heuristic algorithm based on Lagrange relaxation, and the time complexity of the problem is O ([ E + VlogV)]2) V represents the number of satellite nodes in the LEO satellite network, and E represents the number of inter-satellite links in the LEO satellite network; the method of solving the target solution by relaxing the Lagrange multiplier theta can flexibly control and optimize the target and the operation time of the algorithm, the LARAC algorithm theoretically provides a lower bound value for the target function of the original problem, and the reliable routing algorithm is suitable for solving the real-time dynamic QoS under the satellite network.
S7, judging the optimal routing path p*If yes, the process proceeds to step S8, otherwise, the process proceeds to step S9.
S8, passing through the optimal routing path p*And finishing the inter-satellite reliable routing communication of the LEO satellite network, and ending the process.
And S9, rejecting the routing request and ending the process.
The reliability guarantee of the reliable routing method of the LEO satellite network provided by the embodiment of the invention is mainly embodied in three aspects:
(1) after each LEO satellite in the satellite network obtains the periodically updated NSB, the calculation task of the actual routing table entry required by the user is dispersed to each LEO satellite, namely when a ground user initiates a communication service request, when a certain LEO satellite becomes an access satellite (a source node satellite) of the user, the satellite independently calculates the routing forwarding table entry in the form of the source routing taking the satellite as a source node. The orbit speaker satellite does not calculate the global routing list items of all other satellites in the orbit plane in a centralized way any more, and is only responsible for finishing the collection and distribution of routing state information, thereby avoiding that too many on-satellite calculation execution tasks are accumulated on a single central control satellite, preventing the control satellite from causing fault congestion or suffering network malicious attack and the like due to too large calculation task load, leading the routing forwarding function of all member satellites in the administered local range to be invalid and paralyzed, and even adopting a processing mode of handing over calculation tasks in time to other local central control satellites, avoiding the influence on the experience of user communication due to larger routing waiting time delay, so that the reliability of routing calculation is improved in the mode of the distributed routing calculation executor.
(2) Because the global hot spot regions are distributed unevenly, most hot spots are distributed in the range between the equator and 50 degrees N, the traffic load pressure of the satellite over the south hemisphere is far less than that of the satellite over the north hemisphere, therefore, in order to realize the uniform distribution of the global traffic, the invention takes the factor of the geographic position of the satellite into consideration, and provides a link cost correction factor gammaijHowever, only the correction factor is not enough, then the invention combines the correction factor with the composite delay Cost function, and designs a new link Cost function Cost capable of guiding the flow to be evenly distributedijBy the design, the flow is guided to be distributed in a balanced manner in consideration of the geographical position of the satellite, the situation that the service quality is reduced sharply when the satellite in the hot spot area is blocked due to too concentrated flow and too large load on the satellite is avoided, the reliability of the route forwarding process is improved, and the utilization rate of the satellite in the non-hot spot area is also improved.
(3) QoS is usually description of data transmission quality in a communication network, and is an extremely important quantitative measurement standard in data transmission, in order to improve reliability in a user data packet routing transmission process, a forwarding path with the best comprehensive service performance is designed and selected to complete data transmission, because the probability of congestion and packet loss on a path with high service quality is extremely small, better service experience can be brought to a user, the more constrained QoS parameters are selected, the more efficient and reliable guarantee can be obtained for QoS, but the solving difficulty is increased, so that the establishment of multiple constrained conditions is completed only by introducing the most important and most common measurement parameters, namely link delay and bandwidth, in the actual routing design problem, so as to ensure that an algorithm searches for the path with the best comprehensive service performance.
It will be appreciated by those of ordinary skill in the art that the embodiments described herein are intended to assist the reader in understanding the principles of the invention and are to be construed as being without limitation to such specifically recited embodiments and examples. Those skilled in the art can make various other specific changes and combinations based on the teachings of the present invention without departing from the spirit of the invention, and these changes and combinations are within the scope of the invention.

Claims (7)

1. The method for reliably routing the LEO satellite network based on QoS guarantee is characterized by comprising the following steps of:
s1, constructing an LEO satellite network, and periodically updating a whole network link state information base in the LEO satellite network;
s2, enabling an LEO satellite in the LEO satellite network to wait for triggering a route;
s3, judging whether the ground user has new call or call switching arrival, if yes, entering step S4, otherwise returning to step S2;
s4, constructing a multi-constraint QoS optimal path routing model;
s5, pruning the satellite topology by using the link minimum bandwidth constraint, and simplifying the multi-constraint QoS optimal path routing model into a time delay constraint minimum path cost routing model;
s6, solving the delay constraint minimum path cost routing model according to the synthetic cost based Lagrange relaxation algorithm to obtain the optimal routing path p*；
S7, judging the optimal routing path p*If yes, go to step S8, otherwise go to step S9;
s8, passing through the optimal routing path p*Completing inter-satellite reliable routing communication of the LEO satellite network, and ending the process;
s9, rejecting the routing request and ending the process;
the calculation formula of the multi-constraint QoS optimal path routing model in step S4 is as follows:
min Cost(p)
Figure FDA0003242734490000013
Figure FDA0003242734490000011
where p (s, d) represents an available path p between the source satellite node s and the destination satellite node d, cost (p) represents a total cost value for the path p, and:
Figure FDA0003242734490000012
wherein CostijRepresents a link cost function between satellite i and satellite j, and:
Costij＝γij×TDij
wherein TDijIndicating the existence of a link between satellite i and satellite j
Figure FDA0003242734490000014
The calculation formula of the composite delay cost function is as follows:
TDij(t)＝PDij(t)+QDij(t)
wherein TDij(t) denotes a link
Figure FDA0003242734490000024
Total time delay of (PD)ij(t) denotes a link
Figure FDA0003242734490000025
Propagation delay of (QD)ij(t) denotes a link
Figure FDA0003242734490000026
And:
Figure FDA0003242734490000021
Figure FDA0003242734490000022
wherein
Figure FDA0003242734490000027
Representing the physical distance between a satellite i and a satellite j, c is the speed of light, t represents t time, delta t represents the time interval for updating the link state information base of the whole network by the LEO satellite network, q (y) represents the number of transmission packets in an output queue at time y, and PavgThe average length of the transmission packets in the output queue is shown, and the BW represents the link capacity between the satellites; TD (p) represents the cumulative delay of path p, TDmaxMaximum tolerated delay representing the user traffic requirements; band (i, j) represents the available bandwidth of the link between satellite i and satellite j, and is calculated by the formula:
Figure FDA0003242734490000028
wherein
Figure FDA0003242734490000029
Representing the total bandwidth of the link between satellite i and satellite j,
Figure FDA00032427344900000210
indicating the bandwidth used by the link between satellite i and satellite j; band (p) denotes the actual available bandwidth of path p, BandminRepresenting the minimum required available bandwidth of the user communication service; gamma rayijAnd representing a link cost correction factor between the satellite i and the satellite j, wherein the calculation formula is as follows:
Figure FDA0003242734490000023
wherein latiIndicating the latitude, lon, of the satellite iiRepresenting the longitude of satellite i.
2. The method for reliable routing of a LEO satellite network according to claim 1, wherein said step S1 includes the sub-steps of:
s11, constructing an LEO satellite network through M multiplied by N LEO satellites, wherein M is the number of orbital planes of the LEO satellite network, and N is the number of satellites on each orbital plane;
s12, selecting an orbit speaker satellite of each orbit surface;
s13, collecting satellite link state reports of all other satellites in the corresponding orbital plane through the orbital speaker satellite of each orbital plane, and summarizing the satellite link state reports with the satellite link state reports to form an orbital plane link state report of the orbital plane;
s14, transmitting the track surface link state report of the track surface to the adjacent track surface through the track speaker satellite of each track surface;
s15, receiving the track surface link state reports from other track surfaces through the track speaker satellite of each track surface, and completing the construction of a link state information base of the whole network through summarization;
and S16, each satellite receives the latest whole-network link state information base sent by the satellite of the orbit speaker on the orbit plane where the satellite is located, and the periodic updating of the whole-network link state information base is realized.
3. The method for reliable routing of a LEO satellite network according to claim 2, wherein said step S13 includes the sub-steps of:
s131, calculating a satellite link state report of each satellite in each orbit plane, and sending the satellite link state report to an adjacent satellite closest to the orbit speaker satellite;
s132, after receiving the satellite link state report, the adjacent satellite judges whether the satellite link state report is received once, if so, the satellite link state report is discarded, and the adjacent satellite continues to wait for receiving the satellite link state reports sent by other satellites, otherwise, the step S133 is carried out;
s133, judging whether the satellite link state report of the adjacent satellite is sent or not, if so, only sending the satellite link state report received by the adjacent satellite to the next adjacent satellite, and entering the step S134, otherwise, sending the satellite link state report of the adjacent satellite and the satellite link state report received by the adjacent satellite to the next adjacent satellite together, and entering the step S134;
and S134, repeating the steps S131 to S133 until the satellite of the orbit speaker acquires the satellite link state reports of all other satellites in the orbit plane, and summarizing the satellite link state reports and the satellite link state reports to form the orbit plane link state report of the orbit plane.
4. The method for reliable routing of a LEO satellite network according to claim 2, wherein said step S15 includes the sub-steps of:
s151, receiving orbital plane link state reports from other orbital planes through each satellite in each orbital plane;
s152, judging whether the track surface link state report is received once, if so, discarding the track surface link state report, returning to the step S151 to continuously wait for receiving the track surface link state reports from other track surfaces, and otherwise, entering the step S153;
s153, judging whether the satellite receiving the orbital plane link state report is an orbital speaker satellite of the orbital plane where the satellite is located, if so, entering the step S154, otherwise, forwarding the orbital plane link state report to the orbital speaker satellite direction of the orbital plane where the satellite is located, and returning to the step S151;
s154, storing the track surface link state report and forwarding the track surface link state report to the next adjacent track surface;
and S155, repeating the steps S151 to S154 until the orbital speaker satellite of each orbital plane receives the orbital plane link state reports from all other orbital planes in the LEO satellite network, summarizing the orbital plane link state reports, and completing the construction of the link state information base of the whole network.
5. The LEO satellite network reliability routing method of any of claims 2-4, wherein the calculation formula of the satellite link state report is:
Figure FDA0003242734490000041
the calculation formula of the track surface link state report is as follows:
p _ lsa (m) { S _ lsa (x) | x is a satellite on the orbital plane m }
Where S _ lsa (i) represents a link state report for satellite i,
Figure FDA0003242734490000042
represents the current logical address of the neighbor satellite x of the satellite i, 0 ≦ mx≤M-1,0≤nx≤N-1，TDixIndicating the existence of a link ISL between satellite i and its neighbor satellite xi→xThe Band (i, x) represents the available bandwidth of the link between the satellite i and its neighbor satellite x, γixRepresents the link cost correction factor between satellite i and its neighbor satellite x, P _ lsa (m) represents the link state report for orbital plane m, S _ lsa (x) represents the link state report for satellite x on orbital plane m.
6. The method for reliable routing of a LEO satellite network according to claim 1, wherein said step S5 includes the sub-steps of:
s51, using the Band with minimum requirement available bandwidth of user communication serviceminPerforming pruning pretreatment on inter-satellite links which do not meet the minimum bandwidth constraint of the links in the current global network state topological graph G (V, E) of the source node satellite to obtain the global network state topological graph G after the pruning pretreatment*(V*,E*) Wherein V and V*Each representing a set of satellite nodes, E and E, in a LEO satellite network*Each represents a collection of links in a LEO satellite network;
s52, after pruning pretreatmentGlobal network state topology G*(V*,E*) In the above, the multi-constraint QoS optimal path routing model is simplified into the delay constraint minimum path cost routing model:
p*＝min{Cost(p):p∈p(s,d)&TD(p)≤TDmax}
wherein p is*Representing the optimal routing path.
7. The method for reliable routing of a LEO satellite network according to claim 6, wherein said step S6 includes the sub-steps of:
s61, constraining the time delay to the minimum path cost routing model p*Conversion into a routing model L*：
Figure FDA0003242734490000051
Wherein L (θ) represents a new linear function formed by absorbing the delay constraint into the objective function, and:
L(θ)＝min{Costθ(p)-θTDmax:p∈p(s,d)}
＝{Costθ(p):p∈p(s,d)}-θTDmax
where θ represents the Lagrangian multiplier, Costθ(p) represents the sum of the composite link costs contained by path p, and:
Figure FDA0003242734490000052
wherein Costθ＝Costij+θTDijRepresenting a composite link cost function;
s62, making Lagrange multiplier theta equal to 0, and making the link CostijAs the input of Dijkstra algorithm, calculating to obtain the shortest path pcost；
S63, judging shortest path pcostTime delay TD (p)cost) Whether TD (p) is satisfiedcost)≤TDmaxIf so, thenWill shortest path pcostAs the optimal routing path p*Otherwise, go to step S64;
s64, compounding time delay cost TDijCalculating to obtain the shortest path p for the input of Dijkstra algorithmTD；
S65, judging shortest path pTDTime delay TD (p)TD) Whether TD (p) is satisfiedTD)≤TDmaxIf yes, go to step S66, otherwise, go to the optimal routing path p*If not, the flow proceeds to step S7;
s66, replacing shortest path p by iterationcostAnd shortest path pTDFinding the shortest path pcostAnd the shortest path pTDOf the composite link Cost function CostθLagrange multiplier θ that takes the minimum value and makes the linear function L (θ) take the maximum value:
Figure FDA0003242734490000053
where Cost (p)cost) Representing shortest paths pcostCost value of, Cost (p)TD) Representing shortest paths pTDA cost value of;
s67, substituting Lagrange multiplier theta into synthetic link Cost function CostθAnd synthesizing the link Cost function CostθCalculating to obtain a shortest path r as the input of a Dijkstra algorithm;
s68, judging sum Cost of composite link Cost of shortest path rθ(r) whether or not Cost is satisfiedθ(r)＝Costθ(pcost) If yes, the shortest path p isTDAs the optimal routing path p*Otherwise, go to step S69;
s69, judging whether the time delay TD (r) of the shortest path r meets the condition that TD (r) is less than or equal to TDmaxIf yes, the shortest path r is taken as pTDOtherwise the shortest path r is taken as pcostUntil the optimal routing path p satisfying the condition is calculated, repeating the steps S66-S68*。
CN202011389101.4A 2020-12-02 2020-12-02 QoS guarantee-based LEO satellite network reliability routing method Active CN112566142B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011389101.4A CN112566142B (en) 2020-12-02 2020-12-02 QoS guarantee-based LEO satellite network reliability routing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011389101.4A CN112566142B (en) 2020-12-02 2020-12-02 QoS guarantee-based LEO satellite network reliability routing method

Publications (2)

Publication Number Publication Date
CN112566142A CN112566142A (en) 2021-03-26
CN112566142B true CN112566142B (en) 2021-10-08

Family

ID=75047699

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011389101.4A Active CN112566142B (en) 2020-12-02 2020-12-02 QoS guarantee-based LEO satellite network reliability routing method

Country Status (1)

Country Link
CN (1) CN112566142B (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113329409B (en) * 2021-04-25 2022-12-20 清华大学 Routing method and device for avoiding high risk area in low-orbit satellite network
CN113630171B (en) * 2021-08-05 2022-11-01 台州学院 Satellite network k-terminal reliability analysis method based on QoS
CN114553298B (en) * 2022-02-16 2023-05-12 西安电子科技大学 Routing method based on clustering in multi-layer satellite network
CN114640621B (en) * 2022-03-16 2023-10-13 重庆邮电大学 Routing method based on uncertain link parameters in low-orbit satellite network
CN114710196B (en) * 2022-03-24 2023-07-18 重庆邮电大学 Software defined satellite network virtual network function migration method
CN115021793B (en) * 2022-04-27 2023-04-18 哈尔滨工业大学（威海） Network coding-based satellite network inter-satellite link planning and power distribution method
CN116405102B (en) * 2023-06-09 2023-09-08 中国人民解放军战略支援部队航天工程大学 LEO constellation network end-to-end hop count calculation method and device

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9094856B1 (en) * 2014-02-25 2015-07-28 Intelligent Fusion Technology, Inc. Routing method for satellite communication network
CN111148161A (en) * 2020-01-06 2020-05-12 中国科学院微小卫星创新研究院 Method and system for balancing load route between low-orbit satellite constellation satellites
CN112019260A (en) * 2020-09-14 2020-12-01 西安交通大学 Low-orbit heterogeneous satellite network routing method and system

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11483877B2 (en) * 2015-06-17 2022-10-25 Hughes Network Systems, Llc Approaches for high speed global packet data services for LEO/MEO satellite systems
CN105791118B (en) * 2016-03-21 2019-04-02 南京邮电大学 Method for routing towards LEO/GEO double layer minipellet

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9094856B1 (en) * 2014-02-25 2015-07-28 Intelligent Fusion Technology, Inc. Routing method for satellite communication network
CN111148161A (en) * 2020-01-06 2020-05-12 中国科学院微小卫星创新研究院 Method and system for balancing load route between low-orbit satellite constellation satellites
CN112019260A (en) * 2020-09-14 2020-12-01 西安交通大学 Low-orbit heterogeneous satellite network routing method and system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"An approach to QoS-based routing for LEO Satellite Networks";Admela Jukan et al.;《WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings》;20000825;全文 *
"低轨卫星网络路由算法研究";张悦;《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》;20200215;全文 *

Also Published As

Publication number Publication date
CN112566142A (en) 2021-03-26

Similar Documents

Publication Publication Date Title
CN112566142B (en) QoS guarantee-based LEO satellite network reliability routing method
CN110730131B (en) SDN satellite network multi-QoS constraint routing method based on improved ant colony
CN110493130B (en) Dynamic and static hybrid routing method for heaven-earth integrated network
Song et al. TLR: A traffic-light-based intelligent routing strategy for NGEO satellite IP networks
Basagni et al. Dynamic source routing for ad hoc networks using the global positioning system
CN110505153A (en) A kind of mixed logic dynamic method of Incorporate
CN111294108B (en) Efficient routing method for orthogonal circular orbit configuration satellite constellation
Chen et al. Satellite grouping and routing protocol for LEO/MEO satellite IP networks
CN112019260B (en) Low-orbit heterogeneous satellite network routing method and system
CN104683016A (en) Method for distributing and routing optimal services of multi-layer satellite network based on minimum time delay
Dong et al. Load balancing routing algorithm based on extended link states in LEO constellation network
CN102231896B (en) Load-balance-based satellite network on-demand routing method
CN113422636A (en) On-satellite routing optimization method
Jiang et al. A QoS routing strategy using fuzzy logic for NGEO satellite IP networks
Liu et al. Routing for predictable multi-layered satellite networks
Yang et al. A multi-path routing algorithm based on ant colony optimization in satellite network
CN113259993A (en) Cross-layer routing method and communication system based on MEO/LEO double-layer satellite network
CN116781137A (en) Space domain-based low-orbit satellite network deterministic path set planning method
Zhang et al. Research on routing control with delay constraint based on contact plan for integrated satellite terrestrial network
Tao et al. A Joint Minimum Hop and Earliest Arrival Routing Algorithm for LEO Satellite Networks
Huang et al. An adaptive multipath routing for LEO satellite network
Liu et al. Load balancing routing algorithm of low-orbit communication satellite network traffic based on machine learning
Gruber et al. Ad hoc routing for cellular coverage extension
Ling et al. An optimized forward scheduling algorithm in a software-defined satellite network
Wu et al. Dynamic processing while transmitting for SDN-based space-terrestrial integrated networks

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