输出端口编码的可扩展快速转发方法

提出了一种基于路由器端口编码的转发方法（OPCF），该方法通过在通信源和目的间预先建立起面向连接的端口编码路径，可直接根据端口编码对数据包进行路由，避免了路由表查询开销，实现了基于显式路由的灵活快速转发，有助于网络服务质量的提高和流量工程的实现．由于不需要路由器存储和管理除路由表外的额外信息，OPCF可获得良好的扩展性．由于可隐藏数据包的IP地址信息，OPCF能有效增强网络通信的安全性．原型系统上的实验结果表明，该方法能实现比MPLS更低的端到端延时并能有效提高网络的吞吐量．     

基于队列的处理器亲和机制及在网络转发中的应用

提出一种新的基于多报文队列的处理器亲和机制,与传统基于网络接口的亲和机制相比,消除了多处理器对共享资源的竞争,优化了处理器的CACHE行为,降低了互斥锁的影响范围,能够有效提升多核处理器系统的网络转发处理能力.试验结果显示,在复杂网络环境下,基于队列的亲和机制报文转发性能较传统基于接口的亲和机制提高了1.8倍.     

A Distributed and adaptive framework for provisioning QoS in IPv6 networks

A distributed and adaptive framework （DAF） was proposed for provisioning quality of service （QoS） in IPv6 network. In DAF, per-flow admission control and resource reservation, in conjunction with a new IPv6 flow label mechanism, can be performed instantaneously in a fully distributed and independent fashion at the edge of network without hop-by-hop signaling. The flow label helps in resource reservation and packets forwarding for aggregated traffic on an edge-to-edge path basis. In addition, a bounded directional probing technique for DAF was designed to reconfigure resource reservation adaptively between every pair of edge router for aggregated traffic according to the fluctuation of its traffic load. The simulation results show that DAF provides QoS guarantees to individual flows with minimal overhead, as well as keeping the scalability characteristic like DiffServ.     

Research on Improved Low-Energy Adaptive Clustering Hierarchy Protocol in Wireless Sensor Networks

In wireless sensor networks (WSNs), due to the limited battery power of the sensor nodes, the communication energy consumption is the main factor to affect the lifetime of the networks. A reasonable design of the communication protocol can effectively reduce the energy consumption of the network system. Based on low-energy adaptive clustering hierarchy (LEACH), an improved LEACH protocol in WSNs is proposed. In order to optimize the cluster head (CH) election in the cluster setup phase, the improved LEACH takes into account a number of factors, including energy consumption of communication between nodes, remaining energy of the nodes, and the distance between nodes and base station (BS). In the steady phase, one-hop routing and multiple-hop routing are combined to transmit data between CHs to improve energy efficiency. The forward CH is selected as relay node according to the values of path cost. The simulation results show that the proposed algorithm performs better in balancing network energy consumption, and it can effectively improve the data transmission efficiency and prolong the network lifetime, as compared with LEACH, LEACH-C (LEACH-centralized) and NDAPSO-C (an adaptive clustering protocol based on improved particle swarm optimization) algorithms.     

基于遗传算法的道路车辆自组织网络源路由机制

在当前基于交叉路口的城市车辆自组织网络(VANETs)路由协议中，道路上数据包传输大多采用基于地理位置的贪婪转发策略，当数据量较大时，个别节点负载较重，极易引起传输延迟增大乃至丢包的情况.本文提出了一种基于遗传算法的源路由机制，通过记录单体车辆的驾驶信息而非传统方法中的车流均值数据，来预测道路上车辆网络的连通情况，并借助遗传算法，首次基于道路连通性、节点负载和连接跳数这3 点综合考虑，计算得出道路上最佳的源路由节点序列.仿真实验结果表明，在传输率与延迟时间上，性能均优于传统的贪婪路由机制，尤其在车流量为250 veh· lane-1· h-1时，传输率提升约13%.该研究可为智能交通信息通讯提供可靠助力.     

基于遗传算法的道路车辆自组织网络源路由机制

