CN114513241B - SDN-based high-performance QoS guaranteed low-orbit satellite inter-satellite routing method - Google Patents
SDN-based high-performance QoS guaranteed low-orbit satellite inter-satellite routing method Download PDFInfo
- Publication number
- CN114513241B CN114513241B CN202110421356.2A CN202110421356A CN114513241B CN 114513241 B CN114513241 B CN 114513241B CN 202110421356 A CN202110421356 A CN 202110421356A CN 114513241 B CN114513241 B CN 114513241B
- Authority
- CN
- China
- Prior art keywords
- link
- satellite
- inter
- lsp
- tos
- 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
-
- 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/18519—Operations control, administration or maintenance
-
- 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/18521—Systems of inter linked satellites, i.e. inter satellite service
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Radio Relay Systems (AREA)
Abstract
The invention discloses a high-performance QoS guarantee low-orbit satellite inter-satellite routing method based on an SDN, which saves limited on-satellite computing and storage resources by utilizing an SDN network architecture and improves the self-adaptive capacity of a satellite communication network, obtains an initial weight function, a link stability function and a link load function of an inter-satellite link by considering time delay, available bandwidth, link switching and load factors of the inter-satellite link, calculates a weight factor matrix aiming at different required service types, reduces the influence of bottleneck nodes by utilizing an adjustment factor, and updates a path decision matrix according to the link cost function. The method effectively avoids the congestion node, reduces the problem of business path reconstruction caused by link switching, has low complexity, not only has good performance in the aspects of time delay, link stability and load balance, but also ensures the QoS of multiple users.
Description
Technical Field
The invention belongs to the field of satellite networking, and particularly relates to a high-performance QoS guaranteed low-orbit satellite inter-satellite routing method based on an SDN.
Background
With the development of global networks and information needs, terrestrial communication networks have been unable to meet the ever-increasing demands of users. Future heaven and earth integrated information networks will provide more resources than current networks. Satellite communication is an ideal long-range communication technology that not only overcomes the limitations of geographical conditions, but also provides an inexpensive, continuous, reliable communication channel. Therefore, it is necessary to combine the advantages of global coverage, mobility and scalability of the satellite network with the characteristics of huge transmission capability and low time delay of the ground network to realize the air-ground integrated information network. However, the dynamic topology, uneven traffic distribution, and limited power, storage, and processing capabilities of the low-earth satellite communication network make the routing method of the conventional network not applicable to inter-satellite routing of the low-earth satellite. Emerging network application requirements, however, are increasingly complex and varied, which places stringent demands on efficient and flexible management of satellite communication networks. Therefore, to address these problems in satellite networks, attention has been directed to software defined networks.
Software Defined Network (SDN) is a new architecture model of communication network, which simplifies the management of communication network systems. SDN separates the control plane and the data forwarding plane of legacy networks. Centralized control processing of data and optimization and utilization of communication network resources may be achieved.
In current research, there are three main categories of inter-satellite routing methods. The first type, referred to as virtual topology, uses the periodicity and predictability of satellite constellation operation to divide the constellation period into a number of time slices. The satellite network topology can be regarded as static in each time interval, and topology changes caused by high-speed movement of the satellite are shielded. However, the large number of time slices brings a huge routing table and occupies a large amount of storage resources of the satellite. The second type is a virtual node method, where each region corresponds to a satellite with a unique logical address that is used to determine the next hop for the satellite. When the satellite moves to the next area, the logical address will change, but network congestion will occur. The third type is a dynamic topology updating method, which obtains a real-time topological structure calculation routing table by using satellite switching network state information. The satellite node failure and link congestion can be responded in real time, but the complexity of the routing method is obviously increased.
Disclosure of Invention
The invention aims to provide a high-performance QoS guaranteed low-orbit satellite inter-satellite routing method based on an SDN architecture, so that congestion nodes are avoided, the problem of service path reconstruction caused by link switching is solved, and routing is calculated according to different user requirements. In order to achieve the purpose, the method adopts the following steps:
(1) Calculating a link initial weight function and a link survival stability function according to the link state of the inter-satellite link and the link duration and disconnection time;
(2) Calculating a link load matrix and a link load function according to the traffic load state of the intersatellite link acquired by the GEO;
(3) Aiming at different requirements of different service types, calculating a weight factor matrix and an adjustment factor to ensure the QoS of multiple users;
(4) Normalizing the initial weight function, the link stability and the link load function to obtain a link cost function, and calculating path decision matrixes of different service types.
The calculation of the routing method is realized by an SDN controller so as to save satellite limited storage calculation resources, a GEO (Geostationary Orbit) satellite is a control satellite, an MEO (Medium Earth Orbit) satellite is an auxiliary route searching satellite, an LEO (Low Earth Orbit, LEO) satellite is a data information forwarding satellite, and the GEO satellite calculates an optimal communication link and a resource scheduling mode; each node in the satellite communication network is
Mapping virtual nodes in the SDN controller, wherein each virtual node stores LEO satellite node link state information reported by a GEO satellite, and the SDN controller enables the virtual nodes to form a virtual MPLS (Multi-Protocol Label Switching) network; the result calculated according to the method is integrated into an OpenFlow protocol flow table in a tag form, and is sent to an LEO satellite through a southbound interface to execute a data forwarding task.
The specific steps of calculating the link initial weight function and the link survival stability function according to the link state of the inter-satellite link, the link duration and the link disconnection time are as follows:
(1a) In virtual MPLS satellite networks B m×m ＝(b u，υ ) m×m Is a residual bandwidth matrix representing the available bandwidth of the satellite u and upsilon links, D m×m ＝(d u，υ ) m×m Calculating the inter-satellite link S for the propagation delay matrix representing the propagation delay of each inter-satellite link u →S υ Initial weight value:
wherein B is u，υ (t) is the link S u →S υ Remaining available bandwidth at time t, B max For the current satellite networkMaximum value of the remaining bandwidth available in the link, D u，υ (t) is the link S u →S υ Propagation delay at time t, D min Alpha and beta are weight factors for the minimum propagation delay in the current satellite network link;
(1b) According to the inter-satellite link connection state, calculating a label switching path set from a source satellite node S to a destination satellite node D:
LSP＝{lsp 1 ，lsp 2 ，lsp 3 ，…，lsp n }； (2)
(1c) There are n alternative paths, lsp k (k is more than or equal to 1 and less than or equal to n) represents the kth path, and the initial weight value of the kth path is as follows:
wherein m represents lsp k The total number of paths;
(1d) In a satellite constellation system, the on-off of inter-satellite links can be switched for many times in one orbital period, and a satellite S is assumed u And satellite S υ In that
Establish an inter-satellite link at a time
The time link is broken, and the inter-satellite link S u →S υ Survival time of (T) k Comprises the following steps:
(1e) At any time t, the remaining lifetime of the inter-satellite link is:
wherein
(1f) Calculating inter-satellite link S u →S υ The stability of (A) is:
wherein T is tol Is the motion period of the satellite constellation system;
(1g) And calculating an intersatellite link stability matrix according to the formula (6):
(1h) Calculating lsp according to the residual survival time of the inter-satellite link k (k is more than or equal to 1 and less than or equal to n) as the inter-satellite link stability value:
wherein T (S) u →S υ ) min Is lsp k And (k is more than or equal to 1 and less than or equal to n) the minimum link residual survival time of each inter-satellite link.
The specific steps of calculating the link load matrix and the link load function according to the traffic load state of the inter-satellite link acquired by the GEO are as follows:
(2a) When a plurality of users initiate end-to-end service application to the SDN controller, the real-time flow information of the network is acquired through flow monitoring so as to dynamically distribute the service flow of the whole satellite network and avoid the occurrence of congested nodes, lsp k (1. Ltoreq. K. Ltoreq.n) each of S u →S υ Has a link load degree of j k (t), then:
wherein F (t) is an inter-satellite link S at time t u →S υ The distributed traffic load, P (t) is the total number of all LSP sets;
(2b) From equation (9), a link load metric matrix is calculated:
(2c) Calculate lsp k The link load degree function (k is more than or equal to 1 and less than or equal to n) is as follows:
wherein F max (t) is time t lsp k (k is more than or equal to 1 and less than or equal to n) middle intersatellite link S u →S υ Maximum value of allocated traffic load.
Specific steps of calculating a weight factor matrix and an adjustment factor to ensure multiuser QoS (quality of service) according to different requirements of different service types are as follows:
(3a) Considering the requirement of multi-user QoS guarantee, three different traffic service types ToS = { ToS = { (ToS) } 1 ，tos 2 ，tos 3 }，tos 1 Indicating services requiring large bandwidth and low packet loss, e.g. video conferencing, tos 2 Representing delay-tolerant but bandwidth-demanding services, e.g. large file data transfer, tos 3 Represents the traffic with the highest priority, i.e. requiring low latency, low packet loss and low jitter, e.g. signalling;
(3b) The weight factor matrix:
wherein w 11 Represents tos 1 Weight factor of initial weight value, w 22 Represents tos 2 Weight factor for link stability, w 33 Represents tos 3 Weighting factor of link load degreeAt the same time have w 11 +w 12 +w 13 ＝1，w 21 +w 22 +w 23 =1 and w 31 +w 32 +w 33 ＝1；
(3c) Introducing an adjusting factor Q, and calculating the adjusting factor of the link initial weight function:
(3d) Let I assume x (t)＝max 1≤r≤m I r (t) has:
when I is x The greater (t) is
The larger the value of (2), the influence of the bottleneck node on the link initial weight function is reduced.
Normalizing the initial weight function, the link stability and the link load function to obtain a link cost function, and calculating the path decision matrix of different service types, wherein the specific steps are as follows:
(4a) Normalizing the initial weight function:
wherein a is min (t) is the minimum value of the initial weight of the link in lsp, a max (t) is the maximum value of the initial weight value of the link in the lsp;
(4b) Normalized link stability function:
wherein s is min (t) is the minimum value of the link stability in lsp,s max (t) is the maximum value of the link stability in lsp;
(4c) Normalized link load degree function:
wherein j is min (t) is the minimum value of link load in lsp, j max (t) is the maximum value of the link loading in lsp;
(4d) For different types of traffic services tos 1 、tos 2 And tos 3 The corresponding decision matrix is
And
wherein
(4e) The link cost function:
(4f) The decision matrix is updated as:
drawings
FIG. 1 is a flow chart of a method proposed by the present invention;
FIG. 2 is a block diagram of a satellite system in which the present invention may be employed;
FIG. 3 is a schematic diagram of a satellite constellation model;
FIG. 4 is a schematic view of a satellite inter-satellite link model;
FIG. 5 is a schematic diagram of polar orbitals constellation backstitch;
FIG. 6 is a graph of the average link stability simulation results of the present invention;
FIG. 7 is a graph of the average link loading simulation results of the present invention;
FIG. 8 is a diagram of the simulation results of the service delay of the present invention;
Detailed Description
The invention is described in further detail below with reference to the figures and examples.
The flow chart of the method for ensuring the inter-satellite routing of the low earth orbit satellite based on the SDN high-performance QoS is shown in the attached figure 1. The method specifically comprises the following steps:
(1) Calculating a link initial weight function and a link survival stability function according to the link state of the inter-satellite link and the link duration and disconnection time;
(2) Calculating a link load matrix and a link load function according to the traffic load state of the intersatellite link acquired by the GEO;
(3) Aiming at different requirements of different service types, calculating a weight factor matrix and an adjustment factor to ensure the QoS of multiple users;
(4) Normalizing the initial weight function, the link stability and the link load function to obtain a link cost function, and calculating path decision matrixes of different service types.
The satellite network communication system structure based on the SDN is adopted and comprises a user layer, a control layer and a data layer. The user layer mainly comprises various ground user terminals; the control layer mainly comprises a ground station, an MEO and a GEO; the data layer is mainly composed of LEO. The satellite system architecture diagram is shown in figure 2. The GEO satellite is a control satellite, the MEO satellite is an auxiliary path-finding satellite, and the LEO satellite is a data information forwarding satellite. The GEO satellite calculates the optimal communication link and resource scheduling, and the LEO satellite performs the data forwarding function. In addition, GEO satellites can adjust inter-satellite links in real time to ensure optimal communication between LEO satellites, thereby reducing network communication delays and improving the adaptability of the communication network.
The data forwarding task is composed of a low-orbit satellite communication system, comprising N L ×M L A low earth orbit satellite component of which N L Representing the number of constellation orbital planes, M L Representing the number of satellites contained in each orbit. Each low orbit satellite is numbered with (i, j), i representing the orbit number in which the satellite is located (i =1,2, \ 8230;, N L ) J is the satellite number in the orbit of the satellite (j =1,2, \ 8230;, M) L ) The satellite constellation model is shown in fig. 3. The inter-satellite links of a satellite are generally considered to be 4, including 2 inter-orbit links of adjacent orbits and 2 intra-orbit links of the same orbital plane, and the model of the inter-satellite links is shown in fig. 4. Generally, it is considered that two continuous intra-orbit links can be established, and the inter-orbit link needs to be switched continuously according to the motion of the satellite, and the inter-orbit link in the polar region is temporarily closed when the satellite has a high density, a low traffic volume and a high relative angular velocity of the satellite, and then establishes the inter-orbit link with the adjacent orbit when the satellite returns to the low latitude region. In polar orbit constellation, satellites on two sides of a reverse gap are difficult to establish an inter-orbit link due to high relative motion speed, and a schematic diagram of the reverse gap of the polar orbit constellation is shown in fig. 5.
The low-orbit satellite communication system basic model can be expressed as G (v, epsilon, W (t) | upsilon epsilon v, (u, upsilon) epsilon). Wherein a group of nodes is represented by v = u £ R £ G, including user satellite u, relay satellite R and ground node G. ε = ε isl ∪ε gsl Is a set of links, where ε isl Is a set of Inter-Satellite links (ISLs), ε gsl Is a set of Satellite-to-Ground links (GSLs); w (t) = (W) u，υ (t)) represents the time interval [ t [ 1 ，t 2 ]The cost function between the upper node u and the node upsilon generally consists of factors such as available bandwidth, transmission delay, bit error rate and the like. [ t ] of 1 ，t 2 ]The time interval is updated for the satellite topology.
Each node in the satellite communication network is mapped into a virtual node in the SDN controller, each virtual node stores LEO satellite node link state information from GEO satellite reports, and the SDN controller enables the virtual nodes to form a virtual MPLS network; the result calculated according to the method is integrated into an OpenFlow protocol flow table in a tag form and is sent to an LEO satellite through a southbound interface to execute a data forwarding task.
The specific steps of calculating the link initial weight function and the link survival stability function according to the link state of the inter-satellite link, the link duration and the link disconnection time are as follows:
(1a) In virtual MPLS satellite networks B m×m ＝(b u，υ ) m×m Is a residual bandwidth matrix representing the available bandwidth of the satellite u and upsilon links, D m×m ＝(d u，υ ) m×m Calculating the inter-satellite link S for the propagation delay matrix representing the propagation delay of each inter-satellite link u →S υ Initial weight value:
wherein B is u，υ (t) is link S u →S υ Remaining available bandwidth at time t, B max Is the maximum value of the available residual bandwidth in the current satellite network link, D u，υ (t) is link S u →S υ Propagation delay at time t, D min Alpha and beta are weight factors for the minimum propagation delay in the current satellite network link;
(1b) And calculating a label switching path set from the source satellite node S to the destination satellite node D according to the inter-satellite link connection state:
LSP＝{lsp 1 ，lsp 2 ，lsp 3 ，…，lsp n }； (2)
(1c) There are n alternative paths, lsp k (k is more than or equal to 1 and less than or equal to n) represents the kth path, and the initial weight value of the kth path is as follows:
wherein m represents lsp k The total number of paths;
(1d) Communication of inter-satellite links in a satellite constellation systemMultiple handovers may occur within one orbital period, assuming satellite S u And satellite S υ In that
Establishing an inter-satellite link at a time
At the moment when the link is broken, at the moment when the inter-satellite link S is broken u →S υ Survival time of (T) k Comprises the following steps:
(1e) At any time t, the remaining lifetime of the inter-satellite link is:
wherein
(1f) Calculating inter-satellite link S u →S υ The stability of (A) is:
wherein T is tol Is the motion period of the satellite constellation system;
(1g) And calculating an inter-satellite link stability matrix according to the formula (6):
(1h) Calculating lsp according to the residual survival time of the inter-satellite link k The stable value of the inter-satellite link is (1 is more than or equal to k is less than or equal to n):
wherein T (S) u →S υ ) min Is lsp k And (k is more than or equal to 1 and less than or equal to n) the minimum link residual survival time of each inter-satellite link.
The specific steps of calculating the link load matrix and the link load function according to the traffic load state of the inter-satellite link acquired by the GEO are as follows:
(2a) When a plurality of users initiate end-to-end service application to the SDN controller, the real-time flow information of the network is obtained through flow monitoring so as to dynamically distribute the service flow of the whole satellite network and avoid the occurrence of congestion nodes, lsp k (1. Ltoreq. K. Ltoreq.n) each of S u →S υ Has a link load degree of j k (t), then:
wherein F (t) is an inter-satellite link S at time t u →S υ The distributed traffic load, P (t) is the total number of all LSP sets;
(2b) From equation (9), a link load metric matrix is calculated:
(2c) Calculate lsp k The link load degree function (k is more than or equal to 1 and less than or equal to n) is as follows:
wherein F max (t) is t time lsp k (1 ≦ k ≦ n) intermediate intersatellite Link S u →S υ Maximum value of allocated traffic load.
Specific steps of calculating a weight factor matrix and an adjustment factor to ensure multi-user QoS aiming at different requirements of different service types are as follows:
(3a) Considering the requirement of multi-user QoS guarantee, three different traffic service types ToS = { ToS = { (ToS) } 1 ，tos 2 ，tos 3 }，tos 1 Indicating services requiring large bandwidth and low packet loss, e.g. video conferencing, tos 2 Representing delay-tolerant but bandwidth-demanding services, e.g. large file data transfer, tos 3 Indicating the service with the highest priority, i.e. requiring low latency, low packet loss rate and low jitter, e.g. signalling of command data;
(3b) The weight factor matrix:
wherein w 11 Represents tos 1 Weight factor of the initial weight value, w 22 Represents tos 2 Weight factor for link stability, w 33 Represents tos 3 Weight factor of link load degree, and w 11 +w 12 +w 13 ＝1，w 21 +w 22 +w 23 =1 and w 31 +w 32 +w 33 ＝1；
(3c) Introducing an adjusting factor Q, and calculating the adjusting factor of the link initial weight function:
(3d) Let I assume x (t)＝max 1≤r≤m I r (t) has:
when I is x The greater (t) is
The larger the value of (A), the smaller the initial weight function of the bottleneck node to the linkThe influence of the number.
Normalizing the initial weight function, the link stability and the link load function to obtain a link cost function, and calculating the path decision matrix of different service types, wherein the specific steps are as follows:
(4a) Normalizing the initial weight function:
wherein a is min (t) is the minimum value of the link initial weight in lsp, a max (t) is the maximum value of the link initial weight value in lsp;
(4b) Normalized link stability function:
wherein s is min (t) is the minimum value of the link stability in lsp, s max (t) is the maximum value of the link stability in lsp;
(4c) Normalized link load degree function:
wherein j is min (t) is the minimum value of link loading in lsp, j max (t) is the maximum value of the link loading in lsp;
(4d) For different types of traffic services tos 1 、tos 2 And tos 3 The corresponding decision matrix is
And
wherein
(4e) The link cost function:
(4f) The decision matrix is updated as:
according to the decision matrix of the routing method, the weight factor matrix omega with a proper value is distributed, and a proper routing path is selected from the LSP selectable path set for the service types with different QoS requirements, so that routing forwarding is completed.
TABLE 1 satellite constellation parameters
To validate the routing method, STK is used herein to construct a low earth orbit satellite constellation motion model with 4 orbital planes, N L =4; each orbital plane consists of 9 satellites, i.e. M L And =9, a total of 36 constellation models formed by satellites. The satellite latitude is considered to enter a polar region when the satellite exceeds 75 degrees, and at the moment, the inter-orbit link is disconnected, and only 2 intra-orbit links are reserved. The constellation parameters are shown in table 1.
And constructing a satellite constellation model through the STK to obtain data such as inter-satellite link on-off time, satellite periodic motion track, position distance and the like of the satellite so as to construct a network topology model of the low-orbit satellite communication system. The simulation result is compared with the traditional SPFA method, and the method aims at three service types tos with different requirements 1 、tos 2 、tos 3 Setting a weight factor matrix:
by using adjustment factors
And obtaining a decision matrix to perform routing calculation for the services with different requirements.
Selecting the time period of 0-9 degree of satellite motion angle, and figure 6 shows the service types tos under the same conditions 1 、tos 2 、tos 3 The link stability obtained by the SPFA method shows that the link stability corresponding to the three service types of the method is obviously higher than that of the SPFA method. Wherein the service tos 1 The weighting factor of the link stability of (1) is the largest, the link stability in the simulation result is also the highest, and the link stability obtained by the SPFA method is only about 0.8. FIG. 7 shows the traffic types tos under the same conditions 1 、tos 2 、tos 3 And the link load degree obtained by the SPFA method. The result shows that the link load degrees corresponding to the three service types of the method are obviously smaller than those of the SPFA method. Wherein, the service tos 2 The link load factor of (2) is maximum, and the simulation result also shows that the average link load of the path is also minimum, and is only about 0.5. FIG. 8 illustrates a calculation of traffic type tos under the same network communication environment 1 、tos 2 、tos 3 And a service delay graph obtained by a traditional routing method SPFA with the delay as an evaluation standard. As can be seen from fig. 8, the difference between the average delay of the method and the shortest delay obtained by the SPFA method is within 10 ms. Service tos 3 The weight factor corresponding to the time delay is larger, so the average time delay is smaller than the service tos 1 And tos 2 And the average time delay of the SPFA method is more similar to the time delay curve obtained by the SPFA method. Therefore, it can be seen from fig. 6-8 that the method has obvious performance advantages on the premise of guaranteeing QoS of different users.
Those matters not described in detail in the present application are well within the knowledge of those skilled in the art.
Claims (5)
1. A high-performance QoS guaranteed low-orbit satellite inter-satellite routing method based on an SDN is characterized by comprising the following steps:
(1) Calculating a link initial weight function and a link stability function according to the link state of the inter-satellite link and the link duration and disconnection time;
(2) Calculating a link load degree matrix and a link load degree function according to the inter-satellite link flow load state obtained by the GEO;
(3) Aiming at different requirements of different service types, calculating a weight factor matrix and an adjustment factor to ensure the QoS of multiple users;
(4) Normalizing the initial weight function, the link stability and the link load function to obtain a link cost function, and calculating path decision matrixes of different service types;
further, in the step (1), the calculation of the link initial weight function and the link stability function is involved, wherein, the inter-satellite links S of the satellites u and upsilon u →S υ The initial weight function is:
wherein B is u，υ (t) is the link S u →S υ Remaining available bandwidth at time t, B max Is the maximum value of the available residual bandwidth in the current satellite network link, D u，υ (t) is the link S u →S υ Propagation delay at time t, D min Alpha and beta are weight factors for the minimum propagation delay in the current satellite network link; the link stability function is:
wherein T (S) u →S υ ) min For label switched paths lsp k (k is more than or equal to 1 and less than or equal to n) the minimum link residual survival time of each intersatellite link;
further, the step (2) involves calculating a link load degree matrix and a link load degree function, and specifically includes the following steps:
the link load matrix is:
wherein j mn (t) denotes each of the moments S at t m →S n Link load degree of (d);
the link load degree function of the kth path is as follows:
wherein F max (t) is t time lsp k (1 ≦ k ≦ n) intermediate intersatellite Link S u →S υ The maximum value of the distributed traffic load, P (t) is the total number of all label switched path sets;
further, the step (3) involves the definition of the weight factor matrix and the adjustment factor, which is specifically defined as follows:
the weight factor matrix is:
wherein w 11 Representing large bandwidth low packet loss rate service tos 1 Weight factor of the initial weight value, w 22 Representing delay-tolerable but larger bandwidth-requiring traffic tos 2 Weight factor, w, of the link stability 33 Representing the traffic tos with the highest priority 3 Weight factor of link load degree, and w 1 1+w 12 +w 13 ＝1，w 21 +w 22 +w 23 =1 and w 31 +w 32 +w 33 ＝1；
The adjustment factors are:
where max 1≤r≤m I r (t) is the maximum initial weight function value in the total path m at time t, a k And (t) is an initial weight value of the kth path at the time t.
2. The method for high-performance QoS guaranteed low-earth satellite inter-satellite routing based on SDN of claim 1, wherein the step (1) comprises the following specific steps:
(1a) In virtual MPLS satellite networks B m×m ＝(b u，υ ) m×m Is a residual bandwidth matrix representing the available bandwidth of the links u and upsilon of the satellite, D m×m ＝(d u，υ ) m×m Calculating the inter-satellite link S for the propagation delay matrix representing the propagation delay of each inter-satellite link u →S υ Initial weight value:
wherein B is u，υ (t) is the link S u →S υ Remaining available bandwidth at time t, B max Is the maximum value of the available residual bandwidth in the current satellite network link, D u，υ (t) is the link S u →S υ Propagation delay at time t, D min Alpha and beta are weight factors for the minimum propagation delay in the current satellite network link;
(1b) And calculating a label switching path set from the source satellite node S to the destination satellite node D according to the inter-satellite link connection state:
LSP＝{lsp 1 ，lsp 2 ，lsp 3 ，…，lsp n }； (8)
(1c) There are n alternative paths, lsp k (k is more than or equal to 1 and less than or equal to n) represents the kth path, and the initial weight value of the kth path is as follows:
wherein m represents lsp k Total number of paths;
(1d) In a satellite constellation system, the on-off of inter-satellite links can be switched for many times in one orbital period, and a satellite S is assumed u And satellite S υ In that
Establish an inter-satellite link at a time
The time link is broken, and the inter-satellite link S u →S υ Survival time of (T) k Comprises the following steps:
(1e) At any time t, the remaining lifetime of the inter-satellite link is:
wherein
(1f) Calculating inter-satellite link S u →S υ The stability of (A) is:
wherein T is tol Is the movement period of the satellite constellation system;
(1g) Calculating an intersatellite link stability matrix according to equation (12):
(1h) Obtaining lsp according to the residual survival time of the inter-satellite link k (1. Ltoreq. K. Ltoreq.n) as follows:
wherein T (S) u →S υ ) min Is lsp k And (k is more than or equal to 1 and less than or equal to n) the minimum link residual survival time of each inter-satellite link.
3. The SDN-based high-performance QoS guaranteed low-earth satellite inter-satellite routing algorithm of claim 1, wherein the step (2) comprises the following specific steps:
(2a) When a plurality of users initiate end-to-end service application to the SDN controller, the real-time flow information of the network is acquired through flow monitoring so as to dynamically distribute the service flow of the whole satellite network and avoid the occurrence of congested nodes, lsp k (1. Ltoreq. K. Ltoreq.n) each of S u →S υ Has a link load degree of j k (t), then:
wherein F (t) is an inter-satellite link S at time t u →S υ The distributed traffic load, P (t) is the total number of all LSP sets;
(2b) The link load matrix is calculated according to equation (15):
(2c) Calculate lsp k (1. Ltoreq. K. Ltoreq.n) linkThe load degree function is:
wherein F max (t) is time t lsp k (1 ≦ k ≦ n) intermediate intersatellite Link S u →S υ Maximum value of allocated traffic load.
4. The method for high-performance QoS guaranteed low-earth satellite inter-satellite routing based on SDN of claim 1, wherein the step (3) comprises the following specific steps:
(3a) Considering the requirement of multi-user QoS guarantee, three different traffic service types ToS = { ToS = { (ToS) } 1 ，tos 2 ，tos 3 }，tos 1 Represents the service requiring large bandwidth and low packet loss rate, tos 2 Representing delay tolerant but larger bandwidth requiring traffic, tos 3 The service with the highest priority is shown, namely, low time delay, low packet loss rate and low jitter are required;
(3b) The weight factor matrix:
wherein w 11 Represents tos 1 Weight factor of the initial weight value, w 22 Represents tos 2 Weight factor for link stability, w 33 Represents tos 3 Weight factor of link load degree, and has w 11 +w 12 +w 13 ＝1，w 21 +w 22 +w 23 =1 and w 31 +w 32 +w 33 ＝1；
(3c) Introducing an adjusting factor Q, and calculating the adjusting factor of the link initial weight function:
(3d) Suppose I x (t)＝max 1≤r≤m I r (t) has:
when I x The greater (t) is
The larger the value of (2), the influence of the bottleneck node on the link initial weight function is reduced.
5. The method for high-performance QoS guaranteed low-earth satellite inter-satellite routing based on SDN of claim 1, wherein the step (4) comprises the following specific steps:
(4a) Normalizing the initial weight function:
wherein a is min (t) is the minimum value of the link initial weight in lsp, a max (t) is the maximum value of the link initial weight value in lsp;
(4b) Normalized link stability function:
wherein s is min (t) is the minimum value of the link stability in lsp, s max (t) is the maximum value of the link stability in lsp;
(4c) Normalized link load degree function:
wherein j is min (t) is the minimum value of link load in lsp, j max (t) is the maximum value of the link loading in lsp;
(4d) For different types of traffic services tos 1 、tos 2 And tos 3 The corresponding decision matrix is
And
wherein
(4e) The link cost function:
(4f) The decision matrix is updated as:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110421356.2A CN114513241B (en) | 2021-04-19 | 2021-04-19 | SDN-based high-performance QoS guaranteed low-orbit satellite inter-satellite routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110421356.2A CN114513241B (en) | 2021-04-19 | 2021-04-19 | SDN-based high-performance QoS guaranteed low-orbit satellite inter-satellite routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114513241A CN114513241A (en) | 2022-05-17 |
| CN114513241B true CN114513241B (en) | 2023-03-07 |
Family
ID=81547439
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110421356.2A Active CN114513241B (en) | 2021-04-19 | 2021-04-19 | SDN-based high-performance QoS guaranteed low-orbit satellite inter-satellite routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114513241B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115173923B (en) * | 2022-07-04 | 2023-07-04 | 重庆邮电大学 | Low-orbit satellite network energy efficiency perception route optimization method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104079496A (en) * | 2014-07-02 | 2014-10-01 | 南京邮电大学 | Double-deck satellite load balancing method based on link cost conversion |
| CN108011661A (en) * | 2017-11-29 | 2018-05-08 | 清华大学 | A kind of satellite network route oscillation suppressing method and system |
| CN110730131A (en) * | 2019-10-22 | 2020-01-24 | 电子科技大学 | SDN satellite network multi-QoS constraint routing method based on improved ant colony |
| WO2020142610A1 (en) * | 2019-01-04 | 2020-07-09 | Apple Inc. | System and method for framework of l1-sinr measurement and reporting |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105791118B (en) * | 2016-03-21 | 2019-04-02 | 南京邮电大学 | Method for routing towards LEO/GEO double layer minipellet |
| CN106341346B (en) * | 2016-09-08 | 2019-07-19 | 重庆邮电大学 | A kind of routing algorithm ensureing QoS in data center network based on SDN |
| EP3513596B1 (en) * | 2016-09-17 | 2021-07-21 | Hughes Network Systems, LLC | Radio resource management and routing for fixed data circuits in an ngso satellite data communications system |
-
2021
- 2021-04-19 CN CN202110421356.2A patent/CN114513241B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104079496A (en) * | 2014-07-02 | 2014-10-01 | 南京邮电大学 | Double-deck satellite load balancing method based on link cost conversion |
| CN108011661A (en) * | 2017-11-29 | 2018-05-08 | 清华大学 | A kind of satellite network route oscillation suppressing method and system |
| WO2020142610A1 (en) * | 2019-01-04 | 2020-07-09 | Apple Inc. | System and method for framework of l1-sinr measurement and reporting |
| CN110730131A (en) * | 2019-10-22 | 2020-01-24 | 电子科技大学 | SDN satellite network multi-QoS constraint routing method based on improved ant colony |
Non-Patent Citations (2)
| Title |
|---|
| A Survey of Localization using RSSI and TDoA Techniques in Wireless Sensor Network: System Architecture;Nur Aisyah Azmi等;《2018 2nd International Conference on Telematics and Future Generation Networks (TAFGEN)》;20181220;全文 * |
| 基于时变图的天地一体化网络时间确定性路由算法与协议;李红艳等;《通信学报》;20200928(第10期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114513241A (en) | 2022-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113572686B (en) | Heaven and earth integrated self-adaptive dynamic QoS routing method based on SDN | |
| Song et al. | TLR: A traffic-light-based intelligent routing strategy for NGEO satellite IP networks | |
| Alagoz et al. | Exploring the routing strategies in next-generation satellite networks | |
| CN113315569B (en) | Satellite reliability routing method and system with weighted link survival time | |
| CN111148161A (en) | Method and system for balancing load route between low-orbit satellite constellation satellites | |
| CN111294108B (en) | Efficient routing method for orthogonal circular orbit configuration satellite constellation | |
| CN113347678B (en) | 5G constellation route partition control method | |
| CN109586785B (en) | Low-orbit satellite network routing strategy based on K shortest path algorithm | |
| Zhu et al. | Software defined routing algorithm in LEO satellite networks | |
| CN112019260A (en) | Low-orbit heterogeneous satellite network routing method and system | |
| Tang et al. | Federated learning for intelligent transmission with space-air-ground integrated network (SAGIN) toward 6G | |
| CN113259993A (en) | Cross-layer routing method and communication system based on MEO/LEO double-layer satellite network | |
| Mai et al. | Self-learning congestion control of MPTCP in satellites communications | |
| CN113422636A (en) | On-satellite routing optimization method | |
| CN113507314A (en) | Inter-satellite data transmission method | |
| Jiang et al. | A QoS routing strategy using fuzzy logic for NGEO satellite IP networks | |
| Mohorčič et al. | Performance evaluation of adaptive routing algorithms in packet‐switched intersatellite link networks | |
| CN114513241B (en) | SDN-based high-performance QoS guaranteed low-orbit satellite inter-satellite routing method | |
| Yang et al. | A multi-path routing algorithm based on ant colony optimization in satellite network | |
| Han et al. | Dynamic routing for software-defined LEO satellite networks based on ISL attributes | |
| Dash et al. | Routing of VoIP traffic in multilayered satellite networks | |
| Kucukates et al. | Minimum flow maximum residual routing in LEO satellite networks using routing set | |
| Zhang et al. | QoSRA: a QoS-aware routing algorithm for software defined satellite networks | |
| Zhu et al. | Double-layer satellite communication network routing algorithm based on priority and failure probability | |
| Durresi et al. | Routing of real-time traffic in a transformational communications architecture |
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 |