Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Simulation-based comparisons of Tahoe, Reno and SACK TCP
ACM SIGCOMM Computer Communication Review
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
End-to-end Internet packet dynamics
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
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
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A stochastic model of TCP/IP with stationary random losses
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
What TCP/IP protocol headers can tell us about the web
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Variability in TCP round-trip times
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
TransLight: a global-scale LambdaGrid for e-science
Communications of the ACM - Blueprint for the future of high-performance networking
Analytic models for the latency and steady-state throughput of TCP tahoe, Reno, and SACK
IEEE/ACM Transactions on Networking (TON)
STOCHASTIC DIFFERENTIAL EQUATION FOR TCP WINDOW SIZE: ANALYSIS AND EXPERIMENTAL VALIDATION
Probability in the Engineering and Informational Sciences
SRF TCP: a TCP-friendly and fair congestion control method for high-speed networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Hi-index | 0.26 |
In this paper, we propose a generalized framework for modeling the behavior of prominent congestion-control protocols. Specifically, we define a general class of loss-based congestion-control (LB-CC) mechanisms and demonstrate that many variants of TCP, including those being proposed for high-speed networks, belong to this class. Second, we develop a stochastic model to predict the transfer time for bulk transmissions by any protocol belonging to the LB-CC class-our model predicts both the mean as well as the variability in the transfer time. Our model is applicable to a wide set of transfer types and network capacities. We validate our model through extensive simulations under controlled settings, as well as with comprehensive HTTP workloads. We use our empirical analysis to also provide insights into several important issues, including: (i) identifying the settings under which previously-proposed TCP models are accurate, and (ii) identifying the conditions under which only steady-state analysis can be sufficient in modeling transfer performance. Our generalized framework provides a powerful tool that can be used in the design, analysis, and comparison of next-generation transport protocols. We demonstrate this benefit by comparing prominent TCP proposals for high-speed networks.