- Authors:
- J. Padhye,
- V. Firoiu,
- D. Towsley,
- J. Kurose
In this paper we develop a simple analytic characterization of the steady state throughput as a function of loss rate and RTT for a bulk transfer TCP flow, i.e., a flow with an unlimited amount of data to send. Unlike the models in [1,2], our model captures not only the behavior of TCP''s fast retransmit mechanism (which is also considered in [1,2]) but also the effect of TCP''s timeout mechanism on the congestion window. Our measurements suggest that this latter behavior is important from a modeling perspective, as almost all of our TCP traces contained more timeout events than fast retransmit events. Our measurements demonstrate that our model is able to more accurately predict TCP throughput and is accurate over a wider range of loss rates. [1] M. Mathis, J. Semske, J. Mahdavi and T. Ott, The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm, Computer Communication Review, Vol 27, Number 3, July 1997. [2] T. Ott, J. Kemperman and M. Mathis, The Stationary Behavior of Ideal TCP Congestion Avoidance, in preprint. [3] J. Mahdavi and S. Floyd, TCP-Friendly Unicast Rate-Based Flow Control, Note sent to end2end-interest mailing list, January 1997.
Cited By
- Brown L, Ananthanarayanan G, Katz-Bassett E, Krishnamurthy A, Ratnasamy S, Schapira M and Shenker S On the Future of Congestion Control for the Public Internet Proceedings of the 19th ACM Workshop on Hot Topics in Networks, (30-37)
- Zarchy D, Mittal R, Schapira M and Shenker S (2019). Axiomatizing Congestion Control, ACM SIGMETRICS Performance Evaluation Review, 47:1, (51-52), Online publication date: 17-Dec-2019.
- Kaminsky M and Dahlin M (2013). Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, 10.1145/2517349, Online publication date: 3-Nov-2013.
- Tyson G, Mauthe A, Kaune S, Grace P, Taweel A and Plagemann T (2012). Juno, ACM Transactions on Internet Technology, 12:2, (1-28), Online publication date: 1-Dec-2012.
- Oliver I, Miller A and Allison C Virtual worlds, real traffic Proceedings of the first annual ACM SIGMM conference on Multimedia systems, (305-316)
- Madhyastha H, Katz-Bassett E, Anderson T, Krishnamurthy A and Venkataramani A iPlane Nano Proceedings of the 6th USENIX symposium on Networked systems design and implementation, (137-152)
- Moseng T and Kure Ø Evaluation of path dependent scheduling in ad hoc networks Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services, (191-197)
- Biaz S and Vaidya N (2005). "De-randomizing" congestion losses to improve TCP performance over wired-wireless networks, IEEE/ACM Transactions on Networking, 13:3, (596-608), Online publication date: 1-Jun-2005.
- Gao Y, Hou J and Paul S (2003). RACCOOM, IEEE Transactions on Computers, 52:12, (1521-1534), Online publication date: 1-Dec-2003.
- Al-Naamany A and Bourdoucen H Fuzzy-logic-based TCP congestion control system Network control and engineering for Qos, security and mobility II, (180-190)
- Huang L, Horn U, Hartung F and Kampmann M Proxy-based TCP-friendly streaming over mobile networks Proceedings of the 5th ACM international workshop on Wireless mobile multimedia, (17-24)
- Hosein P Capacity model for the CDMA/HDR high-speed wireless data service Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems, (37-44)
- Bakin D, Joa-Ng M and McAuley A Quantifying TCP Performance Improvements in Noisy Environments Using Protocol Boosters Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
- Padhye J, Firoiu V, Towsley D and Kurose J Modeling TCP throughput Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication, (303-314)
- Padhye J, Firoiu V, Towsley D and Kurose J (1998). Modeling TCP throughput, ACM SIGCOMM Computer Communication Review, 28:4, (303-314), Online publication date: 1-Oct-1998.
Recommendations
TCP CERL: congestion control enhancement over wireless networks
In this paper, we propose and verify a modified version of TCP Reno that we call TCP Congestion Control Enhancement for Random Loss (CERL). We compare the performance of TCP CERL, using simulations conducted in ns-2, to the following other TCP variants: ...
TCP Prairie: a sender-only TCP modification based on adaptive bandwidth estimation in wired-wireless networks
This paper presents a new TCP (Transmission Control Protocol) variant called TCP Prairie which is a sender-only TCP modification based on dynamic bandwidth estimation in wired-cum-wireless networks. The key idea here is to continuously measure the ...