Hypersparse Network Flow Analysis of Packets with GraphBLAS
Internet analysis is a major challenge due to the volume and rate of network traffic. In lieu of analyzing traffic as raw packets, network analysts often rely on compressed network flows (netflows) that contain the start time, stop time, source, destination, and number of packets in each direction....
Gespeichert in:
Hauptverfasser: | , , , , , , , , , , , , , , , , , , , , , , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Internet analysis is a major challenge due to the volume and rate of network
traffic. In lieu of analyzing traffic as raw packets, network analysts often
rely on compressed network flows (netflows) that contain the start time, stop
time, source, destination, and number of packets in each direction. However,
many traffic analyses benefit from temporal aggregation of multiple
simultaneous netflows, which can be computationally challenging. To alleviate
this concern, a novel netflow compression and resampling method has been
developed leveraging GraphBLAS hyperspace traffic matrices that preserve
anonymization while enabling subrange analysis. Standard multitemporal spatial
analyses are then performed on each subrange to generate detailed statistical
aggregates of the source packets, source fan-out, unique links, destination
fan-in, and destination packets of each subrange which can then be used for
background modeling and anomaly detection. A simple file format based on
GraphBLAS sparse matrices is developed for storing these statistical
aggregates. This method is scale tested on the MIT SuperCloud using a 50
trillion packet netflow corpus from several hundred sites collected over
several months. The resulting compression achieved is significant ( |
---|---|
DOI: | 10.48550/arxiv.2209.05725 |