Dynamic TCP Acknowledgment in the LogP Model.
Jens S. Frederiksen, Kim S. Larsen, John Noga, and Patchrawat Uthaisombut.
Journal of Algorithms, 48(2): 407-428, 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. Our results are very different from earlier works on the problem where the physical properties of the networks were emphasized less.


publication
Link to the publication at the publisher's site - subscription may be required.
Text required by the publisher (if any): The publication is available from ScienceDirect.

open access (231 KB)
The same as the publisher's version, when the publisher permits. Otherwise, the author's last version before the publisher's copyright; this is often exactly the same, but sometimes fonts, page numbers, figure numbers, etc. are different. It may also be a full version. However, it is safe to read this version, and at the same time cite the official version, as long as references to concrete locations, numbered theorems, etc. inside the article are avoided.

other publications
Other publications by the author.