A faster off-line algorithm for the TCP acknowledgement problem

Authors:
John Noga;Steve Seiden;Gerhard J. Woeginger
Affiliations:
Institut für Mathematik, Technische Universität Graz, Steyrergasse 30, A-8010 Graz, Austria;Department of Computer Science, 298 Coates Hall, Louisiana State University, Baton Rouge, LA;Institut für Mathematik, Technische Universität Graz, Steyrergasse 30, A-8010 Graz, Austria
Venue:
Information Processing Letters
Year:
2002

Citing 3
Cited 5

The concave least-weight subsequence problem revisited

Journal of Algorithms
Sequence comparison with mixed convex and concave costs

Journal of Algorithms
TCP dynamic acknowledgment delay (extended abstract): theory and practice

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Dynamic TCP acknowledgement: penalizing long delays

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic TCP acknowledgment in the LogP model

Journal of Algorithms
Dynamic TCP acknowledgment with sliding window

Theoretical Computer Science
On time lookahead algorithms for the online data acknowledgement problem

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Dynamic tcp acknowledgment with sliding window

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.89

Visualization

Abstract

In a recent paper [Proceedings of STOC'98, 1998, pp. 389-398], Dooly, Goldman and Scott study a problem that is motivated by the networking problem of dynamically adjusting delays of acknowledgements in the Transmission Control Protocol (TCP). Among other results, they give an O(n2) off-line algorithm for computing the optimal way of acknowledging n packet arrivals and departures.In this brief note, we observe that there is a faster off-line algorithm for this problem with time complexity O(n).