CN114513241A - 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 PDF

Info

Publication number
CN114513241A
CN114513241A CN202110421356.2A CN202110421356A CN114513241A CN 114513241 A CN114513241 A CN 114513241A CN 202110421356 A CN202110421356 A CN 202110421356A CN 114513241 A CN114513241 A CN 114513241A
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.)
Granted
Application number
CN202110421356.2A
Other languages
Chinese (zh)
Other versions
CN114513241B (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.)
Nanjing University of Aeronautics and Astronautics
Original Assignee
Nanjing University of Aeronautics and Astronautics
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 Nanjing University of Aeronautics and Astronautics filed Critical Nanjing University of Aeronautics and Astronautics
Priority to CN202110421356.2A priority Critical patent/CN114513241B/en
Publication of CN114513241A publication Critical patent/CN114513241A/en
Application granted granted Critical
Publication of CN114513241B publication Critical patent/CN114513241B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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 congested nodes, reduces the problem of service 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

SDN-based high-performance QoS guaranteed low-orbit satellite inter-satellite routing method
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 expandability 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-orbit satellite communication network make the routing method of the traditional network not applicable to the inter-satellite routing of the low-orbit 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 communication network architecture model, 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, 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 (geographic Orbit) satellite is a control satellite, an MEO (Medium Earth Orbit) satellite is an auxiliary route-finding 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 Bm×m＝(bu，υ)m×mIs left overA bandwidth matrix representing the available bandwidth of the satellite u and upsilon links, Dm×m＝(du，υ)m×mCalculating the inter-satellite link S for the propagation delay matrix representing the propagation delay of each inter-satellite linku→SυInitial weight value:
Figure BSA0000239878330000031
wherein B isu，υ(t) is the link Su→SυRemaining available bandwidth at time t, BmaxIs the maximum value of the available residual bandwidth in the current satellite network link, Du，υ(t) is the link Su→SυPropagation delay at time t, DminAlpha 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＝{lsp1，lsp2，lsp3，…，lspn}； (2)
(1c) there are n alternative paths, lspk(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:
Figure BSA0000239878330000032
wherein m represents lspkThe 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, assuming that a satellite S is useduAnd satellite SυIn that
Figure BSA0000239878330000041
Establish an inter-satellite link at a time
Figure BSA0000239878330000042
At the moment the link is broken, the link is disconnected,this inter-satellite link Su→SυSurvival time of (T)kComprises the following steps:
Figure BSA0000239878330000043
(1e) at any time t, the remaining lifetime of the inter-satellite link is:
Figure BSA0000239878330000044
wherein
Figure BSA0000239878330000045
(1f) Calculating inter-satellite link Su→SυThe stability of (A) is:
Figure BSA0000239878330000046
wherein T istolIs the motion period of the satellite constellation system;
(1g) and calculating an inter-satellite link stability matrix according to the formula (6):
Figure BSA0000239878330000047
(1h) calculating lsp according to the residual survival time of the inter-satellite linkk(k is more than or equal to 1 and less than or equal to n) as the inter-satellite link stability value:
Figure BSA0000239878330000048
wherein T (S)u→Sυ)minIs lspkAnd (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, lspk(1. ltoreq. k. ltoreq.n) each item Su→SυHas a link load degree of jk(t), then:
Figure BSA0000239878330000051
wherein F (t) is an inter-satellite link S at time tu→SυThe allocated traffic load, p (t), is the total number of all sets of LSPs;
(2b) calculating a link load degree matrix according to equation (9):
Figure BSA0000239878330000052
(2c) calculate lspkThe link load degree function (k is more than or equal to 1 and less than or equal to n) is as follows:
Figure BSA0000239878330000053
wherein Fmax(t) is t time lspk(1 ≦ k ≦ n) intermediate intersatellite Link Su→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 ═ ToS1，tos2，tos3}，tos1Indicating services requiring large bandwidth and low packet loss, e.g. video conferencing, tos2Representing delay-tolerant but bandwidth-demanding services, e.g. large file data transfer, tos3Is shown as having the mostServices with high priority, i.e. requiring low delay, low packet loss and low jitter, such as signal command data transmission;
(3b) the weight factor matrix:
Figure BSA0000239878330000054
wherein w11Represents tos1Weight factor of initial weight value, w22Represents tos2Weight factor for link stability, w33Represents tos3Weight factor of link load degree, and w11+w12+w13＝1，w21+w22+w 231 and w31+w32+w33＝1；
(3c) Introducing an adjusting factor Q, and calculating the adjusting factor of the link initial weight function:
Figure BSA0000239878330000061
(3d) let I assumex(t)＝max1≤r≤mIr(t) has:
Figure BSA0000239878330000062
when IxThe greater (t) is
Figure BSA0000239878330000063
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:
Figure BSA0000239878330000064
wherein a ismin(t) is the minimum value of the link initial weight in lsp, amax(t) is the maximum value of the link initial weight value in lsp;
(4b) normalized link stability function:
Figure BSA0000239878330000065
wherein s ismin(t) is the minimum value of the link stability in lsp, smax(t) is the maximum value of the link stability in lsp;
(4c) normalized link load degree function:
Figure BSA0000239878330000066
wherein jmin(t) is the minimum value of link load in lsp, jmax(t) is the maximum value of link loading in lsp;
(4d) for different traffic service types tos1、tos2And tos3The corresponding decision matrix is
Figure BSA0000239878330000071
And
Figure BSA0000239878330000072
wherein
Figure BSA0000239878330000073
(4e) The link cost function:
Figure BSA0000239878330000074
(4f) the decision matrix is updated as:
Figure BSA0000239878330000075
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 SDN-based satellite network communication system structure is composed of 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. A 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, the GEO satellite can adjust the inter-satellite link in real time to ensure optimal communication between the LEO satellites, thereby reducing network communication delay and improving the adaptability of the communication network.
The data forwarding task is composed of a low-orbit satellite communication system, including NL×MLA low earth orbit satellite component, wherein NLRepresenting the number of constellation orbital planes, MLRepresenting the number of satellites contained in each orbit. Each low-orbit satellite is numbered with (i, j), i represents the orbit number of the satellite (i is 1, 2, …, N)L) J is the satellite number in the orbit of the satellite (j is 1, 2, …, M)L) The satellite constellation model is shown in fig. 3. The inter-satellite link of a satellite is generally considered to be 4, and includes 2 inter-orbit links of adjacent orbits and 2 intra-orbit links of the same orbital plane, and the model of the inter-satellite link of the satellite 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 basic model of the low-orbit satellite communication system 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 satellites u, relay satellites R and ground nodes G. E ═ e-isl∪εgslIs a set of links, where εislIs a set of Inter-Satellite links (ISLs), εgslIs a satellite-to-ground link (G)round-Satellite Link, GSL); w (t) ═ Wu，υ(t)) represents the time interval [ t [1，t2]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 ] of1，t2]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 reported by a GEO satellite, 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 Bm×m＝(bu，υ)m×mIs a residual bandwidth matrix representing the available bandwidth of the links u and upsilon of the satellite, Dm×m＝(du，υ)m×mCalculating the inter-satellite link S for the propagation delay matrix representing the propagation delay of each inter-satellite linku→SυInitial weight value:
Figure BSA0000239878330000091
wherein B isu，υ(t) is link Su→SυRemaining available bandwidth at time t, BmaxIs the maximum value of the available residual bandwidth in the current satellite network link, Du，υ(t) is link Su→SυPropagation delay at time t, DminAlpha 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＝{lsp1，lsp2，lsp3，…，lspn}； (2)
(1c) there are n alternative paths, lspk(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:
Figure BSA0000239878330000101
wherein m represents lspkThe 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, assuming that a satellite S is useduAnd satellite SυIn that
Figure BSA0000239878330000102
Establish an inter-satellite link at a time
Figure BSA0000239878330000103
At the moment when the link is broken, at the moment when the inter-satellite link S is brokenu→SυSurvival time of (T)kComprises the following steps:
Figure BSA0000239878330000104
(1e) at any time t, the remaining lifetime of the inter-satellite link is:
Figure BSA0000239878330000105
wherein
Figure BSA0000239878330000106
(1f) Calculating inter-satellite link Su→SυThe stability of (A) is:
Figure BSA0000239878330000107
wherein T istolIs the motion period of the satellite constellation system;
(1g) and calculating an inter-satellite link stability matrix according to the formula (6):
Figure BSA0000239878330000108
(1h) calculating lsp according to the residual survival time of the inter-satellite linkk(k is more than or equal to 1 and less than or equal to n) as the inter-satellite link stability value:
Figure BSA0000239878330000109
wherein T (S)u→Sυ)minIs lspkAnd (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, lspk(1. ltoreq. k. ltoreq.n) each item Su→SυHas a link load degree of jk(t), then:
Figure BSA0000239878330000111
wherein F (t) is an inter-satellite link S at time tu→SυThe allocated traffic load, p (t), is the total number of all sets of LSPs;
(2b) calculating a link load degree matrix according to equation (9):
Figure BSA0000239878330000112
(2c) calculate lspkThe link load degree function (k is more than or equal to 1 and less than or equal to n) is as follows:
Figure BSA0000239878330000113
wherein Fmax(t) is t time lspk(1 ≦ k ≦ n) intermediate intersatellite Link Su→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 ═ ToS1，tos2，tos3}，tos1Indicating services requiring large bandwidth and low packet loss, e.g. video conferencing, tos2Representing delay-tolerant but bandwidth-demanding services, e.g. large file data transfer, tos3Indicating 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:
Figure BSA0000239878330000121
wherein w11Represents tos1Weight factor of initial weight value, w22Represents tos2Weight factor for link stability, w33Represents tos3Weight factor of link load degree, and w11+w12+w13＝1，w21+w22+w 231 and w31+w32+w33＝1；
(3c) Introducing an adjusting factor Q, and calculating the adjusting factor of the link initial weight function:
Figure BSA0000239878330000122
(3d) suppose Ix(t)＝max1≤r≤mIr(t) has:
Figure BSA0000239878330000123
when I isxThe greater (t) is
Figure BSA0000239878330000124
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:
Figure BSA0000239878330000125
wherein a ismin(t) is the minimum value of the link initial weight in lsp, amax(t) is the maximum value of the link initial weight value in lsp;
(4b) normalized link stability function:
Figure BSA0000239878330000126
wherein s ismin(t) is the minimum value of the link stability in lsp, smax(t) is the maximum value of the link stability in lsp;
(4c) normalized link load degree function:
Figure BSA0000239878330000131
wherein jmin(t) is the minimum value of link load in lsp，jmax(t) is the maximum value of link loading in lsp;
(4d) for different traffic service types tos1、tos2And tos3The corresponding decision matrix is
Figure BSA0000239878330000132
And
Figure BSA0000239878330000133
wherein
Figure BSA0000239878330000134
(4e) The link cost function:
Figure BSA0000239878330000135
(4f) the decision matrix is updated as:
Figure BSA0000239878330000136
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
Figure BSA0000239878330000137
To validate the routing method, STK is used herein to construct a low earth orbit satellite constellation motion model with 4 orbital planes, N L4; each orbital plane consists of 9 satellites, M L9, a total of 36 satellites. The satellite latitude is considered to enter the polar region when exceeding 75 degrees, and the inter-orbit link is considered to be in the polar regionAnd (4) disconnecting and only reserving 2 in-track links. 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. Comparing the simulation result with the traditional SPFA method, and aiming at three service types tos with different requirements1、tos2、tos3Setting a weight factor matrix:
Figure BSA0000239878330000141
using adjustment factors
Figure BSA0000239878330000142
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 conditions1、tos2、tos3The 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 tos1The weighting factor of the link stability is the largest, the link stability in the simulation result is 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 conditions1、tos2、tos3And 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 tos2The 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 environment1、tos2、tos3And 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 tos3The weight factor corresponding to the time delay is larger, so the average time delay is smaller than the service tos1And tos2The average time delay of the method is more similar to the time delay curve obtained by the SPFA method. Therefore, it can be seen from the comprehensive simulation results shown in fig. 6-8 that the method has obvious performance advantages on the premise of ensuring the QoS of different users.
Details not described in the present application are well within the skill of those in the art.

