Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks

A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.

A DISTRIBUTED QOS ROUTING BASED ON ANT ALGORITHM FOR LEO SATELLITE NETWORK

Low Earth Orbit (LEO) satellites provide short round-trip delays and are becoming in- creasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algorithms. To satisfy the QoS requirements of multimedia applications, satellite routing protocols should consider handovers and minimize their effect on the active connections. A distributed QoS routing scheme based on heuristic ant algorithm is proposed for satisfying delay bound and avoiding link congestion. Simulation results show that the call blocking probabilities of this al- gorithm are less than that of Shortest Path First (SPF) with different delay bound.

A Discrete-Time Traffic and Topology Adaptive Routing Algorithm for LEO Satellite Networks

“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algo-rithms. Many authors focus on propagation delays with the distance vector but ignore the status information and processing delays of inter-satellite links. For this purpose, a new discrete-time traffic and topology adap-tive routing (DT-TTAR) algorithm is proposed in this paper. This routing algorithm incorporates both inher-ent dynamics of network topology and variations of traffic load in inter-satellite links. The next hop decision is made by the adaptive link cost metric, depending on arrival rates, time slots and locations of source-destination pairs. Through comprehensive analysis, we derive computation formulas of the main per-formance indexes. Meanwhile, the performances are evaluated through a set of simulations, and compared with other static and adaptive routing mechanisms as a reference. The results show that the proposed DT-TTAR algorithm has better performance of end-to-end delay than other algorithms, especially in high traffic areas.

A multi-path routing algorithm of LEO satellite networks based on an improved ant colony system

Geography rectangle is used to reduce signaling overhead of the LEO satellite networks.Moreover,a multi-path routing algorithm based on an improved ant colony system(MPRA-AC) is proposed.Matrix indicating the importance of the link between satellites is introduced into MPRA-AC in order to find the optimal path more quickly.Simulation results show that MPRA-AC reduces the number of iterations to achieve a satisfactory solution.At the same time,the packet delivery ratio of LEO satellite networks when running MPRA-AC and DSR-LSN(dynamic source routing algorithm for LEO satellite networks) is compared.The packet delivery ratio is about 7.9%lower when running DSR-LSN.Moreover,because of the mechanism of active load balancing of MPRA-AC,simulation results show that MPRA-AC outperforms DSR-LSN in link utilization when data packets are transmitted in the networks.

PACKET ROUTING ALGORITHM FOR LEO SATELLITE CONSTELLATION NETWORK

A novel distributed packet routing algorithm for Low Earth Orbit (LEO) satellite networks based on spiderweb topology is presented. The algorithm gives the shortest path with very low computational complexity and without on-board routing tables, which is suitable and practical for on-board processing. Simulation results show its practicability and feasibility.

High-Risk LEO Satellite Network Path Detection Based on Spatial and Temporal Delay Anomaly Analysis

The gradual deployment of Low-Earth Orbit(LEO)mega constellations with inter-satellite links(ISLs)promises ubiquitous,low-latency,and high-throughput satellite network services.However,networked LEO satellites with ISLs are also at risk of routing attacks such as hijacking.Existing defenses against route hijacking in terrestrial networks can hardly work for the LEO satellite network due to its high spatiotemporal dynamics.To deal with it,we propose RPD,a high-risk routing path detection method for LEO mega-constellation networks.RPD detects abnormal high-risk LEO network paths by checking the consistency between the path delay and the geographical distance.This is efficiently achieved by combining in-band measurements and out-of-band statistical processing to detect the anomaly of the clustering feature in the reference delay matrix.RPD avoids the recalculation of the header cryptographic marks when the handover occurs,thus greatly reducing the cost and improving the performance of highrisk path detection.Experiments showed that the proposed RPD mechanism achieves an average detection accuracy of 91.64%under normal network conditions,and maintain about 89%even when congestion occurs in multiple areas of the network and measurement noise is considered.In addition,RPD does not require any cryptographic operation on the intermediate node,only minimal communication cost with excellent scalability and deployability.

Multicast Routing in Satellite Network

There are some problems in the dual-layer satellite MPLs metworks to be composed of LEO and MEO. In order to solve the problems, this paper presents a plan by means of unicast LSP to implement multicast in the dual-layer satellite MPLs networks. It has advantages of saving space and reducing extra charge.

Reinforcement learning based dynamic distributed routing scheme for mega LEO satellite networks

Recently,mega Low Earth Orbit(LEO)Satellite Network(LSN)systems have gained more and more attention due to low latency,broadband communications and global coverage for ground users.One of the primary challenges for LSN systems with inter-satellite links is the routing strategy calculation and maintenance,due to LSN constellation scale and dynamic network topology feature.In order to seek an efficient routing strategy,a Q-learning-based dynamic distributed Routing scheme for LSNs(QRLSN)is proposed in this paper.To achieve low end-toend delay and low network traffic overhead load in LSNs,QRLSN adopts a multi-objective optimization method to find the optimal next hop for forwarding data packets.Experimental results demonstrate that the proposed scheme can effectively discover the initial routing strategy and provide long-term Quality of Service(QoS)optimization during the routing maintenance process.In addition,comparison results demonstrate that QRLSN is superior to the virtual-topology-based shortest path routing algorithm.

