Dynamic TCP acknowledgment in the LogP model

Jens S. Frederiksen, Kim S. Larsen, John Noga, and Patchrawat Uthaisombut. Dynamic TCP acknowledgment in the LogP model. Journal of Algorithms, 48(2):407-428, September 2003.
When messages, which are to be sent point-to-point in a network, become available at irregular intervals, a decision must be made each time a new message becomes available as to whether it should be sent immediately or if it is better to wait for more messages and send them all together. Because of physical properties of the networks, a certain minimum amount of time must elapse in between the transmission of two packets. Thus, whereas waiting delays the transmission of the current data, sending immediately may delay the transmission of the next data to become available even more. We propose a new quality measure and derive optimal deterministic and randomized algorithms for this on-line problem.
Available as ps (294 KB), ps.gz (113 KB), and pdf (188 KB).
Also available at Science Direct.
Errata for this paper are available as ps (85 KB), ps.gz (37 KB), and pdf (47 KB).
Related Papers:

See also other papers by Jens Svalgaard Kohrt.