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

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

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.     

Traffic class dependent routing in ISL networks

This work addresses traffic class dependent (TCD) routing, using different link-cost functions, in the intersatellite link (ISL) network of a nongeostationary packet-switched satellite communication system. Three different traffic classes are introduced, each with its particular optimisation criteria. Performance analysis of TCD routing, in terms of average packet delay and average data throughput of a particular traffic class, is evaluated for homogeneous and nonhomogeneous traffic scenarios using a specifically developed simulation model of the ISL network.     

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.     

MPP蛀孔互联网的模拟研究

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

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.     

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.     

Cooperative Routing for Maximizing Network Performance of Wireless Networks

To greatly increase spectral efficiency and improve network performance in wireless networks,a novel cooperative routing algorithm,namely maximum throughput cooperative routing(MTCR) algorithm,is proposed.According to cooperative link model,throughput analysis is presented to evaluate performance improvement in the process of exploiting cooperative commu-nication from physical layer to higher layer.Taking the throughput improvement as performance metric,a cooperative relay se-lection scheme is developed.Finally,based on the route constructed by adaptive forwarding cluster routing(AFCR) algorithm,each node on the route selects the optimum cooperative node from all the potential cooperative nodes to construct the coopera-tive link with maximum throughput so that cooperative route with maximum network throughput from source to destination can be set up.Simulation results show that compared with the noncooperative routing algorithm and minimum power selection de-code-and-forward(MPSDF) routing algorithm,the proposed algorithm can obviously improve network throughput in the pres-ence of low transmission power,large number of nodes and high spectral efficiency.     

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.     

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

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

基于蚁群优化的能量均衡自适应路由算法

基于蚁群优化的WSNs路由算法具有蚁群优化自组织性、正反馈性和并行性的特点,在构造无线传感器网络中的最优路由时有很好的性能。但是蚁群优化构造最优解时带来的网络开销十分可观,不适合在路由维护阶段反复使用蚁群优化重构路由。考虑到蚁群优化的上述特点,同时针对无线传感器网络能量受限的特点,提出了一种基于蚁群优化的能量均衡白适应路由算法。该算法使用了新的信息素更新算子,算子中包含了网络能量水平因子,能够均衡网络能量消耗。在路由维护阶段,该算法使用了新的基于侦测蚂蚁的自适应路由维护机制,很好地降低了网络开销。     

一种新的容错蛀洞路由算法

研究了蛀洞网络的容错路由问题,提出了一种新的重新路由算法。与已知算法不同的是,该算法不需要虚拟信道,适用于任何网络拓扑结构和任意确定的路由策略,只要保证网络连通,也可适用于任意数目的故障信道。模拟结果表明,与现有方法相比,本文提出的方法在网格结构下具有更好或类似的性能。     

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

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

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.     

Comparison of alternative route selection strategies based on simulation optimization

Air traffic flow management (ATFM) is a collaborative process between the airspace provider and the airspace users. The result of the collaboration should be an outcome that maxi-mizes the utility of the system without excessively penalizing any of the agents. This paper develops a discrete-event simulation model which consists of aggregate departure/arrival airports, flight routes, and sectors for evaluating the alternative collaborative route selection strategy. Given the different perspectives from air traffic control center (ACC) and airlines, eight performance-metrics and five alternative route selection strategies represent the past, current and proposed air traffic flow management operations that were evaluated. The Monte Carlo method combined with the Optimal Computing Budget Allocation (OCBA) simulation optimization technique is employed to assess the performance of different strategies. A case study of the upper air routes in central and southern China shows that the proposed model can be readily implemented to simulate different kinds of air traffic flow management strategies and predict the effect of changes on the airspace sys-tem. It also shows that the proposed alternative collaborative route selection strategy is an effective way in alleviating the en-route traffic congestion.     

临近空间飞行器轨迹分析与组网性能仿真

近年来,临近空间组网成为研究热点,然而临近空间飞行器运行轨迹复杂和高动态的特性为实现可靠通信增加了难度,必须使用合适的移动模型对其性能进行仿真分析。分析了临近空间飞行器完整的运行轨迹,利用QualNet平台建立了飞行中各个阶段的模型,并基于无线自组网按需平面距离向量（AODV）路由协议进行了性能仿真,仿真结果为今后设计空天地-体化飞行器测控通信网提供了一定的依据。     

基于最小跳数的无线传感器网络跨层设计

传统的严格分层参考模型无法实现对无线传感器网络资源的有效管理和运用,跨层设计是提高网络整体性能的一种有效方法。针对无线传感器网络能量、计算资源、存储资源和带宽资源有限的特点,提出一种基于最小跳数的路由层和MAC层的跨层协议设计方案。MAC层和路由层通过共享sensor节点到sink节点的最小跳数信息,在MAC层建立时间梯度,解决多个节点共享无线信道的问题;并在路由层建立路由表,解决路由选择问题。仿真结果表明,该方案在降低网络能耗的同时,在降低传输延迟,提高数据投递率方面也取得了良好的性能。     

TTE网络流量转换策略及其延时性能保障调度算法研究

时间触发以太网（TTE）通过精确的全局时钟同步,使时间触发（TT）消息具有了严格的时间确定性。当系统同步精度降低时,TT消息的实时性也将严重受到影响。利用TTE交换机的流量类型转换功能,提出了一种基于消息时间窗检测的转换策略（TT-TWD）。该策略应用于TT流量向速率限制（RC）流量的转换过程,能够避免在系统同步精度降低时,TT消息出现丢包或不可接受延迟的情况。为保障该策略下网络流量的实时性,设计了一种基于流量转换策略的优先级调度算法（PTCTS）。运用网络演算理论对PTCTS算法的实时性进行了分析,并与先入先出（FIFO）算法结果对比,证明了PTCTS算法有效地减小了由TT流量转换而来的RC流量的延迟上界,同时保证了原始RC流量端到端延迟的确定性。     

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.     

Performance of a two-layer LEO satellite communication network

A novel two-layer low Earth orbiting (LEO) satellite network is proposed. Comparing with a single layer global network, not only the system performance is improved but also the number of satellites can be reduced. The main ideas include (1) to raise the altitude of the original global network, and (2) to add several satellites at lower altitude to form a regional network to serve calls from the areas of heavy traffic. In order to fully utilize the benefits of the two-layer network, additional functions such as adjustable beam and dynamic channel management are added. Call blocking rate is derived. Numerical examples are provided to demonstrate several interesting phenomena.