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

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

On variations of queue response for inputs with the same mean andautocorrelation function

This paper explores the variations in mean queue length for stationary arrival processes with the same mean and autocorrelation functions, or equivalently, the same mean and power spectrum. Three types of processes, namely, two-state Markov-modulated Poisson processes, periodic-sequence modulated Poisson processes and processes generated by randomly filtering a white noise process, are investigated. Results show that the mean queue length can vary substantially for the first type of process, and can vary moderately for the second type of process, as the parameters of the processes are varied, subject to a specified mean and autocorrelation function. However, the mean queue lengths for the third type of arrival processes are determined by the input mean and autocorrelation functions. The results suggest that the queueing performance can be hard to predict from spectral data alone when the power in low frequencies is large     

Adaptive estimation of latency change in evoked potentials bydirect least mean p-norm time-delay estimation

Evoked potentials (EP) have been widely used to quantify neurological system properties. Changes in EP latency may indicate impending neurological injury. Traditional EP analyses are developed under the condition that the background noise in EP analysis are Gaussian distributed. This paper proposes a latency change detection and estimation algorithm under α-stable noise condition, a generalization of Gaussian noise assumption. An analysis shows that the α-stable model fits the noises found in the impact acceleration experiment under study better than the Gaussian model. The robustness of the proposed algorithm is demonstrated through computer simulations and experimental data analysis under both Gaussian and α-stable noise environments     

A duality model of TCP and queue management algorithms

We propose a duality model of end-to-end congestion control and apply it to understanding the equilibrium properties of TCP and active queue management schemes. The basic idea is to regard source rates as primal variables and congestion measures as dual variables, and congestion control as a distributed primal-dual algorithm over the Internet to maximize aggregate utility subject to capacity constraints. The primal iteration is carried out by TCP algorithms such as Reno or Vegas, and the dual iteration is carried out by queue management algorithms such as DropTail, RED or REM. We present these algorithms and their generalizations, derive their utility functions, and study their interaction.     

Frequency-hopped spread-spectrum random access with retransmissioncutoff and code rate adjustment

A transmission policy for frequency-hopped spread-spectrum random-access communication systems in which the retransmission of a blocked packet at each station is determined as a function of that station's own collision experience is examined. For stability considerations and for channel throughput increase, the information packet is encoded by a Reed-Solomon code. An equilibrium analysis is used to show that undesirable bistable behaviour can be avoided if packets are rejected after a certain number of transmission attempts and the code rate is adjusted accordingly. The region of code rate and number of transmission attempt pairs that guarantees the network stability are investigated. The packet rejection probability, average packet delay, and maximum stable throughput are evaluated     

Robustness of real and virtual queue-based active queue management schemes

In this paper, we evaluate the performance of both real and virtual queue-based marking schemes designed for use at routers in the Internet. Using fluid flow models, we show via analysis and simulations that Virtual Queue (VQ)-based marking schemes outperform Real Queue (RQ)-based marking schemes in terms of robustness to disturbances and the ability to maintain low queueing delays. In fact, we prove that a linearized model of RQ-based marking schemes exhibit a lack of robustness to constant but otherwise unknown levels of disturbances. The analytical results we present are applicable to combinations of proportionally fair and TCP-type congestion controllers at the source, and Random Exponential Marking (REM) and Proportional Control (PC) schemes at the router. The behavior of Random Early Discard (RED) and Proportional-Integral (PI) control schemes at the router are also studied via simulations.     

Adaptive downlink scheduling and rate selection: a cross-layer design

In this paper, we discuss a cross-layer design for joint user scheduling and adaptive rate control for downlink wireless transmission. We take a stochastic learning-based approach to achieve this. The scheduling is performed at the medium access control (MAC) layer, whereas the rate selection takes place at the physical/link (PHY/LINK) layer. These two components residing in the two layers exchange information to ensure that user defined rate requests are satisfied by the right combination of transmission schedules and rate selections. The method is highly efficient for low mobility applications with mobile speeds in the order of a few kilometers per hour. While simple to implement, this technique requires no explicit channel estimation phase. The only feedback used are the single bit ACK/NACK signal indicating the correct reception/failure of the packet. As shown in the convergence theorems, the algorithm achieves optimal performance in "stationary" channels. With slowly varying channels, the rate selection algorithm sees a "quasi-stationary" channel and adaptively converges to an optimal solution. Simulations performed using a third-generation wireless system, namely, high-speed downlink packet access (HSDPA) validate the theoretical results.     

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

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

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.     

