Traffic Footprint Characterization of Workloads Using BPF
Linux Plumbers Conference via YouTube
Foundations of Data Visualization - Self Paced Online
You’re only 3 weeks away from a new language
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a 26-minute conference talk from the Linux Plumbers Conference that delves into characterizing traffic footprints of workloads using BPF (Berkeley Packet Filter). Learn how Aditi Ghag from VMware proposes using eBPF programs to detect and attribute network elephant flows to containers or VMs, aiming to improve scheduling and network performance of containerized workloads. Discover the challenges of network resource characterization for diverse application workloads, and understand how this approach can help separate mice flows from elephant flows to achieve low latency. Gain insights into using learned network footprints for dynamic allocation of Linux network resources, such as bandwidth and receive-side scaling queue mappings, all without modifying kernel code.
Syllabus
LPC2019 - Traffic footprint characterization of workloads using BPF
Taught by
Linux Plumbers Conference