On ACK Filtering on a Slow Reverse Channel

Authors:
Chadi Barakat;Eitan Altman
Affiliations:
-;-
Venue:
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
Year:
2000

Citing 8
Cited 0

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
TCP extensions for space communications

MobiCom '96 Proceedings of the 2nd annual international conference on Mobile computing and networking
The performance of TCP/IP for networks with high bandwidth-delay products and random loss

IEEE/ACM Transactions on Networking (TON)
The effects of asymmetry on TCP performance

MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Explicit allocation of best-effort packet delivery service

IEEE/ACM Transactions on Networking (TON)
Window-Based Error Recovery and Flow Control with a Slow Acknowledgement Channel: A Study of TCP/IP Performance

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
On TCP performance in a heterogeneous network: a survey

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

ACK filtering has been proposed as a technique to alleviate the congestion on the reverse path of a TCP connection. In the literature the case of a one-ACK per connection at a time in the buffer at the input of a slow channel has been studied. In this paper we show that this is too aggressive for short transfers. We study first static filtering where a certain ACK queue length is allowed. We show analytically how this length needs to be chosen. We present then some algorithms that adapt the filtering of ACKs as a function of the slow channel utilization rather than the ACK queue length.