article

Free access

TCP congestion control with a misbehaving receiver

Authors:

David Wetherall, and

Tom AndersonAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 29, Issue 5

Pages 71 - 78

https://doi.org/10.1145/505696.505704

Published: 05 October 1999 Publication History

Abstract

In this paper, we explore the operation of TCP congestion control when the receiver can misbehave, as might occur with a greedy Web client. We first demonstrate that there are simple attacks that allow a misbehaving receiver to drive a standard TCP sender arbitrarily fast, without losing end-to-end reliability. These attacks are widely applicable because they stem from the sender behavior specified in RFC 2581 rather than implementation bugs. We then show that it is possible to modify TCP to eliminate this undesirable behavior entirely, without requiring assumptions of any kind about receiver behavior. This is a strong result: with our solution a receiver can only reduce the data transfer rate by misbehaving, thereby eliminating the incentive to do so.

References

[1]

{All98} Mark Allman. On the generation and use of TCP acknowledgments. Computer Communications Review, 28(5), October 1998.]]

Digital Library

[2]

{All99} Mark Allman. TCP byte counting refinements. Computer Communications Review, 29(3), July 1999.]]

Digital Library

[3]

{AN96} Martin Abadi and Roger Needham. Prudent engineering practice for cryptographic protocols. IEEE Transactions on Software Engineering, 22(1), January 1996.]]

Digital Library

[4]

{APS99} M. Allman, V. Paxson, and W. Stevens. TCP congestion control. RFC 2581, April 1999.]]

[5]

{FF99} Sally Floyd and Kevin Fall. Promoting the use of end-to-end congestion control in the Internet. IEEE/ACM Transactions on Networking, August 1999.]]

Digital Library

[6]

{FGM+99} R. Fielding, J. Gettys, J. Mogul, H. Frystyk, L. Masinter, P. Leach, and T. Berners-Lee. Hypertext Transfer Protocol --- HTTP/1.1. RFC 2616, June 1999.]]

Digital Library

[7]

{Flo95} Sally Floyd. TCP and successive fast retransmits, http://www.aciri.org/floyd/papers/fastretrans.ps, May1995.]]

[8]

{FMM+99} Sally Floyd, Jamshid Mahdavi, Matt Mathis, Matthew Podolsky, and Allyn Romanow. An extension to the selective acknowledgment (SACK) option for TCP. Internet Draft, August 1999.]]

[9]

{Jac88} Van Jacobson. Congestion avoidance and control. SIGCOMM '88, August 1988.]]

Digital Library

[10]

{JBB92} V. Jacobson, R. Braden, and D. Borman. TCP extensions for high performance. RFC 1323, May 1992.]]

Digital Library

[11]

{KA98} S. Kent and R. Atkinson. Security architecture for the internet protocol. RFC 2401, November 1998.]]

Digital Library

[12]

{MMFR96} Matt Mathis, Jamshid Mahdavi, Sally Floyd, and Allyn Romanow. TCP Selective Acknowledgement options. RFC 2018, April 1996.]]

Digital Library

[13]

{PAD+99} V. Paxson, M. Allman, S. Dawson, W. Fenner, J. Griner, I. Heavens, K. Lahey, J. Semke, and B. Volz. Known TCP implementation problems. RFC 2525, March 1999.]]

Digital Library

[14]

{RHE99} Reza Rejaie, Mark Handley, and Deborah Estrin. RAP: An end-to-end rate-based congestion control mechanism for realtime streams in the Internet, In INFOCOM '99, March 1999.]]

[15]

{Sch96} Bruce Schneier. Applied Cryptography. John Wiley & Sons, 2nd edition, 1996.]]

[16]

{She94} Scott Shenker. Making greed work in networks: A game-theoretic analysis of switch service disciplines. In SIGCOMM '94, pages 47-57, August 1994.]]

Digital Library

[17]

{Ste94} W. Richard Stevens. TCP/IP Illustrated, volume 1. Addison Wesley, 1994.]]

[18]

{Vas} Fyodor Vaskovich. nmap. http://www.insecure.org/nmap/.]]

[19]

{VRC98} L. Vivisano, L. Rizzo, and J. Crowcroft. TCP-like congestion control for layered multicast data transfer. In INFOCOM '98, April 1998.]]

[20]

{ZDE+93} L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala. RSVP: A New Resource ReSerVation Protocol. IEEE Network, pages 8-18, September 1993.]]

Digital Library

Cited By

Huang LShi HZhang WYu K(2023)Block Transmission Scheduling Strategy Based on Deadline Priority2023 International Conference on Networking and Network Applications (NaNA)10.1109/NaNA60121.2023.00025(104-109)Online publication date: Aug-2023
https://doi.org/10.1109/NaNA60121.2023.00025
Sengupta SKim HRexford JKuipers FOrda A(2022)Continuous in-network round-trip time monitoringProceedings of the ACM SIGCOMM 2022 Conference10.1145/3544216.3544222(473-485)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1145/3544216.3544222
Gomez JKfoury ECrichigno JSrivastava G(2022)A survey on TCP enhancements using P4-programmable devicesComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2022.109030212:COnline publication date: 27-Jun-2022
https://dl.acm.org/doi/10.1016/j.comnet.2022.109030
Show More Cited By

