主动队列管理中的PID控制器

作为对终端系统上拥塞控制的一种补充,中间节点上的主动队列管理(AQM)策略在保证较高吞吐量的基础上有效地控制队列长度,从而实现了控制端到端的时延,保证QoS的目的。C.Hollot等人(2001)用经典控制理论中频域校正的方法设计了用于AQM的PI控制器,但参数整定上的试凑方法不免代有盲目性;算法的瞬态性能指标也不够理想。为此,该文引入了微分环节来增强系统的响应能力,同时给出了基于稳定裕度的参数整定方法,使PID控制器的稳定性有了绝对保障。仿真试验表明PID算法的调节时间远远短于PI控制器,从而为在负载瞬息万变的网络环境中实现控制分组排队等待时间的目标提供了有力的技术保障。     

基于模糊免疫PID的时滞网络自适应主动队列管理

提出了一种基于灰预测和模糊免疫PID控制的时滞网络自适应主动队列管理（AQM）算法FIGAPID，旨在增强AQM算法动态自适应能力，同时补偿网络时滞，综合提高AQM算法性能。该算法借助免疫反馈机理进行PID参数的在线自适应调整，采用模糊非线性逼近的方法进行免疫反馈函数的确定；采用等维新息滚动灰预测实现路由器队列长度的超前预测，补偿AQM控制的反馈滞后。对比传统PID算法，仿真验证了FIGAPID的有效性，表明算法能快速稳定地适应动态时滞网络环境变化，收敛于路由器队列长度期望值，同时具有较小的数据丢包率。     

预测控制主动队列管理算法的设计与分析

针对Intemet时滞网络系统,提出了基于模型预测控制的主动队列管理算法MPAQM.首先考虑时滞系统的因果性来定义预测输出,然后根据拥塞控制的要求描述优化问题,求得路由器缓冲区的分组丢失率;另外分析给出保证闭环时滞系统稳定的充分条件,为算法的参数调节提供理论指导,使得队列能快速、稳定地到达期望值.在单瓶颈和多瓶颈网络拓...     

A stochastic dynamic controller for random early detection queues using a Kalman filter algorithm

The stabilizing random early detection (RED) congestion control algorithm in transmission control protocol (TCP)/IP networks is a control theory problem. Significant attention has been drawn to this problem in the networking and control theory research communities. In this paper, we use a nonlinear dynamic model of the TCP RED congestion control algorithm to analyze and design active queue management (AQM) control systems. A linearized model of RED behavior around its nominal operating point which implicitly includes the delay in the control signal is derived. It is assumed that the system model is corrupted at the input and output by zero mean white Gaussian noise signals. An optimal state feedback stochastic controller is designed for the linearized model of the system in conjunction with a Kalman filter for state estimation. To illustrate the proposed design methodology, simulations results are presented and discussed. The proposed stochastic controller is applied to the nonlinear model of the system; Simulation results indicate that the proposed controller keeps the queue length bounded in an appropriate stochastic sense. Copyright © 2009 John Wiley & Sons, Ltd.     

一种加强的主动队列管理算法--EBLUE

作为一种典型的主动队列管理算法,BLUE明显不同于其它方法,它使用丢包和连接空闲事件来控制拥塞。试验表明BLUE的丢包率明显小于RED,但是其参数设置仍然存在一些不足之处。本文在BLUE算法的基础之上,通过引进自适应的思想对其进行了改进,提出了一种加强的BLUE队列算法——EBLUE。大量的仿真实验表明本文的改进算法能够进一步提高BLUE的性能。     

PAQM: an adaptive and proactive queue management for end‐to‐end TCP congestion control

Two functions, the congestion indicator (i.e. how to detect congestion) and the congestion control function (i.e. how to avoid and control congestion), are used at a router to support end‐to‐end congestion control in the Internet. Random early detection (RED) (IEEE/ACM Trans. Networking 1993; 1 (4):397–413) enhanced the two functions by introducing queue length averaging and probabilistic early packet dropping. In particular, RED uses an exponentially weighted moving average (EWMA) queue length not only to detect incipient congestion but also to smooth the bursty incoming traffic and its resulting transient congestion. Following RED, many active queue management (AQM)‐based extensions have been proposed. However, many AQM proposals have shown severe problems with detection and control of the incipient congestion adaptively to the dynamically changing network situations. In this paper, we introduce and analyse a feedback control model of TCP/AQM dynamics. Then, we propose the Pro‐active Queue Management (PAQM) mechanism, which is able to provide proactive congestion avoidance and control using an adaptive congestion indicator and a control function under a wide range of traffic environments. The PAQM stabilizes the queue length around the desired level while giving smooth and low packet loss rates and high network resource utilization. Copyright © 2004 John Wiley & Sons, Ltd.     

