基于时序推断的拥塞控制策略的性能分析

通过对TD、RED等算法进行较精确的Markov建模,以理论分析和数值模拟的方法对各种拥塞控制策略的性能进行深入的研究和比较,并着重从时间序列的角度分析平均队列长度计算方法的数学过程和理论依据,进而提出基于时序预测推断的平均队列长度的计算方法,给出相应的数学模型和数值模拟性能曲线,结果证明:新的算法在系统稳定性和资源利用率上表现出明显的优越性,其走势更加接近理想的性能曲线.最后考察了各算法结合优先级丢弃策略的性能表现.

Analysis on Congestion Control Strategy Based on Time Series Deduction

Congestion control is one of key technologies in high-speed networks. Through building accurate Markov chain network models for TD and RED arithmetics, the performances of various congestion control strategies are deeply studied and compared by theoretical analysis and numerical simulation. In particular the mathematics process and theoretic source of average queue size are analyzed from time series measures. Then a new calculating formula based on time series deduction and its network model are given. The results show that new arithmetic brings obvious advantages on reliability and resource utilization. Its trend is more close to ideal value curve. At last the performances of arithmetics with various priorities discarding strategy are reviewed.