Noise Can Help: Accurate and Efficient Per-flow Latency Measurement without Packet Probing and Time Stamping Michigan State University SIGMETRICS 14

Problem Statement Per-flow latency – No packet probing – No time stamping

Recording phrase flow ID + random j ∈ [0,m] n time stamp counter vector

Query phrase Input: – m, n – p f: # of packets in flow f – :counter subvector of flow f at X Output: – Estimating latency average – Estimating latency standard deviation

Estimating latency average

Estimating latency standard deviation

Reliability centered parameter selection Input: – M:the total number of bits of the RAM – α: overall required reliability – β: overall required confidence interval –, Output: – m, n – b: size of each counter in bits – T: maximum value of sum of all time stamps

Evaluation Accuracy

Evaluation Storage size

Q&A