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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Allman et al., “ Ongoing TCP Research Related to Satellites”, Internet Draft, work in progress, Sep 1999. 80, 81
E. Altman et al., “Performance Modeling of TCP/IP in a Wide-Area Network”, IEEE Conference on Decision and Control, Dec 1995. 81
H. Balakrishnan, V. Padmanabhan, and R. Katz, “The Effects of Asymmetry on TCP Performance”, ACM MOBICOM, Sep 1997. 80, 81, 87
C. Barakat and E. Altman, “Performance of Short TCP Transfers”, Networking 2000 (Performance of Communications Networks), May 2000. 81, 83
C. Barakat, E. Altman, and W. Dabbous, “On TCP Performance in a Heterogeneous Network: A Survey”, IEEE Communications Magazine, Jan 2000. 80,82
Neal Cardwell, Stefan Savage, and Tom Anderson, “Modeling TCP Latency”, IEEE INFOCOM, Mar 2000. 82
D. Clark and W. Fang, “Explicit Allocation of Best Effort Packet Delivery Service”, IEEE/ACM Transactions on Networking, Aug. 1998. 87
R. Durst, G. Miller, and E. Travis, “TCP Extensions for Space Communications”, ACM MOBICOM, Nov 1996. 80, 81
K. Fall and S. Floyd, “Simulation-based Comparisons of Tahoe, Reno, and SACK TCP”, ACM Computer Communication Review, Jul 1996. 80
V. Jacobson, “Congestion avoidance and control”, ACM SIGCOMM, Aug 1988. 80, 83
V. Jacobson, “Compressing TCP/IP Headers for Low-speed Serial Links”, RFC 1144, Feb 1990. 81
T. V. Lakshman and U. Madhow, “The performance of TCP/IP for networks with high bandwidth-delay products and random loss”, IEEE/ACM Transactions on Networking, Jun 1997. 81
T. V. Lakshman, U. Madhow, and B. Suter, “Window-based error recovery and flow control with a slow acknowledgment channel: a study of TCP/IP performance”, IEEE INFOCOM, 1997. 80
The LBNL Network Simulator, ns, http://www-nrg.ee.lbl.gov/ns. 85
W. Stevens, “TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms”, RFC 2001, 1997. 80, 83
B. Suter, T. V. Lakshman, D. Stiliadis, and A. K. Choudhary, “Design Considerations for Supporting TCP with Per-flow Queueing”, IEEE INFOCOM, Mar 1998. 91
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barakat, C., Altman, E. (2000). On ACK Filtering on a Slow Reverse Channel. In: Crowcroft, J., Roberts, J., Smirnov, M.I. (eds) Quality of Future Internet Services. QofIS 2000. Lecture Notes in Computer Science, vol 1922. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39939-9_7
Download citation
DOI: https://doi.org/10.1007/3-540-39939-9_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41076-8
Online ISBN: 978-3-540-39939-1
eBook Packages: Springer Book Archive