SwitchTree: In-network Computing and Traffic Analyses with Random Forests

Jong-Hyouk Lee (1) , Kamal Singh (2, 3)

1 Sejong University
2 LHC - Laboratoire Hubert Curien
3 UJM - Université Jean Monnet - Saint-Étienne

The success of machine learning in different domains is finding applications in networking. However, this also needs real-time analyses of network data which is challenging. The challenge is caused by the big data size and the need for bandwidth to transfer network data to a central location hosting an analyses server. In order to address this challenge, an in-network computing paradigm is gaining popularity with advances in programmable data plane solutions. In this paper, we perform in-network analysis of the network data by exploiting the power of programmable data plane. We propose SwitchTree which embeds the Random Forest algorithm inside a programmable switch such that Random Forest is configurable and re-configurable at runtime. We show how some flow level stateful features can be estimated, such as the round trip time and bitrate of each flow. We evaluate the performance of SwitchTree using system level experiments and network traces. Results show that SwitchTree is able to detect network attacks at line speed with high accuracy.

Domaines: Intelligence artificielle [cs.AI]; Réseaux et télécommunications [cs.NI]

Jong-Hyouk Lee, Kamal Singh. SwitchTree: In-network Computing and Traffic Analyses with Random Forests. Neural Computing and Applications, inPress. ⟨hal-02968593⟩