Index Terms

TCP congestion control with a misbehaving receiver
1. Networks
  1. Network protocols

Index terms have been assigned to the content through auto-classification.

Recommendations

Protecting TCP from a misbehaving receiver

This study presents the design and implementation of a robust TCP congestion control algorithm. TCP was originally designed for cooperative environments, and its evolution over the years has been built on the same basis. TCP expects the end hosts to ...
Read More
Receiver-centric congestion control with a misbehaving receiver: Vulnerabilities and end-point solutions

Receiver-driven TCP protocols delegate key congestion control functions to receivers. Their goal is to exploit information available only at receivers in order to improve latency and throughput in diverse scenarios ranging from wireless access links to ...
Read More
Performance evaluation of Westwood+ TCP congestion control
Internet performance symposium (IPS 2002)

Westwood+ TCP is a sender-side only modification of the classic Tahoe/Reno TCP that has been recently proposed to improve fairness and efficiency of TCP. The key idea of Westwood+ TCP is to perform an end-to-end estimate of the bandwidth available for a ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 29, Issue 5

October 1999

73 pages

ISSN:0146-4833

DOI:10.1145/505696

Issue’s Table of Contents

Copyright © 1999 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 October 1999

Published in SIGCOMM-CCR Volume 29, Issue 5

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

124
Total Citations
View Citations
2,371
Total Downloads

Downloads (Last 12 months)138
Downloads (Last 6 weeks)9

Other Metrics

View Author Metrics

Citations

Cited By

Huang LShi HZhang WYu K(2023)Block Transmission Scheduling Strategy Based on Deadline Priority2023 International Conference on Networking and Network Applications (NaNA)10.1109/NaNA60121.2023.00025(104-109)Online publication date: Aug-2023
https://doi.org/10.1109/NaNA60121.2023.00025
Sengupta SKim HRexford JKuipers FOrda A(2022)Continuous in-network round-trip time monitoringProceedings of the ACM SIGCOMM 2022 Conference10.1145/3544216.3544222(473-485)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1145/3544216.3544222
Gomez JKfoury ECrichigno JSrivastava G(2022)A survey on TCP enhancements using P4-programmable devicesComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2022.109030212:COnline publication date: 27-Jun-2022
https://dl.acm.org/doi/10.1016/j.comnet.2022.109030
Laraba AFrançois JChowdhury SChrisment IBoutaba R(2021)Mitigating TCP Protocol Misuse With Programmable Data PlanesIEEE Transactions on Network and Service Management10.1109/TNSM.2021.305452818:1(760-774)Online publication date: 1-Mar-2021
https://dl.acm.org/doi/10.1109/TNSM.2021.3054528
Abdelmoniem ABensaou B(2021)T-RACKs: A Faster Recovery Mechanism for TCP in Data Center NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2021.305991329:3(1074-1087)Online publication date: Jun-2021
https://doi.org/10.1109/TNET.2021.3059913
Kasoro NKasereka SAlpha GKyamakya K(2021)ABCSS: A novel approach for increasing the TCP congestion window in a networkProcedia Computer Science10.1016/j.procs.2021.07.075191(437-444)Online publication date: 2021
https://doi.org/10.1016/j.procs.2021.07.075
Kumar VDas D(2021)Data sequence signal manipulation in multipath TCP (MPTCP): The vulnerability, attack and its detectionComputers & Security10.1016/j.cose.2021.102180103(102180)Online publication date: Apr-2021
https://doi.org/10.1016/j.cose.2021.102180
Chen SJero SJagielski MBoldyreva ANita-Rotaru C(2021)Secure Communication Channel Establishment: TLS 1.3 (over TCP Fast Open) versus QUICJournal of Cryptology10.1007/s00145-021-09389-w34:3Online publication date: 24-May-2021
https://doi.org/10.1007/s00145-021-09389-w
Medlej ABeydoun KDedu EDhoutaut D(2020)Scaling up Routing in Nanonetworks with Asynchronous Node Sleeping2020 International Conference on Software, Telecommunications and Computer Networks (SoftCOM)10.23919/SoftCOM50211.2020.9238149(1-6)Online publication date: 17-Sep-2020
https://doi.org/10.23919/SoftCOM50211.2020.9238149
Duggempudi SAnil Kumar VSethumadhavan M(2020)Acknowledgement Spoofing at Kernel Level and TCP Sender Behaviour AnalysisSoft Computing and Signal Processing10.1007/978-981-15-2475-2_62(673-681)Online publication date: 14-Mar-2020
https://doi.org/10.1007/978-981-15-2475-2_62
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents