CN114828144A - Low-earth-orbit satellite constellation-oriented service quality guarantee routing method - Google Patents
Low-earth-orbit satellite constellation-oriented service quality guarantee routing method Download PDFInfo
- Publication number
- CN114828144A CN114828144A CN202210307051.3A CN202210307051A CN114828144A CN 114828144 A CN114828144 A CN 114828144A CN 202210307051 A CN202210307051 A CN 202210307051A CN 114828144 A CN114828144 A CN 114828144A
- Authority
- CN
- China
- Prior art keywords
- satellite
- service
- routing
- link
- service quality
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 64
- 230000005540 biological transmission Effects 0.000 claims abstract description 96
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 29
- 230000008569 process Effects 0.000 claims description 16
- 238000004891 communication Methods 0.000 claims description 15
- 238000012545 processing Methods 0.000 claims description 14
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 13
- 238000000275 quality assurance Methods 0.000 claims description 10
- 230000007246 mechanism Effects 0.000 claims description 7
- 230000001133 acceleration Effects 0.000 claims description 6
- 238000010187 selection method Methods 0.000 claims description 6
- 238000004458 analytical method Methods 0.000 claims description 5
- 238000013461 design Methods 0.000 claims description 5
- 230000001174 ascending effect Effects 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims description 4
- 230000001934 delay Effects 0.000 claims description 4
- 238000004088 simulation Methods 0.000 abstract description 9
- 230000009467 reduction Effects 0.000 abstract description 3
- 238000004364 calculation method Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 230000008092 positive effect Effects 0.000 description 2
- 238000012827 research and development Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 1
- 230000007123 defense Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000013178 mathematical model Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 229940109850 royal jelly Drugs 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
- H04W28/09—Management thereof
- H04W28/0958—Management thereof based on metrics or performance parameters
- H04W28/0967—Quality of Service [QoS] parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/18—Negotiating wireless communication parameters
- H04W28/20—Negotiating bandwidth
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/04—Large scale networks; Deep hierarchical networks
- H04W84/06—Airborne or Satellite Networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- General Physics & Mathematics (AREA)
- Radio Relay Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention belongs to the technical field of satellite internet, and discloses a low earth orbit satellite constellation-oriented service quality guarantee routing method, which does not consider the problems of end-to-end average time delay and link cost performance reduction caused by link congestion in the routing method based on the shortest path in the prior art, and comprises the following steps: the service quality requirements of different types of services are distinguished by performing priority classification on the services. And constructing priority service queues according to different priorities to guarantee the service quality requirement of each route. Aiming at the characteristic that a low earth orbit satellite can simultaneously communicate with four adjacent satellite nodes, the routing algorithm for service quality guarantee is designed to realize multipath parallel transmission of services so as to ensure the end-to-end time delay and bandwidth requirements of service flows. Simulation results show that the routing time delay and the overhead performance obtained by the method are superior to those of the existing routing algorithm based on the shortest path, and the method can be used for routing of space satellite constellation service transmission.
Description
Technical Field
The invention belongs to the technical field of satellite internet, and particularly relates to a low-earth-orbit satellite constellation-oriented service quality guarantee routing method.
Background
At present, satellite internet is a space-based information transmission system which is mainly researched and developed in China in recent years, and is an important component of air, space, earth and sea integration. The satellite in the space realizes global seamless coverage by establishing an inter-satellite link to transmit information, plays an important role in the field of national defense and remote communication, and belongs to a novel infrastructure together with industrial internet, 5G and internet of things. With the increase of the constellation scale of the low-earth orbit satellite, the service types in the link are increased sharply, the requirement difference of various types of services on the network service quality is not considered when the routing protocol carries out undifferentiated service according to a single time delay index, the satellite internet resource cannot be reasonably utilized, network congestion is caused, and the overall performance of the network is influenced. Therefore, the research of the efficient routing protocol for the service quality guarantee has important significance.
Since the satellite internet bears multiple types of heterogeneous priority services, service quality requirements corresponding to the services are different, and the traditional routing scheme based on the shortest path cannot solve the problem that the service quality requirements required by various service transmission processes can be met simultaneously. In order to fully exert the bearing capacity of the satellite internet, improve the utilization rate of network resources, and improve the transmission efficiency of services, the following two challenges need to be overcome: firstly, according to the service quality requirement of the service, the division of service transmission priority is realized, and the service priority order of different services is determined; secondly, a service quality guarantee-oriented low-orbit satellite constellation routing method is customized according to the bearing capacity of the satellite internet, so that guarantee is provided for differentiated service quality requirements.
EKici et al, in the article "A multicast routing algorithm for LEO satellite IP networks. IEEE/ACM trans. Net. w.10(2),183 one (2002)" adopts MRA routing algorithm to decide the next-hop routing node, reducing the transmission delay, the satellite in the centralized routing algorithm needs to master the global topology information, consuming a lot of resources to update and store the routing table, when the constellation size is large, the routing overhead increases sharply when the link is switched. LIU et al, in the article "Load-bearing routing on segment routing for traffic in LEO satellite networks [ J ]. IEEE Access,2019, 7: 112044-. Therefore, von royal jelly is studied in the article "multilayer satellite network quality of service routing protocol [ D ]. harabine: the routing algorithm with the minimum hop count is proposed in Harbin Industrial university, 2016 to solve the congestion problem, two alternative paths are screened out according to geographic position information, the optimal path is selected in combination with load for transmission, and routing cost is reduced.
Through the above analysis, the problems and defects of the prior art are as follows: in the prior art, the end-to-end average time delay and link overhead performance reduction caused by link congestion existing in a routing method based on the shortest path are not considered.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a service quality assurance routing method for a low earth orbit satellite constellation.
The invention is realized in this way, a service quality assurance route selection method facing low orbit satellite constellation, characterized in that, the service quality assurance route selection method facing low orbit satellite constellation distinguishes the service quality requirements of different types of services by classifying the priority of the services; constructing priority service queues according to different priorities to guarantee the service quality requirement of each route; aiming at the characteristic that a low earth orbit satellite can simultaneously communicate with four adjacent satellite nodes, the routing algorithm for service quality guarantee is designed to realize multipath parallel transmission of services so as to ensure the end-to-end time delay and bandwidth requirements of service flows.
The invention divides the services into eight types of priority services according to the service quality requirements of different types of services, constructs a undirected network topological graph according to the service priority, determines the state information of nodes and links in 2 hops by using the hello packets interacted between satellites, and updates the weight on the undirected network topological graph in real time. The invention circularly judges whether the shortest path link meets the service transmission requirement or not, and continuously branches redundant services to the secondary short path, thereby realizing the multi-path transmission of the services and avoiding the reduction of the service quality performance caused by the congestion of the single path.
The failure and link switching avoidance mechanism updates the undirected network topological graph, deletes or adds back the failure or recovers the routing table information of the satellite node by detecting the state information of the nodes and the links in 2 hops, thereby avoiding the phenomena of packet loss and time delay increase caused by link failure and switching.
In the invention, a multi-queue acceleration and deceleration mechanism of multi-priority service data packets is differentiated in the satellite nodes, and the priority of the service data packets is dynamically adjusted according to the remaining allowable time and the hop count of the service data packets, so that the acceleration and deceleration processing of the service data packets in the satellite nodes is realized, and the service quality guarantee capability of the routing method is further improved.
Further, the method for selecting the low earth orbit satellite constellation-oriented service quality assurance route specifically includes:
step one, dividing service quality priority according to service quality requirements; the services with similar service indexes are classified, the service classes are simplified, and the implementation complexity of the invention is reduced.
Step two, constructing a undirected network topological graph according to the service quality index; and establishing a mathematical model for calculating the shortest path and the secondary short path.
Step three, updating the undirected network topology edge weight in real time according to the node and link state information; the timeliness and the high efficiency of the invention are improved by considering the real-time state information of the network
Detecting state information of adjacent nodes and links to generate a routing table; providing shortest and secondary short circuit information for service and providing guarantee for multipath shunting.
Step five, dynamically adjusting the service quality grades of different service flows; the acceleration and deceleration of the service data packet in the satellite node are realized, and the guarantee capability of the service quality is improved.
And step six, judging and determining a next hop routing node. And determining the next hop node of the shortest path or the secondary short path to realize multipath shunting.
Further, the step of dividing the service quality priority according to the service quality requirement specifically includes: there is a satellite communication network, each satellite is regarded as an independent node and is expressed by M (n is more than or equal to 1 and less than or equal to M), adjacent nodes i and j of any two communication satellites form an undirected graph G (i, j), a communication link existing between the satellites i and j (i is more than or equal to 1 and j is less than or equal to M) is regarded as an edge l, link state information is expressed by l (i, j), and the weight on the edge is the transmission delay overhead T of the links i and j i,j And available bandwidth W i,j The constructed two-dimensional array l (i, j) is expressed as follows:
the service quality indicator of the data packet eta comprises single-hop allowed transmission delay
And bandwidth requirements
According to the timeExtended range (0ms,100 ms)]、(100ms,200ms]、(200ms,300ms]、(300ms,400ms]And (400ms,500 ms)]Five queue priorities are set from low to high:
further, the step two of constructing the undirected network topology map according to the service quality index specifically includes:
(2a) the transmission delay overhead T of the link consists of four parts:
T＝T transmission +T propagation +T processing +T judgement ；
wherein T is transmission 、T propagation 、T processing And T judgement Respectively representing transmission delay, propagation delay, processing delay and calculation delay required by service data transmission, wherein the calculation delay is used for judging the sustainable life cycle of a certain link before switching;
(2b) and in the network initialization process, the global topology information is updated when the satellite accesses the network.
Further, the method for selecting a low earth orbit satellite constellation-oriented qos guarantee route is characterized in that the updating of undirected network topology edge weights in real time according to the three nodes and link state information specifically includes:
(3a) satellite k periodically sends a neighbor list N containing 1 hop to satellite j k (1) Link state information l (k, j) and node k internal current Load record table Load k Hello package of (c);
(3b) satellite j periodically sends a neighbor list N containing 1 hop to satellite i j (1)、N k (1) Link state information l (j, i), l (k, j), Load record table Load j 、Load k Hello package (c).
Further, the fourth step of detecting the state information of the neighboring nodes and the links, and generating the routing table specifically includes:
(4a) when finding that a node link in 2 hops is failed or switched, the satellite i deletes the link related information related to the node from the routing table, and adds the relative node address to the routing table again after the link is recovered to be normal;
(4b) satellite i constructs 2-hop neighbor list N according to hello packet i (2) 2-hop neighbor Load information table Load j 、Load k Wherein Load is j For first-hop Load information table, Load k Is a second hop load information table. Update the intra-2-hop link state information l (i, j, k) and the edge weights:
l(i,j,k)＝{T i,j ,T j,k ,W i,j ,W j,k ,；1≤i,j,k≤M}；
(4c) the satellite i is arranged in an ascending order according to the total transmission time cost of the link state information in 2 hops, and the shortest path l is divided First Minor short circuit Second And so on; if the total transmission time cost of a plurality of links is the same, selecting the path with the largest available bandwidth W of the next hop link as the shortest path l First (ii) a When the available bandwidth W of the next hop link is the same, selecting the path with the least load of the next hop node as the shortest path l First (ii) a When the loads are the same, randomly generating the shortest path, and generating a local routing table by the corresponding link;
(4d) after receiving the data packet eta to be transferred, the satellite i firstly judges whether the node is a target node, and if so, the algorithm is ended.
Further, the step five of dynamically adjusting the service quality levels of the different service flows specifically includes:
(5a) acquiring bandwidth W required by satellite i to forward data packet eta η ；
(5b) Sum of time delays experienced by satellite i analysis data packet eta before arrival
(5c) Total propagation delay indicator for data packet eta
And the total time delay that has been experienced
Comparing to calculate the residual allowable transmission delay
(5d) The satellite i judges the hop number hop between the data packet eta and the destination node in advance according to the global routing table obtained in the network access process η Further calculating the single-hop allowed transmission delay
(5e) Satellite i allows transmission delay according to single hop
The current quality of service class of the traffic flow is dynamically calculated in advance,
the smaller, the higher the quality of service level;
(5f) satellite i modifies bandwidth requirements of packet η over the link
(5g) Storing the data packets eta into the queues according to the priority levels, merging the data packets eta into data streams, and sequentially forwarding the data packets from the queue1 with the highest priority level 1;
the sixth step of judging and determining the next hop routing node specifically includes:
(6a) satellite i modifies the total bandwidth requirement of queue1 over the link
(6b) If shortest path l of satellite i First L (i, j), time delay T to next hop satellite j i,j The service quality delay requirement of the current queue1 is met:
continuing to further judge the transmission bandwidth:
(6c) when the link has available bandwidth W i,j Greater than the bandwidth requirement of the current queue 1:
all data packets in the current queue1 are transmitted to the next hop satellite j;
(6d) otherwise, when the available bandwidth W i,j When the bandwidth requirement of the data flow is less than the bandwidth requirement of the data flow, the data packets in the queue are transmitted by using the current all remaining link bandwidth, and the remaining data packets in the queue1 are transmitted to the secondary short path l Second Next hop satellite node up, satellite i bandwidth requirement for secondary short circuit
Comprises the following steps:
(6e) and continuously comparing the available bandwidth on the secondary short path with the data stream transmission requirement, and so on until the available bandwidth and the data stream transmission requirement are met. If the transmission requirement is not met all the time, the service quality cannot be guaranteed, and the process goes to (6 g);
(6f) if shortest path l of satellite i First Time delay T to next hop satellite j i,j If the requirement of service quality guarantee delay of the current queue1 is not met, the algorithm cannot be executed, and the process goes to (6 g);
(6g) the algorithm exits.
It is a further object of the invention to provide a computer arrangement comprising a memory and a processor, the memory storing a computer program which, when executed by the processor, causes the processor to perform the steps of the low earth orbit satellite constellation oriented quality of service guarantee routing method.
It is a further object of the present invention to provide a computer readable storage medium, storing a computer program which, when executed by a processor, causes the processor to perform the steps of the low earth orbit satellite constellation oriented quality of service guarantee routing method.
Another object of the present invention is to provide a low earth orbit satellite constellation routing system for implementing the low earth orbit satellite constellation-oriented qos routing method, the low earth orbit satellite constellation routing system comprising:
the service priority classification module is used for classifying the service priority to distinguish the service quality requirements of different types of services;
the priority service queue building module is used for building priority service queues according to different priorities and guaranteeing the service quality requirements of the routes one by one;
and the routing algorithm design module is used for designing a routing algorithm for service quality guarantee aiming at the characteristic that a low earth orbit satellite can simultaneously communicate with four adjacent satellite nodes, and realizing multipath parallel transmission of services so as to ensure the end-to-end time delay and bandwidth requirements of service flows.
In combination with the technical solutions and the technical problems to be solved, please analyze the advantages and positive effects of the technical solutions to be protected in the present invention from the following aspects:
first, aiming at the technical problems existing in the prior art and the difficulty in solving the problems, the technical problems to be solved by the technical scheme of the present invention are closely combined with results, data and the like in the research and development process, and some creative technical effects are brought after the problems are solved. The specific description is as follows:
aiming at the problem that the service quality performance of service data transmission is reduced due to congestion in the single-path transmission process, a multi-link path distribution mechanism is circulated, whether a shortest path link meets the service transmission requirement is judged circularly, redundant services are distributed to a secondary short link continuously, and multi-path transmission of the services is achieved.
Aiming at link failure and phenomena of packet loss and time delay increase caused by switching, and a failure and link switching avoidance mechanism, a undirected network topological graph is dynamically updated by detecting state information of nodes and links in 2 hops, and routing table information of a failure or a recovery satellite node is deleted or added back, so that the continuity of service transmission is ensured.
Aiming at the problem that the service quality can not be guaranteed after the transmission resources of low-priority service data packets are excessively occupied by high-priority service data packets in a fixed priority queue mechanism, the multi-queue acceleration and deceleration mechanism of the multi-priority service data packets is differentiated in a satellite node, the priority of the service data packets is dynamically adjusted according to the remaining allowable time and the hop count of the service data packets, the service data packets are accelerated and decelerated in the satellite node, and the service quality guarantee capability of the routing method is further improved.
Secondly, considering the technical scheme as a whole or from the perspective of products, the technical effect and advantages of the technical scheme to be protected by the invention are specifically described as follows: the invention divides the service priority according to the service quality requirements of different services, determines the service sequence of the services with different service priority levels, and solves the problem that the traditional best-effort routing scheme can not provide differentiated transmission service for various services. The invention provides a low orbit satellite constellation routing method facing service quality guarantee, which utilizes the satellite internet bearing characteristics of multipath, link difference, inter-satellite switching and the like, fully exerts network node and link resources, overcomes the problem of link congestion caused by the traditional routing method based on the shortest path, and realizes the purpose of providing differentiated service quality guarantee for different services at the same time.
The low orbit satellite constellation route selection method for ensuring the service quality updates the link state and the service priority in real time by utilizing the characteristic of satellite multipath transmission, selects the optimal transmission path for each service flow within the time delay allowable range, reduces the route maintenance cost, effectively avoids the condition of queuing time delay increase caused by heavier load of a single node, and ensures the service quality of the service.
Third, as inventive supplementary proof of the claims of the present invention, there are several important aspects as follows:
the technical scheme of the invention solves the technical problem that people are eagerly to solve but can not be successfully solved all the time:
the invention provides a routing selection method of a low-orbit satellite constellation for guaranteeing the service quality requirement of service transmission from the perspective of a network layer in a seven-layer protocol of a communication network, and simultaneously strengthens the performance of the service quality guarantee method from the perspective of a data link layer, thereby realizing the transmission service quality guarantee of the low-orbit satellite network, providing a service quality guarantee idea for the design of a low-orbit satellite constellation protocol system in China, and solving the problem that the transmission service quality guarantee is always eagerly solved but not successfully obtained in the low-orbit satellite constellation in China for a long time.
Drawings
Fig. 1 is a flowchart of a low earth orbit satellite constellation-oriented service quality assurance routing method according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a low earth orbit satellite constellation routing system according to an embodiment of the present invention;
FIG. 3 is a diagram of a low earth orbit satellite network scenario provided by an embodiment of the invention;
fig. 4 is a general flow chart of qos-oriented routing provided in the embodiment of the present invention;
FIG. 5 is a flowchart of a queue priority reconstruction algorithm provided by an embodiment of the present invention;
fig. 6 is a diagram of a simulation result of a route for quality of service guarantee according to an embodiment of the present invention;
fig. 7 is a diagram of a simulation result of a service quality guarantee oriented end-to-end delay cost v.s. of a shortest route provided in an embodiment of the present invention;
fig. 8 is a diagram of a simulation result of a service quality guarantee oriented route end-to-end path cost v.s. a shortest route end-to-end path cost provided in the embodiment of the present invention;
in the figure: 1. a service priority classification module; 2. a priority service queue building module; 3. and a routing algorithm design module.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
First, an embodiment is explained. This section is an explanatory embodiment expanding on the claims so as to fully understand how the present invention is embodied by those skilled in the art.
As shown in fig. 1, the method for selecting a low earth orbit satellite constellation-oriented service quality assurance route according to the embodiment of the present invention includes the following steps:
s101: the service quality requirements of different types of services are distinguished by carrying out priority classification on the services;
s102: constructing priority service queues according to different priorities to guarantee the service quality requirement of each route;
s103: aiming at the characteristic that a low earth orbit satellite can simultaneously communicate with four adjacent satellite nodes, the routing algorithm for service quality guarantee is designed to realize multipath parallel transmission of services so as to ensure the end-to-end time delay and bandwidth requirements of service flows.
As shown in fig. 2, the low earth orbit satellite constellation routing system provided in the embodiment of the present invention includes:
the service priority classification module 1 is used for classifying the service priority to distinguish the service quality requirements of different types of services;
the priority service queue building module 2 is used for building priority service queues according to different priorities and guaranteeing the service quality requirements of the routes one by one;
and the routing algorithm design module 3 is used for designing a routing algorithm for service quality guarantee aiming at the characteristic that a low earth orbit satellite can simultaneously communicate with four adjacent satellite nodes, and realizing multipath parallel transmission of services so as to ensure the end-to-end time delay and bandwidth requirements of service flows.
The method for selecting the low-orbit satellite constellation-oriented service quality assurance route specifically comprises the following steps:
(1) a satellite communication network is arranged, each satellite is regarded as an independent node M (M is more than or equal to 1 and less than or equal to M), and M represents the total number of the satellites. And an undirected graph G (i, j) formed by any two communicating adjacent satellite nodes i and j. The communication link existing between the satellites i and j (i is more than or equal to 1 and j is more than or equal to M) is regarded as an edge l, the link state information is represented by l (i, j), and the weight on the edge is the transmission delay overhead T of the links i and j i,j And available bandwidth W i,j The two-dimensional array l (i, j) is formed as follows:
the service quality indicator of the data packet eta comprises single-hop allowed transmission delay
And bandwidth requirements
According to the time delay range (0ms,100 ms)]、(100ms,200ms]、(200ms,300ms]、(300ms,400ms]And (400ms,500 ms)]Five queue priorities are set from high to low:
(2) the transmission delay overhead T of the link consists of four parts:
T＝T transmission +T propagation +T processing +T judgement ；
wherein T is transmission 、T propagation 、T processing And T judgement Respectively representing transmission delay, propagation delay, processing delay and calculation delay required by the transmission of service data, wherein the calculation delay is used for judging the sustainable life cycle of a certain link before switching.
(3) And in the network initialization process, the global topology information is updated when the satellite accesses the network.
(4) Satellite k periodically sends a neighbor list N containing 1 hop to satellite j k (1) Link state information l (k, j) and node k internal current Load record table Load k Hello package (c).
(5) Satellite j periodically sends a neighbor list N containing 1 hop to satellite i j (1)、N k (1) Link state information l (j, i), l (k, j), Load record table Load j 、Load k Hello package (c).
(6) When finding that the link of the node in the 2 hops is in fault or is switched, the satellite i deletes the link related information related to the node from the routing table, and after the link is recovered to be normal, the satellite i adds the related node to the routing table again.
(7) Satellite i constructs 2-hop neighbor list N according to hello packet i (2) 2-hop neighbor Load information table Load j 、Load k Wherein Load is j For first-hop Load information table, Load k Is a second hop load information table. Update the intra-2-hop link state information l (i, j, k) and the edge weights:
l(i,j,k)＝{T i,j ,T j,k ,W i,j ,W j,k ,；1≤i,j,k≤M}；
(8) the satellite i carries out ascending order arrangement on the total transmission time cost according to the link state information in 2 hops, and a shortest circuit l is divided First Minor short circuit Second And so on; if the total transmission time cost of a plurality of links is the same, selecting the largest available bandwidth W of the next hop link as the shortest path l First (ii) a When the available bandwidth W of the next hop link is the same, selecting the next hop satellite node with the least load as the shortest path l First (ii) a And when the loads are the same, randomly generating the shortest path, and generating a local routing table according to the satellite node address on the corresponding link.
(9) After receiving the data packet eta to be transferred, the satellite i firstly judges whether the node is a target node, and if so, the algorithm is ended.
(10) Otherwise, the satellite i obtains the bandwidth W required by the forwarded data packet eta η 。
(11) Sum of time delays experienced by satellite i analysis data packet eta before arrival
(12) Total propagation delay indicator for data packet eta
And the total time delay that has been experienced
Comparing to calculate the residual allowable transmission delay
(13) Satellitei pre-judging hop number hop between a data packet eta and a destination node according to a global routing table obtained in network access η Further calculating the single-hop allowed transmission delay
(14) Satellite i allows transmission delay according to single hop
The current quality of service level of the traffic flow is dynamically calculated in advance,
the smaller the quality of service level.
(15) Satellite i modifies bandwidth requirements of packet η over the link
(16) And storing the data packets eta into the queues according to the priority levels, merging the data packets eta into a data stream, and sequentially forwarding the data packets eta from the queue1 with the highest priority level 1.
(17) Satellite i modifies the total demand for bandwidth on the link queue1
(18) If shortest path l of satellite i First L (i, j), time delay T to next hop satellite j i,j The service quality delay requirement of the current queue1 is met:
continuing to further judge the transmission bandwidth:
(18a) when the link has available bandwidth W i,j Bandwidth requirement greater than current queue 1:
all the service data stored in the queue1 are transmitted to the next hop satellite j.
(18b) Otherwise, when the available bandwidth W i,j When the bandwidth requirement of the data flow is less than the bandwidth requirement of the data flow, part of data stored in the queue is transmitted by using the residual bandwidth of the current link, and the residual data packet in the queue1 is transmitted to the secondary short path l Second Next hop satellite node up, satellite i bandwidth requirement for secondary short circuit
Comprises the following steps:
(18c) and continuously comparing the available bandwidth of the subsequent link on the second short path with the transmission requirement of the data stream, and so on until the available bandwidth is met. If the transmission requirement is not satisfied, the service quality cannot be guaranteed, and the step (20) is performed.
(19) If shortest path l of satellite i First Time delay T to next hop satellite j i,j If the quality of service delay requirement of the current queue1 is not met, the algorithm cannot be executed, and the process goes to step (20).
(20) The algorithm exits.
The technical solution of the present invention is further described below with reference to the accompanying drawings.
As shown in fig. 3, the usage scenario of the present invention is a low-earth satellite network, which includes n low-earth satellites and 2 ground stations, wherein 5 antennas are installed on the low-earth satellites, and can communicate with 4 adjacent low-earth satellites and ground gateway stations, assuming that the link establishment time is fast enough, i.e. the link establishment time is negligible. The inter-satellite link adopts a laser link, and the link breakage can not occur in a high orbit area. Reverse gaps are generated between east and west hemisphere constellations. No communication link is established within the reverse slot and no communication is possible between adjacent satellites.
As shown in fig. 4, the low earth orbit satellite constellation routing method for service quality assurance of the present invention includes the following steps:
A satellite communication network is arranged, each satellite is regarded as an independent node M (n is more than or equal to 1 and less than or equal to M), and M represents the total number of the satellites. Adjacent nodes i, j of any two communication satellites form an undirected graph G (i, j). The communication link existing between the satellites i and j (i is more than or equal to 1 and j is more than or equal to M) is regarded as an edge l, the link state information is represented by l (i, j), and the weight on the edge is the transmission delay overhead T of the links i and j i,j And available bandwidth W i.j The constructed two-dimensional array l (i, j) is expressed as follows:
the service quality indicator of the data packet eta comprises single-hop allowed transmission delay
And bandwidth requirements
According to the time delay range (0ms,100 ms)]、(100ms,200ms]、(200ms,300ms]、(300ms,400ms]And (400ms,500 ms)]Five queue priorities are set from low to high:
and 2, constructing a undirected network topological graph according to the service quality index.
(2a) The transmission delay overhead T of the link consists of four parts:
T＝T transmission +T propagation +T processing +T judgement ；
wherein T is transmission 、T propagation 、T processing And T judgement Respectively representing transmission delay, propagation delay, processing delay and calculation delay required by the transmission of service data, wherein the calculation delay is used for judging the sustainable life cycle of a certain link before switching.
(2b) And in the network initialization process, the global topology information is updated when the satellite accesses the network.
And 3, updating the undirected network topology edge weight in real time according to the node and link state information.
(3a) Satellite k periodically sends a neighbor list N containing 1 hop to satellite j k (1) Link state information l (k, j) and node k internal current Load record table Load k Hello package (c).
(3b) Satellite j periodically sends a neighbor list N containing 1 hop to satellite i j (1)、N k (1) Link state information l (j, i), l (k, j), first hop Load record table Load j Second skip Load recording table Load k Hello package (c).
And 4, detecting the state information of the adjacent nodes and the links to generate a routing table.
As shown in fig. 4, the specific implementation of this step is as follows:
(4a) when finding that the link of the node in the 2 hops is in fault or is switched, the satellite i deletes the link related information related to the node from the routing table, and adds the relative node address to the routing table again after the link is recovered to be normal.
(4b) Satellite i constructs 2-hop neighbor list N according to hello packet i (2) 2-hop neighbor Load information table Load j 、Load k Wherein Load is j For first-hop Load information table, Load k Is a second hop load information table. Update the intra-2-hop link state information l (i, j, k) and the edge weights:
l(i,j,k)＝{T i,j ,T j,k ,W i,j ,W j,k ,；1≤i,j,k≤M}；
(4c) the satellites i are sorted in ascending order according to the total transmission time overhead of the link state information within 2 hops,the shortest path l is marked First Minor short circuit Second And so on; if the total transmission time cost of a plurality of links is the same, selecting the path with the largest available bandwidth W of the next hop link as the shortest path l First (ii) a When the available bandwidth W of the next hop link is the same, selecting the path with the least load of the next hop node as the shortest path l First (ii) a And when the loads are the same, randomly generating the shortest circuit, and generating a local routing table by the corresponding link.
(4d) After receiving the data packet eta to be transferred, the satellite i firstly judges whether the node is a target node, and if so, the algorithm is ended.
And 5, dynamically adjusting the service quality grades of different service flows.
As shown in fig. 5, the specific implementation of this step is as follows:
(5a) acquiring bandwidth W required by satellite i to forward data packet eta η 。
(5b) Sum of time delays experienced by satellite i analysis data packet eta before arrival
(5c) Total propagation delay indicator for data packet eta
And the total time delay that has been experienced
Comparing to calculate the residual allowable transmission delay
(5d) The satellite i judges the hop number hop between the data packet eta and the destination node in advance according to the global routing table obtained in the network access process η Further calculating the single-hop allowed transmission delay
(5e) Satellite i allows transmission delay according to single hop
The current quality of service class of the traffic flow is dynamically calculated in advance,
the smaller the quality of service level.
(5f) Satellite i modifies bandwidth requirements of packet η over the link
(5g) And storing the data packets eta into the queues according to the priority levels, merging the data packets eta into a data stream, and sequentially forwarding the data packets eta from the queue1 with the highest priority level 1.
And 6, judging and determining the next hop routing node.
As shown in fig. 4, the specific implementation of this step is as follows:
(6a) satellite i modifies the total bandwidth requirement of queue1 over the link
(6b) If shortest path l of satellite i First L (i, j), time delay T to next hop satellite j i,j The service quality delay requirement of the current queue1 is met:
continuing to further judge the transmission bandwidth:
(6c) when the link has available bandwidth W i,j Greater than the bandwidth requirement of the current queue 1:
all packets in the current queue1 are transmitted to the next hop satellite j.
(6d) Otherwise, when the available bandwidth W i,j When the bandwidth requirement of the data flow is less than the bandwidth requirement of the data flow, the data packets in the queue are transmitted by using the current all remaining link bandwidth, and the remaining data packets in the queue1 are transmitted to the secondary short path l Second Next hop satellite node up, satellite i bandwidth requirement for secondary short circuit
Comprises the following steps:
(6e) and continuously comparing the available bandwidth on the secondary short path with the data stream transmission requirement, and so on until the available bandwidth and the data stream transmission requirement are met. If the transmission requirement is not met, the service quality cannot be guaranteed, and the process goes to (6 g).
(6f) If shortest path l of satellite i First In time delay T to next hop satellite j i,j If the service quality guarantee delay requirement of the current queue1 is not met, the algorithm cannot be executed, and the process goes to (6 g).
(6g) The algorithm exits.
And II, application embodiment. In order to prove the creativity and the technical value of the technical scheme of the invention, the part is the application example of the technical scheme of the claims on specific products or related technologies.
Embodiments of the present invention may be implemented by a combination of software and hardware. The hardware portion may be implemented by a hardware circuit of a programmable hardware device such as a field programmable gate array or a programmable logic device FPGA, or may be implemented by software executed by various types of processor CPUs. The software portions may be stored in a memory and executed by a suitable instruction execution system, such as a microprocessor or specially designed hardware. And finally, the system is integrated on a board card of the satellite-borne router and is matched with other board card functional modules, so that the transmission service quality guarantee of a network level and a router node level is realized.
It should be noted that the embodiments of the present invention can be realized by hardware, software, or a combination of software and hardware. The hardware portion may be implemented using dedicated logic; the software portions may be stored in a memory and executed by a suitable instruction execution system, such as a microprocessor or specially designed hardware. Those skilled in the art will appreciate that the apparatus and methods described above may be implemented using computer executable instructions and/or embodied in processor control code, such code being provided on a carrier medium such as a disk, CD-or DVD-ROM, programmable memory such as read only memory (firmware), or a data carrier such as an optical or electronic signal carrier, for example. The apparatus and its modules of the present invention may be implemented by hardware circuits such as very large scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, or programmable hardware devices such as field programmable gate arrays, programmable logic devices, etc., or by software executed by various types of processors, or by a combination of hardware circuits and software, e.g., firmware.
And thirdly, evidence of relevant effects of the embodiment. The embodiment of the invention achieves some positive effects in the process of research and development or use, and has great advantages compared with the prior art, and the following contents are described by combining data, diagrams and the like in the test process.
1) Simulation conditions
The network comprises 60 low-orbit satellites, 6 orbital planes are divided, the included angle of the adjacent orbital planes is 30 degrees, 10 satellites are arranged on each orbital plane at equal angle intervals, the included angle of the adjacent satellites is 36 degrees, the orbit type is pi-shaped, the orbit inclination angle is 86.5 degrees, the orbit height is 1175km, the coverage area is global coverage, the inter-satellite link rate of the low-orbit satellites is that the same orbit and different orbits are 1Gbps, the link medium is a laser link, the phase factor is 3, and inter-satellite links are arranged between the adjacent satellites. The service source end is located in Beijing, and the destination end is located in Brazilian Reliuliulu.
The simulation time is from 2021, 10, month, 15, 00: 00: number 10 month 16 00 to 2021: 00: 00, the time for each traffic flow to wait for the currently transmitted traffic flow when queuing is one unit time, and the transmission time of each traffic flow is also one unit time. Propagation delay is negligible because the distance between low earth orbit satellites is small compared to the speed of laser transmission.
2) Simulation content and results
Simulation No. 1, 32 low orbit satellite represents the satellite above Beijing, 46 low orbit satellite represents the satellite above Riyote Reneilu, the business is produced and injected to No. 32 satellite from Beijing, and is transmitted to No. 46 satellite through multi-hop inter-satellite link, and then is transmitted to Riyote Reneilu. When the link residual bandwidth is not enough to support the bandwidth required by the service, the satellite shunts the service to different paths for transmission by means of multipath transmission, and a transmission route simulation result of the service flow is obtained, and the result is shown in fig. 6.
As can be seen from fig. 6, unlike the conventional routing method based on the shortest path, the method of the present invention does not transmit all traffic flows through the unique shortest path, but transmits the traffic flows through multiple paths by shunting the traffic flows, thereby avoiding the occurrence of congestion in the unique shortest path and ensuring that the size of the link residual bandwidth meets the bandwidth requirement of the traffic flows after shunting. The invention can effectively guarantee the bandwidth requirement of the service.
As can be seen from fig. 7, as the traffic volume increases, the routing time of the routing method provided by the present invention and the routing time based on the shortest-path routing method both gradually increase, and in comparison, the routing time of the routing method provided by the present invention is smaller than the routing time based on the shortest-path routing method, and as the traffic volume increases, the difference becomes more and more obvious. The invention can effectively reduce the end-to-end routing delay.
As can be seen from fig. 8, as the traffic volume increases, the routing cost of the routing method and the routing cost based on the shortest-path routing method both gradually increase, and in comparison, the routing time of the routing method provided by the present invention is shorter than the routing cost based on the shortest-path routing method, and as the traffic volume increases, the difference becomes more and more obvious. The invention can effectively reduce the end-to-end routing overhead.
The above description is only for the purpose of illustrating the present invention and the appended claims are not to be construed as limiting the scope of the invention, which is intended to cover all modifications, equivalents and improvements that are within the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. A low earth orbit satellite constellation-oriented service quality assurance routing method is characterized in that the low earth orbit satellite constellation-oriented service quality assurance routing method distinguishes service quality requirements of different types of services by carrying out priority classification on the services; constructing priority service queues according to different priorities to guarantee the service quality requirement of each route; aiming at the characteristic that a low earth orbit satellite can simultaneously communicate with four adjacent satellite nodes, the routing algorithm for service quality guarantee is designed to realize multipath parallel transmission of services so as to ensure the end-to-end time delay and bandwidth requirements of service flows.
2. The method for selecting qos-guaranteed routing for low-earth satellite constellations according to claim 1, wherein the method for selecting qos-guaranteed routing for low-earth satellite constellations divides services into eight types of priority services according to qos requirements of different types of services, constructs a directed network topology according to service priorities, determines node and link state information in 2 hops by using hello packets exchanged between satellites, and updates weights on the directed network topology in real time.
3. The low-earth-orbit-satellite-constellation-oriented QoS-guarantee routing method of claim 1, wherein the low-earth-orbit-satellite-constellation-oriented QoS-guarantee routing method updates undirected network topology maps, deletes or adds back a failure or restores routing table information of satellite nodes by detecting 2-hop internal nodes and link state information.
4. The method for selecting qos-guaranteed routing for low earth orbit satellite constellations of claim 1, wherein the qos-guaranteed routing for low earth orbit satellite constellations differentiates multiple-queue acceleration and deceleration mechanisms for multi-priority service data packets within a satellite node, and dynamically adjusts the priority of the service data packets according to the remaining allowed time and the number of hops of the service data packets, thereby implementing acceleration and deceleration processing of the service data packets within the satellite node.
5. The low earth orbit satellite constellation-oriented qos route selection method according to claim 1, wherein the low earth orbit satellite constellation-oriented qos route selection method specifically includes:
step one, dividing service quality priority according to service quality requirements;
step two, constructing a undirected network topological graph according to the service quality index;
step three, updating the undirected network topology edge weight in real time according to the node and link state information;
detecting state information of adjacent nodes and links to generate a routing table;
step five, dynamically adjusting the service quality grades of different service flows;
and step six, judging and determining a next hop routing node.
6. The low-earth-orbit-satellite-constellation-oriented quality-of-service-assurance routing method of claim 5, wherein the method comprisesThe step one of dividing the service quality priority according to the service quality requirement specifically comprises the following steps: there is a satellite communication network, each satellite is regarded as an independent node and is expressed by M (n is more than or equal to 1 and less than or equal to M), adjacent nodes i and j of any two communication satellites form an undirected graph G (i, j), a communication link existing between the satellites i and j (i is more than or equal to 1 and j is less than or equal to M) is regarded as an edge l, link state information is expressed by l (i, j), and the weight on the edge is the transmission delay overhead T of the links i and j i,j And available bandwidth W i,j The constructed two-dimensional array l (i, j) is expressed as follows:
the service quality indicator of the data packet eta comprises single-hop allowed transmission delay
And bandwidth requirements
According to the time delay range (0ms,100 ms)]、(100ms,200ms]、(200ms,300ms]、(300ms,400ms]And (400ms,500 ms)]Five queue priorities are set from low to high:
the step two of constructing the undirected network topology map according to the service quality index specifically comprises the following steps:
(2a) the transmission delay overhead T of the link consists of four parts:
T＝T transmission +T propagation +T processing +T judgement ；
wherein T is transmission 、T propagation 、T processing And T judgement Respectively representing transmission time delay, propagation time delay, processing time delay and calculated time delay required by transmitting service data, wherein the calculated time delay is used for judgingThe lifetime that a certain link can last before handover;
(2b) in the network initialization process, updating global topology information when a satellite accesses a network;
the updating of the undirected network topology edge weight in real time according to the three nodes and the link state information specifically comprises the following steps:
(3a) satellite k periodically sends a neighbor list N containing 1 hop to satellite j k (1) Link state information l (k, j) and node k internal current Load record table Load k Hello package of (c);
(3b) satellite j periodically sends a neighbor list N containing 1 hop to satellite i j (1)、N k (1) Link state information l (j, i), l (k, j), Load record table Load j 、Load k Hello package (c).
7. The low earth orbit satellite constellation-oriented quality of service assurance routing method of claim 5, wherein the step four of detecting neighboring nodes, link state information, generating a routing table specifically comprises:
(4a) when finding that a node link in 2 hops is failed or switched, the satellite i deletes the link related information related to the node from the routing table, and adds the relative node address to the routing table again after the link is recovered to be normal;
(4b) satellite i constructs 2-hop neighbor list N according to hello packet i (2) 2-hop neighbor Load information table Load j 、Load k Wherein Load is j For first-hop Load information table, Load k Is a second hop load information table. Update the intra-2-hop link state information l (i, j, k) and the edge weights:
l(i,j,k)＝{T i,j ,T j,k ,W i,j ,W j,k ,；1≤i,j,k≤M}；
(4c) the satellite i is arranged in an ascending order according to the total transmission time cost of the link state information in 2 hops, and the shortest path l is divided First Minor short circuit Second And so on; if the total transmission time cost of a plurality of links is the same, selecting the path with the largest available bandwidth W of the next hop link as the shortest path l First (ii) a Next hopWhen the available bandwidth W of the link is the same, selecting the path with the least load of the next hop node as the shortest path l First (ii) a When the loads are the same, randomly generating the shortest path, and generating a local routing table by the corresponding link;
(4d) after receiving a data packet eta to be transferred, a satellite i firstly judges whether the node is a target node, and if so, the algorithm is ended;
the step five of dynamically adjusting the service quality levels of different service flows specifically includes:
(5a) acquiring bandwidth W required by satellite i to forward data packet eta η ；
(5b) Sum of time delays experienced by satellite i analysis data packet eta before arrival
(5c) Total propagation delay indicator for data packet eta
And the total time delay that has been experienced
Comparing to calculate the residual allowable transmission delay
(5d) The satellite i judges the hop count hop between the data packet eta and the destination node in advance according to the global routing table obtained when the satellite is accessed to the network η Further calculating the single-hop allowed transmission delay
(5e) Satellite i allows transmission delay according to single hop
The current quality of service class of the traffic flow is dynamically calculated in advance,
the smaller, the higher the quality of service level;
(5f) satellite i modifies bandwidth requirements of packet η over the link
(5g) Storing the data packets eta into the queues according to the priority levels, merging the data packets eta into data streams, and sequentially forwarding the data packets from the queue1 with the highest priority level 1;
the sixth step of judging and determining the next hop routing node specifically includes:
(6a) satellite i modifies the total bandwidth requirement of queue1 over the link
(6b) If shortest path l of satellite i First L (i, j), time delay T to next hop satellite j i,j The service quality delay requirement of the current queue1 is met:
continuing to further judge the transmission bandwidth:
(6c) when the link has available bandwidth W i,j Greater than the bandwidth requirement of the current queue 1:
all data packets in the current queue1 are transmitted to the next hop satellite j;
(6d) otherwise, when the available bandwidth W i,j When the bandwidth requirement of the data flow is less than the bandwidth requirement of the data flow, the data packets in the queue are transmitted by using the current all remaining link bandwidth, and the remaining data packets in the queue1 are transmitted to the secondary short path l Second Next hop satellite node up, satellite i bandwidth requirement for secondary short circuit
Comprises the following steps:
(6e) and continuing to compare the available bandwidth on the second shortest path with the data stream transmission requirement, and so on until the available bandwidth and the data stream transmission requirement are met. If the transmission requirement is not met all the time, the service quality cannot be guaranteed, and the process goes to (6 g);
(6f) if shortest path l of satellite i First Time delay T to next hop satellite j i,j If the requirement of service quality guarantee delay of the current queue1 is not met, the algorithm cannot be executed, and the process goes to (6 g);
(6g) the algorithm exits.
8. A computer arrangement, characterized in that the computer arrangement comprises a memory and a processor, the memory storing a computer program which, when executed by the processor, causes the processor to carry out the steps of the method for low earth satellite constellation oriented quality of service assurance routing according to any one of claims 1 to 7.
9. A computer readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform the steps of the method for low earth orbit satellite constellation oriented quality of service assurance routing according to any one of claims 1 to 7.
10. A low-earth orbit satellite constellation routing system for implementing the low-earth orbit satellite constellation-oriented quality of service guarantee routing method according to any one of claims 1 to 7, wherein the low-earth orbit satellite constellation routing system comprises:
the service priority classification module is used for classifying the service priority to distinguish the service quality requirements of different types of services;
the priority service queue building module is used for building priority service queues according to different priorities and guaranteeing the service quality requirements of the routes one by one;
and the routing algorithm design module is used for designing a routing algorithm for service quality guarantee aiming at the characteristic that a low earth orbit satellite can simultaneously communicate with four adjacent satellite nodes, and realizing multipath parallel transmission of services so as to ensure the end-to-end time delay and bandwidth requirements of service flows.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210307051.3A CN114828144A (en) | 2022-03-27 | 2022-03-27 | Low-earth-orbit satellite constellation-oriented service quality guarantee routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210307051.3A CN114828144A (en) | 2022-03-27 | 2022-03-27 | Low-earth-orbit satellite constellation-oriented service quality guarantee routing method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114828144A true CN114828144A (en) | 2022-07-29 |
Family
ID=82530921
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210307051.3A Pending CN114828144A (en) | 2022-03-27 | 2022-03-27 | Low-earth-orbit satellite constellation-oriented service quality guarantee routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114828144A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115580578A (en) * | 2022-09-01 | 2023-01-06 | 广东电网有限责任公司 | Routing method and device for multi-service demand guarantee |
| CN117675679A (en) * | 2023-11-24 | 2024-03-08 | 航天恒星科技有限公司 | Satellite time sensitive route scheduling method based on domain optimization |
| CN117915427A (en) * | 2024-03-19 | 2024-04-19 | 中国民航大学 | Space-aware routing protocol of aviation self-organizing network based on position prediction |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101645830A (en) * | 2008-08-07 | 2010-02-10 | 中国移动通信集团公司 | Method for packet scheduling of multi-hop network and node device |
| CN107453801A (en) * | 2017-08-28 | 2017-12-08 | 西安电子科技大学 | A kind of Layered Multipath method for routing towards satellite network |
| CN112187340A (en) * | 2020-09-30 | 2021-01-05 | 中国人民解放军陆军工程大学 | Rerouting method for guaranteeing QoS of low-orbit constellation network |
| CN112187342A (en) * | 2020-09-30 | 2021-01-05 | 西安交通大学 | Satellite traffic routing method and system based on energy perception and load balancing |
| CN113067625A (en) * | 2021-03-17 | 2021-07-02 | 西安电子科技大学 | Satellite network multi-service QoS routing method based on region division |
| CN113489528A (en) * | 2021-07-05 | 2021-10-08 | 北京理工大学 | Self-adaptive survivability method suitable for inter-satellite routing |
-
2022
- 2022-03-27 CN CN202210307051.3A patent/CN114828144A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101645830A (en) * | 2008-08-07 | 2010-02-10 | 中国移动通信集团公司 | Method for packet scheduling of multi-hop network and node device |
| CN107453801A (en) * | 2017-08-28 | 2017-12-08 | 西安电子科技大学 | A kind of Layered Multipath method for routing towards satellite network |
| CN112187340A (en) * | 2020-09-30 | 2021-01-05 | 中国人民解放军陆军工程大学 | Rerouting method for guaranteeing QoS of low-orbit constellation network |
| CN112187342A (en) * | 2020-09-30 | 2021-01-05 | 西安交通大学 | Satellite traffic routing method and system based on energy perception and load balancing |
| CN113067625A (en) * | 2021-03-17 | 2021-07-02 | 西安电子科技大学 | Satellite network multi-service QoS routing method based on region division |
| CN113489528A (en) * | 2021-07-05 | 2021-10-08 | 北京理工大学 | Self-adaptive survivability method suitable for inter-satellite routing |
Non-Patent Citations (5)
| Title |
|---|
| HONGYONG AN: "Priority-based distributed dynamic multipath routing for LEO satellite networks", 9TH INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA, 5 March 2015 (2015-03-05), pages 1 * |
| JIARONG HAN: "Task Scheduling of High Dynamic Edge Cluster in Satellite Edge Computing", 2020 IEEE WORLD CONGRESS ON SERVICES (SERVICES), 21 December 2020 (2020-12-21) * |
| LI YANG: "MQRP: QoS Attribute Decision Optimization for Satellite Network Routing", 2018 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, ARCHITECTURE AND STORAGE (NAS), 1 November 2018 (2018-11-01) * |
| 董超颖: "低轨卫星星座网络路由新方法", 计算机科学, 21 August 2020 (2020-08-21) * |
| 邢川;陈二虎;韩笑冬;: "基于动静结合方法的卫星网络路由方法研究", 空间控制技术与应用, no. 03, 15 June 2020 (2020-06-15) * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115580578A (en) * | 2022-09-01 | 2023-01-06 | 广东电网有限责任公司 | Routing method and device for multi-service demand guarantee |
| CN117675679A (en) * | 2023-11-24 | 2024-03-08 | 航天恒星科技有限公司 | Satellite time sensitive route scheduling method based on domain optimization |
| CN117915427A (en) * | 2024-03-19 | 2024-04-19 | 中国民航大学 | Space-aware routing protocol of aviation self-organizing network based on position prediction |
| CN117915427B (en) * | 2024-03-19 | 2024-05-28 | 中国民航大学 | Space perception routing method for aviation self-organizing network based on position prediction |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114828144A (en) | Low-earth-orbit satellite constellation-oriented service quality guarantee routing method | |
| CN106656302B (en) | Distributed node adaptive routing algorithm towards LEO satellite network | |
| EP2697942B1 (en) | Condensed core-energy-efficient architecture for wan ip backbones | |
| CN111294108B (en) | Efficient routing method for orthogonal circular orbit configuration satellite constellation | |
| US7099341B2 (en) | Traffic routing management system using the open shortest path first algorithm | |
| CN110505153A (en) | A kind of mixed logic dynamic method of Incorporate | |
| CN105791118A (en) | LEO/GEO-double-layer-satellite-network-oriented routing policy | |
| CN113347678B (en) | 5G constellation route partition control method | |
| Long | Satellite network robust QoS-aware routing | |
| CN109586785B (en) | Low-orbit satellite network routing strategy based on K shortest path algorithm | |
| Alresaini et al. | Backpressure delay enhancement for encounter-based mobile networks while sustaining throughput optimality | |
| CN106452555A (en) | Multi-path optimization algorithm planning method based on medium and low earth orbit satellite network | |
| CN113507314A (en) | Inter-satellite data transmission method | |
| CN114268575A (en) | Self-adaptive three-dimensional transmission method and system in heaven-earth integrated information network | |
| Xu et al. | A hybrid routing algorithm in terrestrial-satellite integrated network | |
| CN116708271A (en) | Inter-satellite routing method and device for low-orbit constellation network | |
| Roth et al. | Distributed sdn-based load-balanced routing for low earth orbit satellite constellation networks | |
| Liu et al. | Load Balancing Routing Algorithm of Low‐Orbit Communication Satellite Network Traffic Based on Machine Learning | |
| Yuan et al. | Load balancing routing for single-layered satellite networks | |
| Zhang et al. | Dynamical controller placement among SDN space-terrestrial integrated networks | |
| Guo et al. | Dynamic MAC protocol for tactical data links | |
| Prabavathi et al. | A delay and energy efficient multicast routing protocol using IWO and MOLO algorithm for vehicular networks | |
| Ma | Adaptive distributed load balancing routing mechanism for LEO satellite IP networks | |
| CN117176645A (en) | Low-orbit communication satellite constellation routing method and system based on irrelevant multipath | |
| Zhao et al. | Research on the Application of Software-Defined Networking in Low Earth Orbit Satellite Remote Sensing Communications |
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 |