On packet selection criteria for clock recovery
On packet selection criteria for clock recovery
复制标题
时钟恢复的数据包选择标准
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
D. Morgan
中科院分区：
文献类型：
--
作者：
I. Hadžić;D. Morgan
许多基于分组的时钟恢复算法仅使用定时分组到达的子集来训练本地振荡器。一种常用的选择过程是将时间划分为不重叠的窗口，并且对于每个窗口，仅选择具有最小网络传输时间的窗口。这个过程是一个非线性过滤器，主要是基于直觉开发的，并被许多研究人员和开发人员广泛接受，而没有太多的正式分析。在本文中，我们分析了这样的过滤器的输出统计数据，提供了一个封闭的形式表达一些常见的数据包延迟配置文件，并与实验数据的结果。我们还指出了一些网络场景中使用的过滤器是不合理的。
Many packet-based clock recovery algorithms use only a subset of timing packet arrivals to discipline the local oscillator. One commonly used selection process is to partition the time into non-overlapping windows and, for each window, select only the one that had the smallest network transit time. This process is a non-linear filter, developed mostly based on intuition and widely accepted by many researchers and developers without much formal analysis. In this paper, we analyze the output statistics of such a filter, provide a closed-form expression for some commonly observed packet delay profiles, and back the results with experimental data. We also point out some network scenarios where usage of the filter is not well justified.