UMR: A utility-maximizing routing algorithm for delay-sensitive service in LEO satellite networks

This paper develops a routing algorithm for delay-sensitive packet transmission in a low earth orbit multi-hop satellite network consists of micro-satellites. The micro-satellite low earth orbit （MS-LEO） network endures unstable link connection and frequent link congestion due to the uneven user distribution and the link capacity variations. The proposed routing algorithm, referred to as the utility maximizing routing （UMR） algorithm, improve the network utility of the MS-LEO network for carrying flows with strict end-to-end delay bound requirement. In UMR, first, a link state parameter is defined to capture the link reliability on continuing to keep the end-to-end delay into constraint; then, on the basis of this parameter, a routing metric is for- mulated and a routing scheme is designed for balancing the reliability in delay bound guarantee among paths and building a path maximizing the network utility expectation. While the UMR algo- rithm has many advantages, it may result in a higher blocking rate of new calls. This phenomenon is discussed and a weight factor is introduced into UMR to provide a flexible performance option for network operator. A set of simulations are conducted to verify the good performance of UMR, in terms of balancing the traffic distribution on inter-satellite links, reducing the flow interruption rate, and improving the network utility.

Packet routing algorithm for polar orbit LEO satellite constellation network

Broadband satellite networks are capable of providing global coverage and support various services. The networks constructed by Low Earth Orbit （LEO） satellite constellations have attracted great interests because of their short round-trip delays and wide bandwidths. A challenging problem is to develop a simple and efficient packet routing algorithm for the LEO satellite constellation network. This paper presents a SpiderWeb Topological Network （SWTN） and a distributed packet routing algorithm for the LEO satellite constellation network based on the SWTN. The algorithm gives the minimum propagation delay paths with low computational complexity and requires no routing tables, which is practical for on-board processing. The performance of the algorithm is demon- strated through simulations.

Joint multi-QoS and energy saving routing for LEO satellite network

Low earth orbit(LEO) satellite network provides global coverage and supports a wide range of services. However, due to the rapid changes and energy-limitation of satellites, how to meet the demand of the quality of service(QoS) from ground traffic and prolong the lifetime of LEO satellite network is the research emphasis of the investigator. Hence, a routing algorithm which takes into account the multi-QoS requirements and satellite energy consumption(QER) of LEO satellite network is proposed. Firstly, the satellite intimacy degree(SID) and the path health degree(PHD) are introduced to obtain the path evaluation function according to the energy consumption and queue state of the satellite. Then, the distributed routing QER is established through the path evaluation function and the idea of genetic algorithm(GA), which enables each satellite to adjust traffic and realizes the network load balancing. Simulation results show that QER performs well in terms of end-to-end delay, delay jitter, and system throughput.

面向大规模低地球轨道卫星网络的星间链路连接策略

针对大规模低地球轨道(LEO)卫星网络,提出了2类新型星间链路(ISL)连接策略:Grid-V和Grid+,并对传统的Grid连接策略进行改进。所提策略充分利用了次邻轨和跨邻轨星间链路,Grid-V连接策略舍弃了Grid连接策略的轨内链路,利用次邻轨和跨邻轨的星间链路形成网络拓扑;Grid+连接策略在保留Grid连接策略中的星间链路基础上,允许卫星与同轨道或者次邻轨道卫星建立跨星连接。针对Walker-Delta星座构型的大规模LEO卫星网络,设计了基于所提星间链路连接策略的最短距离路由算法,并分别从几何拓扑和数据包层面对路由进行了系统级仿真,以评估各连接策略的性能。仿真结果表明,在几何拓扑层面,所提策略可以有效减少平均路由跳数与路径切换次数;在数据包层面,所提策略在往返时延及抖动、路径占用率、平均吞吐量等方面具有更好的性能。

LEO卫星网络海量遥感数据下行的负载均衡多径路由算法

LEO卫星网络能够为各类用户提供全球无缝实时数据通信,近年来得到了快速发展。与此同时,空间数据源如遥感卫星的海量载荷数据下行体制依旧采用传统的存储转发方式,如果将此类卫星接入配有星间链路的LEO卫星网络,可以有效提高空间任务数据的实时性。但是需要为这种应用需求设计专门的卫星网络负载均衡路由算法。针对视频卫星实时直播的应用场景,设计了一套并行链路不相交多径路由算法SPEMR。OPNET仿真结果表明SPEMR实现的多径方案的性能劣化指数为0.32,仅为TLR路由协议的32%,传统DSP方案的21%,具有相对更强的实时传输海量数据的能力。

基于多目标决策的LEO卫星网络多业务路由算法

