Deterministic regression methods for unbiased estimation of time-varying autoregressive parameters from noisy observations

A great deal of interest has been paid to autoregressive parameter estimation in the noise-free case or when the observation data are disturbed by random noise. Tracking time-varying autoregressive (TVAR) parameters has been also discussed, but few papers deal with this issue when there is an additive zero-mean white Gaussian measurement noise. In this paper, one considers deterministic regression methods (or evolutive methods) where the TVAR parameters are assumed to be weighted combinations of basis functions. However, the additive white measurement noise leads to a weight-estimation bias when standard least squares methods are used. Therefore, we propose two alternative blind off-line methods that allow both the variance of the additive noise and the weights to be estimated. The first one is based on the errors-in-variable issue whereas the second consists in viewing the estimation issue as a generalized eigenvalue problem. A comparative study with other existing methods confirms the effectiveness of the proposed methods.     

Deterministic access protocols for packet radio networks

In this paper, multiple-phase deterministic protocols for packet radio networks are introduced and analysed. Two modes of information transfer are considered, namely (a) broadcasting and (b) point-to-point transmission. We explore systematic ways of designing multiple-phase protocols and apply them on Manhattan networks. The proposed protocols are studied primarily from the point of view of throughput efficiency. Delay analysis is also presented.     

Topology-assisted deterministic packet marking for IP traceback

A novel deterministic packet marking (DPM) for IP traceback against denial of service (DoS) and distributed denial of service (DDoS) attacks is presented, which features good scalability and high accuracy. In this scheme, an ingress router pre-calculates a Hash of its IP address and splits the Hash into several fragments. When marking a packet, the router randomly selects a fragment to mark into the packet. In the traceback stage the victim identifies the marked router with the help of the map of its upstream routers. Based on the map, the victim can identify a candidate ingress router after receiving only several marked packets. The scheme overcomes defects in previous deterministic packet marking schemes, where too much packets are required to recover a router and high false positive rate occurs in case of large-scale DDoS. Theoretical analysis, the pseudo code and experimental results are provided. The scheme is proved to be accurate and efficient and can handle large-scale DDoS attacks.     

Probabilistic packet marking with non-preemptive compensation

A new scheme in probabilistic packet marking (PPM) for IP traceback against denial-of-service attack is presented. Non-preemptive PPM is performed while a marked packet is coming, but compensates the reduction of marking probability in marked-free packets. The nonpreemptive compensation makes the probability of each marked packet arrived at the victim is equal to its original marking probability. This scheme efficiently improves the convergent amount of marked packets required for reconstructing the complete attack path.     

IP traceback with deterministic packet marking

We propose a new approach for IP traceback which is scalable and simple to implement, and introduces no bandwidth and practically no processing overhead. It is backward compatible with equipment which does not implement it. The approach is capable of tracing back attacks, which are composed of just a few packets. In addition, a service provider can implement this scheme without revealing its internal network topology.     

A taxonomy for congestion control algorithms in packet switchingnetworks

The authors propose a new taxonomy for congestion control algorithms in packet switching computer networks based on control theory. They view a network as a large, distributed control system, in which a congestion control scheme is a (distributed) control policy executable at each node (host or switches) of the network in order to a certain level of stable conditions. This taxonomy provides a coherent framework for the comparative study of existing algorithms and offers clues toward the development of new congestion control strategies     

A low-state packet marking framework for approximate fair bandwidth allocation

Misbehaving, non-congestion-reactive traffic is on the rise in the Internet. One way to control misbehaving traffic is to enforce local fairness among flows. Locally fair policies, such as fair-queueing and other fair AQM schemes, are inadequate to simultaneously control misbehaving traffic and provide high network utilization. We thus need to enforce globally fair bandwidth allocations. However, such schemes have typically been stateful and complex to implement and deploy. In this letter, we present a low state, lightweight scheme based on stateless fair packet marking at network edges followed by RIO queueing at core nodes, to control misbehaving flows with more efficient utilization of network bandwidth. Additionally, with low-state feedback from bottleneck routers, we show that, in practice, we can approximate global max-min fairness within an island of routers. We show, using simulations, that we can indeed control misbehaving flows and provide more globally fair bandwidth allocation.     

