基于IPv6分段路由的高校网络流量调度算法

高校网络流量调度算法的数据包转发吞吐率较低,研究基于互联网协议第6版(Internet Protocol version 6,IPv6)分段路由的高校网络流量调度算法。采集高校网络数据,通过网关将数据封装成IPv6数据报文,再转发至交换机与控制器建立通信,制定数据包转发规则;设定添加传输控制协议(Transmission Control Protocol,TCP)的和式增加积式减少(Additive Increase Multiplicative Decrease,AIMD)机制,收敛网络流量,均匀分配带宽的平衡状态,调整网卡分配宽带,进行流量预估;判断链路的网络流量,求解最优路径,实现网络流量调度。实验结果表明,运用设计方法处理转发的吞吐率较高,有效提高高校网络的服务质量。     

基于哈夫曼树的防火墙规则动态优化的研究

随着网络功能的不断增加,防火墙过滤规则集合日益庞大,已严重影响了网络整体性能。本文基于网络流量的特征,提出一种根据网络流量变化动态调整防火墙规则的防火墙规则优化方法,使得匹配网络数据包越多的规则越先与数据包相匹配,从而尽量减少数据包过滤时间。     

加密网络流量类型识别研究

针对传统的检测方法无法识别加密网络流量类型的问题,对加密网络流量类型的识别进行了研究。从加密后保持不变的网络流量特征着手,提出了通过统计数据包长度、数据包到达时间间隔以及流的方向等方法可以正确地识别加密网络流量类型,最后设计出加密网络流量类型识别的模型和相应的加密网络流量实时识别方案,通过对该方案的验证表明采用该方案能够获得较好的效果。     

校园网流量的分形特征

网络流量特性是我们深刻理解整个网络体系的架构及网络控制机制的切入点，所以有必要深入探究网络流量的特性，本文以复旦大学网络中心实测所得的网络流量数量为对象，利用小波技术来研究其数据包到达时间间隔的间波变换系数（小波系数，尺度系数），揭示出流量过程的自相似特性。     

基于改进的NetFPGA的网络流量控制系统研究

OpenFlow是一种软件定义网络的解决方案,而现有的OpenFlow并没有考虑网络中不同连接的优先级。针对该方法的不足,基于开源的NetFPGA平台基础上,提出并设计了一种带优先级网络流量控制系统。系统通过报头解析器对数据包的优先级进行识别;在数据包处理模块中,将不同优先级别的数据包分配到不同的队列中,并通过令牌对队列进行管理;通过NOX控制器设置数据流的优先权和速率。由于加入了带优先级的流量处理模块,可以在满足整个网络流量约束的情况下对具有高优先级的连接数据优先处理;通过TCP和UDP两种连接环境下的实验验证了系统的有效性是具有一定的实际应用价值。     

面向拓扑聚焦的网络流量模拟方法

为降低复杂网络模拟的计算开销,保证网络流量中数据包模拟的真实性,提出了一种面向拓扑聚焦的网络流量模拟方法。根据网络流量中数据包的路由路径所在区域,将数据包分为三种类型,对于每种类型的数据包采用不同的模拟方法。基于网络拓扑的实验表明,该方法适用于复杂网络的模拟,保证数据包模拟的真实性。     

一种基于统计分析的防火墙规则匹配优化方法

文章提出了一种基于统计分析的防火墙规则匹配优化方法。该方法对通过防火墙的数据包进行统计分析,并根据统计数据动态调整过滤规则的相对次序,使其和当前网络流量特性相一致,从而达到减少规则匹配时间、提高防火墙性能之目的。仿真结果表明,该方法在一定程度上提高了防火墙的性能。     

模糊算法在WiNCS死区采样中的应用

针对无线网络控制系统(WiNCS)常规死区采样算法导致的系统控制性能QoP和网络服务质量(QoS)下降的缺陷,提出一种模糊自适应死区采样算法.该方法利用系统控制误差和系统网络时延设定死区阈值,能实时自适应网络负载变化,自动在系统Qop和QoS指标范围内尽可能减少数据包传输量,更好地捕捉到网络流量变化和网络QoS变化.实验证明:所提方法不但能减少数据包传输量,而且可以高效地保证系统控制性能.模糊自适应死区采样结构简单,易于实现,具有一定的推广价值.     

一个基于TCR改进模型的网络流量管理系统①

网络流量管理技术是保证网络服务质量的重要前提。在研究网络流量识别与控制两种关键技术后,提出了一个实用的网络流量管理系统。在端口和特征值双层识别流量类型基础之上,针对TCP Ratecontrol（TCR）在往返时延的测量上难度大,精度低等不足,设计出了一种改进的流量控速模型,使得速率的控制更加有效和精确。最后在Linux的netfilter架构下实现了基于该模型的原型系统。通过实验测试验证了其有效性和准确性。     

基于深度学习的网络流时空特征自动提取方法

