Adaptive Approximate Fair Queueing for Shared-Memory Programmable Switches

doi:10.1109/TNSE.2024.3377814

Adaptive Approximate Fair Queueing for Shared-Memory Programmable Switches

2024-07-01

0

PRE

AI

DOI：10.1109/TNSE.2024.3377814

Original

Original request for help

Save

Abstract

En 中文

Fair Queueing (FQ) is an ideal fair bandwidth allocation scheme but is rarely deployed in production networks due to its high complexity. Driven by the prevalence of commercial programmable switching ASICs (e.g., Broadcom Trident 4, Cisco Silicon One, and Intel Tofino), several recent approaches have shown that FQ can be approximated with limited FIFO queues. However, these approaches (implicitly) assume that each queue has a dedicated buffer, while commodity switching chips usually employ a globally shared memory and dynamically allocate buffer to each queue. When directly applied to shared-memory switches, these approaches are inadaptive to the traffic dynamics. In this paper, we reveal this problem with simulations and explore the intrinsic trade-off between buffer efficiency and fairness. Based on the observations, we design Adaptive Approximate Fair Queueing (A(2)FQ), a practical approximate FQ algorithm that is adaptive to traffic dynamics. At its heart, A(2)FQ dynamically changes the number of effective queues according to traffic characteristics. Extensive experiments and simulations show that A(2)FQ can improve fairness by up to 19.7x.

Keywords:

Switches

Resource management

Bandwidth

Packet loss

Heuristic algorithms

Complexity theory

Channel allocation

Fair queueing

programmable switch

switch buffer management

congestion control

Adaptive Approximate Fair Queueing for Shared-Memory Programmable Switches

Abstract

Journal

Organization