从TCP缓冲区动力学识别几乎排序排列
Identifying almost sorted permutations from TCP buffer dynamics
摘要：
将每个整数序列$A$（旨在表示分组ID）与相同长度的正整数序列${\mathcal M}(A)$相关联。${\mathcal M}(A)$的第$i$个条目是保持乱序分组所需的最小缓冲器的大小（在时间$i$），其中空间也考虑未接收的分组。如果是${\mathcal M}(A)={\mathcal M}(B)$，则调用两个序列$A$、$B$ { \em等价物}（书写为$A\equiv_{FB} B$）。我们证明了以下结果：与$SUS(A)$、$SUS(B)\leq 3$具有相同长度的任何两个排列$A,B$（其中SUS是{ \em向上混洗序列}重新排序度量），并且使得$A\equiv_{FB} B$相同。结果（如果我们将上限3替换为4，则该结果不再有效）是由RESTORED驱动的，RESTORED是我们之前介绍过的面向接收者的网络流量模型。
英文摘要：
Associate to each sequence $A$ of integers (intending to represent packet IDs) a sequence of positive integers of the same length ${\mathcal M}(A)$. The $i$'th entry of ${\mathcal M}(A)$ is the size (at time $i$) of the smallest buffer needed to hold out-of-order packets, where space is accounted for unreceived packets as well. Call two sequences $A$, $B$ {\em equivalent} (written $A\equiv_{FB} B$) if ${\mathcal M}(A)={\mathcal M}(B)$. We prove the following result: any two permutations $A,B$ of the same length with $SUS(A)$, $SUS(B)\leq 3$ (where SUS is the {\em shuffled-up-sequences} reordering measure), and such that $A\equiv_{FB} B$ are identical. The result (which is no longer valid if we replace the upper bound 3 by 4) was motivated by RESTORED, a receiver-oriented model of network traffic we have previously introduced.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
