CN114828144A - Low-earth-orbit satellite constellation-oriented service quality guarantee routing method - Google Patents
Low-earth-orbit satellite constellation-oriented service quality guarantee routing methodDownload PDFInfo
- Publication number
- CN114828144A CN114828144ACN202210307051.3ACN202210307051ACN114828144ACN 114828144 ACN114828144 ACN 114828144ACN 202210307051 ACN202210307051 ACN 202210307051ACN 114828144 ACN114828144 ACN 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.)
- Granted
Links
- 238000000034methodMethods0.000titleclaimsabstractdescription56
- 230000005540biological transmissionEffects0.000claimsabstractdescription95
- 238000004422calculation algorithmMethods0.000claimsabstractdescription34
- 238000000275quality assuranceMethods0.000claimsdescription22
- 235000008694Humulus lupulusNutrition0.000claimsdescription17
- 238000004891communicationMethods0.000claimsdescription17
- 238000012545processingMethods0.000claimsdescription17
- 230000008569processEffects0.000claimsdescription9
- 230000007246mechanismEffects0.000claimsdescription8
- 230000001133accelerationEffects0.000claimsdescription7
- 238000004590computer programMethods0.000claimsdescription5
- 238000013461designMethods0.000claimsdescription5
- 238000010187selection methodMethods0.000claimsdescription5
- 230000001174ascending effectEffects0.000claimsdescription4
- 230000001934delayEffects0.000claimsdescription4
- 238000004458analytical methodMethods0.000claimsdescription2
- 238000004088simulationMethods0.000abstractdescription9
- 238000004364calculation methodMethods0.000description6
- 238000010586diagramMethods0.000description5
- 238000003491arrayMethods0.000description3
- 230000000694effectsEffects0.000description3
- 238000012827research and developmentMethods0.000description3
- 125000004122cyclic groupChemical group0.000description2
- 230000006870functionEffects0.000description2
- 230000008092positive effectEffects0.000description2
- 230000015556catabolic processEffects0.000description1
- 230000007423decreaseEffects0.000description1
- 230000007547defectEffects0.000description1
- 230000007123defenseEffects0.000description1
- 238000006731degradation reactionMethods0.000description1
- 238000005516engineering processMethods0.000description1
- 230000010354integrationEffects0.000description1
- 238000012423maintenanceMethods0.000description1
- 238000013178mathematical modelMethods0.000description1
- 238000012986modificationMethods0.000description1
- 230000004048modificationEffects0.000description1
- 230000006855networkingEffects0.000description1
- 230000003287optical effectEffects0.000description1
- 238000011160researchMethods0.000description1
- 238000012216screeningMethods0.000description1
- 239000004065semiconductorSubstances0.000description1
- 230000002459sustained effectEffects0.000description1
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
Description
Translated fromChinese技术领域technical field
本发明属于卫星互联网技术领域，尤其涉及一种面向低轨卫星星座的服务质量保障路由选择方法。The invention belongs to the technical field of satellite Internet, in particular to a low-orbit satellite constellation-oriented service quality assurance routing method.
背景技术Background technique
目前，卫星互联网是我国近年来重点研发的天基信息传输系统，是空天地海一体化的重要组成部分。太空中的卫星通过建立星间链路实现全球无缝覆盖，进行信息传输，在国防领域和远距离通信中发挥了重要的作用，与工业互联网、5G、物联网共同属于新型基础设施。随着低轨卫星星座规模的增长，链路中的业务类型急剧增加，路由协议根据单一时延指标进行无差别服务时并未考虑各类型业务对网络服务质量的需求差异，不仅无法合理利用卫星互联网资源，还会造成网络拥塞，影响网络整体性能。因此研究面向服务质量保障的高效路由协议具有重要的意义。At present, satellite Internet is a space-based information transmission system that my country has focused on research and development in recent years, and it is an important part of the integration of space, space, earth and sea. Satellites in space achieve seamless global coverage by establishing inter-satellite links and transmit information. They play an important role in the field of national defense and long-distance communications. They belong to a new type of infrastructure together with the Industrial Internet, 5G, and the Internet of Things. With the growth of the low-orbit satellite constellation scale, the types of services in the link increase sharply, and the routing protocol does not take into account the differences in the demand for network service quality of various types of services when performing indiscriminate services based on a single delay index, not only cannot use satellites reasonably Internet resources can also cause network congestion and affect the overall performance of the network. Therefore, it is of great significance to study efficient routing protocols for QoS assurance.
由于卫星互联网承载着多类异构优先级业务，这些业务所对应的服务质量需求各不相同，传统基于最短路径的路由选择方案无法解决同时满足各类业务传输过程所需服务质量需求的问题。为了能够充分发挥卫星互联网的承载能力、提高网络资源的利用率并提升业务的传输效率，需要克服如下两方面挑战：其一，根据业务服务质量需求，实现对业务传输优先级的划分，明确不同业务的服务优先顺序；其二，根据卫星互联网的承载能力，定制面向服务质量保障的低轨卫星星座路由选择方法，从而为差异化的业务服务质量需求提供保障。Since the satellite Internet carries multiple types of heterogeneous priority services, the service quality requirements corresponding to these services are different, and the traditional shortest path-based routing scheme cannot solve the problem of simultaneously satisfying the service quality requirements for various types of service transmission processes. In order to give full play to the carrying capacity of satellite Internet, improve the utilization rate of network resources and improve the efficiency of service transmission, the following two challenges need to be overcome: First, according to the service quality requirements of the service, the priority of service transmission should be divided, and the different Second, according to the carrying capacity of satellite Internet, customize the low-orbit satellite constellation routing method for service quality assurance, so as to provide guarantee for differentiated business service quality requirements.
EKici等人在文章“A multicast routing algorithm for LEO satellite IPnetworks.IEEE/ACM Trans.Netw.10(2),183–192(2002)”中采用MRA路由算法决定下一跳路由节点，减少了传输时延，集中式路由算法中卫星需要掌握全局拓扑信息，耗费大量资源更新和存储路由表，当星座规模较大，链路发生切换时路由开销急剧增加。LIU等人在文章“Load-balancing routing algorithmbased on segment routing for traffic returnin LEO satellite networks[J].IEEE Access,2019,7：112044-112053.”中提出了分布式的分段路由算法，将卫星区域进一步划分为轻负载区域和重负载区域，并在两种区域内分别执行预平衡最短路径算法和最小权重路径算法，在提升吞吐量的同时增加了节点的存储开销，算法较复杂。因此，冯玺宝在文章“多层卫星网络服务质量路由协议研究[D].哈尔滨：哈尔滨工业大学,2016.”中提出最小跳数路由算法解决拥塞问题，根据地理位置信息筛选出两条备选路径，结合负载选择最佳路径进行传输，减少路由开销，但只有指定节点具有路径筛选功能，需要频繁更新路由信息。In the article "A multicast routing algorithm for LEO satellite IPnetworks.IEEE/ACM Trans.Netw.10(2), 183–192(2002)", EKici et al. adopted the MRA routing algorithm to determine the next hop routing node, reducing the transmission time. In the centralized routing algorithm, the satellite needs to master the global topology information, and consumes a lot of resources to update and store the routing table. When the constellation scale is large, the routing overhead increases sharply when the link is switched. LIU et al. proposed a distributed segment routing algorithm in the article "Load-balancing routing algorithm based on segment routing for traffic return in LEO satellite networks [J]. IEEE Access, 2019, 7: 112044-112053." It is further divided into a light load area and a heavy load area, and the pre-balanced shortest path algorithm and the least weight path algorithm are executed in the two areas respectively, which increases the storage overhead of the node while improving the throughput, and the algorithm is more complicated. Therefore, Feng Xibao proposed the minimum hop routing algorithm to solve the congestion problem in the article "Research on the Quality of Service Routing Protocol for Multilayer Satellite Networks [D]. Harbin: Harbin Institute of Technology, 2016.", and screened out two alternative paths according to the geographical location information. , select the best path for transmission in combination with the load, and reduce the routing overhead, but only the designated node has the path screening function, and the routing information needs to be updated frequently.
通过上述分析，现有技术存在的问题及缺陷为：现有技术未考虑基于最短路径的路由选择方法中存在的链路拥塞所导致的端到端平均时延、链路开销性能下降。Through the above analysis, the existing problems and defects in the prior art are: the prior art does not consider the end-to-end average delay and link overhead performance degradation caused by link congestion in the shortest path-based routing method.
发明内容SUMMARY OF THE INVENTION
针对现有技术存在的问题，本发明提供了一种面向低轨卫星星座的服务质量保障路由选择方法。Aiming at the problems existing in the prior art, the present invention provides a route selection method for quality of service assurance oriented to a low-orbit satellite constellation.
本发明是这样实现的，一种面向低轨卫星星座的服务质量保障路由选择方法，其特征在于，所述面向低轨卫星星座的服务质量保障路由选择方法通过对业务进行优先级分类，区分不同类型业务的服务质量需求；根据不同优先级构建优先级服务队列，保障逐条路由的服务质量需求；针对低轨卫星具有能够与相邻四个卫星节点同时通信的特点，通过设计面向服务质量保障的路由选择算法，实现业务的多路并传以保证业务流的端到端时延和带宽需求。The present invention is implemented in this way, a method for routing quality assurance of service quality oriented to low-orbit satellite constellations, characterized in that, the method for routing selection of quality of service assurance oriented to low-orbit satellite constellations distinguishes different types of services by prioritizing services. Service quality requirements of different types of services; build priority service queues according to different priorities to ensure the service quality requirements of route-by-route; for low-orbit satellites that can communicate with four adjacent satellite nodes at the same time, through the design of service quality assurance-oriented service quality requirements The routing algorithm implements multiple simultaneous transmission of services to ensure the end-to-end delay and bandwidth requirements of the service flow.
本发明根据不同类型业务的服务质量需求，将业务划分为八类优先级业务，并按照业务优先级构建无向网络拓扑图，利用卫星之间交互的hello包来确定2跳内的节点、链路状态信息，实时更新无向网络拓扑图上边的权重。本发明循环多链路路径分流机制，循环判断最短路径链路是否满足业务传输需求，不断将多余业务分流到次短链路上，实现业务的多路径传输，避免了单路径拥塞导致服务质量性能下降。According to the service quality requirements of different types of services, the invention divides the services into eight types of priority services, constructs an undirected network topology map according to the service priorities, and uses the hello packets exchanged between satellites to determine the nodes and chains within 2 hops. road status information, and update the weights on the top of the undirected network topology graph in real time. The cyclic multi-link path distribution mechanism of the present invention cyclically judges whether the shortest path link meets the service transmission requirements, continuously distributes redundant services to the next shortest link, realizes multi-path transmission of services, and avoids single path congestion leading to service quality performance. decline.
本发明故障及切换链路避免机制，通过探测2跳内节点、链路状态信息，更新无向网络拓扑图，删除或者回添故障或者恢复卫星节点的路由表信息，避免了链路故障以及切换引发的丢包及时延增大现象。The fault and switching link avoidance mechanism of the present invention, by detecting the node and link state information within 2 hops, updates the topology map of the undirected network, deletes or adds back the routing table information of the fault or restores the satellite node, and avoids the link fault and switching. The resulting packet loss and delay increase.
本发明在卫星节点内部，差异化多优先级业务数据包多队列加速和减速机制，根据业务数据包的剩余允许时间和跳数来动态调整业务数据包的优先级，实现对业务数据包在卫星节点内部进行加速、减速处理，进一步提升本路由方法的服务质量保障能力。The present invention, within the satellite node, differentiates the multi-priority service data packet multi-queue acceleration and deceleration mechanism, dynamically adjusts the priority of the service data packet according to the remaining allowable time and hop count of the service data packet, and realizes the service data packet in the satellite. Acceleration and deceleration processing are performed inside the node to further improve the service quality assurance capability of this routing method.
进一步，所述面向低轨卫星星座的服务质量保障路由选择方法具体包括：Further, the QoS guarantee routing method for the low-orbit satellite constellation specifically includes:
步骤一，根据业务服务质量需求，划分服务质量优先级；将服务指标相近的业务进行分类，简化服务类别，降低本发明的实现复杂度。Step 1: Classify service quality priorities according to service quality requirements of services; classify services with similar service indicators, simplify service categories, and reduce the implementation complexity of the present invention.
步骤二，根据业务服务质量指标构建无向网络拓扑图；为计算最短路径和次短路径建立数学模型。In
步骤三，根据节点、链路状态信息，实时更新无向网络拓扑边权重；考虑网络实时状态信息，提升本发明的时效性和高效性Step 3: Update undirected network topology edge weights in real time according to node and link state information; consider real-time network state information to improve the timeliness and efficiency of the present invention
步骤四，探测相邻节点、链路状态信息，生成路由表；为业务提供最短路和次短路信息，为多路径分流提供保障。Step 4: Detect adjacent nodes and link status information, and generate a routing table; provide shortest and secondary short-circuit information for services, and provide protection for multi-path offloading.
步骤五，动态调整不同业务流的服务质量等级；实现业务数据包在卫星节点内的加减速，提升本发明的服务质量的保障能力。Step 5: Dynamically adjust the service quality levels of different service flows; realize the acceleration and deceleration of service data packets in the satellite node, and improve the service quality assurance capability of the present invention.
步骤六，判断、确定下一跳路由节点。确定最短路径或者是次短路径的下一跳节点，实现多路径分流。Step 6: Judge and determine the next hop routing node. Determine the next hop node of the shortest path or the next shortest path to implement multi-path offloading.
进一步，所述步骤一根据业务服务质量需求，划分服务质量优先级具体包括：有一个卫星通信网络，将每颗卫星视为一个独立节点，用m(1≤n≤M)表示，任意两颗通信卫星的相邻节点i、j构成无向图G(i,j)，卫星i、j(1≤i,j≤M)间存在的通信链路视为边l，链路状态信息用l(i,j)表示，边上权重是由链路i、j的传输时延开销Ti,j和可用带宽Wi,j构成的二维数组l(i,j)表示如下：Further, in the
数据包η的服务质量指标包含单跳允许传输时延
进一步，所述步骤二根据业务服务质量指标构建无向网络拓扑图具体包括：Further, the
(2a)链路的传输时延开销T由四部分构成：(2a) The transmission delay overhead T of the link consists of four parts:
T＝Ttransmission+Tpropagation+Tprocessing+Tjudgement；T=Ttransmission +Tpropagation +Tprocessing +Tjudgement ;
其中Ttransmission、Tpropagation、Tprocessing和Tjudgement分别表示传输业务数据所需的传输时延、传播时延、处理时延以及计算时延，其中计算时延用于判断某一链路在切换前能够持续的生存期；Among them, Ttransmission , Tpropagation , Tprocessing and Tjudgement represent the transmission delay, propagation delay, processing delay and calculation delay required for transmitting service data, respectively, and the calculation delay is used to judge whether a link is before switching. sustainable lifespan;
(2b)在网络初始化过程中，卫星入网时更新全局拓扑信息。(2b) During the network initialization process, the global topology information is updated when the satellite is connected to the network.
进一步，所述的面向低轨卫星星座的服务质量保障路由选择方法，其特征在于，所述步骤三根据节点、链路状态信息，实时更新无向网络拓扑边权重具体包括：Further, the described low-orbit satellite constellation-oriented service quality assurance routing method is characterized in that, in the
(3a)卫星k定期向卫星j发送含有1跳邻居列表Nk(1)、链路状态信息l(k,j)和节点k内部当前负载记录表Loadk的hello包；(3a) Satellite k periodically sends a hello packet containing 1-hop neighbor list Nk (1), link state information l(k ,j) and current load record table Loadk in node k to satellite j;
(3b)卫星j定期向卫星i发送含有1跳邻居列表Nj(1)、Nk(1)，链路状态信息l(j,i)、l(k,j)，负载记录表Loadj、Loadk的hello包。(3b) Satellite j periodically sends to satellite i a list of 1-hop neighbors Nj (1), Nk (1), link status information l(j,i), l(k,j), load record table Loadj , Loadk 's hello package.
进一步，所述步骤四探测相邻节点、链路状态信息，生成路由表具体包括：Further, the step 4 detects adjacent nodes and link state information, and generates a routing table specifically including:
(4a)卫星i发现2跳内节点链路发生故障或进行切换时，从路由表中删除涉及该节点的链路相关信息，链路恢复正常后，将相关节点地址重新添加至路由表中；(4a) When satellite i finds that the node link within 2 hops fails or switches, delete the link related information involving the node from the routing table, and re-add the relevant node address to the routing table after the link returns to normal;
(4b)卫星i根据hello包构建2跳邻居列表Ni(2)、2跳邻居负载信息表Loadj、Loadk，其中Loadj为第一跳负载信息表、Loadk为第二跳负载信息表。更新2跳内链路状态信息l(i,j,k)和边上权重：(4b) Satellitei builds a 2-hop neighbor list Ni (2), a 2-hop neighbor load information table Loadj , Loadk according to the hello packet, where Loadj is the first hop load information table, and Loadk is the second hop load information surface. Update link state information l(i,j,k) and edge weights within 2 hops:
l(i,j,k)＝{Ti,j,Tj,k,Wi,j,Wj,k,；1≤i,j,k≤M}；l(i,j,k)={Ti,j ,Tj,k ,Wi,j ,Wj,k ,;1≤i,j,k≤M};
(4c)卫星i按照2跳内的链路状态信息的总传输时间开销进行升序排列，划分出最短路lFirst、次短路lSecond，以此类推；如果多条链路的总传输时间开销相同，选择下一跳链路可用带宽W最大的路径设为最短路lFirst；当下一跳链路可用带宽W相同时，选择下一跳节点负载最少的路径设为最短路lFirst；当负载相同时，随机生成最短路，并将对应的链路生成本地路由表；(4c) The satellite i is arranged in ascending order according to the total transmission time overhead of the link state information within 2 hops, and divides the shortest path lFirst , the second short circuit lSecond , and so on; if the total transmission time overhead of multiple links is the same , select the path with the largest available bandwidth W of the next hop link as the shortest path lFirst ; when the available bandwidth W of the next hop link is the same, select the path with the least load of the next hop node as the shortest path lFirst ; At the same time, the shortest path is randomly generated, and the corresponding link is generated into the local routing table;
(4d)卫星i接收到需要中转的数据包η后，首先判断本节点是否为目的节点，如果是，则算法结束。(4d) After satellite i receives the data packet n that needs to be transferred, it firstly judges whether this node is the destination node, and if so, the algorithm ends.
进一步，所述步骤五动态调整不同业务流的服务质量等级具体包括：Further, the
(5a)获取卫星i转发数据包η所需要的带宽Wη；(5a) obtain the bandwidth Wn required by satellite i to forward data packet n ;
(5b)卫星i分析数据包η在到达之前经历的时延总和
(5c)对数据包η的总传输时延指标
(5d)卫星i根据入网时获得的全局路由表，预先判断数据包η与目的节点之间的跳数hopη，进一步计算单跳允许传输时延
(5e)卫星i根据单跳允许传输时延
(5f)卫星i修改数据包η在该链路上的带宽需求
(5g)将数据包η按照优先级等级存入队列中，合并成数据流，并按顺序从最高优先级level1的队列queue1开始进行顺序转发处理；(5g) data packet n is stored in the queue according to the priority level, merged into a data stream, and sequentially forwards processing from the queue queue1 of the highest priority level1 in sequence;
所述步骤六判断、确定下一跳路由节点具体包括：The
(6a)卫星i修改队列queue1在该链路上的带宽总需求
(6b)如果卫星i的最短路径lFirst为l(i,j)，到下一跳卫星j的时延Ti,j满足当前队列queue1的服务质量时延需求：(6b) If the shortest pathlFirst of satellite i is l(i,j), the delay Ti,j to the next hop satellite j satisfies the service quality delay requirement of the current queue queue1:
继续进一步判断传输带宽：Continue to further judge the transmission bandwidth:
(6c)当链路可用带宽Wi,j大于当前队列queue1的带宽需求时：(6c) When the available bandwidth Wi,j of the link is greater than the bandwidth requirement of the current queue queue1:
将当前队列queue1中的所有数据包全部传输给下一跳卫星j；All data packets in the current queue queue1 are transmitted to the next hop satellite j;
(6d)否则，当可用带宽Wi,j小于数据流带宽的需求时，利用当前全部剩余链路带宽传输队列中的数据包，并将队列queue1中剩余的数据包传输给次短路径lSecond上的下一跳卫星节点，卫星i对次短路的带宽需求
(6e)继续比较次短路径上的可用带宽和数据流传输需求，以此类推直到满足为止。若一直不满足传输需求，则服务质量无法保障，转到(6g)；(6e) Continue to compare the available bandwidth and data stream transmission requirements on the next shortest path, and so on until satisfied. If the transmission demand has not been met, the service quality cannot be guaranteed, go to (6g);
(6f)如果卫星i的最短路径lFirst中，到下一跳卫星j的时延Ti,j不满足当前队列queue1的服务质量保障时延需求，则算法无法执行，转到(6g)；(6f) If in the shortest path lFirst of satellite i, the delay Ti,j to the next hop satellite j does not meet the service quality guarantee delay requirement of the current queue queue1, then the algorithm cannot be executed, and go to (6g);
(6g)算法退出。(6g) The algorithm exits.
本发明的另一目的在于提供一种计算机设备，所述计算机设备包括存储器和处理器，所述存储器存储有计算机程序，所述计算机程序被所述处理器执行时，使得所述处理器执行所述面向低轨卫星星座的服务质量保障路由选择方法的步骤。Another object of the present invention is to provide a computer device, the computer device includes a memory and a processor, the memory stores a computer program, and when the computer program is executed by the processor, the processor causes the processor to execute the program. Describe the steps of a low-orbit satellite constellation-oriented service quality assurance routing method.
本发明的另一目的在于提供一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时，使得所述处理器执行所述面向低轨卫星星座的服务质量保障路由选择方法的步骤。Another object of the present invention is to provide a computer-readable storage medium storing a computer program, which, when executed by a processor, causes the processor to execute the low-orbit satellite constellation-oriented service quality assurance routing steps of the method.
本发明的另一目的在于提供一种实施所述面向低轨卫星星座的服务质量保障路由选择方法的低轨卫星星座路由选择系统，所述低轨卫星星座路由选择系统包括：Another object of the present invention is to provide a low-orbit satellite constellation routing system that implements the low-orbit satellite constellation-oriented service quality assurance routing method, and the low-orbit satellite constellation routing system includes:
业务优先级分类模块，用于通过对业务进行优先级分类，区分不同类型业务的服务质量需求；The business priority classification module is used to distinguish the service quality requirements of different types of business by classifying the business priorities;
优先级服务队列构建模块，用于根据不同优先级构建优先级服务队列，保障逐条路由的服务质量需求；The priority service queue building module is used to build priority service queues according to different priorities to ensure the service quality requirements of each route;
路由选择算法设计模块，用于针对低轨卫星具有能够与相邻四个卫星节点同时通信的特点，通过设计面向服务质量保障的路由选择算法，实现业务的多路并传以保证业务流的端到端时延和带宽需求。The routing algorithm design module is used for the characteristics of low-orbit satellites that can communicate with four adjacent satellite nodes at the same time. By designing a routing algorithm for service quality assurance, the multi-channel parallel transmission of services is realized to ensure the end of the service flow. End-to-end latency and bandwidth requirements.
结合上述的技术方案和解决的技术问题，请从以下几方面分析本发明所要保护的技术方案所具备的优点及积极效果为：In combination with the above-mentioned technical solutions and the technical problems solved, please analyze the advantages and positive effects of the technical solutions to be protected by the present invention from the following aspects:
第一、针对上述现有技术存在的技术问题以及解决该问题的难度，紧密结合本发明的所要保护的技术方案以及研发过程中结果和数据等，详细、深刻地分析本发明技术方案如何解决的技术问题，解决问题之后带来的一些具备创造性的技术效果。具体描述如下：First, in view of the technical problems existing in the above-mentioned prior art and the difficulty of solving the problems, closely combine the technical solutions to be protected of the present invention and the results and data in the research and development process, etc., and analyze in detail and profoundly how to solve the technical solutions of the present invention. Technical problems, some creative technical effects brought about by solving problems. The specific description is as follows:
针对单路径传输过程发生拥塞导致业务数据传输服务质量性能下降的问题，循环多链路路径分流机制，循环判断最短路径链路是否满足业务传输需求，不断将多余业务分流到次短链路上，实现业务的多路径传输。Aiming at the problem that the service quality performance of service data transmission is degraded due to congestion in the single-path transmission process, the cyclic multi-link path offloading mechanism cyclically judges whether the shortest path link meets the service transmission requirements, and continuously offloads redundant services to the next shortest link. Realize multi-path transmission of services.
针对链路故障以及切换引发的丢包及时延增大现象，故障及切换链路避免机制，通过探测2跳内节点、链路状态信息，动态更新无向网络拓扑图，删除或者回添故障或者恢复卫星节点的路由表信息，保障业务传输的连续性。Aiming at the phenomenon of packet loss and delay caused by link failure and switching, the failure and switching link avoidance mechanism can dynamically update the undirected network topology map by detecting the node and link status information within 2 hops, and delete or add faults or The routing table information of the satellite node is restored to ensure the continuity of service transmission.
针对固定优先级队列机制中高优先级业务数据包过度抢占低优先级业务数据包的传输资源导致低优先级业务数据包消耗大量网络资源后服务质量仍无法得到保障的问题，在卫星节点内部，差异化多优先级业务数据包多队列加速和减速机制，根据业务数据包的剩余允许时间和跳数来动态调整业务数据包的优先级，实现对业务数据包在卫星节点内部进行加速、减速处理，进一步提升本路由方法的服务质量保障能力。In the fixed-priority queuing mechanism, high-priority service packets preempt the transmission resources of low-priority service packets excessively, so that service quality cannot be guaranteed even after low-priority service packets consume a large amount of network resources. The multi-queue acceleration and deceleration mechanism of multi-priority service data packets is implemented, and the priority of service data packets is dynamically adjusted according to the remaining allowable time and hops of the service data packets, so as to realize the acceleration and deceleration processing of service data packets inside the satellite node. The service quality assurance capability of the routing method is further improved.
第二，把技术方案看做一个整体或者从产品的角度，本发明所要保护的技术方案具备的技术效果和优点，具体描述如下：本发明由于根据不同业务的服务质量需求对业务服务的优先级进行了划分，确定了不同服务优先等级业务的服务顺序，解决了传统尽力而为路由方案中无法为各类业务提供差异化传输服务的问题。本发明通过提出一种面向服务质量保障的低轨卫星星座路由选择方法，利用多径、链路差异和星间切换等卫星互联网承载特征，充分发挥了网络节点、链路资源，克服了传统基于最短路径的路由选择方法所造成的链路拥塞问题，实现了能够同时为不同业务提供差异化的服务质量保障。Second, considering the technical solution as a whole or from the product point of view, the technical effects and advantages of the technical solution to be protected by the present invention are specifically described as follows: It divides and determines the service order of services with different service priority levels, and solves the problem that the traditional best-effort routing scheme cannot provide differentiated transmission services for various services. The invention proposes a low-orbit satellite constellation routing method oriented to service quality assurance, utilizes satellite Internet bearing features such as multipath, link difference and inter-satellite handover, fully utilizes network nodes and link resources, and overcomes the traditional The link congestion problem caused by the shortest path routing method realizes that it can provide differentiated service quality assurance for different services at the same time.
本发明面向服务质量保障的低轨卫星星座路由选择方法利用卫星多径传输的特点，实时更新链路状态和业务优先级，在时延允许范围内为每个业务流选择最佳的传输路径，降低路由维护开销的同时有效地避免了由于单一节点负载较重造成排队时延增加的情况，保证了业务的服务质量。The low-orbit satellite constellation routing method for service quality assurance of the present invention utilizes the characteristics of satellite multi-path transmission to update the link state and service priority in real time, and selects the best transmission path for each service flow within the allowable range of time delay. While reducing the routing maintenance overhead, it effectively avoids the increase of queuing delay due to the heavy load of a single node, and ensures the service quality of the business.
第三，作为本发明的权利要求的创造性辅助证据，还体现在以下几个重要方面：Third, as an auxiliary evidence of inventive step for the claims of the present invention, it is also reflected in the following important aspects:
本发明的技术方案是否解决了人们一直渴望解决、但始终未能获得成功的技术难题：Whether the technical solution of the present invention has solved the technical problem that people have been eager to solve, but have not been able to achieve success:
本发明面向我国现阶段大规模低轨卫星组网业务传输服务质量保障关键技术领域，从通信网络七层协议中网络层的角度提供了保障业务传输服务质量需求的低轨卫星星座的路由选择方法，同时从数据链路层角度对服务质量保障方法性能进行了加强，实现了低轨卫星网络的传输服务质量保障，为我国低轨卫星星座协议体系设计提供了服务质量保障思路，解决了长期以来我国低轨卫星星座中一直渴望解决、但始终未能获得成功的传输服务质量保障问题。The invention is oriented to the key technical field of service quality assurance of large-scale low-orbit satellite networking business transmission service quality at the current stage in my country, and provides a low-orbit satellite constellation routing method that guarantees the service quality requirements of business transmission from the perspective of the network layer in the seven-layer protocol of the communication network. At the same time, the performance of the quality of service guarantee method has been strengthened from the perspective of the data link layer, and the transmission service quality guarantee of the low-orbit satellite network has been realized. my country's low-orbit satellite constellation has always been eager to solve the problem of transmission service quality assurance, but has never been successful.
附图说明Description of drawings
图1是本发明实施例提供的面向低轨卫星星座的服务质量保障路由选择方法流程图；Fig. 1 is a flow chart of a low-orbit satellite constellation-oriented service quality assurance routing method provided by an embodiment of the present invention;
图2是本发明实施例提供的低轨卫星星座路由选择系统的结构示意图；2 is a schematic structural diagram of a low-orbit satellite constellation routing system provided by an embodiment of the present invention;
图3是本发明实施例提供的低轨卫星网络场景图；3 is a low-orbit satellite network scenario diagram provided by an embodiment of the present invention;
图4是本发明实施例提供的面向服务质量保障路由总体流程图；Fig. 4 is the overall flow chart of the service quality assurance-oriented routing provided by the embodiment of the present invention;
图5是本发明实施例提供的队列优先级重构算法流程图；5 is a flowchart of a queue priority reconstruction algorithm provided by an embodiment of the present invention;
图6是本发明实施例提供的面向服务质量保障的路由的仿真结果图；6 is a simulation result diagram of a route for quality of service assurance provided by an embodiment of the present invention;
图7是本发明实施例提供的面向服务质量保障的路由端到端时延开销v.s.最短路路由端到端时延开销的仿真结果图；7 is a simulation result diagram of the end-to-end delay cost of the route for quality of service assurance v.s. the shortest route end-to-end delay cost provided by the embodiment of the present invention;
图8是本发明实施例提供的面向服务质量保障的路由端到端路径开销v.s.最短路路由端到端路径开销的仿真结果图；8 is a simulation result diagram of the end-to-end path cost of the route for quality of service assurance v.s. shortest route end-to-end path cost provided by an embodiment of the present invention;
图中：1、业务优先级分类模块；2、优先级服务队列构建模块；3、路由选择算法设计模块。In the figure: 1. Business priority classification module; 2. Priority service queue building module; 3. Routing algorithm design module.
具体实施方式Detailed ways
为了使本发明的目的、技术方案及优点更加清楚明白，以下结合实施例，对本发明进行进一步详细说明。应当理解，此处所描述的具体实施例仅仅用以解释本发明，并不用于限定本发明。In order to make the objectives, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention, but not to limit the present invention.
一、解释说明实施例。为了使本领域技术人员充分了解本发明如何具体实现，该部分是对权利要求技术方案进行展开说明的解释说明实施例。1. Explain the embodiment. In order for those skilled in the art to fully understand how the present invention is specifically implemented, this part is an explanatory embodiment for explaining the technical solutions of the claims.
如图1所示，本发明实施例提供的面向低轨卫星星座的服务质量保障路由选择方法包括以下步骤：As shown in FIG. 1 , the route selection method for quality of service assurance for a low-orbit satellite constellation provided by an embodiment of the present invention includes the following steps:
S101：通过对业务进行优先级分类，区分不同类型业务的服务质量需求；S101: Distinguish service quality requirements of different types of services by prioritizing services;
S102：根据不同优先级构建优先级服务队列，保障逐条路由的服务质量需求；S102: Build a priority service queue according to different priorities to ensure the service quality requirements of each route;
S103：针对低轨卫星具有能够与相邻四个卫星节点同时通信的特点，通过设计面向服务质量保障的路由选择算法，实现业务的多路并传以保证业务流的端到端时延和带宽需求。S103: Aiming at the characteristics of low-orbit satellites that can communicate with four adjacent satellite nodes at the same time, by designing a routing algorithm for service quality assurance, multi-channel simultaneous transmission of services is realized to ensure the end-to-end delay and bandwidth of the service flow. need.
如图2所示，本发明实施例提供的低轨卫星星座路由选择系统包括：As shown in FIG. 2 , the low-orbit satellite constellation routing system provided by the embodiment of the present invention includes:
业务优先级分类模块1，用于通过对业务进行优先级分类，区分不同类型业务的服务质量需求；The business
优先级服务队列构建模块2，用于根据不同优先级构建优先级服务队列，保障逐条路由的服务质量需求；The priority service
路由选择算法设计模块3，用于针对低轨卫星具有能够与相邻四个卫星节点同时通信的特点，通过设计面向服务质量保障的路由选择算法，实现业务的多路并传以保证业务流的端到端时延和带宽需求。Routing
本发明实施例提供的面向低轨卫星星座的服务质量保障路由选择方法具体包括以下步骤：The route selection method for quality of service assurance for a low-orbit satellite constellation provided by the embodiment of the present invention specifically includes the following steps:
(1)设有一个卫星通信网络，将每颗卫星视为一个独立节点m(1≤m≤M)，M表示卫星总个数。任意两颗通信的相邻卫星节点i、j构成的无向图G(i,j)。卫星i、j(1≤i,j≤M)间存在的通信链路视为边l，链路状态信息用l(i,j)表示，边上权重是由链路i、j的传输时延开销Ti,j和可用带宽Wi,j构成的二维数组l(i,j)，表示如下：(1) There is a satellite communication network, and each satellite is regarded as an independent node m (1≤m≤M), where M represents the total number of satellites. An undirected graph G(i,j) formed by any two communicating adjacent satellite nodes i, j. The communication link existing between satellites i and j (1≤i,j≤M) is regarded as edge l, the link state information is represented by l(i,j), and the weight on the edge is determined by the transmission time of links i and j. The two-dimensional array l(i,j) formed by the extension cost Ti,j and the available bandwidth Wi,j is expressed as follows:
数据包η的服务质量指标包含单跳允许传输时延
(2)链路的传输时延开销T由四部分构成：(2) The transmission delay overhead T of the link consists of four parts:
T＝Ttransmission+Tpropagation+Tprocessing+Tjudgement；T=Ttransmission +Tpropagation +Tprocessing +Tjudgement ;
其中Ttransmission、Tpropagation、Tprocessing和Tjudgement分别表示传输业务数据所需的传输时延、传播时延、处理时延以及计算时延，计算时延用于判断某一链路在切换前能够持续的生存期。Among them, Ttransmission , Tpropagation , Tprocessing and Tjudgement respectively represent the transmission delay, propagation delay, processing delay and calculation delay required for transmitting service data. The calculation delay is used to judge whether a link can be switched before switching. Sustained lifetime.
(3)在网络初始化过程中，卫星入网时更新全局拓扑信息。(3) During the network initialization process, the global topology information is updated when the satellite is connected to the network.
(4)卫星k定期向卫星j发送含有1跳邻居列表Nk(1)、链路状态信息l(k,j)和节点k内部当前负载记录表Loadk的hello包。(4) Satellite k periodically sends a hello packet containing 1-hop neighbor list Nk (1), link state information l(k,j) and current load record table Loadk in node k to satellite j.
(5)卫星j定期向卫星i发送含有1跳邻居列表Nj(1)、Nk(1)，链路状态信息l(j,i)、l(k,j)，负载记录表Loadj、Loadk的hello包。(5) Satellite j periodically sends to satellite i a list of 1-hop neighbors Nj (1), Nk (1), link status information l(j,i), l(k,j), load record table Loadj , Loadk 's hello package.
(6)卫星i发现2跳内节点链路发生故障或进行切换时，从路由表中删除涉及该节点的链路相关信息，链路恢复正常后，将相关节点重新添加至路由表中。(6) When satellite i finds that the node link within 2 hops is faulty or switches, it deletes the link related information related to the node from the routing table. After the link returns to normal, the related node is added to the routing table again.
(7)卫星i根据hello包构建2跳邻居列表Ni(2)、2跳邻居负载信息表Loadj、Loadk，其中Loadj为第一跳负载信息表、Loadk为第二跳负载信息表。更新2跳内链路状态信息l(i,j,k)和边上权重：(7) Satellitei builds a 2-hop neighbor list Ni (2), a 2-hop neighbor load information table Loadj , Loadk according to the hello packet, where Loadj is the first hop load information table, and Loadk is the second hop load information surface. Update link state information l(i,j,k) and edge weights within 2 hops:
l(i,j,k)＝{Ti,j,Tj,k,Wi,j,Wj,k,；1≤i,j,k≤M}；l(i,j,k)={Ti,j ,Tj,k ,Wi,j ,Wj,k ,;1≤i,j,k≤M};
(8)卫星i按照2跳内的链路状态信息对总传输时间开销进行升序排列，划分出最短路lFirst、次短路lSecond，以此类推；如果多条链路的总传输时间开销相同，选择下一跳链路可用带宽W最大的设为最短路lFirst；当下一跳链路可用带宽W相同时，选择下一跳卫星节点负载最少的设为最短路lFirst；当负载相同时，随机生成最短路，并根据对应链路上的卫星节点地址生成本地路由表。(8) Satellite i arranges the total transmission time overhead in ascending order according to the link status information within 2 hops, and divides the shortest path lFirst , the second short circuit lSecond , and so on; if the total transmission time overhead of multiple links is the same , select the one with the largest available bandwidth W of the next hop link as the shortest path lFirst ; when the available bandwidth W of the next hop link is the same, select the one with the least load of the next hop satellite node and set it as the shortest path lFirst ; when the loads are the same , the shortest path is randomly generated, and the local routing table is generated according to the satellite node address on the corresponding link.
(9)卫星i接收到需要中转的数据包η后，首先判断本节点是否为目的节点，如果是，则算法结束。(9) After satellite i receives the data packet n that needs to be transferred, it first judges whether this node is the destination node, and if so, the algorithm ends.
(10)否则卫星i获取转发数据包η所需带宽Wη。(10) Otherwise, the satellite i obtains the bandwidth W n required for forwarding the data packetn .
(11)卫星i分析数据包η在到达之前所经历的时延总和
(12)对数据包η的总传输时延指标
(13)卫星i根据入网时获得的全局路由表，预先判断数据包η与目的节点之间的跳数hopη，进一步计算单跳允许传输时延
(14)卫星i根据单跳允许传输时延
(15)卫星i修改数据包η在该链路上的带宽需求
(16)将数据包η按照优先级等级存入队列中，合并成数据流，并按顺序从最高优先级level1的队列queue1开始进行顺序转发处理。(16) Store the data packet n in the queue according to the priority level, merge it into a data stream, and perform sequential forwarding processing from the queue queue1 of the highest priority level1 in sequence.
(17)卫星i修改queue1在该链路上的带宽总需求
(18)如果卫星i的最短路径lFirst为l(i,j)，到下一跳卫星j的时延Ti,j满足当前队列queue1的服务质量时延需求：(18) If the shortest pathlFirst of satellite i is l(i,j), the delay Ti,j to the next hop satellite j satisfies the service quality delay requirement of the current queue queue1:
继续进一步判断传输带宽：Continue to further judge the transmission bandwidth:
(18a)当链路可用带宽Wi,j大于当前队列queue1的带宽需求：(18a) When the available bandwidth Wi,j of the link is greater than the bandwidth requirement of the current queue queue1:
将队列queue1中存储的业务数据全部传输给下一跳卫星j。All the service data stored in the queue queue1 is transmitted to the next hop satellite j.
(18b)否则，当可用带宽Wi,j小于数据流带宽需求时，利用当前链路剩余带宽传输队列中存储的部分数据，并将队列queue1中剩余的数据包传输给次短路径lSecond上的下一跳卫星节点，卫星i对次短路的带宽需求
(18c)继续比较次短路径上后续链路可用带宽和数据流的传输需求，以此类推直到满足为止。若一直不满足传输需求，则服务质量无法保障，转到步骤(20)。(18c) Continue to compare the available bandwidth of the subsequent link on the next shortest path with the transmission requirement of the data stream, and so on until it is satisfied. If the transmission requirement has not been met, the service quality cannot be guaranteed, and the process goes to step (20).
(19)如果卫星i的最短路径lFirst中，到下一跳卫星j的时延Ti,j不满足当前队列queue1的服务质量时延需求，则算法无法执行，转到步骤(20)。(19) If in the shortest path lFirst of satellite i, the delay Ti,j to the next hop satellite j does not meet the service quality delay requirement of the current queue queue1, the algorithm cannot be executed, and go to step (20).
(20)算法退出。(20) The algorithm exits.
下面结合附图对本发明的技术方案作进一步的描述。The technical solutions of the present invention will be further described below with reference to the accompanying drawings.
如图3所示，本发明的使用场景是一个低轨卫星网络，其包含n颗低轨卫星和2个地面站，低轨卫星上装配有5根天线，同时可以跟相邻的4颗低轨卫星通信以及地面信关站通信，假设建链时间足够快，即建链时间可以忽略不计。星间链路采用激光链路，在高轨道地区不会发生断链。东西半球星座之间会产生反向缝。反向缝内不建立通信链路，相邻卫星之间不能进行通信。As shown in FIG. 3 , the use scenario of the present invention is a low-orbit satellite network, which includes n low-orbit satellites and 2 ground stations. The low-orbit satellites are equipped with 5 antennas, which can be connected to 4 adjacent low-orbit satellites at the same time. Orbital satellite communication and ground gateway station communication, assuming that the chain establishment time is fast enough, that is, the chain establishment time can be ignored. The inter-satellite link uses a laser link, which will not break the link in high-orbit areas. Reverse seams are created between the constellations in the eastern and western hemispheres. No communication link is established in the reverse slot, and communication between adjacent satellites cannot be performed.
如图4所示，本发明面向服务质量保障的低轨卫星星座路由选择方法包括以下步骤：As shown in Figure 4, the low-orbit satellite constellation routing method for quality of service assurance of the present invention includes the following steps:
步骤1，根据业务服务质量需求，划分服务质量优先级。
设有一个卫星通信网络，将每颗卫星视为一个独立节点m(1≤n≤M)，M表卫星总个数。任意两颗通信卫星的相邻节点i、j构成无向图G(i,j)。卫星i、j(1≤i,j≤M)间存在的通信链路视为边l，链路状态信息用l(i,j)表示，边上权重是由链路i、j的传输时延开销Ti,j和可用带宽Wi.j构成的二维数组l(i,j)表示如下：There is a satellite communication network, and each satellite is regarded as an independent node m (1≤n≤M), where M represents the total number of satellites. The adjacent nodes i and j of any two communication satellites form an undirected graph G(i,j). The communication link existing between satellites i and j (1≤i,j≤M) is regarded as edge l, the link state information is represented by l(i,j), and the weight on the edge is determined by the transmission time of links i and j. The two-dimensional array l(i,j) formed by the delay cost Ti,j and the available bandwidth Wij is expressed as follows:
数据包η的服务质量指标包含单跳允许传输时延
步骤2，根据业务服务质量指标构建无向网络拓扑图。
(2a)链路的传输时延开销T由四部分构成：(2a) The transmission delay overhead T of the link consists of four parts:
T＝Ttransmission+Tpropagation+Tprocessing+Tjudgement；T=Ttransmission +Tpropagation +Tprocessing +Tjudgement ;
其中Ttransmission、Tpropagation、Tprocessing和Tjudgement分别表示传输业务数据所需的传输时延、传播时延、处理时延以及计算时延，其中计算时延用于判断某一链路在切换前能够持续的生存期。Among them, Ttransmission , Tpropagation , Tprocessing and Tjudgement represent the transmission delay, propagation delay, processing delay and calculation delay required for transmitting service data, respectively, and the calculation delay is used to judge whether a link is before switching. sustainable lifespan.
(2b)在网络初始化过程中，卫星入网时更新全局拓扑信息。(2b) During the network initialization process, the global topology information is updated when the satellite is connected to the network.
步骤3，根据节点、链路状态信息，实时更新无向网络拓扑边权重。Step 3: Update the topological edge weights of the undirected network in real time according to the node and link state information.
(3a)卫星k定期向卫星j发送含有1跳邻居列表Nk(1)、链路状态信息l(k,j)和节点k内部当前负载记录表Loadk的hello包。(3a) Satellite k periodically sends a hello packet containing 1-hop neighbor list Nk (1), link state information l(k, j) and current load record table Loadk in node k to satellite j.
(3b)卫星j定期向卫星i发送含有1跳邻居列表Nj(1)、Nk(1)，链路状态信息l(j,i)、l(k,j)，第一跳负载记录表Loadj、第二跳负载记录表Loadk的hello包。(3b) Satellite j periodically sends to satellite i a list of 1-hop neighbors Nj (1), Nk (1), link status information l(j,i), l(k,j), first-hop load record The hello packet of the table Loadj and the second hop load record table Loadk .
步骤4，探测相邻节点、链路状态信息，生成路由表。Step 4, detecting adjacent nodes and link state information, and generating a routing table.
如图4所示，本步骤的具体实现如下：As shown in Figure 4, the specific implementation of this step is as follows:
(4a)卫星i发现2跳内节点链路发生故障或进行切换时，从路由表中删除涉及该节点的链路相关信息，链路恢复正常后，将相关节点地址重新添加至路由表中。(4a) When satellite i finds that the node link within 2 hops is faulty or switches, it deletes the link related information related to the node from the routing table. After the link returns to normal, it adds the relevant node address to the routing table again.
(4b)卫星i根据hello包构建2跳邻居列表Ni(2)、2跳邻居负载信息表Loadj、Loadk，其中Loadj为第一跳负载信息表、Loadk为第二跳负载信息表。更新2跳内链路状态信息l(i,j,k)和边上权重：(4b) Satellitei builds a 2-hop neighbor list Ni (2), a 2-hop neighbor load information table Loadj , Loadk according to the hello packet, where Loadj is the first hop load information table, and Loadk is the second hop load information surface. Update link state information l(i,j,k) and edge weights within 2 hops:
l(i,j,k)＝{Ti,j,Tj,k,Wi,j,Wj,k,；1≤i,j,k≤M}；l(i,j,k)={Ti,j ,Tj,k ,Wi,j ,Wj,k ,;1≤i,j,k≤M};
(4c)卫星i按照2跳内的链路状态信息的总传输时间开销进行升序排列，划分出最短路lFirst、次短路lSecond，以此类推；如果多条链路的总传输时间开销相同，选择下一跳链路可用带宽W最大的路径设为最短路lFirst；当下一跳链路可用带宽W相同时，选择下一跳节点负载最少的路径设为最短路lFirst；当负载相同时，随机生成最短路，并将对应的链路生成本地路由表。(4c) The satellite i is arranged in ascending order according to the total transmission time overhead of the link state information within 2 hops, and divides the shortest path lFirst , the second short circuit lSecond , and so on; if the total transmission time overhead of multiple links is the same , select the path with the largest available bandwidth W of the next hop link as the shortest path lFirst ; when the available bandwidth W of the next hop link is the same, select the path with the least load of the next hop node as the shortest path lFirst ; At the same time, the shortest path is randomly generated, and the corresponding link is generated into the local routing table.
(4d)卫星i接收到需要中转的数据包η后，首先判断本节点是否为目的节点，如果是，则算法结束。(4d) After satellite i receives the data packet n that needs to be transferred, it firstly judges whether this node is the destination node, and if so, the algorithm ends.
步骤5，动态调整不同业务流的服务质量等级。Step 5: Dynamically adjust the service quality levels of different service flows.
如图5所示，本步骤的具体实现如下：As shown in Figure 5, the specific implementation of this step is as follows:
(5a)获取卫星i转发数据包η所需要的带宽Wη。(5a) Obtain the bandwidth Wn required by satellite i to forward data packet n .
(5b)卫星i分析数据包η在到达之前经历的时延总和
(5c)对数据包η的总传输时延指标
(5d)卫星i根据入网时获得的全局路由表，预先判断数据包η与目的节点之间的跳数hopη，进一步计算单跳允许传输时延
(5e)卫星i根据单跳允许传输时延
(5f)卫星i修改数据包η在该链路上的带宽需求
(5g)将数据包η按照优先级等级存入队列中，合并成数据流，并按顺序从最高优先级level1的队列queue1开始进行顺序转发处理。(5g) The data packet n is stored in the queue according to the priority level, merged into a data stream, and sequentially forwarded from the queue queue1 of the highest priority level1 in sequence.
步骤6，判断、确定下一跳路由节点。Step 6: Judge and determine the next hop routing node.
如图4所示，本步骤的具体实现如下：As shown in Figure 4, the specific implementation of this step is as follows:
(6a)卫星i修改队列queue1在该链路上的带宽总需求
(6b)如果卫星i的最短路径lFirst为l(i,j)，到下一跳卫星j的时延Ti,j满足当前队列queue1的服务质量时延需求：(6b) If the shortest pathlFirst of satellite i is l(i,j), the delay Ti,j to the next hop satellite j satisfies the service quality delay requirement of the current queue queue1:
继续进一步判断传输带宽：Continue to further judge the transmission bandwidth:
(6c)当链路可用带宽Wi,j大于当前队列queue1的带宽需求时：(6c) When the available bandwidth Wi,j of the link is greater than the bandwidth requirement of the current queue queue1:
将当前队列queue1中的所有数据包全部传输给下一跳卫星j。All data packets in the current queue queue1 are transmitted to the next hop satellite j.
(6d)否则，当可用带宽Wi,j小于数据流带宽的需求时，利用当前全部剩余链路带宽传输队列中的数据包，并将队列queue1中剩余的数据包传输给次短路径lSecond上的下一跳卫星节点，卫星i对次短路的带宽需求
(6e)继续比较次短路径上的可用带宽和数据流传输需求，以此类推直到满足为止。若一直不满足传输需求，则服务质量无法保障，转到(6g)。(6e) Continue to compare the available bandwidth and data stream transmission requirements on the next shortest path, and so on until satisfied. If the transmission demand has not been met, the service quality cannot be guaranteed, go to (6g).
(6f)如果卫星i的最短路径lFirst中，到下一跳卫星j的时延Ti,j不满足当前队列queue1的服务质量保障时延需求，则算法无法执行，转到(6g)。(6f) If the delay Ti,j to the next hop satellite j in the shortest path lFirst of satellite i does not meet the service quality guarantee delay requirement of the current queue queue1, the algorithm cannot be executed, and go to (6g).
(6g)算法退出。(6g) The algorithm exits.
二、应用实施例。为了证明本发明的技术方案的创造性和技术价值，该部分是对权利要求技术方案进行具体产品上或相关技术上的应用实施例。2. Application Examples. In order to prove the creativity and technical value of the technical solution of the present invention, this part is an application example of the technical solution in the claims on specific products or related technologies.
本发明的实施方式可以通过软件和硬件结合的方式实现。硬件部分可以利用现场可编程门阵列、可编程逻辑设备FPGA等的可编程硬件设备的硬件电路实现，也可以用由各种类型的处理器CPU执行的软件实现。软件部分可以存储在存储器中，由适当的指令执行系统，例如微处理器或者专用设计硬件来执行。最终集成在星载路由器板卡上，配合其它板卡功能模块，实现网络级和路由器节点级的传输服务质量保障。The embodiments of the present invention can be implemented by a combination of software and hardware. The hardware part can be realized by hardware circuits of programmable hardware devices such as field programmable gate arrays, programmable logic devices FPGA, etc., and can also be realized by software executed by various types of processors CPU. Portions of the software may be stored in memory and executed by a suitable instruction execution system, such as a microprocessor or specially designed hardware. It is finally integrated on the onboard router board, and cooperates with other board function modules to achieve network-level and router-node-level transmission service quality assurance.
应当注意，本发明的实施方式可以通过硬件、软件或者软件和硬件的结合来实现。硬件部分可以利用专用逻辑来实现；软件部分可以存储在存储器中，由适当的指令执行系统，例如微处理器或者专用设计硬件来执行。本领域的普通技术人员可以理解上述的设备和方法可以使用计算机可执行指令和/或包含在处理器控制代码中来实现，例如在诸如磁盘、CD或DVD-ROM的载体介质、诸如只读存储器(固件)的可编程的存储器或者诸如光学或电子信号载体的数据载体上提供了这样的代码。本发明的设备及其模块可以由诸如超大规模集成电路或门阵列、诸如逻辑芯片、晶体管等的半导体、或者诸如现场可编程门阵列、可编程逻辑设备等的可编程硬件设备的硬件电路实现，也可以用由各种类型的处理器执行的软件实现，也可以由上述硬件电路和软件的结合例如固件来实现。It should be noted that the embodiments of the present invention may be implemented by hardware, software, or a combination of software and hardware. The hardware portion may be implemented using special purpose logic; the software portion may be stored in memory and executed by a suitable instruction execution system, such as a microprocessor or specially designed hardware. Those of ordinary skill 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, for example on a carrier medium such as a disk, CD or DVD-ROM, such as a read-only memory Such code is provided on a programmable memory (firmware) or a data carrier such as an optical or electronic signal carrier. The device and its modules of the present invention can be implemented by hardware circuits such as very large scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, etc., or programmable hardware devices such as field programmable gate arrays, programmable logic devices, etc., It can also be implemented by software executed by various types of processors, or by a combination of the above-mentioned hardware circuits and software, such as firmware.
三、实施例相关效果的证据。本发明实施例在研发或者使用过程中取得了一些积极效果，和现有技术相比的确具备很大的优势，下面内容结合试验过程的数据、图表等进行描述。3. Evidence of the relevant effects of the embodiment. The embodiments of the present invention have achieved some positive effects in the process of research and development or use, and indeed have great advantages compared with the prior art.
1)仿真条件1) Simulation conditions
网络包含60颗低轨卫星，分处6个轨道面，相邻轨道面夹角30°，每个轨道面上等角度间隔部署10颗卫星，相邻卫星夹角36°，轨道类型为π型，轨道倾角为86.5°，轨道高度1175km，覆盖区域为全球覆盖，低轨卫星星间链路速率为同轨、异轨均为1Gbps，链路介质为激光链路，相位因子为3，相邻卫星之间具有星间链路。业务源端位于北京，目的端位于巴西里约热内卢。The network consists of 60 low-orbit satellites, which are divided into 6 orbital planes, and the included angle of adjacent orbital planes is 30°. 10 satellites are deployed at equal angular intervals on each orbital plane, and the included angle of adjacent satellites is 36°. The orbit type is π type. , the orbital inclination is 86.5°, the orbital height is 1175km, the coverage area is global coverage, the link rate between low-orbit satellites is 1Gbps in the same orbit and in different orbits, the link medium is a laser link, the phase factor is 3, and the adjacent There are inter-satellite links between satellites. The business source is located in Beijing and the destination is located in Rio de Janeiro, Brazil.
仿真时间是从2021年10月15号00：00：00到2021年10月16号00：00：00，每个业务流在排队时等待当前被传输的业务流的时间为一个单位时间，每个业务流的传输时间也为一个单位时间。由于低轨卫星间的距离相比激光传输的速度而言很小，因此传播时延忽略不计。The simulation time is from 00:00:00 on October 15, 2021 to 00:00:00 on October 16, 2021. The time for each service flow to wait for the currently transmitted service flow when queuing is one unit time. The transmission time of each service flow is also a unit time. Since the distance between LEO satellites is small compared to the speed of laser transmission, the propagation delay is negligible.
2)仿真内容与结果2) Simulation content and results
仿真1，32号低轨卫星代表此时北京上空的卫星，46号低轨卫星代表此时里约热内卢上空的卫星，业务从北京产生并上注到32号卫星，经过多跳星间链路传输到46号卫星，然后下传到里约热内卢。当链路剩余带宽不足以支撑业务所需带宽的时候，卫星通过多径传递的方式将业务分流到不同的路径上进行传输，得到业务流的传输路由仿真结果，结果如图6所示。The
从图6可见，不同于传统的基于最短路径的路由选择方法，本发明所提方法不是将所有业务流都通过唯一的最短路进行传输的，而是通过将业务分流，通过多条路径进行传输，从而避免了唯一最短路径发生拥塞的情况发生，保障了链路剩余带宽大小满足分流后的业务流带宽需求。说明本发明能够有效保障业务的带宽需求。It can be seen from Fig. 6 that, different from the traditional shortest path-based routing method, the method proposed in the present invention does not transmit all service flows through a single shortest path, but divides the service flows and transmits them through multiple paths. , thereby avoiding the occurrence of congestion on the only shortest path, and ensuring that the remaining bandwidth of the link meets the bandwidth requirements of the service flow after the offload. It is illustrated that the present invention can effectively guarantee the bandwidth requirement of the service.
从图7可见，随着业务量的增加，本发明所提路由选择方法的路由时间和基于最短路路由方法的路由时间均逐渐提高，相比而言，本发明所提方法的路由时间小于基于最短路路由方法的路由时间，且随着业务量的增加，差距越来越明显。说明本发明能够有效减少端到端路由时延。As can be seen from FIG. 7 , with the increase of the traffic volume, the routing time of the routing method proposed in the present invention and the routing time based on the shortest route routing method are gradually increased. The routing time of the shortest route routing method, and with the increase of traffic, the gap becomes more and more obvious. It is illustrated that the present invention can effectively reduce the end-to-end routing delay.
从图8可见，随着业务量的增加，本发明所提路由选择方法的路由开销和基于最短路路由方法的路由开销均逐渐提高，相比而言，本发明所提方法的路由时间小于基于最短路路由方法的路由开销，且随着业务量的增加，差距越来越明显。说明本发明能够有效减少端到端路由开销。It can be seen from Fig. 8 that with the increase of the traffic volume, the routing overhead of the routing method proposed in the present invention and the routing overhead based on the shortest-path routing method gradually increase. The routing cost of the shortest path routing method is more and more obvious with the increase of the traffic volume. It is illustrated that the present invention can effectively reduce the end-to-end routing overhead.
以上所述，仅为本发明的具体实施方式，但本发明的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本发明揭露的技术范围内，凡在本发明的精神和原则之内所作的任何修改、等同替换和改进等，都应涵盖在本发明的保护范围之内。The above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited to this. Any person skilled in the art is within the technical scope disclosed by the present invention, and all within the spirit and principle of the present invention Any modifications, equivalent replacements and improvements made within the scope of the present invention should be included within the protection scope of the present invention.
Claims (10)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210307051.3ACN114828144B (en) | 2022-03-27 | 2022-03-27 | A quality of service routing method for low-orbit satellite constellations |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210307051.3ACN114828144B (en) | 2022-03-27 | 2022-03-27 | A quality of service routing method for low-orbit satellite constellations |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114828144Atrue CN114828144A (en) | 2022-07-29 |
| CN114828144B CN114828144B (en) | 2024-08-09 |
Family
ID=82530921
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210307051.3AActiveCN114828144B (en) | 2022-03-27 | 2022-03-27 | A quality of service routing method for low-orbit satellite constellations |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114828144B (en) |
Cited By (8)
| 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 |
| CN115866703A (en)* | 2022-11-16 | 2023-03-28 | 国网北京市电力公司 | Network channel switching method and device, storage medium and processor |
| CN117675679A (en)* | 2023-11-24 | 2024-03-08 | 航天恒星科技有限公司 | Satellite time-sensitive routing 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 |
| CN118611736A (en)* | 2024-06-24 | 2024-09-06 | 中国人民解放军军事科学院系统工程研究院 | A path selection method for giant constellation networks based on rolling optimization |
| CN119211029A (en)* | 2024-08-23 | 2024-12-27 | 南京邮电大学 | LEO-SN multi-hop multi-service end-to-end delay analysis method based on martingale theory |
| CN119299364A (en)* | 2024-12-11 | 2025-01-10 | 湖南国科鸿飞科技有限公司 | Data transmission method, device, equipment and storage medium based on GLink bus network |
| CN119788185A (en)* | 2024-12-20 | 2025-04-08 | 上海大学 | A method for span transmission of time-sensitive services of low-orbit constellation |
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 | 西安电子科技大学 | A multi-service QoS routing method for satellite network based on area division |
| CN113489528A (en)* | 2021-07-05 | 2021-10-08 | 北京理工大学 | Self-adaptive survivability method suitable for inter-satellite routing |
- 2022
- 2022-03-27CNCN202210307051.3Apatent/CN114828144B/enactiveActive
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 | 西安电子科技大学 | A multi-service QoS routing method for satellite network based on area 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 (9)
| 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 |
| CN115866703A (en)* | 2022-11-16 | 2023-03-28 | 国网北京市电力公司 | Network channel switching method and device, storage medium and processor |
| CN117675679A (en)* | 2023-11-24 | 2024-03-08 | 航天恒星科技有限公司 | Satellite time-sensitive routing 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 |
| CN118611736A (en)* | 2024-06-24 | 2024-09-06 | 中国人民解放军军事科学院系统工程研究院 | A path selection method for giant constellation networks based on rolling optimization |
| CN119211029A (en)* | 2024-08-23 | 2024-12-27 | 南京邮电大学 | LEO-SN multi-hop multi-service end-to-end delay analysis method based on martingale theory |
| CN119299364A (en)* | 2024-12-11 | 2025-01-10 | 湖南国科鸿飞科技有限公司 | Data transmission method, device, equipment and storage medium based on GLink bus network |
| CN119788185A (en)* | 2024-12-20 | 2025-04-08 | 上海大学 | A method for span transmission of time-sensitive services of low-orbit constellation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114828144B (en) | 2024-08-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114828144B (en) | A quality of service routing method for low-orbit satellite constellations | |
| CN110290066B (en) | A Dynamic Routing Method for Satellite Networks Based on Queue Monitoring and Congestion Prediction | |
| CN112333109B (en) | Ant colony optimization-based load balancing routing method in low-orbit satellite network | |
| Song et al. | TLR: A traffic-light-based intelligent routing strategy for NGEO satellite IP networks | |
| CN106656302B (en) | An Adaptive Routing Algorithm for Distributed Nodes in LEO Satellite Networks | |
| CN105959232B (en) | A kind of satellite network method for routing based on software defined network control points optimization | |
| CN101552933B (en) | Optical network self-adapting route system for low/middle orbit double-layer satellite and calculating method of agent route | |
| CN110493130A (en) | Incorporate network sound state mixed logic dynamic method | |
| CN111294108B (en) | An Efficient Routing Method for Orthogonal Circular Orbit Configuration Satellite Constellation | |
| CN107453801A (en) | A kind of Layered Multipath method for routing towards satellite network | |
| CN112311441B (en) | Congestion Avoidance Routing Methods in Low Orbit Constellation Networks | |
| CN104683016A (en) | Method for distributing and routing optimal services of multi-layer satellite network based on minimum time delay | |
| CN113055076B (en) | A Routing Method in LEO/MEO Double Layer Satellite Communication Network | |
| CN106230719A (en) | A kind of LEO satellite network link switching management method based on link remaining time | |
| CN113067627B (en) | Self-adaptive survivable satellite routing method based on virtual nodes | |
| Wei et al. | Iris: Towards intelligent reliable routing for software defined satellite networks | |
| Roth et al. | Distributed sdn-based load-balanced routing for low earth orbit satellite constellation networks | |
| CN118473503A (en) | Multi-path reliable transmission method and system for local perception of satellite network | |
| CN114095067A (en) | Multilayer satellite network dynamic routing method and system | |
| CN115483972A (en) | Communication system based on double-layer satellite optical network architecture and dynamic flow control method thereof | |
| Peng et al. | FastTS: Enabling fault-tolerant and time-sensitive scheduling in space-terrestrial integrated networks | |
| Singh et al. | Effective congestion control in MANET | |
| Li et al. | Load-balanced cooperative transmission in MEO-LEO satellite network | |
| CN114513241B (en) | SDN-based high-performance QoS guaranteed low-orbit satellite inter-satellite routing method | |
| Durresi et al. | Routing of real-time traffic in a transformational communications architecture |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |