SR架构下的软件定义信息中心网络概率路由策略

传统的TCP/IP路由以IP地址为中心,信息传输效率低下,难以满足网络用户需求。信息中心网络(Information-Centric Network,ICN)开始成为研究热点,ICN以内容为中心,可以高效传输信息。为了利用软件定义网络(Software Defined Network,SDN)和分段路由技术的优势,提高SDN控制器效率,减少网络传输时延,提出了一种可以应用于ICN的集中式架构。为进一步利用无标度网络对ICN进行建模,提出了一种基于数控分离的自适应概率路由算法。该算法通过迭代的方法调节数据包在节点发送的概率,使网络获取更佳性能。仿真结果表明,与最短路径算法和效率路由算法相比,该算法可以提升网络容量,有效降低平均路径长度。     

A novel Hα control strategy for design of a robust dynamic routing algorithm in traffic networks

In this paper novel centralized and decentralized routing control strategies based on minimization of the worst-case queuing length are proposed. The centralized routing problem is formulated as an H_infin optimal control problem to achieve a robust routing performance in presence of multiple and unknown fast time-varying network delays. Unlike similar previous work in the literature the delays in the queuing model are assumed to be unknown and time-varying. A Linear Matrix Inequality (LMI) constraint is obtained to design a delay-dependent H_infin controller. The physical constraints that are present in the network are then expressed as LMI feasibility conditions. Our proposed centralized routing scheme is then reformulated in a decentralized frame work. This modification yields an algorithm that obtains the "fastest route", increases the robustness against multiple unknown time-varying delays, and enhances the scalability of the algorithm to large scale traffic networks. Simulation results are presented to illustrate and demonstrate the effectiveness and capabilities of our proposed novel dynamic routing strategies.     

一种快速蜂窝多跳网路由算法

本文提出了一种适用于蜂窝多跳网的路由算法.该算法充分考虑了蜂窝多跳小区以基站为中心的特点.将传统的分布式路由方式改为基站统一为各节点提供路由的集中处理方式,并定义了一套与之适应的信令.由于采用了集中的处理方式,在新方法中,基站能够通过处理和维护路由过程中所得到的信息,逐步获取小区的拓扑结构,提高路由的效率.仿真结果表明,相比于现有方法,本文提出的算法在寻路的时间上大大缩短,寻路的质量也有一定提高.     

Toward manageable middleboxes in software‐defined networking

Software‐defined networking (SDN) acts as a centralized management unit, especially in a network with devices that operate under the transport layer of the OSI model. However, when a network with layer 7 middleboxes (MBs) is considered, current SDNs exhibit limitations. As such, to achieve a real‐centralized management unit, a new architecture is required that decouples the data and control planes of all network devices. In this report, we propose such a complementary architecture to the current SDN in which SDN‐enabled MBs are included along with contemporary SDN‐enabled switches. The management unit of this architecture improves network performance and reduces routing cost by considering the status of the MBs during flow forwarding. This unit consists of the following two parts: an SDN controller (SDNC) and a middlebox controller (MBC). The latter selects the best MBs for each flow and the former determines the best path according to its routing algorithm and provides information via the MBC. The results show that the proposed architecture improved performance because the utilization of all network devices including MBs is manageable.     

Routing framework and creation algorithm in Ad Hoc based SDN

Node energy-limited and mobility,indeed,requirement of customized service,made Ad Hoc press for customization Routing.Based on the core principle of software defined networking (SDN),the control framework and the design of routing creation bran-new approach about Ad Hoc based SDN was analyzed firstly.Secondly,the hierarchical routing model was established,and the problem of routing key nodes and key link centralized selection based on service path was proposed and its algorithm was designed,which could embed customize service into physical networks via nodes mapping based network performance maximization.Finally,it corroborate the advantage of routing implement via SDN in function,performance and the whole networks utilization.Experiments show that the energy consumption of network nodes is more balanced and the overall utilization of the network is nearly 14% higher than the traditional method.     

Routing optimization based on topology control in satellite network

A new double-layer satellite network model for space networking was established and a routing algorithm based on topology control (TCRA) was proposed considering the advantages of low earth orbit and stationary earth orbit satellite networks.This model used virtual node strategy and satellite grouping idea,which regarded the coverage area of each low earth orbit satellite as a virtual node.The network took into account the influence of the polar area on the division of the satellite footprints,such that the upper management satellites can accurately acquire the topology of the lower satellites.Using the improved virtual node strategy,the time slices were superior to other network models in quantity,length and other aspects.Based on the network topology,stationary earth orbit satellites calculate routing for low earth orbit satellites,while low earth orbit satellites were responsible for forwarding data.The simulation results show that the routing algorithm is superior to other algorithms in average end-to-end delay and packet loss rate.     

一种新型IP数据链网络路由算法模型

针对无线数据链网络,提出了一种新型的基于分层结构的IP路由算法模型,满足至少3种异构数据链网络的集成要求.仿真结果表明,该模型可有效支撑基于链路带宽、传输时延、链路质量等多种QoS的路由算法设计,为无线数据链网络层IP路由协议和算法设计提供了理论框架和实现指导.     

基于SDN的量子密码通信网络设计与研究

软件定义网络(SDN)采用OpenFlow技术分离网络设备的数据平面和控制平面,实现灵活控制网络资源的目的。基于此,设计了量子密码通信网络模型,实现灵活控制密码通信网络整体量子密匙资源,确保了信息的安全传输。此外,提出了综合到端可用密匙和跳数的路由算法,提高了QKD生成密匙的有效利用率。由测试结果可知,通过基于SDN的量子密码通信网络及路由算法,可提高量子密匙资源利用率,提高网络性能。     

基于自相似业务的移动Adhoc网络路由算法研究

该文分析了移动Adhoc网络中普遍存在但被忽视的自相似业务的路由和排队性能,提出了基于网络规划模型的多径备份路由优化功率(MBOP)算法。该算法利用多路径和备份路由,并对网络的发射功率进行优化,适用于网络结构动态变化的移动无线自组织网络。仿真结果表明,该算法可以显著改善节点的排队性能,提高网络的吞吐量改进时延性能。     

基于业务的光接入网路由选择算法

光接入网有着不同于光骨干网的特点和问题,不能直接套用光骨干网的路由选择算法。提出了一种基于业务的光接入网的路由选择算法。其思想是根据业务类型和重要性构建不同的带权图模型,每一种模型采用相应的子算法,使整体资源得到合理配置。实践证明,该算法能够改善网络的传输质量。     

Power‐efficient routing for SDN with discrete link rates and size‐limited flow tables: A tree‐based particle swarm optimization approach

Software‐defined networking is a promising networking paradigm for achieving programmability and centralized control in communication networks. These features simplify network management and enable innovation in network applications and services such as routing, virtual machine migration, load balancing, security, access control, and traffic engineering. The routing application can be optimized for power efficiency by routing flows and coalescing them such that the least number of links is activated with the lowest link rates. However, in practice, flow coalescing can generally overflow the flow tables, which are implemented in a size‐limited and power‐hungry ternary content addressable memory (TCAM). In this paper, a set of practical constraints is imposed to the software‐defined networking routing problem, namely, size‐limited flow table and discrete link rate constraints, to ensure applicability in real networks. Because the problem is NP‐hard and difficult to approximate, a low‐complexity particle swarm optimization–based and power‐efficient routing (PSOPR) heuristic is proposed. Performance evaluation results revealed that PSOPR achieves more than 90% of the optimal network power consumption while requiring only 0.0045% to 0.9% of the optimal computation time in real‐network topologies. In addition, PSOPR generates shorter routes than the optimal routes generated by CPLEX.     

集中与分布:协同虚拟网络映射

结合传统集中式和分布式两类算法各自的特性,提出了协同虚拟网络映射算法。该算法保留了集中式算法中拥有全局视野的中心控制实体,负责总体控制和关键决策,同时将具体映射方案的计算过程交给有限的底层网络子集实现;唯一的中心控制实体与多个底层节点相互配合协作,共同完成虚拟网络映射的整个过程。该算法继承了集中式和分布式算法各自的优势,有效弥补了二者的缺陷,初步的仿真试验也证明了其可行性和有效性。     

一种基于QoS的选播路由算法研究

随着计算机和网络技术的迅猛发展,对网络服务质量的要求越来越高,因此选播成为了IPv6中的一种标准通信模型。在提出了一种新的解决多种限制条件下QoS路由问题的启发式算法,在该算法中,综合考虑了时延、带宽和费用的限制条件,主要采用了网络链路信息预先处理和改进的宽度优先搜索等方法。实验结果表明,该算法具有良好的性能指标,能够有效解决多种限制条件下的QoS路由问题,并且较好的平衡网络负载和服务器负载。     

Satellite constellation of MEO and IGSO network routing with dynamic grouping

