Master’s Thesis Presentation • Cryptography, Security, and Privacy (CrySP) • Decentralized Traffic Correlation Using Programmable Switches

Friday, March 13, 2026 2:00 pm - 3:00 pm EDT (GMT -04:00)

Please note: This master’s thesis presentation will take place online.

Gurjot Singh, Master’s candidate
David. R. Cheriton School of Computer Science

Supervisor: Professor Diogo Barradas

Attributing network attacks to their sources is challenging as adversaries employ proxy chains, virtual private networks, and anonymity infrastructures to obscure their origins. Traffic correlation techniques mitigate this challenge by linking flows observed at multiple network vantage points using invariant characteristics such as timing and packet volume. However, existing attack attribution systems largely rely on centralized architectures that aggregate flow features at dedicated correlators, introducing computational and communication overheads that hinder scalability in high-speed networks.

This thesis discusses RevealNet, a decentralized framework for attack attribution that leverages P4-programmable switches to perform traffic correlation directly within the network fabric. RevealNet distributes feature extraction and correlation across cooperating networks, reducing dependence on centralized processing and minimizing telemetry offloading. Upon detection of a malicious flow, flow features are disseminated to participating switches, which locally correlate them against outgoing traffic using lightweight similarity metrics. To operate within the constraints of programmable data planes, RevealNet employs compact flow feature representations based on traffic aggregation matrices and sketching techniques designed for integer-only computation. The framework further incorporates heuristic optimizations that exploit temporal alignment and traffic-volume similarity to reduce correlation complexity and limit false positives.

Experimental evaluation conducted over a prototype of our framework using multiple real-world attack datasets demonstrates that RevealNet achieves attack attribution accuracy comparable to state-of-the-art centralized systems while significantly improving scalability. Notably, compact flow feature representations achieve accuracy comparable to complete flow representations, substantially reducing memory requirements without sacrificing attribution performance. Overall, RevealNet’s distributed design reduces bandwidth overhead by up to 96% when deployed on a testbed consisting of 20 P4-enabled switches and enables programmable switches to correlate a significantly larger number of flows concurrently, demonstrating that attack attribution can be effectively decentralized within programmable network infrastructures.


Attend this master’s thesis presentation virtually on MS Teams.