Near Optimal Network-wide Per-Flow Measurement

Network-wide flow measurements are a fundamental building block for applications such as identifying attacks, detecting load imbalance, and performing traffic engineering. Due to the rapid line rates, flow measurements use the fast SRAM memory that is too small to monitor all flows. However, the existing methods make sub-optimal memory use or rely on strong assumptions about the traffic. Our work introduces novel cooperative flow monitoring algorithms that achieve near-optimal flow coverage without strong assumptions.