Because inter‐satellite links (ISLs) among the distributed satellite nodes can be used to support autonomous control in satellite system operation to reduce dependency on the ground stations, it becomes a popular communication paradigm for the future satellite systems. However, this introduces great technical challenges, particularly for routing protocol to support such space communication system. Facing the challenges, we present out study of routing technology in this paper tailored for satellite network of MEO (Table 1) and IGSO with ISLs in addition to satellite–ground links. The study aims to explore the routing strategies and algorithms of satellite network based on the evolution law of network topology to provide reference design for data exchange in autonomous satellite system. A comprehensive investigation, ranging from the analysis of relevant factors affecting data exchange in satellite networks to the primary application and resource constraints in designing satellite routing strategy, has been conducted. Our main contribution is to propose an on‐demand computing and caching centralized routing strategy and algorithm on the satellite network. The routing strategy and algorithm is designed for satellite network topology dynamic grouping. The route calculation for user data transmission is divided into three phases: direction estimation, direction enhancement, and congestion avoidance. The strategy and algorithm provide significant advantages of high efficiency, low complexity, and flexible configuration, by which the satellite networks can provide the features of flexible configure, efficient transferring, easy management, structural survivability, and great potential in scalability. Copyright © 2013 John Wiley & Sons, Ltd.     

基于Grover搜索算法的MANET网络路由协议

In Mobile Ad-hoc Networks (MA-NETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading perfor-mance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover’s sear-ching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover’s algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capa-bility of the network.     

WSN中负载均衡能量有效的路由算法研究

在PHGASIS建链方法的基础上提出了一种改进的建链方法；在此基础上提出了一种基于双层链结构并由基站集中控制的负载均衡、能量有效的路由算法（LBEERA），此算法充分利用了簇状路由算法和链状路由算法的优点．LBEERA算法将网络划分为多个簇，每个簇的节点组成一条低层链，每条链的链头节点形成一条高层链．仿真试验发现，相对于LHACH算法和PHGASIS算法，LBEERA算法增加了网络生存时间，减少了包传输时延．     

Distributed Algorithms for Secure Multipath Routing in Attack-Resistant Networks

To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple paths so that intruders require much more resources to mount successful attacks. Our work exhibits several important properties that include: (1) routing decisions are made locally by network nodes without the centralized information of the entire network topology; (2) routing decisions minimize throughput loss under a single-link attack with respect to different session models; and (3) routing decisions address multiple link attacks via lexicographic optimization. We devise two algorithms termed the Bound-Control algorithm and the Lex-Control algorithm, both of which provide provably optimal solutions. Experiments show that the Bound-Control algorithm is more effective to prevent the worst-case single-link attack when compared to the single-path approach, and that the Lex-Control algorithm further enhances the Bound-Control algorithm by countering severe single-link attacks and various types of multi-link attacks. Moreover, the Lex-Control algorithm offers prominent protection after only a few execution rounds, implying that we can sacrifice minimal routing protection for significantly improved algorithm performance. Finally, we examine the applicability of our proposed algorithms in a specialized defensive network architecture called the attack-resistant network and analyze how the algorithms address resiliency and security in different network settings.     

三层动态网络联合优化选路算法

 IP/MPLS over WDM被认为是下一代互联网络的最理想解决方案,但是在目前以及以后的很长一段时间内,网络结构仍然是IP/MPLS over SDH over WDM这样三层网络共存的情况。为了能够有效降低三层动态网络中的业务阻塞率,本文提出了三层动态网络联合优化选路算法。该算法分为两种模式,在模式1中,上层网络中被阻塞的业务可以开放的利用下层网络的空闲资源;在模式2中,将三层网络整合成为一个网络,在这个综合网络中为每一个业务进行选路。为了能够实时的传输每一个到达的动态业务,在这两种模式中采用蚁群策略为动态业务进行选路,提出了一个新的前向蚂蚁路径选择概率模型以及路径质量评判参数,使得所选的路径能兼顾链路利用率和路径跳数。仿真实验表明,同其他算法相比,本文提出的算法可以有效地降低三层动态网络的阻塞率。     

Routing algorithm for the Rotation-Exchange network

The paper proposes a new routing algorithm for the Rotation-Exchange (REn) network. The length of the path between any two nodes given by the algorithm is not more than (3/8)n^2 O(n), that is, the diameter of REn is not more than (3/8)n^2 O(n). This improves on a (1/2)n^2 O(n) routing algorithm proposed earlier.     

Low-complexity centralized joint power and admission control in cognitive radio networks

This letter introduces a centralized joint power and admission control algorithm for cognitive radio networks. Its novelty lies in the proposed admission metric. Unlike those in existing algorithms, our metric predetermines the admission order of N secondary users which intend to access the network. This allows us to search a group of admitted secondary users with the bisection method. The proposed algorithm is shown by simulation to achieve a comparable performance to existing algorithms, and the computational complexity is reduced from O(N³) to O(N² log₂ N).