selective packet capture at high speed rates
play

Selective Packet Capture at High Speed Rates Reservoir Labs Peter - PowerPoint PPT Presentation

Selective Packet Capture at High Speed Rates Reservoir Labs Peter Cullen, James Ezick, Kelly Fox, Troy Hanson, Richard Lethin, Erik Mogus, Jordi Ros-Giralt, Alison Ryan, {cullen, ezick, fox, hanson, lethin, mogus, giralt, ryan}@reservoir.com


  1. Selective Packet Capture at High Speed Rates Reservoir Labs Peter Cullen, James Ezick, Kelly Fox, Troy Hanson, Richard Lethin, Erik Mogus, Jordi Ros-Giralt, Alison Ryan, {cullen, ezick, fox, hanson, lethin, mogus, giralt, ryan}@reservoir.com Presenter: Jordi Ros-Giralt | giralt@reservoir.com 2nd European Zeek (Bro) Workshop April 10, 2019 632 Broadway Suite 803 New York, NY 10012 1 2nd European Zeek (Bro) Workshop Patented technologies

  2. Roadmap • Selective Packet Capture: Problem definition • Optimizations • Long queue emulation • Lockless bimodal queues • Tail early dropping • LFN tables • Multiresolution priority queues • Zeek script 2 2nd European Zeek (Bro) Workshop Patented technologies

  3. Packet Capturing at Very High Speed Rates • Scalability issue: performing packet capture is either intractable or requires highly expensive hardware both in processing and storage. • Liability issue: indiscriminate packet capture poses a liability issue. • Selective Packet Capture (SPC) provides a sweet-spot solution to both of these problems. • SPC gets a "free lunch" by leveraging all the heavy lifting work done by Zeek 3 2nd European Zeek (Bro) Workshop Patented technologies

  4. Problem Definition Capturing packets at very high speed rate is an HPC problem… So let's talk first about performance optimization... 4 2nd European Zeek (Bro) Workshop Patented technologies

  5. Problem Definition • System wide performance optimization of network components like routers, firewalls, or network analyzers such as a Zeek sensor is complex. • Hundreds of different SW algorithms and data structures interrelated in subtle ways. • Two interdependent problems: • Shifting micro-bottlenecks • Nonlinear performance collapse • Special focus on the problem of packet capturing at very high speed rates 5 2nd European Zeek (Bro) Workshop Patented technologies

  6. Problem Definition Shifting Micro-Bottlenecks It’s difficult... 6 2nd European Zeek (Bro) Workshop Patented technologies

  7. Problem Definition Shifting Micro-Bottlenecks ...to optimize... 7 2nd European Zeek (Bro) Workshop Patented technologies

  8. Problem Definition Shifting Micro-Bottlenecks ...bottlenecks... 8 2nd European Zeek (Bro) Workshop Patented technologies

  9. Problem Definition Shifting Micro-Bottlenecks ...that keep moving... 9 2nd European Zeek (Bro) Workshop Patented technologies

  10. Problem Definition Shifting Micro-Bottlenecks ...every microsecond... 10 2nd European Zeek (Bro) Workshop Patented technologies

  11. Problem Definition Shifting Micro-Bottlenecks ...or so. 11 2nd European Zeek (Bro) Workshop Patented technologies

  12. Non-linear Performance Collapse Disk I/O L1-I cache: 896 kB L1-D cache: 896 kB 10.4 Gbps Cache L2 cache: 7168 kB L3 cache: 71680 kB Net PCIE CPU I/O 40Gbps 64 Gbps 56 GHz Memory 1092 Gbps 12 2nd European Zeek (Bro) Workshop Patented technologies

  13. Non-linear Performance Collapse Healthy cache regime: - CPU operates out of cache - High cache hit ratios Disk I/O L1-I cache: 896 kB L1-D cache: 896 kB 10.4 Gbps Cache L2 cache: 7168 kB L3 cache: 71680 kB Net PCIE CPU I/O 40Gbps 64 Gbps 56 GHz Memory 1092 Gbps State 1: network is the bottleneck 13 2nd European Zeek (Bro) Workshop Patented technologies

  14. Non-linear Performance Collapse Highly inefficient memory regime: - CPU operates out of RAM - High cache miss ratios Disk I/O L1-I cache: 896 kB L1-D cache: 896 kB 10.4 Gbps Cache L2 cache: 7168 kB L3 cache: 71680 kB Net 10x penalty PCIE CPU I/O 40Gbps 64 Gbps 56 GHz Memory 1092 Gbps State 2: network is no longer the bottleneck 14 2nd European Zeek (Bro) Workshop Patented technologies

  15. Non-linear Performance Collapse Highly inefficient memory regime: - CPU operates out of RAM - High cache miss ratios Disk I/O L1-I cache: 896 kB L1-D cache: 896 kB 10.4 Gbps Cache L2 cache: 7168 kB L3 cache: 71680 kB Net 10x penalty PCIE CPU I/O 40Gbps 64 Gbps 56 GHz output Memory 1092 Gbps input State 2: network is no longer the bottleneck By removing the network bottleneck, system spends more time processing packets that will need to be dropped anyway → net performance degradation (performance collapse) 15 2nd European Zeek (Bro) Workshop Patented technologies

  16. Performance Optimization: Algorithms and Data Structures Long queue emulation Reduces packet drops due to fixed-size hardware rings Lockless bimodal queues Improves packet capturing performance Tail early dropping (TED) Increases information entropy and extracted metadata LFN tables Reduces state sharing overhead Multiresolution priority queues Reduces cost of processing timers 16 2nd European Zeek (Bro) Workshop Patented technologies

  17. Performance Optimization: Algorithms and Data Structures Long queue emulation Reduces packet drops due to fixed-size hardware rings Lockless bimodal queues Improves packet capturing performance Tail early dropping (TED) Increases information entropy and extracted metadata LFN tables Reduces state sharing overhead Multiresolution priority queues Reduces cost of processing timers 17 2nd European Zeek (Bro) Workshop Patented technologies

  18. Long Queue Emulation Dispatcher Model: Long queue emulation Model: - Packet read cache penalty. - Packet drop penalty under certain - Descriptor read cache penalty conditions 18 2nd European Zeek (Bro) Workshop Patented technologies

  19. Long Queue Emulation: Operational Lemma 19 2nd European Zeek (Bro) Workshop Patented technologies

  20. Long Queue Emulation in Practice Use LQE 20 2nd European Zeek (Bro) Workshop Patented technologies

  21. Long Queue Emulation • Optimal LQE size 21 2nd European Zeek (Bro) Workshop Patented technologies

  22. Performance Optimization: Algorithms and Data Structures Long queue emulation Reduces packet drops due to fixed-size hardware rings Lockless bimodal queues Improves packet capturing performance Tail early dropping Increases information entropy and extracted metadata LFN tables Reduces state sharing overhead Multiresolution priority queues Reduces cost of processing timers 22 2nd European Zeek (Bro) Workshop Patented technologies

  23. Lockless Bimodal Queues • Goal: move packets from the memory ring to disk without using locks (trigger capture) 23 2nd European Zeek (Bro) Workshop Patented technologies

  24. Lockless Bimodal Queues • Goal: move packets from the memory ring to disk without using locks 24 2nd European Zeek (Bro) Workshop Patented technologies

  25. Lockless Bimodal Queues 25 2nd European Zeek (Bro) Workshop Patented technologies

  26. Lockless Bimodal Queues 26 2nd European Zeek (Bro) Workshop Patented technologies

  27. Lockless Bimodal Queues 27 2nd European Zeek (Bro) Workshop Patented technologies

  28. SPC Workflow 28 2nd European Zeek (Bro) Workshop Patented technologies

  29. Selective Packet Capture API • The function spc_capture() takes two arguments as shown by its function prototype: ## API for capturing a Pcap function spc_capture(prefix: string, filter: string); • The prefix argument allows users to specify a prefix for the generated Pcap file name. The filter argument can be used to specify a BPF filter applied to the captured packets as they are written to the pcap file. See https://www.tcpdump.org/manpages/pcap-filter.7.html for the expression syntax of the BPF filter. If set to the empty string “”, all packets (without any filtering) are written to the Pcap file. 29 2nd European Zeek (Bro) Workshop Patented technologies

  30. Selective Packet Capture by Example 30 2nd European Zeek (Bro) Workshop Patented technologies

  31. Thank You 632 Broadway Suite 803 New York, NY 10012 812 SW Washington St. Suite 1200 Portland, OR 97205 31 2nd European Zeek (Bro) Workshop Patented technologies

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend