An effective network congestion control method for multilayer network

The congestion control problem in a single node network has been solved by the nonlinear feedback control method,which has been proven to be effective and robust for different router’s queue size.However,these control models are based on the single layer network architecture,and the senders and receivers are directly connected by one pair of routers.With the network architecture being more and more complex,it is a serious problem how to cooperate many routers working in the multilayer network simultaneously.In this paper,an effective Active Queue Management（AQM）scheme to guarantee the stability by the nonlinear control of imposing some restrictions on AQM parameter in multilayer network is proposed.The nonlinear control can rely on some heuristics and network traffic controllers that appear to be highly correlated with the multilayer network status.The proposed method is based on the improved classical Random Early Detection（RED）differential equation and a theorem for network congestion control.The theorem proposed in the paper proved that the stability of the fluid model can effectively ensure the convergence of the average rate to its equilibrium point through many routers in multilayer network.Moreover,when the network capacity is larger,the proposed scheme can still approach to the fullest extensibility of utilization and ensure the stability of the fluid model.The paper reveals the reasons of congestion control in multilayer network,provides a theorem for avoiding network congestion,and gives simulations to verify the results.     

一种参数自适应的主动队列管理算法-自适应BLUE

BLUE算法是一种典型的主动队列管理(Active Queue Management,AQM)算法,研究表明BLUE算法优于RED算法.BLUE算法使用丢包事件和链路空闲事件控制网络拥塞.但由于BLUE算法在参数设置方面存在不足,尤其是当TCP连接数突然剧烈变动时,容易导致队列溢出或空闲的频繁发生.该文引进参数自适应机制,提出了自适应BLUE算法,并借鉴了RED算法的早期拥塞检测机制.NS仿真实验表明该算法能有效保持队列长度的稳定,减少队列溢出或空闲现象的发生,在提高链路利用率的同时降低丢包率.     

一种时滞网络自适应主动队列管理算法研究

主动队列管理(AQM)算法的自适应能力和克服滞后性不良影响的能力是该文研究的重点。在分析AQM采用传统PID存在的问题的基础上,提出了一种时滞网络的自适应主动队列管理(FAGPID)算法。由模糊控制器实现PID参数对动态网络环境的在线自适应调整;成功引入灰预测算法实现反馈数据的超前预测,补偿滞后。仿真对比AQM环境中FAGPID,传统PID以及基于模糊免疫PID(FIGPID)的算法,可知FAGPID相对于FIGPID复杂度低,但FAGPID与FIGPID性能相当,均能克服滞后的影响,能快速稳定地适应动态网络环境,收敛于期望队列长度,具有较小的丢包率,优于传统PID算法。     

A wireless multimedia transmission control algorithm over heterogeneous IP networks

In this paper,an algorithm Wireless Multimedia Transmission Control(WMTC) is proposed for multimedia transmission control over wired-wireless networks.The relationship between packet length and packet loss rate in the Gilbert wireless error model is investigated.Furthermore,the algorithm can detect the nature of packet losses by sending large and small packets alternately,and control the sending rate of nodes.In addition,by means of updating factor K,this algorithm can adapt to the changes of network states...     

A novel Markov analytical model for the TCP/AQM systems

A novel closed-loop feedback TCP/AQM(Transfer Control Protocol/Active Queue Management) model is proposed in this paper using a discrete-time Markov chain,and a way to calculate the equilibrium distribution of this model is given.In the model,system time is divided into time slots,the bottleneck router queue model and TCP window size model in each slot are analyzed.Finally,by combining adjacent slots,an integrated TCP/AQM analytical model is developed.By this model,the average values of packets dropping rat...     

SABlue:一种带加速因子的自适应AQM算法

该文在分析SBlue算法的基础上,提出了一种带加速因子的自适应AQM算法SABlue(Self-tune Accelerate Blue)。算法将瞬时队长作为早期拥塞检测参量,根据队列负载因子控制丢包步长,实现丢包概率幅度的自适应调整,最终将路由队列长度稳定在目标区域内。为了提高网络突变跨度较大情况时算法的响应速度,在队列警戒区域内引入了加速因子。实验表明,SABlue面对突变流和不同RTT的网络场景,队列收敛时间短,丢包率小,且具有较好的鲁棒性,算法综合性能优于其他AQM算法。     

一种基于RED分组丢弃历史的带宽均衡分配算法

针对目前Internet中的响应流和非响应流带宽分配不均衡的问题,该文提出了一种基于RED分组丢弃历史的算法,该算法可以发现高速率的数据流并对其到达分组按概率作优先丢弃,以避免这些流对带宽的过度占用,多个仿真实验从不同的角度验证了该算法的有效性。     

一种新的快速响应的AQM算法