An adaptive congestion control scheme for real time packet videotransport

We show that modulating the source rate of a video encoder based on congestion signals from the network has two major benefits: the quality of the video transmission degrades gracefully when the network is congested and the transmission capacity is used efficiently. Source rate modulation techniques have been used in the past in designing fixed rate video encoders used over telephone networks. In such constant bit rate encoders, the source rate modulation is done using feedback information about the occupancy of a local buffer. Thus, the feedback information is available instantaneously to the encoder. In the scheme proposed, the feedback may be delayed by several frames because it comes from an intermediate switching node of a packet switched network. The paper shows the proposed scheme performs quite well despite this delay in feedback. We believe the use of such schemes will simplify the architecture used for supporting real time video services in future nationwide gigabit networks     

DDoS攻击源追踪的一种新包标记方案研究

在对包标记方案的收敛性进行研究的基础上，给出了新的标记概率的选取方法，以得到最优化的收敛性；同时，为了对抗攻击者控制转发节点伪造信息而干扰路径重构算法，提出了一种新的安全的验证包标记方案。最后，对该方案的一些性能进行了仿真验证，结果显示，验证包标记方案的各方面性能均有较大提高。     

Deterministic multiuser carrier-frequency offset estimation for interleaved OFDMA uplink

In orthogonal frequency-division multiple access (OFDMA), closely spaced multiple subcarriers are assigned to different users for parallel signal transmission. An interleaved subcarrier-assignment scheme is preferred because it provides maximum frequency diversity and increases the capacity in frequency-selective fading channels. The subcarriers are overlapping, but orthogonal to each other such that there is no intercarrier interference (ICI). Carrier-frequency offsets (CFOs) between the transmitter and the receiver destroy the orthogonality and introduces ICI, resulting in multiple-access interference. This paper exploits the inner structure of the signals for CFO estimation in the uplink of interleaved OFDMA systems. A new uplink signal model is presented, and an estimation algorithm based on the signal structure is proposed for estimating the CFOs of all users using only one OFDMA block. Diversity schemes are also presented to improve the estimation performance. Simulation results illustrate the high accuracy and efficiency of the proposed algorithm.     

Robust algorithm for estimation of time-varying transfer functions

We introduce a new method to estimate reliable time-varying (TV) transfer functions (TFs) and TV impulse response functions. The method is based on TV autoregressive moving average models in which the TV parameters are accurately obtained using the optimal parameter search method which we have previously developed. The new method is more accurate than the recursive least-squares (RLS), and remains robust even in the case of significant noise contamination. Furthermore, the new method is able to track dynamics that change abruptly, which is certainly a deficiency of the RLS. Application of the new method to renal blood pressure and flow revealed that hypertensive rats undergo more complex and TV autoregulation in maintaining stable blood flow than do normotensive rats. This observation has not been previously revealed using time-invariant TF analyses. The newly developed approach may promote the broader use of TV system identification in studies of physiological systems and makes linear and nonlinear TV modeling possible in certain cases previously thought intractable.     

A control theoretical approach to congestion control in packet networks

In this paper, we introduce a control theoretical analysis of the closed-loop congestion control problem in packet networks. The control theoretical approach is used in a proportional rate controller, where packets are admitted into the network in accordance with network buffer occupancy. A Smith Predictor is used to deal with large propagation delays, common to high speed backbone networks. The analytical approach leads to accurate predictions regarding both transients as well as steady-state behavior of buffers and input rates. Moreover, it exposes tradeoffs regarding buffer dimensioning, packet loss, and throughput.     

