Abstract
Network-wide heavy hitter detection is usually performed by sampling on several network measurement points (NMPs) and merging the measurement results in the centralized controller to get a network-wide view. However, a packet may pass several NMPs and be counted multiple times when measurement results are merged, which causes the double-counting problem and leads to incorrect detection. Existing studies either overlook this problem or require significant memory usage. This paper proposes SAROS, a self-adaptive routing oblivious sampling method for accurate network-wide heavy hitter detection. Specifically, SAROS exploits a sampling mechanism in the data plane, where the sampling threshold on each measurement point is predicted and adaptively set by the control plane. Such guidance from the control plane greatly reduces the memory usage in the data plane, while mitigating the double-counting problem. Experimental results show that, compared with existing solutions, SAROS improves the F1-Score of heavy hitter detection by 10 ∼ 40%.
Funding Information
  • National Key Research and Development Program of China (2022YFB3103000)
  • National Natural Science Foundation of China (Grant No. U20A20180, Grant No. 62072437))

This publication has 23 references indexed in Scilit: