Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
ACM SIGCOMM Computer Communication Review
A new congestion control scheme: slow start and search (Tri-S)
ACM SIGCOMM Computer Communication Review
TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Measurements and analysis of end-to-end Internet dynamics
Measurements and analysis of end-to-end Internet dynamics
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Delay-based congestion avoidance for TCP
IEEE/ACM Transactions on Networking (TON)
Is the Round-trip Time Correlated with the Number of Packets in Flight ?
Is the Round-trip Time Correlated with the Number of Packets in Flight ?
Heterogeneous data networks: congestion or corruption?
Heterogeneous data networks: congestion or corruption?
TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
TCP-Illinois: A loss- and delay-based congestion control algorithm for high-speed networks
Performance Evaluation
Increased DNS forgery resistance through 0x20-bit encoding: security via leet queries
Proceedings of the 15th ACM conference on Computer and communications security
Explicit congestion control based on 1-bit probabilistic marking
Computer Communications
NF-TCP: a network friendly TCP variant for background delay-insensitive applications
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
| Hi-index | 0.00 |
TCP uses packet loss as a feedback from the network to adapt its sending rate. TCP keeps increasing its sending rate as long as no packet loss occurs (unless constrained by buffer size). Alternative congestion avoidance techniques (CATs) have been proposed to avoid such "aggressive" behavior. These CATs use simple statistics on observed round-trip times and/or throughput of a TCP connection in response to variations in congestion window size. These CATs have a supposed ability to detect queue build-up.The objective of this paper is to question the ability of these CATs to reliably detect queue build-up under real network conditions. For this purpose, the sample coefficient of correlation between round-trip time and the number of packets in flight is analyzed for 14,218 connections over 737 Internet paths. These coefficients of correlation were extracted from a set of tcpdump traces collected by Vern Paxson.The coefficients of correlation measured confirm that the correlation between RTT and window size is often weak.