Claims (5)

1. A SDN-based high-performance QoS guaranteed low-orbit satellite inter-satellite routing method is characterized by comprising 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.
2. The SDN-based high-performance QoS guaranteed low-earth satellite inter-satellite routing method according to claim 1, wherein the step (1) includes the following specific steps:
(1a) in virtual MPLS satellite networks Bm×m＝(bu，υ)m×mIs a residual bandwidth matrix representing the available bandwidth of the satellite u and upsilon links, Dm×m＝(du，υ)m×mCalculating the inter-satellite link S for the propagation delay matrix representing the propagation delay of each inter-satellite linku→SυInitial weight value:
Figure FSA0000239878320000011
wherein B isu，υ(t) is the link Su→SυRemaining available bandwidth at time t, BmaxIs the maximum value of the available residual bandwidth in the current satellite network link, Du，υ(t) is link Su→SυPropagation delay at time t, DminAlpha 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＝{lsp1，lsp2，lsp3，…，lspn}； (2)
(1c) there are n alternative paths, lspk(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:
Figure FSA0000239878320000021
wherein m represents lspkThe 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, assuming that a satellite S is useduAnd satellite SυIn that
Figure FSA0000239878320000022
Establish an inter-satellite link at a time
Figure FSA0000239878320000023
At the moment when the link is broken, at the moment when the inter-satellite link S is brokenu→SυSurvival time of (T)kComprises the following steps:
Figure FSA0000239878320000024
(1e) at any time t, the remaining lifetime of the inter-satellite link is:
Figure FSA0000239878320000025
wherein
Figure FSA0000239878320000026
(1f) Calculating inter-satellite link Su→SυThe stability of (A) is:
Figure FSA0000239878320000027
wherein T istolIs the motion period of the satellite constellation system;
(1g) and calculating an inter-satellite link stability matrix according to the formula (6):
Figure FSA0000239878320000028
(1h) calculating lsp according to the residual survival time of the inter-satellite linkk(k is more than or equal to 1 and less than or equal to n) as the inter-satellite link stability value:
Figure FSA0000239878320000029
wherein T (S)u→Sυ)minIs lspkAnd (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 method according to claim 1, wherein said step (2) includes the following specific steps:
(2a) when a plurality of users initiate an end-to-end service application to the SDN controllerWhen the satellite network congestion information is requested, the real-time traffic information of the network is acquired through traffic monitoring so as to dynamically distribute the service traffic of the whole satellite network and avoid the occurrence of congestion nodes, lspk(1. ltoreq. k. ltoreq.n) each item Su→SυHas a link load degree of jk(t), then:
Figure FSA0000239878320000031
wherein F (t) is an inter-satellite link S at time tu→SυThe allocated traffic load, p (t), is the total number of all sets of LSPs;
(2b) calculating a link load degree matrix according to equation (9):
Figure FSA0000239878320000032
(2c) calculate lspkThe link load degree function (k is more than or equal to 1 and less than or equal to n) is as follows:
Figure FSA0000239878320000033
wherein Fmax(t) is t time lspk(1 ≦ k ≦ n) intermediate intersatellite Link Su→SυMaximum assigned 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 ═ ToS1，tos2，tos3}，tos1Indicating services requiring large bandwidth and low packet loss, e.g. video conferencing, tos2Representing delay-tolerant but bandwidth-demanding services, e.g. large file data transfer, tos3Indicates the highest superiorityAdvanced services, i.e. requiring low delay, low packet loss and low jitter, such as signal command data transmission;
(3b) the weight factor matrix:
Figure FSA0000239878320000034
wherein w11Represents tos1Weight factor of initial weight value, w22Represents tos2Weight factor for link stability, w33Represents tos3Weight factor of link load degree, and w11+w12+w13＝1，w21+w22+w231 and w31+w32+w33＝1；
(3c) Introducing an adjusting factor Q, and calculating the adjusting factor of the link initial weight function:
Figure FSA0000239878320000041
(3d) let I assumex(t)＝max1≤r≤mIr(t) has:
Figure FSA0000239878320000042
when I isxThe greater (t) is
Figure FSA0000239878320000043
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:
Figure FSA0000239878320000044
wherein a ismin(t) is the minimum value ta of the link initial weight values in lspmax(t) is the maximum value of the link initial weight value in lsp;
(4b) normalized link stability function:
Figure FSA0000239878320000045
wherein s ismin(t) is the minimum value of the link stability in lsp, smax(t) is the maximum value of the link stability in lsp;
(4c) normalized link load degree function:
Figure FSA0000239878320000051
wherein jmin(t) is the minimum value of link loading in lsp, jmax(t) is the maximum value of link loading in lsp;
(4d) for different types of traffic services tos1、tos2And tos3The corresponding decision matrix is
Figure FSA0000239878320000052
And
Figure FSA0000239878320000053
wherein
Figure FSA0000239878320000054
(4e) The link cost function:
Figure FSA0000239878320000055
(4f) the decision matrix is updated as:
Figure FSA0000239878320000056
CN202110421356.2A 2021-04-19 2021-04-19 SDN-based high-performance QoS guaranteed low-orbit satellite inter-satellite routing method Active CN114513241B (en)

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 true CN114513241A (en) 2022-05-17
CN114513241B 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)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115173923A (en) * 2022-07-04 2022-10-11 重庆邮电大学 Energy efficiency perception route optimization method and system for low-orbit satellite network

