期刊文献+

基于最小均方滤波的RTO预测算法 被引量:2

RTO prediction algorithm based on a least mean square filter
原文传递
导出
摘要 传统的传输控制协议(TCP)中的重传超时值(RTO)设置过于保守,且RTO预测算法对于往返时延(RTT)变化的响应过于缓慢,造成长时间的无谓等待,降低了带宽利用率。为了解决这些问题,提出一种基于最小均方(LMS)滤波的预测算法。为了验证新算法的性能,选择了大量有代表性的网址进行试验,对新旧2种算法的预测结果进行比较,并做了性能分析。试验结果证明,所提出的算法相比于原算法,具有能很快达到稳定,稳定后的预测误差小,对RTT变化的响应快等特点,提高了传输性能。 The retransmission timeout (RTO) prediction algorithm that current the transmission control protocol uses is too sluggish to respond to changes in the round-trip time (RTT). Furthermore, the predicted values are usually much larger than real RTTs, leading to reductions in the bandwidth utility ratio. A prediction algorithm based on a least mean squares filter was developed to predict better values. The algorithm performance was evaluated using a variety of typical websites. The results show that the algorithm quickly stabilizes, has a very small prediction error, and quickly responds to RTT changes, so it can improve transmission performance.
出处 《清华大学学报(自然科学版)》 EI CAS CSCD 北大核心 2007年第4期603-605,共3页 Journal of Tsinghua University(Science and Technology)
基金 国家自然科学基金资助项目(60573122) 国家"九七三"重点基础研究项目(2003CB314804)
关键词 往返时延(RTT) 重传超时值(RTO) 最小均方误差(LMS) round-trip time(RTT) retransmission timeout value (RTO) least mean square(LMS)
  • 相关文献

参考文献8

  • 1章淼,吴建平,徐恪.一种改善TCP公平性的算法[J].清华大学学报(自然科学版),2003,43(9):1280-1283. 被引量:3
  • 2林闯等著..计算机网络的服务质量 QoS[M].北京:清华大学出版社,2004:357.
  • 3Stallings W.High-Speed Networks and Internets Performance and Quality of Service[M].Beijing:Publishing House of Electronics Industry,2003. 被引量:1
  • 4ZHANG Lixia.Why TCP timers don't work well[J].ACM SIGCOMM Computer Communication Review,1986,16(3):397-405. 被引量:1
  • 5Allman M,Paxson V,Stevens W.TCP Congestion Control[S].RFC 2581,April 1999. 被引量:1
  • 6Paxson V,Allman M.Computing TCP's Retransmission Timer[S].November 2000,RFC 2988. 被引量:1
  • 7Jacobson V.Congestion avoidance and control[J].ACM Computer Communication Review,1988,18(4):314-329. 被引量:1
  • 8张贤达著..现代信号处理[M].北京:清华大学出版社,2002:528.

二级参考文献8

  • 1Chiu D, Jain R. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks[J]. Computer Networks and ISDN Systems, 1989, 17(1):1-14. 被引量:1
  • 2Floyd S. Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic [J].Computer Communication Review, 1991, 21(5) : 30 - 47. 被引量:1
  • 3Hamann T, Walrand J. A new fair window algorithm for ECN capable TCP (new-ECN) [A]. Sidi M. Proceedings of INFOCOM'2000 [C]. Tel Avlv, Israel: IEEE Communications Society, 2000. 1528 - 1536. 被引量:1
  • 4Demers A, Keshav S, Shenker S. Analysis and simulation of a fair queueing algorithm [J]. Internetworking: Research and Experience, 1990, 1(1): 3-26. 被引量:1
  • 5Lin D, Morris R. Dynamics of random early detection [J].ACM Computer Communication Review, 1997, 27(4): 127-137. 被引量:1
  • 6Padhye J, Firoiu V, Towsley D, et al. Modeling TCP throughput: a simple model and its empirical validation [J].ACM Computer Communication Review, 1998, 211(4) : 303 -314. 被引量:1
  • 7Floyd S, Gummadi R, Shenker S. Adaptive RED: An Algorithm for Increasing the Robustness of RED's Active Queue Management [EB/OL]. http://www. icir.org/floyd/papers/adaptiveRed.pdf, August 2001. 被引量:1
  • 8Floyd S. TCP and explicit congestion notification [J]. ACM Computer Communication Review, 1994, 24(5) : 10 - 23. 被引量:1

共引文献2

同被引文献10

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部