TY - GEN
T1 - Occamy
T2 - 20th European Conference on Computer Systems, EuroSys 2025, co-located 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2025
AU - Shan, Danfeng
AU - Li, Yunguang
AU - Ma, Jinchao
AU - Zhang, Zhenxing
AU - Liang, Zeyu
AU - Wen, Xinyu
AU - Li, Hao
AU - Jiang, Wanchun
AU - Li, Nan
AU - Ren, Fengyuan
N1 - Publisher Copyright:
© 2025 Copyright held by the owner/author(s).
PY - 2025/3/30
Y1 - 2025/3/30
N2 - Today’s high-speed switches employ an on-chip shared packet buffer. The buffer is becoming increasingly insufficient as it cannot scale with the growing switching capacity. Nonetheless, the buffer needs to face highly intense bursts and meet stringent performance requirements for datacenter applications. This imposes rigorous demand on the Buffer Management (BM) scheme, which dynamically allocates the buffer across queues. However, the de facto BM scheme, designed over two decades ago, is ill-suited to meet the requirements of today’s network. In this paper, we argue that shallow-buffer switches, intense bursts, along with dynamic traffic call for a highly agile BM that can quickly adjust the buffer allocation as traffic changes. However, the agility of the current BM is fundamentally limited by its non-preemptive nature. Nonetheless, we find that preemptive BM, considered unrealizable in history, is now feasible on modern switch chips. We propose Occamy1, a preemptive BM that can quickly adjust buffer allocation. Occamy utilizes the redundant memory bandwidth to actively reclaim and reallocate the over-allocated buffer. Testbed experiments and large-scale simulations show that Occamy can improve the end-to-end performance by up to ∼55%.
AB - Today’s high-speed switches employ an on-chip shared packet buffer. The buffer is becoming increasingly insufficient as it cannot scale with the growing switching capacity. Nonetheless, the buffer needs to face highly intense bursts and meet stringent performance requirements for datacenter applications. This imposes rigorous demand on the Buffer Management (BM) scheme, which dynamically allocates the buffer across queues. However, the de facto BM scheme, designed over two decades ago, is ill-suited to meet the requirements of today’s network. In this paper, we argue that shallow-buffer switches, intense bursts, along with dynamic traffic call for a highly agile BM that can quickly adjust the buffer allocation as traffic changes. However, the agility of the current BM is fundamentally limited by its non-preemptive nature. Nonetheless, we find that preemptive BM, considered unrealizable in history, is now feasible on modern switch chips. We propose Occamy1, a preemptive BM that can quickly adjust buffer allocation. Occamy utilizes the redundant memory bandwidth to actively reclaim and reallocate the over-allocated buffer. Testbed experiments and large-scale simulations show that Occamy can improve the end-to-end performance by up to ∼55%.
KW - Buffer Management
KW - Datacenter Networks
KW - Traffic Bursts
UR - https://www.scopus.com/pages/publications/105002241982
U2 - 10.1145/3689031.3717495
DO - 10.1145/3689031.3717495
M3 - 会议稿件
AN - SCOPUS:105002241982
T3 - EuroSys 2025 - Proceedings of the 2025 20th European Conference on Computer Systems
SP - 1365
EP - 1382
BT - EuroSys 2025 - Proceedings of the 2025 20th European Conference on Computer Systems
PB - Association for Computing Machinery, Inc
Y2 - 30 March 2025 through 3 April 2025
ER -