.png){kind=icon}
返回
An average queue-length-difference-based congestion detection algorithm in TCP/AQM network
.png){kind=icon}
PRE
AI
DOI：10.1002/acs.2863.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Congestion detection in transmission control protocol/active queue management networks remains a challenging problem in which the choosing of congestion signal is one of the most important factors. Exponentially weighted moving average of queue length, the most widely used congestion signal, is facing difficulties in detecting incipient congestion and quantifying the optimal forgetting factor. Aiming at these 2 disadvantages, we propose an average queue-length-difference-based congestion detection algorithm where exponentially weighted moving average of queue-length difference is chosen as the congestion signal with the theoretical optimal forgetting factor deduced. First, by defining the queue-length difference as the state, the corresponding state equation is derived from the fluid model. Second, we prove that the inflow traffic in state equation is a discrete-time martingale, which can be transformed to a Wiener process according to the martingale representation theorem. Noticing that the observation of state will be coupled with noise because of the unstable transmission, the state estimation is then derived with the application of recursive least squares filter. The filter gain of state estimation, which is a function of the noise-signal ratio, corresponds to the optimal forgetting factor in average queue-length-difference-based congestion detection algorithm. Simulation results in NS-3 and MATLAB illustrate the effectiveness of the proposed algorithm.
Keyword:
average queue-length difference
congestion detection
discrete-time martingale
optimal forgetting factor
recursive least squares
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
2.6K
被引数:
3.6K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容