Abstract
Programmable network switches promise flexibility and high throughput, enabling applications such as load balancing and traffic engineering. Network measurement is a fundamental building block for such applications, including tasks such as the identification of heavy hitters (largest flows) or the detection of traffic changes. However, high-throughput packet processing architectures place certain limitations on the programming model, such as restricted branching, limited capability for memory access, and a limited number of processing stages. These limitations restrict the types of measurement algorithms that can run on programmable switches. In this paper, we focus on the RMT programmable high-throughput switch architecture, and carefully examine its constraints on designing measurement algorithms. We demonstrate our findings while solving the heavy hitter problem. We introduce PRECISION, an algorithm that uses \emph{Probabilistic Recirculation} to find top flows on a programmable switch. By recirculating a small fraction of packets, PRECISION simplifies the access to stateful memory to conform with RMT limitations and achieves higher accuracy than previous heavy hitter detection algorithms that avoid recirculation. We also analyze the effect of each architectural constraint on the measurement accuracy and provide insights for measurement algorithm designers.
Comment: To appear in IEEE ICNP 2018
Original document
The different versions of the original document can be found in:
- https://arxiv.org/abs/1808.03412,
- https://arxiv.org/pdf/1808.03412v2,
- https://ui.adsabs.harvard.edu/abs/2018arXiv180803412B/abstract,
- http://export.arxiv.org/pdf/1808.03412,
- http://export.arxiv.org/abs/1808.03412,
- https://uk.arxiv.org/abs/1808.03412,
- https://academic.microsoft.com/#/detail/2951243021
Document information
Published on 01/01/2018
Volume 2018, 2018
DOI: 10.1109/icnp.2018.00047
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?