针对低轨(LEO,low earth orbit)卫星网络中,链路资源利用不均衡以及差异化业务的服务质量(Qo S,quality of service)要求难以满足,容易导致网络整体运行效率降低的问题,提出了一种基于多目标决策的路由算法。将LEO卫星网络传输的业务定义为时延敏感、带宽敏感和可靠性敏感3类,采用本征向量法计算业务权值,并利用一致性比率判定所得权值可被接受,进一步,基于多目标决策理论,结合卫星网络节点与链路的实际状态与业务的具体要求,计算满足业务Qo S需求的路径,从而实现LEO卫星网络的多目标动态优化路由。建立基于铱星网络系统的仿真实验平台,模拟网络时延、剩余带宽和误分组率等不确定特征,为随机产生的3类业务进行路由规划,仿真结果表明,算法在满足Qo S约束的同时,能有效地均衡卫星链路的业务负载,而且在吞吐量等方面的性能均有较明显提升。

下一代LEO卫星网络路由策略分析

鉴于LEO卫星网络有限的资源和高昂的建设维护成本,研究有效的LEO卫星网络路由策略成为下一代LEO卫星网络建设的关键问题。LEO卫星网络具有不同于传统的地面网络的特性,首先从对路由影响的角度对这些特性进行归纳,随后依据这些特性总结出侧重于网络拓扑结构、路由更新和负载平衡3个方面的解决方案,分析了每种方案特点,为进一步设计满足应用需求的、更为有效的下一代卫星网络路由策略奠定基础。

链路及节点多属性融合的低轨卫星网络路由算法

针对低轨卫星网络面对破坏性事件系统性能损失多、通信延迟和丢包率高的问题,提出了基于多属性的低轨卫星网络多路径路由算法。在采用虚拟拓扑方案仿真的低轨卫星星座中,计算源节点与目标节点之间的多条可行路径,该算法融合卫星间链路属性和相邻卫星节点属性构建路径的传输成本模型,自适应调整两类属性对传输成本的影响权重,每颗卫星将路径传输成本的归一化结果作为通过该路径转发报文的概率,并独立进行分布式的路由选择。仿真结果表明,与经典的低轨卫星网络多路径路由算法相比,无论网络负载较大发生拥塞时,还是卫星遭受网络攻击或出现故障时,该算法性能下降缓慢,丢包率和平均端到端延迟更低,且具有良好的负载均衡能力,有效增强了路由的可用性。

基于分时的LEO卫星网络非对称路由算法

提出了一种基于分时的LEO卫星网络非对称路由算法A-DTRA(asymmetric discrete time based routing algorithm)。针对网络节点在各时间片内的链路连接状态,该算法通过中心节点两次广播来获取一跳邻节点信息及其邻节点的邻居节点信息,从而完成了链路检测,得到每个时间片内的有向虚拟拓扑图。通过使用备份路由和路由表压缩机制实现了非对称链路上分组转发的可靠性,失效节点处理的及时性以及星上节点开销的低耗性。通过仿真分析可知,该算法具有较好的数据包转发率和端到端时延性能。此外,利用非对称链路可提高网络的连通性能,该算法适用于存在非对称链路的LEO卫星网络。

面向LEO卫星网的轻量级按需QoS源路由算法

接入卫星切换、流量分布不均匀和星上处理能力受限等因素使LEO卫星网的QoS路由面临巨大挑战。提出了一种引入移动代理技术的轻量级按需QoS源路由算法。首先结合星际链路队列占用情况设计了星际链路可用指数;接着基于卫星网承载流量分布特点提出了卫星可用指数;综合星际链路和卫星可用指数给出了移动代理迁移策略、星际QoS路由及其重建算法。仿真结果表明,提出的路由算法信令开销低,时延抖动、新呼叫阻塞率和切换呼叫阻塞率等QoS性能明显优于传统路由算法。

基于OPNET的LEO卫星网络协议仿真平台研究

在OPNET仿真环境下,通过对LEO卫星网络协议构架分析,合理简化协议体系结构,构建通用卫星节点模块,实现了LEO卫星网络协议仿真平台。该平台能够模拟无连接LEO卫星网络路由表的建立更新和数据包选路等过程,以及切换、长时延等一些卫星网络特性给其他协议带来的影响。最后通过对作者提出的一种路由算法进行仿真,验证了该仿真平台能够在一定精度上模拟LEO卫星网络环境。

LEO/MEO卫星网络基于动态路由策略的链路故障检测

卫星通信将成为未来个人通信系统的一个重要组成部分.LEO和MEO(low/mediumearthorbiting)是卫星个人通信网络(S-PCN)的首选.针对使用星际链路ISL(intersatellitelinks)的LEO和MEO卫星系统,本文提出一种基于动态路由策略的卫星个人通信网络的链路故障检测方法,该方法适用于面向连接且采用基于ATM路由算法的卫星网络.该算法通过构建离散时间动态虚拓扑图(DT-DVTG)(discrete-timedynamicvirtualtopologygraph)管理卫星能够自主地、实时地检测(identification)出最可能出现故障的链路范围,并通过快速的、自主的测试可精确定位故障链路.通过在卫星网络上的仿真表明,具有实时性、自主性、精确性且可能不占用或只占用很少的额外带宽.