Dynamic TCP acknowledgment in the LogP model |
| |
Authors: | Jens S Frederiksen Kim S Larsen John Noga Patchrawat Uthaisombut |
| |
Institution: | a Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark;b Department of Computer Science, California State University, Northridge, CA 91330, USA;c Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA |
| |
Abstract: | 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. |
| |
Keywords: | Dynamic TCP acknowledgment Packet bundling On-line algorithms Competitive ratio Flow-time Deterministic Randomized |
本文献已被 ScienceDirect 等数据库收录! |
|