论文信息 - BOTTLENECK-QUEUE BEHAVIOR : How much can TCP know about it ?

BOTTLENECK-QUEUE BEHAVIOR : How much can TCP know about it ?

We start off with an analysis on the effect of queuing delay on throughput. Departing from there, we claim that RTT alone is a better estimator than throughput. We investigate the potential of RTT-based metrics to approach the bottleneck queue behavior from TCP and we characterize the accuracy of our estimation.

[1] Andreas Pitsillides,et al. Congestion Control in Computer Networks , 2007 .

[2] Donald F. Towsley,et al. Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[3] QUTdN QeO,et al. Random early detection gateways for congestion avoidance , 1993, TNET.

[4] Vassilis Tsaoussidis,et al. Beyond AIMD: explicit fair-share calculation , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[5] Vassilis Tsaoussidis,et al. The dynamics of responsiveness and smoothness in heterogeneous networks , 2005, IEEE Journal on Selected Areas in Communications.

[6] Larry L. Peterson,et al. TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[7] Vassilis Tsaoussidis,et al. TCP-Real: receiver-oriented congestion control , 2002, Comput. Networks.

[8] Kai Xu,et al. TCP-Jersey for wireless IP communications , 2004, IEEE Journal on Selected Areas in Communications.

[9] Manish Jain,et al. Ten fallacies and pitfalls on end-to-end available bandwidth estimation , 2004, IMC '04.

[10] Raj Jain,et al. Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[11] Ren Wang,et al. TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks , 2002, Wirel. Networks.