流量异常检测是网络入侵检测的主要途径之一,也是网络安全领域的一个热门研究方向。通过对网络流量进行实时监控,可及时有效地对网络异常进行预警。目前,网络流量异常检测方法主要分为基于规则和基于特征工程的方法,但现有方法需针对网络流量特征的变化需重新人工收集规则或 构造特征,工作量大且繁杂。为解决上述问题,该文提出一种基于卷积神经网络和循环神经网络的深度学习方法来自动提取网络流量的时空特征,可同时提取不同数据包之间的时序特征和同一数据包内字节流的空间特征,并减少了大量的人工工作。在 MAWILab 网络轨迹数据集上进行的验证分析结果表明,该文所提出的网络流时空特征提取方法优于已有的深度表示学习方法。     

分布式星群网络中基于蚁群算法的通信量分类路由

给出了一种分布式星群网络(Distributed Satellite Cluster Network,DSCN)体系架构,阐明了DSCN拓扑变化的特点。在分析网络状态获取方式和路由计算方法的基础上,提出了一种适用于DSCN的基于蚁群算法的通信量分类路由(Ant Colony Optimization Based Traffic Classified Routing,ATCR)算法。ATCR算法将通信量分为时延敏感型通信量A、带宽敏感型通信量B以及提供尽力而为服务的通信量C,并对蚁群算法(Ant Colony Optimization,ACO)收敛慢的缺点进行了改进。仿真实验表明,ATCR算法提高了收敛速度,可以有效平衡网络流量。通信量A和C的端到端时延要小于未采用通信量分类的改进ACO算法。由于减少了重负载链路的数量及拥塞引起的丢包,ATCR算法在分组递交率上的表现优于改进的ACO算法。     

A traffic-class burst-polling based delta DBA scheme for QoS in distributed EPONs

Ethernet passive optical network (EPON) preserves the merits of traditional Ethernet network while reducing complexities and improving quality of service (QoS). In this paper, a traffic-class burst-polling based delta dynamic bandwidth allocation (TCBP-DDBA) scheme is presented to provide better QoS to expedited forwarding packet and maximize channel utilization service to assure forwarding and best effort packets. The network resources are efficiently utilized and adaptively allocated to the three traffic classes by guaranteeing the requested QoS. Simulation results using OPNET show that the TCBP-DDBA scheme performs well in comparison to the conventional allocation scheme for a set of given parameters such as: packet delay, queue size, packet delay variation and channel utilization. This work considers system-wide DBA development in contrast to unit-based approach. It is concluded that the algorithm can be used for many types of EPON-based practical distributed networks.     

Reservation arbitrated access — a bandwidth on demand protocol for multiplexing variable bit rate isochronous traffic over dual bus metropolitan area networks

With the advent of multimedia communication services, transport of real-time traffic over metropolitan area networks (MANs) is becoming an important problem. We present a novel reservation arbitrated (RA) access protocol for multiplexing variable bit rate isochronous (VBRI) traffic such as packet voice and video over dual bus MANs in general and IEEE 802.6 MANs in particular. In combination with a cyclic release mechanism, RA access allows variable bit rate traffic sources (VBRSs) to capture and reserve some isochronous channels on a bandwidth on demand basis in a round robin fashion. For a reasonable bus length suitable for metropolitan coverage, it is possible to select operation parameters which enable contention free access in the reservation process. Bandwidth utilization can be further improved by employing a movable boundary option to efficiently integrate VBRI traffic with other traffic. System performances including packet loss ratio, packet delay, delay jitter, probability distribution of consecutive packet loss and channel utilization are analyzed by both theoretical computations and computer simulations for voice, video conference and motion video traffic. Results indicate that the protocol is fair and provides a nearly isochronous transport service while ensuring efficient bandwidth utilization, yielding substantial capacity improvements over pre-arbitrated (PA) access. Compared to queue-arbitrated (QA) access, RA access not only provides variable bit rate isochronous channels but also allows VBRSs to adapt to the reserved bandwidth during network congestion so that performance degradation can be minimized. RA access complements existing PA and QA access methods in 802.6 MANs to provide a complete traffic transport solution for all types of BISDN services.     

基于人工免疫的工业认知无线网络路由机制

工业互联网（industrial Internet）已成为第四次工业革命的代表技术.根据工业网络数据传输服务的需求,以及针对工业无线网络拓扑相对稳定、流量规律变化等特点,提出了一种基于人工免疫系统（artificial immune system,简称AIS）的工业认知无线网络路由机制,包含基于链路质量的域内静态路由算法和基于多路径的域间动态路由算法,以实现工业网络的可靠路由.根据人工免疫系统特点,将工业网络的拓扑结构进行区域划分：提出了基于链路质量的域内静态路由算法,采用软硬件结合的方式监视网络链路,并根据移动窗口指数加权平均法计算链路丢包率;提出了基于多路径的域间动态路由算法,根据模式距离对节点的流量周期进行预测,防止节点因流量过大而导致丢包.基于OMNET++仿真平台进行仿真实验,结果表明,所提出的路由机制在应对突发流量时与组合定向地理路由算法相比,丢包率及网络开销分别降低1倍;应对链路失效的情况时与图路由算法相比丢包率降低4倍.     