A congestion control middleware layer with dynamic bandwidth management for satellite communications

Historically, satellites have been set aside for what regards Internet connectivity; however, the interest in their usage to provide Internet connectivity is now rising again. Because of the growing demand for Internet services around the world, satellites can be an effective medium to serve scarcely populated areas as well as mission‐critical communications. While the standard transmission control protocol (TCP) performs badly when employed on satellite links for the high propagation delay, when a number of client hosts are wirelessly connected to a gateway that forwards and receives traffic across such links, the major limit is represented by the channel condition estimation performed by the TCP through loss detection and/or acknowledgement‐based timing information. This paper proposes congestion control middleware layer (C²ML+), a centralized and collaborative middleware with dynamic bandwidth management, that aims to improve performance and QoS for TCP flows in the aforementioned scenarios. Results of ns‐3 simulations show an improvement in aggregate throughput, a significant reduction of latencies because of low queues occupancy levels, and higher fairness and friendliness guarantees among flows. They also confirm that C²ML+ allows a dynamic and efficient usage of the bottleneck link, avoiding a waste of resources when some client nodes are unable to fully exploit their transmission potential. Copyright © 2015 John Wiley & Sons, Ltd.     

A study of deploying smooth‐ and responsive‐TCPs with different queue management schemes

While there exist extensive research works on congestion control and active queue management, or the joint dynamics of a congestion control strategy with the random early detection (RED) algorithm, little has been done on the interactions between different window adjustment strategies and different queue management schemes such as DropTail and RED. In this paper, we consider a spectrum of TCP‐friendly additive increase and multiplicative decrease (AIMD) parameters. At the one end of this spectrum, smooth‐TCP enhances smoothness for multimedia applications by reducing the window decrease ratio upon congestion, at the cost of the additive increase speed and the responsiveness to available bandwidth. At the other end, responsive‐TCP enhances the responsiveness by increasing the additive increase speed, at the cost of smoothness. We investigate the network dynamics with various combinations of AIMD parameters and queue management schemes, under different metrics. The investigation is conducted from the deployment (especially incremental deployment) point of view. We discussed the impact of the interactions on the goodput, fairness, end‐to‐end delay, and its implications to energy consumption on mobile hosts. Copyright © 2008 John Wiley & Sons, Ltd.     

考虑慢启动影响的TCP吞吐量模型

TCP吞吐量模型的研究是网络协议研究的一个重要方面,同一些其它模型相比,Padhye提出的TCP吞吐量模型比较精确地描述了TCP吞吐量与往返时间、丢包率和超时时限的关系,但在丢包率很高的场合,Padhye模型误差较大,本文分析了高网络负荷下TCP传输的性能,提出了一个高网络负荷下TCP吞吐量的改进Padhye模型,实验表明,该模型在高网络负荷环境下更接近实际情况.     

基于改进量子进化算法的PID参数优化

PID控制器是一类广泛使用的控制器,其参数优化决定了控制器的性能。提出了一种基于改进量子进化算法的PID控制参数优化方法。在该算法中量子个体的每位量子比特都可以向不同的目标学习,实现了量子个体之间信息的充分交换,一方面保证了算法的收敛性,另一方面保证了算法的探索能力,有效提高了算法的优化性能。将该方法用于PID控制器参数优化,与其他优化算法的仿真结果比较表明,该方法能获取更好的控制效果,验证了该方法的有效性。     

串联排队RED、ERED网络分析模型

基于串联排队网络理论,建立了包括多个网络节点的串联排队RED和ERED分析模型。推导了具有指数分布分组丢失函数的RED算法(ERED)。在概率生成函数域,推导了节点的离去过程,并将其拟合为后续节点的到达过程,从而,刻画了多节点级联拥塞控制的通信场景。通过求解串联排队系统,得出串联排队RED、ERED以及DT 3种AQM机制的网络性能指标,分析了AQM参数设置对其性能的影响。针对不同突发度的业务源,给出每个节点和系统端到端性能指标。     

基于BFGS方法的拥塞速率控制算法

针对TCP/AQM对偶性模型采用梯度投影方法调整链路价格收敛速度慢的问题,使用具有更快收敛速度的BFGS方法来进行链路价格的计算,提出一种基于BFGS方法的拥塞速率控制算法。仿真结果证明,利用BFGS方法所设计拥塞速率控制算法具有更快的收敛速度,算法性能优于其它算法。     

区分服务模型中的一种动态队列管理算法

