Abstract
Today, network devices share buffer across priority queues to avoid drops during transient congestion. While cost-effective most of the time, this sharing can cause undesired interference among seemingly independent traffic. As a result, low-priority traffic can cause increased packet loss to high-priority traffic. Similarly, long flows can prevent the buffer from absorbing incoming bursts even if they do not share the same queue. The cause of this perhaps unintuitive outcome is that today’s buffer sharing techniques are unable to guarantee isolation across (priority) queues without statically allocating buffer space. To address this issue, we designed FB, a novel buffer sharing scheme that offers strict isolation guarantees to high-priority traffic without sacrificing link utilizations. Thus, FB outperforms conventional buffer sharing algorithms in absorbing bursts while achieving on-par throughput. We show that FB is practical and runs at line-rate on existing hardware (Barefoot Tofino). Significantly, FB’s operations can be approximated in non-programmable devices.
Cite this work
BibTeX entry
@article{bufferfbreview21,
author = {Apostolaki, Maria and Addanki, Vamsi and Ghobadi, Manya and Vanbever, Laurent},
url = {https://arxiv.org/abs/2105.10553},
title = {{FB:} {A} Flexible Buffer Management Scheme for Data Center Switches},
journal = {CoRR},
volume = {abs/2105.10553},
year = {2021},
eprinttype = {arXiv},
eprint = {2105.10553}
}