TCP - IP White Papers
Combinatorics of TCP Reordering
Overview This paper studies a combinatorial problem motivated by a receiver-oriented model of TCP traffic from, that incorporates information on both arrival times, and the dynamics of packet IDs. It shows that given a buffer sequence B, constructing a sequence A of IDs that belongs to the preimage of B is no harder than finding matchings in bipartite graph, Counting the number of sequences A of packet IDs that belong to the preimage of B can be done in linear time in the special case when there exists a constant upper bound on the maximum entry in B. and This problem also has a fully polynomial randomized approximation scheme when a constant upper bound on the number of repeats in the packet sequences in the preimage.
| Publisher | Pennsylvania State University | File Format | |
|---|---|---|---|
| Date Published | April 2007 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful?
White Paper RSS
Download
Register