在当前基于交叉路口的城市车辆自组织网络(VANETs)路由协议中，道路上数据包传输大多采用基于地理位置的贪婪转发策略，当数据量较大时，个别节点负载较重，极易引起传输延迟增大乃至丢包的情况.本文提出了一种基于遗传算法的源路由机制，通过记录单体车辆的驾驶信息而非传统方法中的车流均值数据，来预测道路上车辆网络的连通情况，并借助遗传算法，首次基于道路连通性、节点负载和连接跳数这3 点综合考虑，计算得出道路上最佳的源路由节点序列.仿真实验结果表明，在传输率与延迟时间上，性能均优于传统的贪婪路由机制，尤其在车流量为250 veh· lane-1· h-1时，传输率提升约13%.该研究可为智能交通信息通讯提供可靠助力.     

A secure and reliable routing protocol for wireless mesh networks

This study proposes an efficient secure routing protocol which considers symmetric and asymmetric links for wireless mesh networks （WMNs）. A wireless mesh network is a group of wireless mesh routers and several kinds of wireless devices （or nodes）. Individual node cooperates by forwarding packets to each other, allowing nodes to communicate beyond the symmetric or asymmetric links. Asymmetric link is a special feature of WMNs because the wireless transmission ranges of different wireless devices may be different. The asymmetric link enhances WMN coverage. Providing security in WMNs has become an important issue over the last few years. Existing research on this topic tends to focus on providing security for routing and data content in the symmetric link. However, most studies overlook the asymmetric link in these networks. This study proposes a novel distributed routing protocol beyond symmetric and asymmetric links, to guarantee the security and high reliability of the established route in a hostile environment, such as WMNs, by avoiding the use of unreliable intermediate nodes. The routes generated by the proposed protocol are shorter than those in prior works. The major objective of the proposed protocol is to allow trustworthy intermediate nodes to participate in the path construction protocol. The mesh clients out of mesh router wireless transmission range may discover a secure route to securely connect to the mesh router for Internet access via the proposed protocol. The proposed protocol enhances wireless mesh network coverage and assures security.     

轨道交通中异构智融车载网络发展综述

从蜂窝无线接入技术、非蜂窝无线接入技术、异构智融车载网络接入技术三方面，分析了国内外轨道交通车载网络的研究现状；针对非蜂窝无线接入技术和蜂窝无线接入技术的问题，阐述了协同利用轨道交通周边异构无线资源进行网络融合、协同通信的优越性；从网络模型、网络架构两方面论述了异构智融车载网络的融合方案；结合智能轨道交通业务需求，从可靠性和资源利用率两方面对现有的异构智融车载网络研究进行了系统性的归类梳理；从人工智能、安全性和云边结合三方面提出未来异构智融车载网络的发展趋势。研究结果表明:异构智融车载网络可靠性分为网络架构的可靠性和数据传输的可靠性，其中在网络架构可靠性方面，主要研究了通过冗余网络架构、车云传输架构、软件定义网络构架和智慧协同网络架构4种方式提升可靠性，在数据传输可靠性方面，主要研究了通过多路径传输、网络编码和切换算法降低传输过程中的丢包率；异构智融车载网络资源利用率分为无线接入的资源利用率和链路调度的资源利用率，其中在无线接入资源利用率方面，主要通过信道状态预测、频谱划分、频移补偿3种方式增加网络吞吐量，提高资源利用率，在链路调度的资源利用率方面，主要通过调度算法、接收缓存算法和拥塞控制算法来减少异构链路对数据传输的影响，降低数据重传次数，提高网络资源利用率。      

多频无线通信网路由协议

针对多频无线通信网的特点,设计了一种多频无线通信网路由协议（MCWN-RP）.协议采用组播扩散机制优化扩散路径,采用非重传确认机制减少报文种类,采用最短路径树构造算法降低扩散内容,采用自适应定时器调整机制减少网络冲突,从而大大降低了协议开销;同时采用差别拓扑更新方式,提高收敛性能.对MCWN-RP进行了协议开销和收敛时间的性能分析,得出协议性能与拓扑更新包大小和协议包发送间隔的关系.OPNET仿真结果表明,与OSPF、OLSR协议相比,MCWN-RP具有非常小的协议开销和较高的收敛性能,是一种高效的动态路由协议.     

一种基于能量模型的AODV改进协议

移动Ad Hoe网络是由一组无线移动主机组成的一个没有任何基础设施或集中管理设备的临时网络.针对网络拓扑易变以及带宽、能源有限等移动Ad Hoe网络的主要特点.在介绍一种能量消耗模型的基础上,提出了一种路由算法,由于该算法是一个NP完全同题,因此给出了一个解决该问题的近似算法,在经典的路由协议AODV基础上进行了仿真实验.实验结果表明新的协议EA-AODV在总能量消耗和网络生存时间方面表现出了很好的性能.     

