Dynamic TCP acknowledgement: penalizing long delays
Susanne Albers, Helge Bals · 2003
We study the problem of acknowledging a sequence of data packets that are sent across a TCP connection. Previous work on the problem has focused mostly on the objective function that minimizes the sum of the number of acknowledgements sent and the delays incurred for all of the packets. Dooly, Goldman and Scott presented a deterministic 2-competitive online algorithm and showed that this is the best competitiveness of a deterministic strategy. Recently Karlin, Kenyon and Randall developed a randomized online algorithm that achieves an optimal competitive ratio of e=(e 1) 1:58.