English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Packet scheduling is a fundamental networking task that recently receivedrenewed attention in the context of programmable data planes. Programmablepacket scheduling systems such as those based on Push-In First-Out (PIFO)abstraction enabled flexible scheduling policies, but are tooresource-expensive for large-scale line rate operation. This prompted researchinto practical programmable schedulers (e.g., SP-PIFO, AIFO) approximating PIFObehavior on regular hardware. Yet, their scalability remains limited due toextensive number of memory operations. To address this, we design an effectiveyet resource-efficient packet scheduler, Range-In First-Out (RIFO), which usesonly three mutable memory cells and one FIFO queue per PIFO queue. RIFO isbased on multi-criteria decision-making principles and uses small guaranteedadmission buffers. Our large-scale simulations in Netbench demonstrate thatdespite using fewer resources, RIFO generally achieves competitive flowcompletion times across all studied workloads, and is especially effective inworkloads with a significant share of large flows, reducing flow completiontime up to 2.9x in Datamining workloads compared to state-of-the-art solutions.Our prototype implementation using P4 on Tofino switches requires only 650lines of code, is scalable, and runs at line rate.

RIFO: Pushing the Efficiency of Programmable Packet Schedulers