低轨卫星星座快速响应链路损毁路由算法

设计高效弹性的卫星路由算法是未来低轨(Low Earth Orbit, LEO)卫星通信技术的一个重要发展方向。为解决低轨卫星星座网络中星间链路发生故障后存在的传输中断和数据安全问题,提出了一种低轨卫星星座快速响应链路损毁路由算法(Quick-response Link Destruction Routing Algorithm for LEO Satellite Constellation, QRLDRA)。QRLDRA以星座可预测拓扑作为星间路由计算基础,增加星地回传路由设计,快速将星间链路异常回传至地面计算中心处理;引入多优先级动态队列,根据节点链路状态调整星间链路不同数据传输的优先级;综合路由计算、路由上注、链路检测等功能,完成对拓扑变化的及时响应。通过仿真实验与传统算法的比较发现,所提算法有效提高了数据端到端传输的成功率,为用户业务服务质量(Quality of Service, QoS)提供了可靠保障。     

LEO卫星移动通信系统空间网络技术分析

在分析LEO卫星星座移动通信系统空间段网络功能和特点的基础上,进行了星座网络路由和交换技术体制的分析和论证,提出了以支持话音业务为主的LEO卫星移动通信系统星座网络路由和交换技术方案。星座网络采用定长信元格式交换体制,采用动态拓扑离散化的拓扑快照静态路由策略。这种静态路由离线计算方式和定长信元交换相结合,提高了网络交换的效率和转发速率。     

一种新的GEO/LEO双层星座路由算法

针对多层卫星星座网络的复杂通信环境和特殊应用背景,提出一种新的基于优先级的星上分布式路由算法( PDRA)。 PDRA算法采用新的分层管理策略,根据信息重要程度设置优先级,在拓扑快照起始时刻进行路由计算与更新,信息传输过程中采用拥塞回避策略。理论分析和仿真验证表明,PDRA算法与现有典型卫星星座网络路由算法相比性能优越,能够很好地利用GEO/LEO双层星座特点,有较低的数据丢包率和较高的吞吐量,可有效避免链路拥塞,并能保证重要信息实时可靠传输。     

一种面向低轨遥感星座的路由任务规划算法研究

为了解决遥感星座数据传输时效性差的问题,利用星间链组网,提出了一种适应于断续猝发特征星间网络的路由任务规划算法。该算法以遥感卫星成像任务规划结果为驱动,结合卫星网络拓扑结构的时变性特点,改进基于快照序列的拓扑划分方法,降低路由切换频率,减少链路切换代价损失。并将卫星与地面站之间的路由看作低轨遥感星座路由的一部分,在选择星地最短路由路径的同时实现星地建链总时长最大化。仿真结果表明,该算法能够显著提升低轨遥感卫星星座的数据传输能力。     

基于NoC的容错路由算法

各种各样的软件和硬件上的错误都会破坏网络的数据传输,因此研究No C网络的容错算法是非常必要的。在基于XY路由算法的基础上提出了改进的容错路由算法,当链路或者传输节点之间发生错误时,可通过重新设置路由规则来获取一条有效的路由路径。在FPGA上进行路由容错算法的仿真,并和目前常用的几种路由算法在所适用拓扑、是否防止死锁等方面进行对比。仿真结果显示改进的路由容错算法性能优越,是可行的。     

基于仿人体血管路径WSN故障容错路由算法研究

为提高无线传感器网络(WSN)故障容错性和传输稳定性,实现网络负载均衡,提出了一种仿人体血管路径的WSN故障容错路由算法.通过研究人体血管路径特性,将其引入到WSN故障容错路由设计中,在对网络节点分区域进行等级标定的基础上实行能耗均衡的静态分簇;运用改进的蚁群算法生成节点路径并计算各路径信息素值,以确定传输路径选择概率并建立仿血管拓扑结构路由.理论与仿真结果表明,此算法具有良好的性能.     

多层卫星通信网络自适应路由策略

单层卫星网络由于轨道高度和覆盖能力的不同,以至构成通信的单层系统往往不能满足不同业务服务质量的需求。分析了Walkerdelta型星座构建多层卫星通信网络的拓扑结构和ISL性能,提出了在统计分布模型下的多层卫星自适应路由策略,综合考虑了路径时延和ISL链路负载。仿真结果表明了多层网络自适应路由策略能够更加有效地分配网络通信量,网络具有较小的丢包率、网络平均归一化链路负载和特定路径综合路径权重,有利于降低网络平均阻塞概率和特定路径阻塞概率,获得更高的可靠性,较传统的单层非自适应路由更加有效、可靠。     

基于业务感知和策略选择的认知路由算法

提出了一种基于业务感知和策略选择的认知路由(cognitive network routing)算法。该算法面向认知网络环境综合考虑了网络资源、业务流、策略选择等要素,在获知网络中业务流的宏观特征和需求的前提下,首先通过离线资源分配将网络资源按照业务流的固有分配特征预先配置给不同类型的业务流,然后通过在线路径计算实时得出各个业务流的最优路径。仿真实验验证了认知路由算法的有效性,对比于MIRA、SWP路由算法,CNR算法可以提高网络资源利用率,避免因资源不均衡产生的网络拥塞,能够在业务流和资源2个层面优化网络性能。     