一种基于TDD的无线mesh网络随机自学习调度算法

基于时分多址（TDD）的无线mesh网络是实现无线多跳网络和宽带无线接入的一种关键技术.为用户提供一种可以保障稳定通信的有效的分布式算法是影响基于TDD的无线mesh网络性能的关键因素.本文针对TDD的无线mesh网络提出一种随机自学习分布式调度算法,这种算法是一种基于信息学习的随机选择算法.在网络中,任一节点都要根据其邻居节点控制消息中所携带的数据,学习邻居节点的调度信息,从而判断可用时隙.若上次信息传输成功,则节点仍然沿用上次的传输时隙;反之,节点在可用时隙中随机选择一个时隙发送控制消息.仿真结果表明,与IEEE802.16标准中定义的算法相比,提出的随机自学习分布式调度算法能实现更高的吞吐量.     

Polling algorithm based on traffic burst characteristics of broadband wireless access systems

In this paper, we propose a novel polling algorithm to decrease the number of idle slots and collission slots during the polling cycle by evaluating the bandwidth request of the subscribe stations (SSs) in the next polling cycle for broadband wireless access (BWA) systems. We firstly analyze the feature of silent time intervals and deduce the Hurst index which symbolizes the degree of self-similarity and long-relative nature. Then we represent the inactive OFF time intervals by the Pareto model and estimate the shape parameter α by the group measured data. Finally we can evaluate the transmission probability of a silent SS before the next polling cycle. By this algorithm, we can find the optimal transmission opportunities for the base station (BS) to achieve the least collision or void timeslots in order to achieve the largest bandwidth efficiency. The theoretical analysis and simulation results show that this polling algorithm can improve the performance for BWA system.     

A new method of transmission network flexible planning using the connection number

Because connection number can express and process synthetic uncertainties caused by various uncertainties in the transmission network planning, a connection number model (CNM) was presented to compare the values of connection number logically. This paper proposed a novel model for transmission network flexible planning with uncertainty. In the proposed planning model both certainty and uncertainty information were included, and the cost-benefit analysis method was used to evaluate the candidate schemes in the objective function. Its good adaptability and flexibility were illustrated through two examples.     

A simple method to solve the network congestion for spitial architcture

Scheduling algorithm always plays an important role in the spatial architecture for the contradiction between the finite network bandwidth and the abundant execution resources. This article provides a simple method to solve the contention for network resource in one of the spatial architecture, i.e. the tera-op, reliable, intelligently adaptive processing system (TRIPS) processor. The method improves the performance of network by increasing the bypass bandwidth which can transmit the data in the internal of every execution unit, and converting the proportion of remote communication by the deep scheduling algorithm. The deeply optimized algorithm is realized to verify the validity of the method, and the performance increase 9% for floating point spec2000 benchmark is got.     

最小化网络总时延启发式遗传算法

路由选择算法是用于决定计算机网络每个结点输入的信息包应当从哪一个输出线路发送出去,以便使得某种指定的费用最小。提出了一种新的有效启发式遗传路由算法,以使网络总时延最小。该算法采用了启发式遗传路由方案,从而获得近似最优解。采用遗传算法的方法可以减少网络路由算法的运算规模,实现逐步求解。与其他已知类似算法相比较,该算法具有较小的时间复杂性。     

自供电路侧单元能量-时延均衡分组调度策略

考虑了自供电路侧单元在分组传输过程中能量收集、车辆到达与车速的随机性, 基于受限马尔科夫决策模型建立分组调度系统模型, 研究了分组平均传输时延与能量消耗; 分析了在能量队列约束下最小分组平均传输时延的优化问题, 提出了自供电路侧单元能量-时延均衡分组调度策略, 通过仿真试验分析了最优分组调度策略性能, 并与贪婪中继方案和Q-learning算法进行对比。仿真结果表明: 该分组调度策略具有双门限结构, 系统通过自供电路侧单元的能量队列状态以及到达车辆的车速状态确定决策变量, 使系统可以在考虑能量利用效率的前提下降低监测数据分组的平均传输时延, 保证自供电路侧单元在能量存储不溢出不耗尽的同时, 最小化系统分组平均传输时延; 在单分组发送模型中, 提出的分组调度策略的平均传输时延相比贪婪中继方案降低了15.7%, 相比Q-learning算法降低了13.5%;在批量分组发送模型中, 其分组平均传输时延相比贪婪中继方案降低了20.4%, 相比Q-learning算法降低了11.5%。      

