论文部分内容阅读
为了改善Internet中各流量带宽分配的不公平性,提出一种适于缓存管理的非TCP友好流的惩罚算法(NFTFP算法)。通过在缓冲区记录每个连接所占用的带宽,对于非TCP友好流量进行识别和惩罚,从而提高不同数据流享用带宽的公平性。仿真实验表明在标准TCP流量和非TCP友好流共存的环境下,NFTFP算法能提高对非TCP友好流的惩罚力度,在保持较高的链路利用率的同时,获得比RED算法更好的公平性。
In order to improve the unfairness of bandwidth allocation in Internet, a non-TCP friendly stream penalty algorithm (NFTFP algorithm) is proposed for cache management. By recording the bandwidth occupied by each connection in the buffer and identifying and punishing non-TCP-friendly traffic, the fairness of the bandwidth for different data streams can be improved. The simulation results show that the NFTFP algorithm can improve the punishment of non-TCP-friendly flows under the circumstance where both standard TCP traffic and non-TCP-friendly flows coexist. While maintaining high link utilization, the NFTFP algorithm obtains better fairness than the RED algorithm Sex.