TCP - IP White Papers
Dynamic TCP Acknowledgment With Sliding Window
Overview The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the sliding window that restricts the maximum number of packets that the sender can inject into the network without an acknowledgement in TCP protocol. This paper proposes a new problem in which the sliding window is realistically integrated. This paper studies how the ability of on-line algorithms changes, depending on whether the receiver knows the window size. It shows that a deterministic on-line algorithm extended from the optimal on-line algorithm for Dooly's framework achieves the best competitive ratio of 2, if the window size is given.
| Publisher | University of Electro-Communications | File Format | |
|---|---|---|---|
| Date Published | May 2007 | Downloads | 7 |
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 3 out of 4 users found this white paper useful
White Paper RSS
Download
Register