Citations (7)

* Cited by examiner, † Cited by third party
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
CN105791118A (en) * 2016-03-21 2016-07-20 南京邮电大学 LEO/GEO-double-layer-satellite-network-oriented routing policy
CN106341346A (en) * 2016-09-08 2017-01-18 重庆邮电大学 Routing algorithm of guaranteeing QoS in data center network based on SDN
US20180084476A1 (en) * 2016-09-17 2018-03-22 Hughes Network Systems, Llc Radio resource management and routing for fixed data circuits in an ngso satellite data communications system
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

Patent Citations (7)

* Cited by examiner, † Cited by third party
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
CN105791118A (en) * 2016-03-21 2016-07-20 南京邮电大学 LEO/GEO-double-layer-satellite-network-oriented routing policy
CN106341346A (en) * 2016-09-08 2017-01-18 重庆邮电大学 Routing algorithm of guaranteeing QoS in data center network based on SDN
US20180084476A1 (en) * 2016-09-17 2018-03-22 Hughes Network Systems, Llc Radio resource management and routing for fixed data circuits in an ngso satellite data communications system
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)

* Cited by examiner, † Cited by third party
Title
NUR AISYAH AZMI等: "A Survey of Localization using RSSI and TDoA Techniques in Wireless Sensor Network: System Architecture", 《2018 2ND INTERNATIONAL CONFERENCE ON TELEMATICS AND FUTURE GENERATION NETWORKS (TAFGEN)》 *
李红艳等: "基于时变图的天地一体化网络时间确定性路由算法与协议", 《通信学报》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115173923A (en) * 2022-07-04 2022-10-11 重庆邮电大学 Energy efficiency perception route optimization method and system for low-orbit satellite network
CN115173923B (en) * 2022-07-04 2023-07-04 重庆邮电大学 Low-orbit satellite network energy efficiency perception route optimization method and system