Link quality estimation for arbitrary packet sizes over wireless links using packet reception events

The packet error rate of wireless links is known to increase with the length of packets. Yet, packet length is rarely taken into account in protocols and algorithms estimating the packet error rate. Still, it is an important factor that higher layer protocols need to be aware of. In this article, we systematically measure the relationship between packet length and packet error rate over a wide range of wireless links and technologies. On the basis of our measurements, we propose a simple empirical model that can capture this behavior. Using this model, multiple methods are proposed that can estimate the packet error rate for any packet length by sampling the link. We consider methods based on hello packets with controlled packet lengths as well as data packets, where the transmitted packet lengths cannot be controlled. We investigate the accuracy of the different estimation methods in various situations and show how they are able to predict the delivery ratio for different packet sizes.     

一种改进的适用于分组传输的OFDM频偏估计方法

提出了一种改进的基于训练符号的频偏估计方法.该方法通过综合利用训练符号和循环前缀的信息得到时域的细频偏估计,通过峰值检测得到频域的粗频偏估计.仿真结果表明,在多径衰落信道下,在频偏估计范围达到整个信号带宽的同时,本算法的估计精度也有了明显的提高,并且当信噪比达到12dB时,可以使剩余频偏限制在子载波间隔的2％以内.     

基于边界到边界带宽估计的数据包标记器

提出了一种基于带宽估计的标记算法，我们称之为BEBM(baadwidth estimation based marking)。它跟踪网络中可利用带宽的动态变化，对可利用带宽进行估计，并以一种按比例的方式在各个汇聚流之间公平地重新分配网络中的可利用带宽。我们通过仿真试验对算法进行了验证，并与其它几种标记算法进行比较，结果 证实BEBM算法比其它几种算法具有更好的公平性以及更高的链路利用率。     

Comparison of DDE and ETDGE for time-varying delay estimation

The performances of DDE and ETDGE, which are two recently proposed methods for the direct estimation of time delay between signals received at two spatially separated sensors, are compared. Although both algorithms are computationally efficient, it is shown that the ETDGE method generally outperforms the DDE method for tracking nonstationary delays with different source signals     

Minimax lower bound for time-varying frequency estimation ofharmonic signal

Estimation of the instantaneous frequency and its derivatives is considered for a harmonic complex-valued signal with the time-varying phase and time-invariant amplitude. The asymptotic minimax lower bound is derived for the mean squared error of estimation, provided that the phase is an arbitrary m-times piecewise differentiable function of time. It is shown that this lower bound is different only in a constant factor from the upper bound for the mean squared errors of the local polynomial periodogram with the optimal window size. The time-varying phases “worst” for estimation of the instantaneous frequency and its derivatives are obtained as a solution of the minimax problem     

基于粒子滤波的MIMO-OFDM时变信道半盲估计

提出一种基于粒子滤波的MIMO-OFDM时变信道半盲估计方法。首先，对粒子滤波算法进行改进，通过对采样粒子分布进行局部优化调整，提出一种局部优化粒子滤波算法。然后，将该粒子滤波算法用于MIMO-OFDM时变信道估计。由于该信道估计过程在频域进行，因而无需已知（或估计）多径信道长度。与现有时变信道半盲估计方法相比，本方法具有估计误差低、对非高斯噪声顽健性强等特点，从而有效改善了接收端的符号检测性。计算机仿真结果证明了本方法的有效性。     

基于粒子滤波的大气激光OFDM时变信道半盲估计

为了有效改善大气激光正交频分复用通信系统接收端的符号检测性能,采用现有的混合粒子滤波算法对大气激光正交频分复用时变信道进行半盲估计,并进行了理论分析与实验验证.与传统的基于导频的时变信道估计方法相比,该方法可有效改善接收端的符号检测性能,并通过MATLAB仿真结果验证了该方法的有效性.结果表明,在相同的信噪比下,所用方...