Oscillation suppression for traffic class dependent routing in ISL network

Adaptive per-hop routing in the intersatellite link (ISL) network of a packet-switched, nongeostationary satellite system is addressed. In particular, a traffic class dependent (TCD) routing is proposed with different optimization criteria for different traffic classes. Furthermore, for delay sensitive traffic, performance is enhanced by an exponential smoothing link-cost function, which reduces traffic load oscillations in the network. The performance of the proposed procedures is evaluated in two different traffic scenarios using an appropriate simulation model     

Wavelength dimensioning for wavelength-routed WDM satellite network

Internet and broadband applications driven by data traffic demand have become key dri-vers for satellite constellations. The key technology to satisfy the high capacity requirements between satellites is optical satellite networks by means of wavelength division multiplexing inter-satellite links (ISLs) with wavelength routing (WDM-OSN). Due to the limited optical amplifier bandwidth onboard the satellite, it is important to minimize the wavelength requirements to provi-sion requests. However, ISLs should be dynamically established and deleted for each satellite according to its visible satellites. Furthermore, different link assignments will result in different topologies, hence yielding different routings and wavelength assignments. Thus, a perfect match model-based link assignment scheme (LAS-PMM) is proposed to design an appropriate topology such that shorter path could be routed and less wavelengths could be assigned for each ISL along the path. Finally, simulation results show that in comparison to the regular Manhattan street net-work (MSN) topology, wavelength requirements and average end-to-end delay based on the topol-ogy generated by LAS-PMM could be reduced by 24.8%and 12.4%, respectively.     

Effective local dynamic routing strategy for air route networks

With the rapid development of air transportation, network service ability has attracted a lot of attention in academe. Aiming to improve the throughput of the air route network(ARN), we propose an effective local dynamic routing strategy in this paper. Several factors, such as the routing distance, the geographical distance and the real-time local traffic, are taken into consideration.When the ARN is in the normal free-flow state, the proposed strategy can recover the shortest path routing(SPR) strategy. When the ARN undergoes congestion, the proposed strategy changes the paths of flights based on the real-time local traffic information. The throughput of the Chinese air route network(CARN) is evaluated. Results confirm that the proposed strategy can significantly improve the throughput of CARN. Meanwhile, the increase in the average flying distance and time is tiny. Results also indicate the importance of the distance related factors in a routing strategy designed for the ARN.     

混合SDN的多目标路由优化算法

为充分利用SDN(Software Defined Network,软件定义网络)节点的优势来优化网络性能,混合SDN的流量工程成为当前的研究热点,而路由优化是实现流量工程目标的重要策略之一.但是,当前混合SDN的流量工程中未考虑网络整体的负载均衡以及SDN节点的处理能力.针对上述问题,提出了一种多目标路由优化算法——MCS(Minimum Cost Sum,最小化代价和),综合考虑整个网络的传输延迟与链路利用率,同时保证SDN节点的处理能力满足实际约束,最终实现全网综合性能的最优化.实验结果表明,当网络整体负载较轻,MCS与现有的SOTE(SDN/OSPF Traffic Engineering,软件定义网络/开放最短路径优先流量工程)算法性能相近;而当网络负载加重时,MCS相比于SOTE,可将网络负载降低约9％,因此,MCS算法具有更高的优化能力.     

MPP蛀孔互联网的模拟研究

蛀孔交换技术的特性不同于存储转发交换技术的特性。该文分析了消息在重载蛀孔网络中传输的性能特性，指出了在典型的二维MESH网中应用蛀孔技术的障碍。在此基础上提出了二维MESH的一种改进结构，即间接二维MESH结构，并分析、模拟了该结构在各种网络负载及各种网络规模下的性能特性。分析及模拟都说明了该结构的高效性。     

星间链路在空间态势感知中的应用研究

通过对星间链路和空间态势感知系统国内外发展现状的分析,指出星间链路在空间信息有效获取、安全传输和实时应用以及保障空间态势感知系统战场生存能力等方面起着重要的作用.针对星间链路在未来空间态势感知系统中的应用需求,提出包含空间通信模型和空间导航模型在内的空间感知体系基本架构,并对该架构下星间链路的设计要求或者特点进行分析,指出星间链路应该具有灵活可变的星间路由策略和联网结构,并能够支持高速可变和安全可靠的星间数据传输.分别从空间网络和卫星节点2个层面提出了系统实现的关键技术,并给出部分关键技术的研究重点和研究方法.上述研究结果可以为星间链路及相关领域的研究工作提供一定的借鉴和帮助.     

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-to-end 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 formulated 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 algorithm 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.     

ELGR: An Energy-efficiency and Load-balanced Geographic Routing Algorithm for Lossy Mobile Ad Hoc Networks

Geographic routing is a highly active area of research in mobile ad hoc networks (MANETs) owing to its efficiency and scalability. However, the use of simple greedy forwarding decreases the packet reception rate (PRR) dramatically in unreliable wireless environments; this also depresses the network lifetime. Therefore, it is important to improve delivery performance and prolong MANET lifetime simultaneously. In this article, a novel geographic routing algorithm, named energy-efficiency and load-loalanced geographic routing (ELGR), is presented for lossy MANETs. ELGR combines energy efficiency and load balance to make routing decisions. First, a link estimation scheme for the PRR is presented that increases the network energy efficiency level. Second, a learning method is proposed to adaptively sense local network loads, allowing enhanced whole network load balance. The results of a simulation show that ELGR performs better than several other geographic routing algorithms; in particular it extends network lifetime by about 20%, with a higher delivery ratio.     

基于蚁群算法的多路径QoS路由算法研究

针对现代网络通信量不断地增大以及蚁群算法在解决路由问题时存在的一些不足提出了基于改进蚁群算法的路由优化算法。该算法将蚁群系统的特点和流量工程的思想相结合对基本的蚁群算法进行了3方面的改进：将路由器的缓冲队列的利用率加入下一结点选择的标准;采用链路的利用率做为全局更新信息素;选择多条路径来进行数据传输。仿真实验结果表明该算法可以实现网络负载均衡,降低拥塞发生的可能性,提高了网络资源的利用率。     

An evolutionary computational framework for capacity-safety trade-off in an air transportation network

Airspace safety and airport capacity are two key challenges to sustain the growth in Air Transportation. In this paper, we model the Air Transportation Network as two sub-networks of airspace and airports, such that the safety and capacity of the overall Air Transportation network emerge from the interaction between the two. We propose a safety-capacity trade-off approach,using a computational framework, where the two networks can inter-act and the trade-off between capacity and safety in an Air Transport Network can be established. The framework comprise of an evolutionary computation based air traffic scenario generation using a flow capacity estimation module(for capacity), Collision risk estimation module(for safety) and an air traffic simulation module(for evaluation). The proposed methodology to evolve air traffic scenarios such that it minimizes collision risk for given capacity estimation was tested on two different air transport network topologies(random and small-world) with the same number of airports. Experimental results indicate that though airspace collision risk increases almost linearly with the increasing flow(flow intensity) in the corresponding airport network, the critical flow depend on the underlying network configuration. It was also found that, in general, the capacity upper bound depends not only on the connectivity among airports and their individual performances but also the configuration of waypoints and mid-air interactions among conflicts. Results also show that airport network can accommodate more traffic in terms of capacity but the corresponding airspace network cannot accommodate the resulting traffic flow due to the bounds on collision risk.     

基于复杂网络的空中交通特征与延误传播分析

空中交通流量管理主要集中在尾随间隔、空中等待等局部战术空中交通流量调配,对空中交通流量整体运行规律、延误传播和整体解决的研究较少。航空运输网络是一个复杂系统,从复杂网络理论角度对航空运输网络进行研究很有必要。首先,分析了空中交通流量网络的度、度分布、权值、权分布、流量、容量、延误等静态特征;然后,提出了空中交通流量网络整体效能评估方法,使用选择性攻击和随机攻击方法分析了空中交通流量网络的抗毁性,基于负荷容量级联失效模型和病毒传播模型与空中交通延误传播的相似性建立了空中交通延误传播模型,最后,使用实际运行数据验证了空中交通流量网络的特征与延误传播模型的有效性,该研究可以为大范围空中流量管理提供决策支持。     

软交换承载网络组网模式分析与研究

针对软交换网络中信令流、媒体流和维护流等业务流的交互需求,结合SOFTX3000软交换设备、UMG8900通用媒体网关设备和UA5000用户接入设备相关单板的工作原理,分析了采用二层组网模式的承载网络存在的弊端,提出了基于OSPF(Open Shortest Path First,开放式最短路径优先)协议的三层路由组网模式,并在某电话局软交换网络中得到应用。经分析,采用三层路由组网模式相比于二层组网模式具有更高的安全性和可靠性。     

Research of multi-path routing based on network coding in space information networks

A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks. On the basis of traditional multi-path routing, the algorithm uses a random linear network coding strategy to code data pack- ets. Code number is determined by the next hop link status and the number of current received packets sent by the upstream node together. The algorithm improves retransmission and cache mechanisms through using redundancy caused by network coding. Meanwhile, the algorithm also adopts the flow distribution strategy based on time delay to balance network load. Simulation results show that the proposed routing algorithm can effectively improve packet delivery rate, reduce packet delay, and enhance network performance.     

基于 TTE 端系统协议处理软件的研究与设计

在深入研究 TTE 协议基础上,根据该网络通信特点,提出了一种 TTE 端系统协议软件的设计方法。该协议软件在不同接入方式下采用了不同协议栈处理,支持三种不同优先级和实时性的数据流的传输,具有较好的可靠性,对于 TTE 端系统的设计有一定参考价值。     

基于功能脆弱性的空中交通相依网络流量分配

依据空中交通管理与航班运行规则,采用复杂网络理论构建由机场、航路与管制扇区组成的相依网络模型,建立不同扰动策略的影响规则,提出以网络流量熵和交通流损失比变化率为指标识别网络功能脆弱性。并以网络总流量熵最小为目标,建立基于改进遗传算法的网络流量协调分配策略,以降低空中交通相依网络的脆弱性。以民航华北地区空域为原型,发现了其相依网络脆弱性表现规律和脆弱源,采用遗传算法求解网络流量分配方案,优化结果降低了网络总熵值和功能脆弱性,其中机场网络流量分配后效果最为显著,验证了方法的有效性,研究结果可为空中流量管理决策提供一定的理论支撑。     

Inter-satellite link augmented BeiDou-3 orbit determination for precise point positioning

Precise Point Positioning(PPP) requires precise products, including high-accuracy satellite orbit and clock parameters. It is impossible to obtain an orbit solution that is sufficiently accurate for PPP services with a regional tracking network; therefore, satellite orbits are usually estimated by a global tracking network with a large number of ground stations. However, it is expensive to build globally distributed stations. Fortunately, BeiDou-3 satellites carry an InterSatellite Link(ISL) pay...     

基于PWM控制器ISL6752大功率DC/DC变换器的研究

以一种新型的PWM控制器-ISL6752为核心,对其控制机理进行分析,在Simplorer7.0仿真平台基础上建立了其内部关键子模块的模型,进行理论设计与系统综合仿真,并以一台48V/20A的原理样机为例进行验证对比,其模型对于原理性分析以及设计控制网络的参数具有重要的指导价值。     

定向凝固镍基高温合金缺口低循环疲劳性能及寿命预测

针对定向凝固(DS)镍基高温合金DZ125开展了850℃条件下不同缺口形式和不同理论应力集中系数(Kt)下的低循环疲劳(LCF)试验研究.利用弹塑性有限元分析缺口根部的应力应变场,并将传统临界距离理论(TCD)及其Kt修正形式引入SWT参数,以此开展缺口试件LCF寿命预测研究.结果表明:高温LCF强度同缺口几何形状关联不大,但具有强的Kt相关性;无论是将尖锐缺口试件作为校准试件还是对临界距离进行平均处理,传统TCD的点方法(PM)及线方法(LM)其寿命预测大于5倍分散带,且预测能力同缺口应力集中程度相关;改进TCD的点方法和线方法可得到小于2倍的分散带,且其预测精度与缺口几何形状无关.由于SWT参数可考虑平均应力(应力比)影响,故根据光滑试件和某Kt下缺口LCF试验数据便可以采用改进TCD预测其他缺口试件在不同应力比下的疲劳寿命,其应用简单、方便.     

Overview of multiple satellite communication networks

Recently interest in packet communications has stimulated an interest in constellations of low altitude satellites. Such a configuration would have less propagation delay and be cheaper to launch than satellites at higher or geosynchronous altitude. However, many more satellites are necessary at low altitude to achieve reasonable coverage of the earth and insure availability of the resource. Further, the geometry of such a constellation would be dynamic with communication links of short duration as the satellites speed past each other or a ground site. The most difficult design issue in these systems is a stable method of routing messages that will sustain a reasonable level of traffic. This paper explores the problems of routing and switching messages through a constellation of low altitude satellites and examines some of the related demands on technology. The dynamic nature of crosslinks, uplinks, and downlinks requires a very agile antenna system, and the volume of information for routing of traffic is overwhelming. Use of some type of facetted phased array antenna is advocated to solve the former problem, but the latter problem is more subtle. Since the volume of ephemeris and constellation data as well as the rate of update is unmanageable, schemes relying on some form of broadcast or random access may be considered. It is concluded that none of the known or examined approaches to routing and switching is completely satisfactory