Analyzing Packet Interarrival Times Distribution to Detect Network Bottlenecks
Analyzing Packet Interarrival Times Distribution to Detect Network Bottlenecks
复制标题
分析数据包到达间隔时间分布以检测网络瓶颈
DOI：
--
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
P. Varga
中科院分区：
文献类型：
--
作者：
P. Varga
本文分析了包含瓶颈的网段的数据包到达间隔时间（PIT）分布函数的性质。为了显示瓶颈行为与数据包到达间隔时间分布之间的相关性，通过包括越来越紧的瓶颈连接在内的模拟来观察概率分布函数（PDF）的变化。通过被动监控进行网络瓶颈检测的过程需要有效的指标来区分严重拥塞的链路与正常或未充分利用的连接。本文评估了 PIT 分布的第三和第四中心矩（分别是偏度和峰度），作为瓶颈检测的可能指标。仿真结果以及实际测量数据分析表明，PIT 峰度可以成为瓶颈行为的有力度量。
This paper analyzes the properties of packet interarrival time (PIT) distribution functions of network segments including bottlenecks. In order to show the correlation between bottleneck behavior and packet interarrival time distribution, the alteration of probability distribution function (PDF) is observed through simulations including tighter and tighter bottleneck connections. The process of network bottleneck detection by passive monitoring requires effective metrics for distinguishing seriously congested links from normal or underutilized connections. The paper evaluates the third and fourth central moments (skewness and kurtosis, respectively) of PIT distribution as possible metrics for bottleneck detection. Simulation results as well as real measurement data analysis showed that PIT kurtosis can be a powerful measure of bottleneck behavior.