TCP congestion control with a misbehaving receiver
- 5 October 1999
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 29 (5), 71-78
- https://doi.org/10.1145/505696.505704
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.Keywords
This publication has 9 references indexed in Scilit:
- TCP byte counting refinementsACM SIGCOMM Computer Communication Review, 1999
- Promoting the use of end-to-end congestion control in the InternetIEEE/ACM Transactions on Networking, 1999
- RAP: An end-to-end rate-based congestion control mechanism for realtime streams in the InternetPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- On the generation and use of TCP acknowledgmentsACM SIGCOMM Computer Communication Review, 1998
- TCP Selective Acknowledgment OptionsPublished by RFC Editor ,1996
- Prudent engineering practice for cryptographic protocolsIEEE Transactions on Software Engineering, 1996
- Making greed work in networksPublished by Association for Computing Machinery (ACM) ,1994
- RSVP: a new resource ReSerVation ProtocolIEEE Network, 1993
- Congestion avoidance and controlPublished by Association for Computing Machinery (ACM) ,1988