在对区分服务模型和RED算法进行分析的基础上，提出了一种基于RED算法的动态队列管理算法。实验结果证明，我们提出的算法在不损害高优先级数据流量的情况下，能较好地实时调整各优先级的门限值，减少网络资源的消耗，提高网络资源的利用率。     

Auto-tuning of PID controller according to fractional-order reference model approximation for DC rotor control

This paper presents a stochastic, multi-parameters, divergence optimization method for the auto-tuning of proportional–integral–derivative (PID) controllers according to a fractional-order reference model. The study aimed to approximate the step response of the real closed-loop flight control system to the response of a theoretical reference model for a smoother and more precise flight control experience. The proposed heuristic optimization method can auto-tune a PID controller without a precise plant model. This is very advantageous when dealing with model and parameter uncertainties in real control application and practice. Experimental study confirms the reference model driven auto-tuning of the DC rotor prototype.     

一种适合数据链的TOP拥塞控制策略

传统因特网传输控制协议（TCP）主要针对有线网络设计，无法应对数据链网络中突发干扰、高误码率、拓扑高动态变化引起的拥塞和吞吐率下降等问题。提出一种适合数据链网络的拥塞控制策略，利用主动探测结果来设定拥塞窗口大小，采用反馈机制进行动态拥塞控制，通过网关节点的缓存和转发来实现快速重传。仿真结果表明，与典型拥塞控制机制相比，提出的策略可明显改善数据链网络的传输性能。     

一种基于IP网络的拥塞控制调度算法

文中在TCP基于窗口的端到端的拥塞控制算法和IP层拥塞控制算法上提出了一种改进的增强型非线性比例积分算法,该算法主要解决PID算法的参数设置、鲁棒性和算法敏感性问题,减少了PID算法的参数设置.改进的算法采用了内模控制和优化控制来实现算法的稳定性.通过仿真实验证明提出的算法有快的收敛速度和稳定性,提高了算法的鲁棒性.     

一种基于BP神经网络算法PID控制器的研究与仿真

文中将BP神经网络的原理应用于参数辨识过程,结合传统的PID控制算法,形成一种改进型BP神经网络PID控制算法。该算法利用BP神经网络建立系统参数模型,能够跟踪被控对象的变化,取得较高的辨识精度。针对BP神经网络对权系初始值敏感的缺点,优化BP神经网络的初始权系数。通过BP算法修正BP网络自身权系数,实现PID参数的在线调整。仿真结果显示了该算法收敛速度快、精度高、鲁棒性强、稳定性好,表明了该算法的可行性与有效性。     

基于神经网络的多路无线TCP均衡控制算法

针对无线网络应用,能够有效地使多路的TCP数据业务均衡地使用网络共享资源,需要系统能根据无线网络的容量实时变化,动态调整各路TCP协议拥塞窗口大小,其参数结构复杂,难于建立精确的数学模型。为此提出了一种基于BP神经网络的控制算法,利用它可有效解决多路无线TCP数据业务拥塞窗口的自适应控制问题,为基于无线网络数据业务应用的优化提出一种新的思路。     

A Dynamic Adaptive Layered Multicast Congestion Control Mechanism

To solve the problem that most of existing layered multicast protocols cannot adapt todynamic network conditions because their layers are coarsely granulated and static,a new congestioncontrol mechanism for dynamic adaptive layered multicast(DALM) is presented.In this mechanism,anovel feedback aggregating algorithm is put forward,which can dynamically determine the number oflayers and the rate of each layer,and can efficiently improve network bandwidth utilization ratio.Additionally,because all layers is transmitted in only one group,the intricate and time-consuminginternet group management protocol(IGMP) operations,caused by receiver joining a new layer orleaving the topmost subscribed layer,are thoroughly eliminated.And this mechanism also avoids otherproblems resulted from multiple groups.Simulation results show that DALM is adaptive and TCPfriendly.     

Performance analysis of an improved dynamic power management model in wireless sensor node

The energy consumption in the wireless sensor networks is a very critical issue which attracts immediate attention for the sake of the growing demand of the billion dollar market in future. The Dynamic Power Management (DPM) technique is a way of controlling and saving the energy usage in a sensor node. Previously, researchers have proposed lifetime improving stochastic models for wireless sensor networks and limited work has been done focusing on the wireless sensor node. This paper proposes an analyser based Semi-Markov model for DPM in the event-driven sensor node. The power consumption comparison with previously proposed models without this analyser shows the analyser significant contributes to lifetime improvement. The improved model is more power efficient, presents how the DPM model observes the input event arrival and power states of the sensor node components, and then dynamically manages the power consumption of the overall system. Further, to observe the effect of event arrival, missed events, waiting time, processor utilization on the power consumption and lifetime, the proposed DPM system with the single server queuing model is developed.