Talks.cam will close on 1 July 2026, further information is available on the UIS Help Site
 

University of Cambridge > Talks.cam > Computer Laboratory Systems Research Group Seminar > Fast and Accurate Flow Mining in High-Speed Networks with Sketches

Fast and Accurate Flow Mining in High-Speed Networks with Sketches

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Dr Andrew Moore.

Please note unusual SRG/NETOS time / location.

Traffic measurement is fundamental to network management, supporting key functions such as detecting large flows for improved load balancing, estimating flow sizes for better bandwidth allocation, and identifying suspicious traffic for intrusion prevention. As network traffic continues to grow, measurement systems must provide accurate flow statistics, such as frequency and persistence, at high speed and low latency, while operating efficiently on hardware platforms like programmable switches.

While deterministic approaches offer precision, they are often too slow and memory-intensive for real-time, large-scale deployments. Consequently, approximate methods have emerged as a practical alternative, striking a balance between accuracy and efficiency. In this talk, Weihe presents a series of novel approximate data structures (sketches) that enable fast and accurate flow detection across a variety of tasks in high-speed networks.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2026 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity