Hierarchical IP flow clustering

Kamal Shadi, Preethi Natarajan, Constantine Dovrolis
Abstract

The analysis of flow traces can help to understand a network’s usage patterns.
We present a hierarchical clustering algorithm for network flow data that can summarize terabytes of IP traffic  into a parsimonious tree model.  The method automatically finds an appropriate scale of aggregation so  that each cluster represents a local maximum of the traffic density from a block of source addresses
to a block of destination addresses. We apply this clustering method on NetFlow data from an enterprise network, find the largest traffic clusters,  and analyze their stationarity across time. The existence of heavy-volume clusters that persist over long time scales can help network operators to perform usage-based accounting, capacity provisioning and traffic engineering. Also, changes in the layout of hierarchical clusters can facilitate the detection of anomalies and significant changes in the network workload.

Download the full article DOI: 10.1145/3155055.3155063

Leave a Reply