YoVDO

Traffic Footprint Characterization of Workloads Using BPF

Offered By: Linux Plumbers Conference via YouTube

Tags

Linux Plumbers Conference Courses C Programming Courses Network Traffic Analysis Courses Linux System Administration Courses Cluster Management Courses Container Orchestration Courses BPF (Berkeley Packet Filter) Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Related Courses

UNSW Computing 1 - The Art of Programming
OpenLearning
C++ For C Programmers, Part A
University of California, Santa Cruz via Coursera
Beginning Game Programming with C#
University of Colorado System via Coursera
Introduction to Computing 计算概论A
Peking University via Coursera
Comprendre les Microcontroleurs
École Polytechnique Fédérale de Lausanne via Coursera