Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Simulation-based comparisons of Tahoe, Reno and SACK TCP
ACM SIGCOMM Computer Communication Review
Forward acknowledgement: refining TCP congestion control
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Modeling the performance of HTTP over several transport protocols
IEEE/ACM Transactions on Networking (TON)
Comparative performance analysis of versions of TCP in a local network with a lossy link
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
Understanding TCP Vegas: a duality model
Journal of the ACM (JACM)
An integrated model for the latency and steady-state throughput of TCP connections
Performance Evaluation
TCP-PR: TCP for Persistent Packet Reordering
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Performance Evaluation - Special issue: Distributed systems performance
On the predictability of large transfer TCP throughput
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A queueing network model of TCP performance
SAICSIT '05 Proceedings of the 2005 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
A new TCP for persistent packet reordering
IEEE/ACM Transactions on Networking (TON)
An analytical model of fast retransmission and recovery in TCP-SACK
Performance Evaluation
Beyond fluid models: modelling TCP mice in IP networks under non-stationary random traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking
Machine-learnt versus analytical models of TCP throughput
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the predictability of large transfer TCP throughput
Computer Networks: The International Journal of Computer and Telecommunications Networking
Interleaved Traffic Splitting: A promising technique to solve False Timeout
Computer Communications
Analytical Model of TCP NewReno through a CTMC
EPEW '09 Proceedings of the 6th European Performance Engineering Workshop on Computer Performance Engineering
Generalized stochastic performance models for loss-based congestion control
Computer Communications
Unfairness in TCP performance over lossy optical burst-switched (OBS) networks
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
An analytic throughput model for TCP NewReno
IEEE/ACM Transactions on Networking (TON)
On the accuracy of analytical models of TCP throughput
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Analytical modeling of TCP flow in wireless LANs
Mathematical and Computer Modelling: An International Journal
Performance analysis and improvement of PR-SCTP for small messages
Computer Networks: The International Journal of Computer and Telecommunications Networking
On Detecting Spectrum Opportunities for Cognitive Vehicular Networks in the TV White Space
Journal of Signal Processing Systems
Hi-index | 0.00 |
Continuing the process of improvements made to TCP through the addition of new algorithms in Tahoe and Reno, TCP SACK aims to provide robustness to TCP in the presence of multiple losses from the same window. In this paper we present analytic models to estimate the latency and steady-state throughput of TCP Tahoe, Reno, and SACK and validate our models using both simulations and TCP traces collected from the Internet. In addition to being the first models for the latency of finite Tahoe and SACK flows, our model for the latency of TCP Reno gives a more accurate estimation of the transfer times than existing models. The improved accuracy is partly due to a more accurate modeling of the timeouts, evolution of cwnd during slow start and the delayed ACK timer. Our models also show that, under the losses introduced by the droptail queues which dominate most routers in the Internet, current implementations of SACK can fail to provide adequate protection against timeouts and a loss of roughly more than half the packets in a round will lead to timeouts. We also show that with independent losses SACK performs better than Tahoe and Reno and, as losses become correlated, Tahoe can outperform both Reno and SACK.