[VFM18] Discovering Patterns of Interest in IP Traffic Using Cliques in Bipartite Link Streams

Conférence Internationale avec comité de lecture : International Conference on Complex Networks (CompleNet), March 2018, pp.NA, Boston, USA,

Mots clés: algorithms, cliques, graphs

Résumé: Studying IP traffic is crucial for many applications. We focus here on the detection of (structurally and temporally) dense sequences of interactions, that may indicate botnets or coordinated network scans. More precisely, we model a MAWI capture of IP traffic as a link streams, \ie{} a sequence of interactions $(t_1,t_2,u,v)$ meaning that devices $u$ and $v$ exchanged packets from time $t_1$ to time $t_2$. This traffic is captured on a single router and so has a bipartite structure: links occur only between nodes in two disjoint sets. We design a method for finding interesting bipartite cliques in such link streams, i.e. two sets of nodes and a time interval such that all nodes in the first set are linked to all nodes in the second set throughout the time interval. We then explore the bipartite cliques present in the considered trace. Comparison with the MAWILab classification of anomalous IP addresses shows that the found cliques succeed in detecting anomalous network activity.


@inproceedings {
title="{Discovering Patterns of Interest in IP Traffic Using Cliques in Bipartite Link Streams}",
author=" T. Viard and R. Fournier-S'niehotta and C. Magnien and M. Latapy ",
booktitle="{International Conference on Complex Networks (CompleNet)}",
address="Boston, USA",