小卫星业务调度路由优化

针对小卫星通信链路交换频繁和低资源利用率的问题，提出了一种基于调度的小卫星路由优化策略。建立起小卫星星座模型，根据其运行方向(与赤道平面近似垂直)和所在维度确定链路的实时连接策略，优化其路由路径。面对持续增长的网络业务与有限的星上资源的矛盾，将业务数据包分类为实时性数据包和非实时性数据包，实行加权轮询调度保证其服务质量和资源的利用率。仿真结果证明，相比已有小卫星路由算法，优化的路由算法可以有效减小数据传输时延并增加系统吞吐量。     

仿血管路径的无线传感器网络故障容错路由算法

为提高无线传感器网络故障容错性和传输稳定性,实现网络负载均衡,提出了一种仿血管路径的无线传感器网络故障容错路由算法.研究了人体血管路径特性及属性关联,对网络节点分区域等级标定并以不同概率值进行静态分簇,运用改进的蚁群算法BWAS(最优最差蚂蚁系统)生成节点路径,以路径信息素值作为传输路径的选择概率建立仿血管拓扑结构路由...     

Performance evaluation of adaptive routing algorithms in packet‐switched intersatellite link networks

This paper addresses the performance evaluation of adaptive routing algorithms in non‐geostationary packet‐switched satellite communication systems. The dynamic topology of satellite networks and variable traffic load in satellite coverage areas, due to the motion of satellites in their orbit planes, pose stringent requirements to routing algorithms. We have limited the scope of our interest to routing in the intersatellite link (ISL) segment. In order to analyse the applicability of different routing algorithms used in terrestrial networks, and to evaluate the performance of new algorithms designed for satellite networks, we have built a simulation model of a satellite communication system with intersatellite links. In the paper, we present simulation results considering a network‐uniform source/destination distribution model and a uniform source–destination traffic flow, thus showing the inherent routing characteristics of a selected Celestri‐like LEO satellite constellation. The updates of the routing tables are centrally calculated according to the Dijkstra shortest path algorithm. Copyright © 2002 John Wiley & Sons, Ltd.     

Optimal Routing for Wireless Mesh Networks With Dynamic Traffic Demand

Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband Internet access. Traffic routing plays a critical role in determining the performance of a wireless mesh network. To investigate the best routing solution, existing work proposes to formulate the mesh network routing problem as an optimization problem. In this problem formulation, traffic demand is usually implicitly assumed as static and known a priori. Contradictorily, recent studies of wireless network traces show that the traffic demand, even being aggregated at access points, is highly dynamic and hard to estimate. Thus, in order to apply the optimization-based routing solution into practice, one must take into account the dynamic and unpredictable nature of wireless traffic demand. This paper presents an integrated framework for wireless mesh network routing under dynamic traffic demand. This framework consists of two important components: traffic estimation and routing optimization. By studying the traces collected at wireless access points, we first present a traffic estimation method which predicts future traffic demand based on its historical data using time-series analysis. This method provides not only the mean value of the future traffic demand estimation but also its statistical distribution. We further investigate the optimal routing strategies for wireless mesh network which take these two forms of traffic demand estimations as inputs. The goal is to balance the traffic load so that minimum congestion will be incurred. This routing objective could be transformed into the throughput optimization problem where the throughput of aggregated flows is maximized subject to fairness constraints that are weighted by the traffic demands. Based on linear programming, we present two routing algorithms which consider the mean value and the statistical distribution of the predicted traffic demands, respectively. The trace-driven simulation study demonstrates that our integrated traffic estimation and routing optimization framework can effectively incorporate the traffic dynamics in mesh network routing.     

MPLS-based satellite constellation networks

Nongeostationary satellite constellations with intersatellite links are a challenge for networking due to their continuously changing topology. In order to make maximal use of the network's capacities, special attention has to be paid to routing and traffic engineering. Multiprotocol label switching (MPLS) as underlying protocol is an interesting candidate for this task since it offers many possibilities to exert influence on traffic flows and supports today's dominating Internet protocol traffic very well. This paper describes a general MPLS-based networking concept for satellite networks and discusses different scenarios considering the particularities and constraints of the dynamic topology. Functional elements of MPLS like ingress, egress, or core routers have to be mapped onto the physical entities of the network and prerequisites for traffic engineering are discussed. Routing and rerouting of paths is of key interest since this affects route computation effort and routing performance. Thus, an analytical estimation of routing effort is deduced and numerical and simulation results are presented.     

Multiple gateway placement in large‐scale constellation networks with inter‐satellite links

Multiple gateways are required in large satellite constellation networks (LSCNs) with inter‐satellite links (ISLs), and their placement may greatly affect the system performance. Gateway placement can be optimized to achieve better network performance under the non‐uniform ground demand distribution. This paper formulates a gateway placement optimization model for LSCN with ISLs, aiming at achieving an optimal overall performance including delay, traffic peak, and load balance. The constraints of potential gateway location, gateway‐satellite connectivity, and max hop‐count are considered. A genetic algorithm (GA)‐based method is proposed to solve the integer optimization problem with the help of quasi‐evenly distributed reference layout. A Starlink‐like constellation with ISLs is adopted in the simulation. The simulation results show that the optimized layout has better performance than the reference layout. Additionally, the locations with high user demand or at the middle of ocean are preferred by gateways. The network performance is jointly influenced by gateway placement, demand distribution, constellation configuration, node, and link capacities. The abnormally high ISL hop‐count is found in the south Indian Ocean, which is caused by constellation and ISL configuration.     

卫星网络路由技术现状及展望

与地面固定通信网络不同,卫星网络的节点高度动态性、有限的星上处理能力和网络拓扑周期性变化的特点给卫星互联网的路由协议与算法设计带来了新的挑战。该文系统梳理了学术界针对卫星网络所提出的路由技术,提出了卫星路由技术未来的发展方向。首先介绍了卫星网络架构和目前在卫星通信系统上应用的主要路由协议,并且简要介绍了卫星光通信网络的路由问题;其次,根据卫星节点的管理方式以及路由表生成方式将路由算法分类为集中式卫星路由、分布式卫星路由以及混合式卫星路由,详细介绍了各类卫星路由方法的代表性成果并总结其优化目标和适用场景;接着,总结了不同卫星网络场景和网络需求下如何选择合适的卫星路由算法;最后,阐述目前卫星路由技术面临的挑战以及未来的发展趋势,并在附录中介绍了当前主流的卫星网络仿真平台。     

Optical networks with hybrid routing

All-optical switching or wavelength routing has the benefit of optical bypass that can eliminate expensive high-speed electronic processing at intermediate nodes and reduce significantly the cost of high-bandwidth transport. But all-optical switching has the limitations of coarse granularity, lack of multiplexing gain, and scarcity of wavelength resources, which do not mesh well with Internet traffic that has many small and diverse flows and emphasizes the importance of resource sharing. In particular, wavelength routed light paths have difficulty to seamlessly converge with multiprotocol label switching label-switched paths that have arbitrary bandwidth granularity and relatively abundant labels. In this paper, we propose a hybrid wavelength and subwavelength routing scheme that can preserve the benefits of optical bypass for large traffic flows at the same time provide multiplexing gain for small traffic flows. We first study the hybrid routing scheme using static optimization that produces an optimal path set and a partition between wavelength and subwavelength routing. We then present a dynamic heuristic that tracks the static optimization closely. During the process, we proposed a traffic arrival process called incremental arrival with sporadic random termination to more accurately model practical optical network traffic generation process.     

Routing Optimization in IP Networks Utilizing Additive and Concave Link Metrics

Routing optimization provides network operators with a powerful method for traffic engineering. Its general objective is to distribute traffic flows evenly across available network resources in order to avoid network congestion and quality of service degradation. In this paper we consider routing optimization based on conventional routing protocols where packets are forwarded hop-by-hop in a destination-based manner. Unlike other work in this area, we consider routing protocols, which are able to take into account concave routing metrics in addition to additive ones. The concave link metric introduces an additional degree of freedom for routing optimization, thus, increasing its optimization potential. We present and evaluate a mixed-integer programming model, which works on these metrics. This model unifies the optimization for single-metric and dual-metric routing concepts and also includes the consideration of multipath routing. Furthermore, we propose a heuristic algorithm usable for larger network instances. Numerical results indicate that employment of both the dual-metric concept and multipath routing can achieve considerably better utilization results than default-configured single-metric routing. A significant finding is that metric-based routing optimization with two link metrics often comes close to the results obtainable by optimization of arbitrarily configurable routing.     

Load balancing routing for single-layered satellite networks

The varying population density leads to imbalanced utilization rate of satellites. To ensure an intelligent engineering of traffic over satellite networks, a distributed routing scheme for single-layered satellite network, load balancing routing protocol based on mobile agent (LBRP-MA) is proposed. For LBRP-MA, mobile agents explore route by migrating autonomously. Upon arriving at destination, mobile agents migrate back. On each intermediate satellite, mobile agents evaluate path cost considering satellite geographical position as well as inter-satellite link (ISL) cost, and finally take ISL congestion index into account to update routing tables. Through simulations on the Courier-like constellation, the proposed approach is shown to achieve guaranteed end-to-end delay bound and decrease packet loss ratio with better throughput, which is especially suitable for data transferring in case of high traffic load. Moreover, results of the complexity analysis demonstrate that LBRP-MA can have low onboard signaling, storage and computation requirements. Furthermore, issues of LBRP-MA such as ISL congestion index and cost modification factor are discussed.