Also Published As

Publication number Publication date
CN114513241B (en) 2023-03-07

Similar Documents

Publication Publication Date Title
CN113572686B (en) Heaven and earth integrated self-adaptive dynamic QoS routing method based on SDN
CN107294592B (en) Satellite network based on distributed SDN and construction method thereof
Song et al. TLR: A traffic-light-based intelligent routing strategy for NGEO satellite IP networks
CN113315569B (en) Satellite reliability routing method and system with weighted link survival time
Alagoz et al. Exploring the routing strategies in next-generation satellite networks
CN111294108B (en) Efficient routing method for orthogonal circular orbit configuration satellite constellation
CN111148161A (en) Method and system for balancing load route between low-orbit satellite constellation satellites
CN109586785B (en) Low-orbit satellite network routing strategy based on K shortest path algorithm
CN113347678B (en) 5G constellation route partition control method
CN112019260B (en) Low-orbit heterogeneous satellite network routing method and system
Zhu et al. Software defined routing algorithm in LEO satellite networks
CN113055076B (en) Routing method in LEO/MEO double-layer satellite communication network
Tang et al. Federated learning for intelligent transmission with space-air-ground integrated network 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
CN113507314A (en) Inter-satellite data transmission method
Han et al. Dynamic routing for software-defined LEO satellite networks based on ISL attributes
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
Dash et al. Routing of VoIP traffic in multilayered satellite networks
Zhang et al. QoSRA: a QoS-aware routing algorithm for software defined satellite networks
Kucukates et al. Minimum flow maximum residual routing in LEO satellite networks using routing set
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
Jiang et al. Fast recovery routing algorithm for software defined network based operationally responsive space satellite 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