Formal Abstractions for Packet Scheduling

Explore a 17-minute conference talk from OOPSLA2 2023 that delves into formal abstractions for packet scheduling in software-defined networking (SDN). Learn about PIFO trees, a flexible primitive for programmable packet scheduling, and their semantic properties. Discover how researchers formalized PIFO trees' syntax and semantics, developed compilation algorithms for topology-independent behavior, and created a software simulator for experimentation. Gain insights into optimizing PIFO tree implementations and realizing logical PIFO trees on hardware with fixed topologies. Examine case studies demonstrating the simulator's behavior on standard and custom algorithms, and access supplementary materials for hands-on exploration of the concepts presented.

[OOPSLA23] Formal Abstractions for Packet Scheduling