CN106788666B - Double-layer satellite grouping routing method based on virtual L EO group node - Google Patents
Double-layer satellite grouping routing method based on virtual L EO group node Download PDFInfo
- Publication number
- CN106788666B CN106788666B CN201610993549.4A CN201610993549A CN106788666B CN 106788666 B CN106788666 B CN 106788666B CN 201610993549 A CN201610993549 A CN 201610993549A CN 106788666 B CN106788666 B CN 106788666B
- Authority
- CN
- China
- Prior art keywords
- group
- meo
- virtual
- link
- satellite
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18513—Transmission in a satellite or space-based system
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
Abstract
The invention provides a double-layer satellite packet routing method based on a virtual L EO group node, which comprises the steps of 1, grouping L EO, 2, obtaining an intra-group local routing algorithm and a boundary routing algorithm according to a L EO intra-group link state report and a virtual L1 EO group node link state report, forwarding data, 3, updating the algorithms in IS L3 switching, IS L switching and L EO/MEO layer IO L state switching among L EO layer groups, and 4, performing congestion control and load balancing when congestion occurs in L EO groups and/or the outer boundary of L EO groups IS congested, and hiding L EO layer L link state change and L EO/MEO layer L link state change in a network topology.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a double-layer satellite grouping routing method based on a virtual L EO group node.
Background
The satellite network has the advantages of providing global coverage, being not limited by geographical conditions and the like, supporting flexible and expandable network configuration, and providing high-bandwidth communication service for global users, according to the working orbit classification of the satellite, different constellations have different advantages and disadvantages, the L EO satellite has smaller propagation delay, but the coverage range of the L EO satellite is limited, more satellites are needed for global coverage, so that the number of data packet hops in long-distance transmission dependence is too large, and further the satellite resources are wasted.
The multi-layer satellite networking system fully combines the advantages of different types of constellations, and becomes one of the research hotspots of the next generation of satellites.
Due to the strictly regular orbital motion of the satellites, the dynamic topology of the satellite network is predictable and exhibits a certain periodicity. Based on the characteristic, the routing technology of the satellite network adopts a topology control strategy to shield the dynamics of the topology, and then performs routing optimization calculation aiming at a static topology sequence. In a multilayer satellite network, a virtual topological routing strategy can well solve the problem of dynamic change of topology. The system period of the satellite constellation is divided into N snapshots, the satellite topology in each snapshot is considered to be fixed and invariable, and then route calculation is carried out according to the fixed topology.
The literature (Chen C, Ekici E, Akyildiz I F. satellite grouping and routing protocol for L EO/MEO satellite grouping IP networks [ C ]// International work on Mobile Multimedia, WOWMOM 2002, Atlanta, Georgia,28 September 2002, proceedings.2002: 109. 116.) proposes an SGRP algorithm that routes satellite packets on the basis of using a virtual topology, in which EO satellites are grouped together according to their coverage relationship with L satellites, L EO satellites in the same MEO satellite footprint are collectively managed by the MEO.
However, in the multi-layer satellite network architecture, the link between the MEO and L EO layer changes violently, which results in severe changes of the packet relationship in the SGRP, excessive snapshots in one system period, frequent snapshot switching, large protocol overhead, and poor adaptability to real-time situations such as communication traffic, link congestion, link failure, etc. in addition, data transmission in the SGRP is mainly performed through L EO, and the MEO only performs routing calculation and congestion control, which results in the waste of MEO network resources.
In the literature (Nishiyama H, Kudoh D, Kato N, et al, L oad Balancing and qospovisioning Based on the Congestion Prediction for GEO/L EO Hybrid satellite networks [ J ]. Proceedings of the IEEE,2011,99(11): 1998) 2007) a Congestion control routing algorithm Based on a GEO/L EO two-layer satellite constellation is proposed, and load Balancing is performed for different traffic types, when the link load of a L EO layer satellite is high, delay-sensitive traffic is forwarded through a L EO satellite, and delay-insensitive traffic is forwarded to a GEO manager corresponding thereto, so that load Balancing is performed, however, since delay-insensitive traffic of a L EO satellite with high link load is forwarded through the same GEO manager, the bottleneck of the GEO is easily caused, and thus the Congestion of the system performance is realized, and load Balancing of the GEO satellite with high link load is not realized.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a double-layer satellite packet routing method based on a virtual L EO group node.
The double-layer satellite packet routing method based on the virtual L EO group node provided by the invention comprises the following steps:
step 1, grouping L EO;
step 2, obtaining an intra-group local routing algorithm and a boundary routing algorithm according to the L EO intra-group link state report and the link state report of the virtual L EO group node, and forwarding data;
step 3, updating algorithms in the states of IS L switching in L EO layer groups, IS L switching among L EO layer groups and L EO/MEO layer IO L;
and 4, carrying out congestion control and load balancing on the situations that congestion occurs in L EO groups and/or congestion occurs at the outer boundary of L EO groups.
Preferably, the step 1 comprises:
step 1.1: according to the coverage range of the MEO, the number of satellites in the area covered by the MEO and NL0/NM0L EO groups within a set range of deviation of the ratios (A) and ensuring that each group L EO comprises at least one MEO with an average time to cover greater than t0L EO of (1) to generate a preliminary grouping of L EO, where N isL0Indicating the desired value, N, of the number of L EO's in a visual range of the MEOM0Expected number of MEOs representing a line-of-sight distance of L EO, t0Is calculated as follows:
t0＝tmax-t
in the formula: t is tmaxThe maximum coverage time for the MEO is,tan empirical adjustment factor for MEO coverage time;
step 1.2: with link load exceeding threshold I0Judging whether the divided L EO groups contain inter-satellite links with link loads exceeding a threshold value α, if not, finishing the division, if so, continuously cutting the inter-satellite links with the link loads exceeding a threshold value α to form new connected branches;
wherein, the threshold value I0Is calculated as follows:
I0＝C-I
in the formula: c represents the link bandwidth, I represents the throughput threshold of the time delay sensitivity service and represents an experience adjustment factor;
step 1.3-Each L EO packet corresponds to a packet manager MEO, specifically MiRepresenting the manager of the ith L EO packet, L EO of this L EO packet are noted in turn as Li1,Li2,Li3…LiNI is a natural number greater than 0, Li1Represents the first L EO, &lTtT translation = L "&gTt L &lTt/T &gTt in the ith L EO packetiNRepresenting the nth L EO in the nth L EO group, N representing the total number of L EO in the L EO group.
Preferably, the intra-group local routing algorithm and the boundary routing algorithm in step 2 are that L EO groups are virtualized into a L EO group node, the reachable relation between the virtual L EO group node and other virtual L EO group nodes and MEOs is judged, corresponding virtual links are established according to the reachable relation, and the virtual link state is calculated according to the established virtual links, so that local routing calculation is performed in L EO groups represented by the virtual L EO group node, and global routing calculation is performed according to the link states of the MEOs and the virtual L EO group nodes.
Preferably, the step 3 comprises:
when IS L switches within L EO group groups, the link status reports within L EO groups change, then L EO groups recalculate intra-group local routing tables;
when IS L IS switched between L EO layer groups, link state reports of virtual L EO group nodes are changed, and then a global routing table between L EO layer groups IS recalculated;
when the states of L EO/MEO layer IO L are switched, the reachable information between L EO and MEO in the group is changed, and the adjacent L EO is notified to update the group member state table in a delayed manner by a method of reducing the reachable domain;
when a system period is over, or a certain virtual L EO group node and a manager MEO corresponding to the virtual L EO group node are unavailable, carrying out snapshot switching once, recalculating the route and then carrying out data forwarding.
Preferably, the method of narrowing the reachable domain means:
when the IO L link reachable state of an L EO group and an MEO manager of the L EO group is changed, updating a group member state table corresponding to the L EO group, and judging whether the L EO group has unrepeated link state information or not, if the unrepeated link state information does not exist, forwarding a state change report of the L EO group to an adjacent L EO group node reachable by the MEO manager, and if the unrepeated link state information exists, forwarding the state change report of the L EO group and the unrepeated state change report to an adjacent L EO group node reachable by the MEO manager;
when an L EO group receives the status change report sent by the adjacent L EO group node, the corresponding group member status table in the L EO group is updated, and the status change information is saved until the status of the current L EO group and the IO L of the MEO manager changes or snapshot switching occurs.
Preferably, the step 4 comprises:
when a certain link in the L EO group is congested, performing shortest path calculation again in the L EO group, and correcting a local routing table of the L EO group;
when L EO boundary links are congested, forwarding delay insensitive data to the destination virtual L EO group node and other L EO within the reachable boundary according to a set proportion;
when congestion occurs to most links in L EO groups or most boundary links of some L EO groups, sending congestion warning to candidate MEOs covering corresponding L EO groups, and requesting to forward data to the MEOs;
l EO selects the optimal MEO according to the load condition and time delay corresponding to the candidate MEO with self visual distance, and forwards the data by using the selected optimal MEO, wherein the optimal MEO refers to the satellite with the lowest load and time delay.
Compared with the prior art, the invention has the following beneficial effects:
1. the double-layer satellite grouping routing method based on the virtual L EO group node IS mainly used for solving the problems of frequent snapshot switching caused by complicated and changeable satellite topology and unbalanced load in network topology, and by using the method provided by the invention, the changes of the link state of an IS L link of a L EO layer and the changes of the link state of an IO L link between L EO/MEO layers can be hidden on the basis of two layers of satellites, so that unnecessary snapshot switching IS reduced.
2. The method of the invention divides the route calculation into global route calculation and local route calculation, L EO in each group only needs to calculate the route in the group, and the MEO manager satellite calculates the route of the virtual L EO group node, thus greatly reducing the complexity of the route calculation and improving the working efficiency of the satellite system.
3. Aiming at the congestion condition in the networking system, the invention carries out local routing update in the L EO group if the intra-group link is congested, forwards the link to the boundary link with smaller link load at the boundary if the boundary link is congested, and carries out data forwarding through the optimal relay MEO satellite if the intra-group or boundary link is congested in a larger range, thereby ensuring the load balance of the whole network and ensuring the QoS routing.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments with reference to the following drawings:
FIG. 1 is a flow chart of L EO packet and route calculation work at the beginning of a snapshot provided by the present invention;
FIG. 2 is a schematic diagram of the intra-group division after the L EO layers are initially grouped according to the present invention;
FIG. 3 IS a schematic diagram of IS L and IO L link switching in accordance with the present invention
FIG. 4 is a schematic diagram of a virtual L EO group node of the present invention.
Detailed Description
The present invention will be described in detail with reference to specific examples. The following examples will assist those skilled in the art in further understanding the invention, but are not intended to limit the invention in any way. It should be noted that it would be obvious to those skilled in the art that various changes and modifications can be made without departing from the spirit of the invention. All falling within the scope of the present invention.
The double-layer satellite packet routing method based on the virtual L EO group node, which is provided by the invention, is a routing algorithm used in an MEO/L EO two-layer satellite networking system, can be used for solving the problems of frequent topology snapshot switching and unbalanced traffic load in a satellite network in a network protocol, and specifically comprises the following steps:
and S1, according to the multi-to-multi covering relation between MEOs and L EO, all L EO satellites are grouped according to the MEO covering time and the link load, each L EO satellite with relatively balanced load selects a reachable MEO satellite as a manager, and each L EO satellite in the group maintains a group member state table to maintain L EO information of the group.
And S2, virtualizing the L EO satellite into a L EO satellite group node, judging the reachable relationship between the virtual L EO group node and other virtual L EO group nodes and MEO satellites, and further establishing a corresponding virtual link so as to calculate the state of the virtual link.
Step S3, local routing is performed within the L EO satellite group, while the MEO satellite performs global routing computations based on the MEO and the link states of the virtual L EO group nodes, specifically,
when IS L in a group IS switched, a link state report in a L EO group IS changed, and the group recalculates a local routing table in the group;
when IS L between groups IS switched, the link state report of the virtual L EO group node IS changed, and then the global routing table between groups IS recalculated;
when the inter-layer IO L is switched, the reachable information between the L EO satellite and the MEO satellite in the group is changed, and the neighbor L EO satellite is delayed to update the group member state table by reducing the reachable domain.
By defining the 'virtual L EO group node', a group of L EO satellites IS regarded as a whole, a virtual L EO node with a larger coverage area IS constructed, the link state switching of L EO layer IS L and the link state switching of L EO/MEO interlayer IO L are shielded, the connection probability of the whole group L EO satellites and MEO satellites IS increased, the snapshot switching times are greatly reduced, and the robustness of the system IS enhanced.
Specifically, let the number of L EO in the two-layer satellite networking system be NLThe number of MEOs being NMAt some point, the desired number of L EO's under one MEO footprint is NL0I.e. a desired number of L EO lines of one MEO line of sight is NL0Then, on average, the expected number of MEOs for one L EO line-of-sight is NM0＝NL0×NM/NLIn addition, in an L EO/MEO two-layer satellite networking system, the switching frequency of IS L between L EO IS much less than the switching frequency of IO L between L EO/MEO.
The technical solution of the present invention will be described in more detail with reference to the following embodiments.
As shown in FIG. 1, at the beginning of each snapshot period, L EO is grouped according to MEO coverage time and L EO link status, and the implementation steps are as follows:
step 1L EO grouping
1) According to MThe coverage of EO, the number of satellites in the area with longer MEO coverage time is selected to be approximate to NL0/NM0L EO satellites in a group, and ensuring that each group L EO contains at least one MEO with an average time to coverage greater than t0The L EO satellite of (a) is connected to the branch, resulting in a preliminary grouping of longer MEO coverage times and more reachable links between L EO and MEO satellites.
Wherein t is0Is calculated as follows:
t0＝tmax-t
wherein t ismaxFor the longest coverage time of the MEO satellite,tthe factors are adjusted empirically for MEO satellite coverage time.
2) With link load exceeding threshold I0Judging whether the current L EO satellite group contains an inter-satellite link with a link load exceeding a threshold α, if not, finishing the division, if so, cutting the inter-satellite links with the link load exceeding the threshold α as much as possible to form connected branches as few as possible, wherein the inter-satellite links with the link load exceeding the threshold α and which cannot form a loop should be preferentially cut.
Wherein the threshold value I0Is calculated as follows:
I0＝C-I
wherein, C is link bandwidth, I is throughput threshold of time delay sensitivity service, and is experience adjustment factor.
3) The finally generated L EO packet is the packet corresponding to the virtual L EO group node in the following step, and the manager of each packet is the manager corresponding to the preliminary packet generated in step 1)iThe manager's L EO packet is designated L in turni1,Li2,Li3…。
Step 2L EO group boundary confirmation
Boundary members in each group L EO satellite propagate to members within the group virtual L EO group nodes for which inter-satellite links are reachable L EO group members maintain a list of members within the group, record all members within the group, and record the virtual L EO group nodes to which the boundary members are connected to determine boundary relationships.
Step 3, L EO local route calculation in satellite group
The members in each group of L EO satellites transmit link state reports to other members in the group, and the link state reports mainly comprise L EO member nodes with reachable inter-satellite links, corresponding time delay information, link residual bandwidth and other link information, then a shortest path algorithm is operated according to the link state reports of the members in the group and the inter-satellite links, the link cost and the shortest path from the current satellite to other satellites in the group are saved, and the routing table entries saved by each satellite are [ destination L EO satellite nodes, next hop L EO satellite nodes ].
Step 4 virtual link state report collection for virtual L EO group nodes
Each group L EO as a virtual L EO group node sends a link probing packet to its neighbor virtual L EO group node to obtain a link status report corresponding to the virtual link, the link status report for the virtual link is calculated based on the virtual L EO group node LViAnd LVjIf there is a reachable link between the corresponding L EO groups, then virtual L EO group node LViAnd LVjReachable, and the link status report corresponding to the virtual link is virtual L EO group node LViAnd LVjThe union of reachable link state reports for the corresponding L EO group.
Step 5L EO layer boundary route calculation
1) Selecting a L EO satellite reachable with its corresponding MEO in each L EO satellite group, integrating its virtual link state report with a neighbor virtual L EO group node, taking it as the link state report of the virtual L EO group node, and forwarding it to the corresponding MEO.
2) After receiving the link status report of the virtual L EO group node, the MEO propagates the link status report at the MEO layer.
3) After receiving the link state reports for all virtual L EO group nodes, the MEOs compute routing tables for their respective corresponding virtual L EO group nodes.
4) After the MEO calculates the routing table, the corresponding routing table is simplified into [ destination virtual L EO group node, next hop virtual L EO group node ], and the routing table is forwarded to the corresponding virtual L EO group node.
5) After the satellite which is reachable with the MEO in the L EO satellite group represented by the virtual L EO group node receives the packet, the simplified routing table is propagated in the L EO group, and the routing tables are updated respectively.
Step 6: packet forwarding
1) When a satellite receives a data packet, firstly, judging whether a virtual L EO group node corresponding to a destination node is a virtual L EO group node corresponding to the current satellite or not, if not, executing the step 2), otherwise, executing the step 3)
2) And finding a next-hop virtual L EO group node according to the virtual L EO group node corresponding to the destination node, searching a boundary L EO satellite reaching the next-hop virtual L EO group node according to the member table in the group, and taking the boundary L EO satellite as a temporary destination node searched by a subsequent routing table.
3) And searching the routing table according to the destination node to find the L EO satellite corresponding to the next hop.
System maintenance
During data transmission, link switching between intra-group and inter-group occurs at L EO layer due to dynamic nature of satellite topology.
L IS L switching within EO layer sets:
due to the dynamic property of the satellite, the state of the IS L in the L EO layer group may change, which results in the change of the topology of the satellite in the group, at this time, local routing calculation in the group IS performed again according to step 3 in the method flow, and the local routing of the members in the group IS updated.
L IS L switching between EO layer sets:
due to the dynamic property of the satellite, the state of the IS L between L EO layer groups may change, which results in a change of the link state report of the virtual L EO group node, at this time, the table entry of the corresponding relationship between the boundary L EO satellite and the virtual L EO group node in the group member table IS updated according to step 2 in the method flow, and the virtual link state report collection of the virtual L EO group node IS performed according to step 4 in the method flow, and finally, the L EO layer boundary route calculation IS performed again according to step 5 in the method flow.
L EO/MEO layer IO L switching:
the status of L EO/MEO layer IO L may change due to the dynamic of the satellite, resulting in a change of the reachable information of L EO group members and MEOs, at this time, the group member status table of the group L EO should be modified according to the reduced reachable domain method, where when there is a change of the reachable status of an IO L link between an L EO and its MEO administrator, the corresponding group member status table in the L EO is updated, then it is determined whether the L EO has unrepeated link status information, if not, the status change report of the L EO is forwarded to a L EO neighbor reachable by the MEO satellite, if so, the status change report of the L EO satellite is forwarded to a L EO neighbor reachable by the MEO satellite, and when a L EO satellite receives the status change report sent by the neighbor node, the corresponding group member status table in the L EO is updated and the status change information is saved until the current node and the MEO administrator have changed status or snapshot 84 status of the previous MEO.
And (3) snapshot switching:
when a system period is more than one, or a certain virtual L EO group node is unavailable to a manager MEO, snapshot switching is carried out, routing calculation is carried out again through the steps 1-5, and then data forwarding is carried out according to the step 6.
Load balancing
When the load of a certain link in L EO satellite group exceeds a threshold I0Then the shortest path algorithm is re-performed within the L EO group and the group L EO local routing table is modified for load balancing.
When L EO satellite boundary link load exceeds threshold I0And forwarding the delay insensitive data to other reachable boundary L EO satellites of the destination virtual L EO group node according to a certain proportion so as to carry out load balancing.
When the load of most links in L EO satellite groups or most boundary links of some two groups of L EO satellites exceeds a threshold I0L EO satellite selects the best MEO satellite according to the load condition and time delay corresponding to the candidate MEO satellite with the visual range, and utilizes the best MEO satellite to carry out data forwardingAnd forwarding the data, thereby achieving the purpose of load balancing.
The foregoing description of specific embodiments of the present invention has been presented. It is to be understood that the present invention is not limited to the specific embodiments described above, and that various changes or modifications may be made by one skilled in the art within the scope of the appended claims without departing from the spirit of the invention. The embodiments and features of the embodiments of the present application may be combined with each other arbitrarily without conflict.
Claims (4)
1. A double-layer satellite packet routing method based on a virtual L EO group node is characterized by comprising the following steps:
step 1, grouping L EO;
step 2, obtaining an intra-group local routing algorithm and a boundary routing algorithm according to the L EO intra-group link state report and the link state report of the virtual L EO group node, and forwarding data;
step 3, updating algorithms in the states of IS L switching in L EO layer groups, IS L switching among L EO layer groups and L EO/MEO layer IO L;
step 4, carrying out congestion control and load balancing when congestion occurs in L EO groups and/or congestion occurs at the outer boundary of L EO groups;
the step 1 comprises the following steps:
step 1.1: according to the coverage range of the MEO, the number of satellites in the area covered by the MEO and NL0/NM0L EO groups within a set range of deviation of the ratios (A) and ensuring that each group L EO comprises at least one MEO with an average time to cover greater than t0L EO of (1) to generate a preliminary grouping of L EO, where N isL0Indicating the desired value, N, of the number of L EO's in a visual range of the MEOM0Expected number of MEOs representing a line-of-sight distance of L EO, t0Is calculated as follows:
t0＝tmax-t
in the formula: t is tmaxThe maximum coverage time for the MEO is,tan empirical adjustment factor for MEO coverage time; t is t0Represents an average coverage time determination threshold;
step 1.2: with link load exceeding threshold I0Judging whether the divided L EO groups contain inter-satellite links with link loads exceeding a threshold value α, if not, finishing the division, if so, continuously cutting the inter-satellite links with the link loads exceeding a threshold value α to form new connected branches;
wherein, the threshold value I0Is calculated as follows:
I0＝C-I
in the formula: c represents the link bandwidth, I represents the throughput threshold of the time delay sensitivity service and represents an experience adjustment factor;
step 1.3-Each L EO packet corresponds to a packet manager MEO, specifically MiRepresenting the manager of the ith L EO packet, L EO of this L EO packet are noted in turn as Li1,Li2,Li3…LiNI is a natural number greater than 0, Li1Represents the first L EO, &lTtT translation = L "&gTt L &lTt/T &gTt in the ith L EO packetiNRepresents the Nth L EO in the Nth L EO packet, N represents the total L EO in the L EO packet;
the step 4 comprises the following steps:
when a certain link in the L EO group is congested, performing shortest path calculation again in the L EO group, and correcting a local routing table of the L EO group;
when L EO boundary links are congested, forwarding delay insensitive data to the destination virtual L EO group node and other L EO within the reachable boundary according to a set proportion;
when congestion occurs to most links in L EO groups or most boundary links of some L EO groups, sending congestion warning to candidate MEOs covering corresponding L EO groups, and requesting to forward data to the MEOs;
l EO selects the optimal MEO according to the load condition and time delay corresponding to the candidate MEO with self visual distance, and forwards the data by using the selected optimal MEO, wherein the optimal MEO refers to the satellite with the minimum load and time delay weight.
2. The method for routing the double-layer satellite packets based on the virtual L EO group node as claimed in claim 1, wherein the local routing algorithm and the boundary routing algorithm in the group in step 2 are that a L EO packet is virtualized into a L EO group node, the reachable relationship between the virtual L EO group node and other virtual L EO group nodes and MEOs is judged, corresponding virtual links are established according to the reachable relationship, and the virtual link state is calculated according to the established virtual links, so that the local routing calculation is performed in a L EO packet represented by the virtual L EO group node and the global routing calculation is performed according to the link states of the MEOs and the virtual L EO group node.
3. The method for double-tier satellite packet routing based on virtual L EO group nodes of claim 1, wherein said step 3 comprises:
when IS L switches within L EO group groups, the link status reports within L EO groups change, then L EO groups recalculate intra-group local routing tables;
when IS L IS switched between L EO layer groups, link state reports of virtual L EO group nodes are changed, and then a global routing table between L EO layer groups IS recalculated;
when the states of L EO/MEO layer IO L are switched, the reachable information between L EO and MEO in the group is changed, and the adjacent L EO is notified to update the group member state table in a delayed manner by a method of reducing the reachable domain;
when a system period is over, or a certain virtual L EO group node and a manager MEO corresponding to the virtual L EO group node are unavailable, carrying out snapshot switching once, recalculating the route and then carrying out data forwarding.
4. The method for double-layer satellite packet routing based on virtual L EO group nodes of claim 3, wherein the method for reducing reachable domain is:
when the IO L link reachable state of an L EO group and an MEO manager of the L EO group is changed, updating a group member state table corresponding to the L EO group, and judging whether the L EO group has unrepeated link state information or not, if the unrepeated link state information does not exist, forwarding a state change report of the L EO group to an adjacent L EO group node reachable by the MEO manager, and if the unrepeated link state information exists, forwarding the state change report of the L EO group and the unrepeated state change report to an adjacent L EO group node reachable by the MEO manager;
when an L EO group receives the status change report sent by the adjacent L EO group node, the corresponding group member status table in the L EO group is updated, and the status change information is saved until the status of the current L EO group and the IO L of the MEO manager changes or snapshot switching occurs.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610993549.4A CN106788666B (en) | 2016-11-10 | 2016-11-10 | Double-layer satellite grouping routing method based on virtual L EO group node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610993549.4A CN106788666B (en) | 2016-11-10 | 2016-11-10 | Double-layer satellite grouping routing method based on virtual L EO group node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106788666A CN106788666A (en) | 2017-05-31 |
| CN106788666B true CN106788666B (en) | 2020-07-14 |
Family
ID=58973351
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610993549.4A Active CN106788666B (en) | 2016-11-10 | 2016-11-10 | Double-layer satellite grouping routing method based on virtual L EO group node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106788666B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107528628B (en) * | 2017-09-28 | 2020-01-10 | 中国电子科技集团公司第七研究所 | Signal synchronization method, device and system of satellite communication system |
| CN107959630B (en) * | 2017-12-12 | 2021-05-11 | 中国联合网络通信集团有限公司 | Routing method and routing system |
| CN108173754B (en) * | 2017-12-26 | 2021-01-29 | 中国联合网络通信集团有限公司 | Routing method and routing system |
| CN108647802B (en) * | 2018-03-26 | 2021-06-25 | 复旦大学 | Anti-congestion method based on double-layer traffic network model |
| CN108768504B (en) * | 2018-06-07 | 2019-03-12 | 中国人民解放军国防科技大学 | Control message snapshot routing method of software defined satellite network based on LEO/MEO |
| CN109088669B (en) * | 2018-07-18 | 2020-12-15 | 北京天链测控技术有限公司 | Low-earth-orbit satellite communication method |
| CN111277321B (en) * | 2020-02-14 | 2021-10-19 | 北京邮电大学 | Satellite communication system and method |
| CN115441929B (en) * | 2022-08-22 | 2023-09-01 | 北京交通大学 | Method and system for realizing satellite network link simulator |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101459946A (en) * | 2008-12-12 | 2009-06-17 | 南京邮电大学 | Satellite network reliable routing method based on virtual nodes |
| CN104683016A (en) * | 2015-03-15 | 2015-06-03 | 西安电子科技大学 | Method for distributing and routing optimal services of multi-layer satellite network based on minimum time delay |
| CN104821844A (en) * | 2015-05-21 | 2015-08-05 | 哈尔滨工业大学 | Time slot optimization-based double-layer satellite network routing method |
| CN105959232A (en) * | 2016-06-16 | 2016-09-21 | 清华大学 | Satellite network routing method based on control point optimization of software-defined network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7403530B2 (en) * | 2001-07-27 | 2008-07-22 | 4198638 Canada Inc. | Scalable router |
-
2016
- 2016-11-10 CN CN201610993549.4A patent/CN106788666B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101459946A (en) * | 2008-12-12 | 2009-06-17 | 南京邮电大学 | Satellite network reliable routing method based on virtual nodes |
| CN104683016A (en) * | 2015-03-15 | 2015-06-03 | 西安电子科技大学 | Method for distributing and routing optimal services of multi-layer satellite network based on minimum time delay |
| CN104821844A (en) * | 2015-05-21 | 2015-08-05 | 哈尔滨工业大学 | Time slot optimization-based double-layer satellite network routing method |
| CN105959232A (en) * | 2016-06-16 | 2016-09-21 | 清华大学 | Satellite network routing method based on control point optimization of software-defined network |
Non-Patent Citations (3)
| Title |
|---|
| A Hierarchical and Distributed QoS Routing Protocol for Two-layered Satellite Networks;Y.H.Zhou等;《The Proceedings of the Multiconference on "Computational Engineering in Systems Applications"》;20070730;全文 * |
| A routing protocol for hierarchical LEO/MEO satellite IP networks;CHAO CHEN等;《WIRELESS NETWORKS》;20050731;第11卷(第4期);第507至521页 * |
| Traffic-Adaptive Hybrid Routing for Double-Layered Satellite Networks;Danlin Yao等;《2009 2nd International Conference on Biomedical Engineering and Informatics》;20091030;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106788666A (en) | 2017-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106788666B (en) | Double-layer satellite grouping routing method based on virtual L EO group node | |
| CN111211828B (en) | Inter-satellite routing method and device for low earth orbit communication satellite constellation | |
| CN103905306B (en) | A kind of route exchanging method suitable for GEO/LEO bilayer Constellation Networks | |
| CN110493130B (en) | Dynamic and static hybrid routing method for heaven-earth integrated network | |
| CN106685834B (en) | Credible routing method based on medium/low orbiter network | |
| CN104683016B (en) | Based on the optimal service distribution method for routing of multilayer satellite network for minimizing time delay | |
| CN113067625B (en) | Satellite network multi-service QoS routing method based on region division | |
| CN105791118B (en) | Method for routing towards LEO/GEO double layer minipellet | |
| CN109714270B (en) | Satellite routing load balancing method based on event triggering | |
| CN103986512B (en) | Satellite network inter-satellite link failure recovery method based on regional division | |
| CN109586785B (en) | Low-orbit satellite network routing strategy based on K shortest path algorithm | |
| CN111342885B (en) | Gateway station combination-based satellite network routing method | |
| CN108540204B (en) | Satellite network topology generation method using fast convergence ant colony algorithm | |
| US20190386904A1 (en) | COMPUTING SYSTEM PROVIDING ENHANCED POINT OF PRESENCE (PoP) SERVER SELECTION BASED UPON NETWORK HEALTH METRICS AND RELATED METHODS | |
| CN105472781A (en) | Portable field emergency comprehensive communication and command system | |
| CN113055076B (en) | Routing method in LEO/MEO double-layer satellite communication network | |
| CN103312608A (en) | Satellite network routing algorithm based on traffic engineering | |
| CN107302396A (en) | Network route planning method between dynamic star based on mixed strategy | |
| CN106789661B (en) | A kind of information forwarding method and space information network system | |
| CN112020117B (en) | Routing method based on transmission speed and node capacity in low-earth-orbit satellite communication network | |
| Na et al. | An active distributed QoS routing for LEO satellite communication network | |
| CN115882931A (en) | Multi-layer satellite data forwarding method and system | |
| Fan et al. | A link congestion oriented LEO network routing protocol | |
| CN114095067A (en) | Multilayer satellite network dynamic routing method and system | |
| CN103716242A (en) | Routing method and system |
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 |