Revealing Hidden Hierarchical Heavy Hitters in network traffic
Salvator Galea, Andrew William Moore, Gianni Antichi, Giuseppe Bianchi, Roberto Bifulco · 2018
The idea to enable advanced in-network monitoring functionality has been lately fostered by the advent of massive data-plane programmability. A specific example includes the detection of traffic aggregates with programmable switches, i.e., heavy hitters. So far, proposed solutions implement the mining process by partitioning the network stream in disjoint windows. This practice allows efficient implementations but comes at a well-known cost: the results are tightly coupled with the traffic and window's characteristics.