该文应用控制理论,设计了具有快速响应特征的比例积分(Proportional-Integral, PI)控制器,并以此提出了一个新的主动队列管理(Active Queue Management, AQM)算法,称为Active PI算法(简称A-PI)。A-PI用一组参数实现快速响应,用另一组参数保证队长稳定,使用门限值实现两组参数间平滑切换,算法实现简单。理论分析和仿真实验表明,A-PI算法在保证队长稳定的同时实现了对不同网络环境的快速响应。     

一种支持区分服务的模糊公平分组丢弃算法

随机早期检测(RED)算法是目前Internet中广泛使用的一种缓存管理算法,对RED算法进行改进以提高公平性以及对网络动态变化的适应性一直是主动队列管理的研究重点之一。该文引入新的变量分享指数,取代单个业务流缓存占用量来表征不同业务流对网络资源的占用情况,以克服缓存占用量表征公平性的缺陷。同时,在无线网络中对分享指数的定义进行推广,使其同时兼顾公平性和系统性能(信道条件)。通过对分享指数和队列长度共同制定规则,提出了一种基于模糊逻辑控制的缓存管理算法。算法在根据缓存队列长度计算丢弃概率时,根据不同流对网络资源的占用情况(即分享指数)进一步决定增加或减小相应的丢弃概率,从而可利用不同流之间的差异以加速缓解拥塞,具有更好的自适应性和公平性。仿真表明,采用该算法后,系统性能得到改善。     

QPID-AVQ：一种基于队列的PID控制的AVQ算法

本文针对AVQ算法存在的不足,在PD-AVQ算法基础上,为进一步提高系统的稳定性,引入积分选项,构成PID-AVQ算法,运用控制理论推导出了满足系统稳定条件的取值范围.利用PID-AVQ算法更新虚拟带宽,综合考虑平均队列长度和包到达速率,提出了一种新的基于队列的PID控制自适应虚拟队列管理算法QPID-AVQ,可根据网络实际情况调节参数,保持队列长度稳定.仿真结果表明,当控制参数在稳定范围内取值时,QPID-AVQ算法能较好地适应网络状态变化,使队列长度始终维持在期望值附近,而不受用户数量的影响,具有较好的稳定性、抗干扰能力和较高的带宽利用率,综合性能优于PD-AVQ和RED算法.     

REDu:一种新的识别并惩罚非适应流的主动式队列管理算法

本文提出一种新的主动式队列管理算法——热度算法(REDu).算法深入挖掘非适应流与适应流本质区别,利用CHOKe命中、RED丢弃等信息预选非适应流,通过热度升降机制计算一种新的部分流状态——热度,以此识别并惩罚非适应流.基于ns-2的仿真实验显示,与其他几种主动式队列管理算法相比,REDu具有更准确的识别并惩罚非适应流的能力,对适应流提供更好的保护,网络的鲁棒性也显著提高.     

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.     

认知无线网络中基于Stackelberg博弈的功率控制新算法

针对认知无线网络中存在的干扰问题和功率消耗过大问题,提出了一种新的基于斯坦克尔伯格(Stackelberg)博弈的功率控制算法。建立了主次用户双层网络模型,将主用户设置为领导者,次用户设置为追随者,并对次用户产生的总干扰进行定量分析。在次用户多次博弈的过程中,动态地调整主用户单位干扰价格,在保证主用户自身正常通信前提下,尽量使得收益最大化,提高主用户的参与积极性。仿真实验表明,该算法在保证主次用户的服务质量（QoS）前提下,有效地减小了次用户的发射功率,而且能获得更高的系统容量。     

TCP网络的自适应非奇异终端滑模控制

针对TCP网络的拥塞控制问题,采用非奇异终端滑模控制理论提出了一种新的主动队列管理算法。采用非奇异终端滑模面以克服传统终端滑模控制的奇异问题,同时确保系统能在有限时间内收敛至平衡点。考虑到UDP流干扰的情况,用Lyapunov稳定性方法给出了一个自适应律来消除UDP流干扰对系统的影响。仿真结果表明,该算法可以使队列长度快速收敛到设定值,同时维持较小的队列振荡,优于传统的滑模控制。     

A connection control strategy for bursty sources in broadband packet networks

This paper proposes an admission strategy for connection-oriented services at the access node of a broadband integrated packet network based on asynchronous transfer mode. Based on an estimate of the probability of cell loss and in the absence of buffering, we determine the number of sources from different classes of bursty traffic which can be accepted. The parameters which are used to describe the traffic sources are average bit rate and peak bit rate. We will evaluate the cell loss estimate for homogeneous and heterogeneous cases. Furthermore, we will examine the variation of this estimate as the average to peak ratio changes. The estimate is an upper bound for the probability of cell loss. Based on this upper bound simple and robust allocation of resources to bursty sources can be developed. The proposed strategy can be implemented using simple computations or via a look-up table to determine admission or denial of an incoming call and therefore allocating the required capacity. The procedure results in efficient use of the bandwidth, ensuring the desired service quality for connection-oriented services and results in proactive control of network congestion.     

IP over WDM网络中能耗自感知的混合疏导专有保护算法

针对绿色生存性IP over WDM网络中资源开销大、网络阻塞率高的问题,提出一种能耗自感知的混合疏导专有保护(HG-PA-DPP)算法。首先在IP层的核心路由器对低粒度业务请求集中疏导;然后通过实时感知WDM层的链路负载和双层器件带来的链路能耗状态定义链路权值,基于分层图在不同波长平面上为各业务请求寻找权值小且链路分离的工作路径和保护路径,同时在业务的中间节点处对不需要光-电-光转换的光路进行光旁路处理;最后,将空闲或保护资源设置为休眠模式以实现节能。仿真结果表明,所提算法在高负载时有着更好的节能效果,且在大网络拓扑下资源开销(RO)为传统算法的76.5%,阻塞率(BP)仅为传统算法的61.1%。     

A dynamic cross-layer data queue management approach based on priority for delay-tolerant mobile sensor networks

This paper presents a Dynamic Cross-layer Data Queue Management approach (DC-DQM) based on priority to address the priority deviation problem in Delay-Tolerant Mobile Sensor Networks (DT-MSNs). Receiver-driven data delivery scheme is used for fast response to data transfers, and a priority based interaction model is adopted to identify the data priority. Three interactive parameters are introduced to prioritize and dynamically manage data queue. The experimental results show that it can ameliorate data delivery ratio and achieve good performance in terms of average delay.     

MST-based clustering topology control algorithm for wireless sensor networks

In this paper, we propose a novel clustering topology control algorithm named Minimum Spanning Tree (MST)-based Clustering Topology Control (MCTC) for Wireless Sensor Networks (WSNs), which uses a hybrid approach to adjust sensor nodes’ transmission power in two-tiered hierarchical WSNs. MCTC algorithm employs a one-hop Maximum Energy &; Minimum Distance (MEMD) clustering algorithm to decide clustering status. Each cluster exchanges information between its own Cluster Members (CMs) locally and then deliveries information to the Cluster Head (CH). Moreover, CHs exchange information between CH and CH and afterwards transmits aggregated information to the base station finally. The intra-cluster topology control scheme uses MST to decide CMs’ transmission radius, similarly, the inter-cluster topology control scheme applies MST to decide CHs’ transmission radius. Since the intra-cluster topology control is a full distributed approach and the inter-cluster topology control is a pure centralized approach performed by the base station, therefore, MCTC algorithm belongs to one kind of hybrid clustering topology control algorithms and can obtain scalability topology and strong connectivity guarantees simultaneously. As a result, the network topology will be reduced by MCTC algorithm so that network energy efficiency will be improved. The simulation results verify that MCTC outperforms traditional topology control schemes such as LMST, DRNG and MEMD at the aspects of average node’s degree, average node’s power radius and network lifetime, respectively.     

A method for congestion control in atm networks using peak rate throttling

This paper presents a technique, called peak rate throttling, for congestion control of controllable, variable bit rate traffic in ATM (asynchronous transfer mode) networks. It is much less conservative than techniques that have already been proposed. This is because techniques already proposed take no account of the load that is actually being carried by the network. Techniques already proposed assign a predetermined share of network capacity to connections regardless of what is actually being used. The technique proposed here works by throttling the peak bit rate that a user is allowed to send on a connection when the network detects a rising network load that may increase the cell loss rate of connections to greater than an acceptable limit. Users are still permitted to send whatever average bit rate they require, however. The technique relies on the assumption that the load offered to network links is stationary for a long enough period so that controlling action does not need to be performed too often or too quickly. It is feasible to achieve congestion control of a network using peak bit rate throttling alone and no other technique apart from connection control.     

Spectrum handoff in cognitive radio with fuzzy logic control

The secondary usage of spectrum has been investigated in Cognitive Radio (CR) network to resolving the spectrum scarcity issue in wireless communication. When Primary Users (PU) who own the spectrum appear, spectrum handoff is needed to maintain the communications of Secondary Users. But the decision making of spectrum handoff is a challenge issue for CR network, because the input of decision making, which obtain through spectrum sensing, is heterogeneous and inexact. In this paper we will use fuzzy logic control theory to solve this issue and make use of new information for handoff operation: the probability of PU’s occupancy at a certain channel. Our new algorithm can make more intelligent decision compared to simple traditional spectrum handoff decision making and reduce the probability of spectrum handoff, also the performance of SU’s communication can be enhanced.