跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.09575 · v1

An Empirical Evaluation of a Weighted PALU Model for Internet Traffic Networks

首次提交 2026-11-06 23:12
版本更新 2026-11-06 23:12
雷达观测 2026-11-09 13:22
arXiv ↗PDF ↗

摘要

The PALU model is a hybrid power law generative framework that decomposes Internet traffic graphs into three structural components: a preferential attachment core, degree one leaf nodes, and disconnected satellite clusters. Although the original PALU formulation provided a theoretical basis for this decomposition, it was never validated against real traffic data and was restricted to unweighted networks. This work presents the first empirical evaluation of PALU against real Internet traffic, using packet traces from the MAWI WIDE samplepoint F dataset. We introduce a weighted extension of the model incorporating strength degree scaling, and develop a packet-to-graph pipeline for parameter estimation across multiple observation window sizes. Results show that the power law degree exponent $α\approx 2.0$ remains stable across observation scales from $10^5$ to $3 \times 10^6$ packets, consistent with the PALU structural prediction. However, the satellite cluster parameter $λ$ and the weighted scaling parameter $θ$ exhibit systematic dependence on observation scale, and the Poisson star assumption for unattached components is formally rejected at all tested window sizes. These results indicate that PALU captures important aspects of Internet traffic structure but requires an explicit observation model to fully account for finite sampling effects.

作者备注:5 pages, 1 figure, IEEE MIT URTC 2026

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-06 23:12 · 最新观测版本

An Empirical Evaluation of a Weighted PALU Model for Internet Traffic Networks

The PALU model is a hybrid power law generative framework that decomposes Internet traffic graphs into three structural components: a preferential attachment core, degree one leaf nodes, and disconnected satellite clusters. Although the original PALU formulation provided a theoretical basis for this decomposition, it was never validated against real traffic data and was restricted to unweighted networks. This work presents the first empirical evaluation of PALU against real Internet traffic, using packet traces from the MAWI WIDE samplepoint F dataset. We introduce a weighted extension of the model incorporating strength degree scaling, and develop a packet-to-graph pipeline for parameter estimation across multiple observation window sizes. Results show that the power law degree exponent $α\approx 2.0$ remains stable across observation scales from $10^5$ to $3 \times 10^6$ packets, consistent with the PALU structural prediction. However, the satellite cluster parameter $λ$ and the weighted scaling parameter $θ$ exhibit systematic dependence on observation scale, and the Poisson star assumption for unattached components is formally rejected at all tested window sizes. These results indicate that PALU captures important aspects of Internet traffic structure but requires an explicit observation model to fully account for finite sampling effects.

查看此版本解读 →查看此版本原文 ↗