Fine-Grained Queue Measurement in the Data Plane研读笔记

文章信息

X. Chen et al., “Fine-Grained Queue Measurement in the Data Plane,” in Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies, Orlando, Florida, Dec. 2019, pp. 15–29

文章内容

问题描述

这篇文章研究的问题是, 当数据包在交换机/路由器中因为排队延迟而经历了拥塞的时候, 判断到底是哪一个数据流导致的网络拥塞. 具体而言, 假设数据包$i$ (其流标识符为$f_i$)到达和离开交换机的时间分别为$a_i$和$d_i$, 且$d_i-a_i\ge \tau$, 则求$\alpha$, 其中
α = ∣ { j ∣ ( a i ≤ d j < d i ) & ( f j = f i ) } ∣ ∣ { j ∣ a i ≤ d j < d i } ∣ \alpha = \frac{|\{j | (a_i \le d_j < d_i)\&(f_j = f_i)\}|}{|\{j | a_i \le d_j < d_i\}|} α=∣{ j∣a