变速率分组SAMA系统性能研究

以扩频ALOHA(SAMA)多址访问技术为研究对象,研究了变速率方式对分组无线通信系统性能的影响,提出自适应变速率分组算法,提高了系统性能。     

Bayesian prediction for the range with a burr distribution and a random sample size

This paper is concerned with the problem of predicting the future range with the two-parameter Burr distribution, given a sample of a random size and using the Bayesian approach. We consider two possible distributions of the random sample size and the results so obtained have been illustrated numerically, using iterative techniques and computer facilities.     

CA:引导企业安全管理变革

IT业高水平的技术创新不断地为用户带来了新的、更好的产品。但同时,也使IT应用的复杂性进入一个全新层次。冠群电脑(中国)有限公司总经理兼副总裁吴沛殷女士就不止一次表示:在中国,快速发展的信息安全市场和国内企业对IT管理解决方案的需求,对信息安全厂商提出了更高的要求。她分析,由于IT供应商们不需要互相配合,而且他们之间也不经常沟通,因此情况正在越变越复杂。这导致的结果就是:没有哪些产品能够轻松的集成,消费者不得不在众多的平台、应用和标准间挣扎。另外,造成IT环境日益复杂的原因不仅有主要产品的推陈出新,还有每年发布的…     

Mean arrival time and mean pulsewidth of signals propagating through a dispersive and random medium

An electromagnetic pulse propagating through the ionosphere can be modified owing to dispersion as well as random scattering from electron density irregularities. As a result, the pulse arrival time and the pulsewidth are altered. In this paper we show how such quantities can be computed and related to the medium parameters. In this connection the two-frequency mutual intensity function enters in the formulation naturally. The results show that the mean arrival time is dominated by a term which indicates that the pulse is traveling at the group velocity corresponding to the carrier frequency. But there are also small but important corrections resulting from random scattering and higher order dispersion. Our results also show the importance of scattering and dispersion in lengthening the pulse. These results have important implications in satellite based navigational and communication systems.     

Spectral efficiency and cutoff rate of random spreading BICM-based CDMA signals with MMSE multiuser receivers

We analyze the spectral efficiency and cutoff rate of random spreading bit-interleaved coded-modulation based synchronous code-division multiple-access signals with minimum mean-square error multiuser receivers. Both additive white Gaussian noise and frequency nonselective Rayleigh fading channels are considered. The spectral efficiency and cutoff rate are characterized as functions of the system load, modulation schemes, and signal-to-noise ratio.     

变阶自适应滤波器及其算法研究

提出了变阶自适应滤波器和一种变步长变阶自适应LMS算法。通过仿真证明适选取参数，该算法比单一变步长算法要优越，变步长变阶自适应滤波器同时具有变步长定低阶滤波器和变步长定高阶滤波器的优点。     

自适应变异遗传算法及其性能分析

本文提出了一种新的自适应遗传算法,通过对二进制编码串中每一比特位赋予不同的变异概率来加快搜索过程。对几种典型函数的测试结果表明：本文算法的收敛性能优于标准遗传算法。     

Mean residual life and its association with failure rate

The life time distributions having decreasing, increasing, or upside-down bathtub shaped MRL (mean residual life) are used as models in many applications. Mi (1995) has shown that if a component has a bathtub shape failure rate function, then the MRL is unimodal but the converse does not hold. This paper develops sufficient conditions for the unimodal MRL to imply that the failure rate function has a bathtub shape     

Bayesian prediction of the jth order statistic with burr distribution and a random sample size

This work is concerned with the Bayesian prediction problem of the j order statistic when the size of the future sample is a random variable and the samples are drawn from a generalized Burr distribution (GBD). A numerical illustration is also given.     

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.