Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp013j3335631
Title: | SketchProbe: Discovering Vulnerabilities in Sketch-based Applications with Reinforcement Learning |
Authors: | Luo, Wei |
Advisors: | Apostolaki, Maria MA |
Department: | Computer Science |
Class Year: | 2024 |
Publisher: | Princeton, NJ : Princeton University |
Abstract: | Sketches are approximate data structures critical to network traffic monitoring. Theyare specifically designed for environments constrained by memory, enabling the maintenance of accurate statistics within a compact space. This efficiency comes at the cost of estimation error that varies based on the workload encountered by the sketch. Traditionally, sketch-based applications are optimized for average traffic scenarios, and this assumption of standard patterns of network traffic introduces vulnerabilities, as these applications may not be prepared for atypical or adversarial traffic patterns. Manual testing for these vulnerabilities is time-intensive and often impractical due to the vast range of possible traffic scenarios. In this paper, we introduce SketchProbe, a novel system leveraging Reinforcement Learning (RL) to identify adversarial traffic patterns in sketch-based applications. Unlike manual identification, SketchProbe automates the discovery process, ensuring a thorough and efficient exploration of potential failure modes. Our evaluation indicates that SketchProbe effectively identifies critical scenarios that significantly impact the performance of sketch-based applications, which is valuable for improving the robustness of such applications. |
URI: | http://arks.princeton.edu/ark:/88435/dsp013j3335631 |
Type of Material: | Academic dissertations (M.S.E.) |
Language: | en |
Appears in Collections: | Computer Science, 2023 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Luo_princeton_0181G_15041.pdf | 2.62 MB | Adobe PDF | View/Download |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.