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
Comparative performance analysis of versions of TCP in a local network with a lossy link
IEEE/ACM Transactions on Networking (TON)
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Modeling TCP behavior in a differentiated services network
IEEE/ACM Transactions on Networking (TON)
TCP westwood: end-to-end congestion control for wired/wireless networks
Wireless Networks
Modeling the throughput of TCP Vegas
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Web100: extended TCP instrumentation for research, education and diagnosis
ACM SIGCOMM Computer Communication Review
Analytic models for the latency and steady-state throughput of TCP tahoe, Reno, and SACK
IEEE/ACM Transactions on Networking (TON)
Setting up a Web100-Dummynet testbed for research in transport layer protocols
Proceedings of the 43rd annual Southeast regional conference - Volume 2
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
High Performance TCP/IP Networking
High Performance TCP/IP Networking
Short Survey: A survey of TCP-friendly router-based AQM schemes
Computer Communications
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
This paper presents an analytical model to study the throughput performance of TCP with an Additive Increase Smooth Decrease (AISD) strategy. The new AISD-based TCP protocol produces smooth transfer rates and performs the flow and congestion control functions of TCP. As a result, it is suitable for streaming applications and solves the unfairness problem that occurs when TCP and UDP share the same bottleneck link. The AISD strategy is very simple to implement, only modifies the multiplicative part of the Additive Increase Multiplicative Decrease strategy of TCP, and can be implemented in any TCP version. The smooth part of the strategy is implemented using a low pass filter that considers history in the calculation of the congestion window. The modeling of this new strategy raises new challenges compared to the classical TCP modeling in two ways: first, it needs to be adapted to a more complex dynamism of the congestion window, and second, the model needs to incorporate a scheduler that periodically updates the value of the congestion window. The model is progressively built to finally characterize the steady-state send rate and throughput of a flow as a function of the loss probability, the round-trip time (RTT), the time-out interval, and the scheduler interval. The performance of this AISD-based TCP is compared analytically and experimentally with TCP Reno, and its superior performance is demonstrated.