Saved in:
| Main Authors: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.13570 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912201235759104 |
|---|---|
| author | Shan, Danfeng Li, Yunguang Ma, Jinchao Zhang, Zhenxing Liang, Zeyu Wen, Xinyu Li, Hao Jiang, Wanchun Li, Nan Ren, Fengyuan |
| author_facet | Shan, Danfeng Li, Yunguang Ma, Jinchao Zhang, Zhenxing Liang, Zeyu Wen, Xinyu Li, Hao Jiang, Wanchun Li, Nan Ren, Fengyuan |
| contents | 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 Occamy, 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%. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_13570 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Occamy: A Preemptive Buffer Management for On-chip Shared-memory Switches Shan, Danfeng Li, Yunguang Ma, Jinchao Zhang, Zhenxing Liang, Zeyu Wen, Xinyu Li, Hao Jiang, Wanchun Li, Nan Ren, Fengyuan Networking and Internet Architecture 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 Occamy, 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%. |
| title | Occamy: A Preemptive Buffer Management for On-chip Shared-memory Switches |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2501.13570 |