Joint call and packet QoS in cellular packet networks

This paper proposes a novel call admission control scheme capable of providing a combination of call and packet level quality of service requirements in cellular packet networks. Specifically, we propose a distributed call admission control scheme called PFG, which maximizes the wireless channel utilization subject to a predetermined bound on the call dropping and packet loss probabilities for variable-bit-rate traffic in a packet-switched wireless cellular network. We show that in wireless packet networks, the undesired event of dropping an ongoing call can be completely eliminated without sacrificing the bandwidth utilization. Extensive simulation results confirm that our scheme satisfies the hard constraint on call dropping and packet loss probabilities while maintaining a high bandwidth utilization.     

Design novel weighted rating of multiple attributes scheme to enhance handoff efficiency in heterogeneous wireless networks

With the availability of multiple access interfaces, mobile device users can move between heterogeneous wireless networks. Service providers now must try harder to satisfy their users by ensuring connection service quality. The vertical handoff scheme plays an important role in this endeavor. We propose a novel handoff scheme that features two operating processes: attributes rating and network ranking. A self-developed WRMA (Weighted Rating of Multiple Attributes) method is used to rate attributes. TOPSIS is employed to rank networks. The WRMA-based handoff scheme, as we shall call it hereafter, select an AHP-SAW handoff model to compare with. The WRMA, which rates attributes directly, is relatively simple to use. Further, TOPSIS was found to be more precise than SAW in ranking networks. We also compared our handoff scheme with the traditional NIST signal handoff model. Four Key Performance Indicators of packet drop ratio, delay, jitter and throughput were applied in our experiments. Results demonstrate our handoff scheme outperformed the NIST model in lowering packet drop ratio for all four traffic types. Higher average throughput is achieved. Experiments also show improvements on packet delay and jitter. Such improvements can significantly enhance link service quality, making it more suitable for voice and video traffic applications.     

无线网络中基于流媒体传输的自适应TFRC机制

在无线网络高误码率的环境下, 经典TFRC机制会将无线误码丢包误认为拥塞丢包, 导致吞吐量过度降低. 针对无线网络实时流媒体业务的传输控制问题, 提出了一种改进型动态自适应TFRC机制(Adaptive-TFRC). 它在接收端利用丢包区分参数来真实反映网络的状态(即拥塞或者误码), 然后反馈至发送端, 同时对经典TFRC机制的吞吐量模型公式进行改进, 最终能够根据实时网络条件动态自适应地调节传输速率. 仿真结果表明, Adaptive-TFRC机制能够有效地提高网络吞吐量, 降低实时业务流的延时抖动, 同时能够进一步改善TCP业务的友好性传输, 从而保证无线网络实时流媒体的服务质量.     

一种适用于多业务场景的HSDPA分组调度算法

针对HSDPA多业务应用场景,提出一种新的分组调度算法。该分组调度算法在保证每种业务的QoS的同时,兼顾公平性和分组时延限制。在包含流类、交互类以及背景类业务的应用场景里对该算法进行仿真。仿真结果表明,与正比公平和M-LWDF算法相比,该算法能获得更好的系统性能。     

Delays in a series of queues with correlated service times

In almost all applications of queueing network models it is assumed that for each customer the service times at different network nodes are independent. But service times in, for instance, computer and communication networks are typically essentially determined by properties like message or packet lengths that do not change substantially on the route through the network. Therefore, the service times of any customer in a queueing network are likely to be correlated, which can significantly influence quality of service (QoS) properties and performance measures such that results obtained with the independence assumption may be misleading. We consider delays in a series of queues with correlated service times at each network node where for each customer the service time at the first node is a random variable and the successive service times are correlated with the one at the first node. A recursive scheme for delays is provided. This scheme is used in order to efficiently conduct a simulation study where two types of correlation are studied, namely identical service times, and service times with an additional Gaussian noise. The simulation study focuses on comparisons of end-to-end delays for independent service times at different nodes and correlated service times, respectively. It turns out that for both correlation types, in light traffic the delays in case of correlated service times are larger than for independent service times by a factor that first increases with increasing traffic intensity up to a maximum value approached in medium traffic after which it decreases quickly and drops down to become significantly smaller than one in heavy traffic. This effect intensifies with increasing number of network nodes and depends, as well as the crossover point from which on correlated service times yield smaller delays, on the distribution of the service times at the first node.     

A scheduler ASIC for a programmable packet switch

While the Internet is successful in supporting traditional data-only traffic, an integrated services Internet is inevitable with the emergence of new applications such as voice, video, multimedia, and interactive video conferencing. Such an integrated services network should support a wide range of applications with diverse quality of service requirements and traffic characteristics. Provision for quality of service in packet networks in general, and in the Internet in particular, is the focus of most of the recent developments in switching and routing system design. We designed a generic, single-queue scheduler engine for use in a programmable packet switch/router to handle IP packets, ATM cells, or a combination of both. Comprising 275,000 gates, the 0.35-micron ASIC is incorporated into a prototype programmable packet switch