考虑网络拥堵与系统公平的车载异构网络选择方法

利用演化博弈的有限理智特性执行网络选择, 以实现车载异构网络系统中网络资源的均衡分配; 利用双层博弈对演化博弈方法进行优化, 保证极端拥堵中部分车辆消息传输的同时, 维持系统公平; 设计了专用短程通信、长期演进和无线局域网融合的车载异构网络仿真场景, 对比了基于多准则决策的传统方法、基于演化博弈的网络选择方法和基于双层博弈的网络选择方法。仿真结果表明: 采用基于演化博弈和双层博弈的车载异构网络选择方法首次解决了动态网络环境中车载异构网络切换时出现的大规模乒乓效应, 利用双层博弈能够实现拥堵抑制和系统公平; 采用基于双层博弈的网络选择方法能够驱动异构网络系统在2~3个切换周期内实现网络系统状态的稳定; 在预设的动态网络评价条件下与80个终端的一般场景中, 双层博弈终端平均网络评价指标高于演化博弈19.5%, 为3种网络协同工作提供可靠服务; 在190个终端极端拥堵场景中, 终端合理分配, 共享专用短程通信网络资源, 双层博弈终端平均网络评价指标高于演化博弈10.3%, 双层博弈专用短程通信网络评价指标为演化博弈的2.18倍, 可以保证车联网基本安全信息的广播、系统的公平并维系基本车联网服务。      

QTNPOSS网络最大延时性能分析（英文）

为增强TNPOSS网络的QoS性能,通过引入分形令牌桶（FLB）和加权公平队列调度（WFQ）,提出了QoS增强的TNOPSS（QTNPOSS）网络模型.在QTNPOSS中,网络多媒体流的数据包在到达网络节点时进行整形,而后通过WFQ输出.利用网络微积分工具,分析了QTNPOSS网络的最大端到端延时表达式.大量数值实验表明,多媒体流的长相关特性和WFQ的权重对QT-NPOSS网络的延时都有影响,其中WFQ权重对QTNPOSS网络端到端延时的影响更大.     

中国煤炭运输网络空间演化

为了研究中国煤炭运输网络的演变规律和内在作用机制, 借鉴复杂网络的建模思想, 提出了综合煤炭价格成本和运输成本选择机制的煤炭运输网络演化模型, 并通过调节模型参数, 分析了其对网络特性的影响; 为反映煤炭价格动态波动对节点选择的影响, 构建了服务于演化模型的煤炭价格波动函数; 采用1998年中国煤炭运输数据进行仿真计算, 并将仿真结果与2016年中国煤炭运输网络特性进行对比, 以验证提出的煤炭运输网络演化模型的合理性。研究结果表明: 节点强度比节点度更适合用于分析中国煤炭运输网络特性; 中国煤炭运输网络为异配网络, 移走少数高强度节点会严重影响网络的连通性, 增加煤炭运输进口节点会减小移走少数高强度节点对网络的影响; 增加煤炭运输出口节点能提高中国煤炭运输网络的可靠性, 能大大提高山东、辽宁等地区的港口潜力, 带动地区经济发展; 增加煤炭运输进口节点会使中国东南部沿海地区和中部地区成为关键节点, 也能提高中国煤炭运输网络的可靠性, 但网络抗毁性会减弱, 网络中关键节点与非关键节点连接的倾向性会逐渐减弱, 网络的传递性和紧密程度表现为先升高后降低的趋势。可见, 在增加煤炭运输进出口节点的同时, 应加强对煤炭运输网络的整体规划和对枢纽地区的建设和管理, 合理引导煤炭运输资源配置, 以提高中国煤炭运输网络的整体性能。      

A New Congestion Prevention Policy for the Router

Introduction When too many packets are present in therouter, the performance of the router will degradeand the network will have congestion. Congestioncan be cause by several factors. If all of the suddenstreams of packets begin arriving on three or fourinput lines and all packet need the router to dealwith, a queue will build up. Slow processors canalso cause congestion. If the router’s CPU is slowat performing the bookkeeping tasks required ofthem, queues can build up even though there is…