Skip to main content

Memory-Efficient Membership Encoding in Switches

Author(s): Pan, Mengying; MacDavid, Robert; Landau-Feibish, Shir; Rexford, Jennifer

To refer to this page use:
Abstract: Network applications often define policies to manage network traffic based on its attributes (e.g., a service chain, valid next-hops, permission flags). These policies match against packets' attributes in switches before being applied. However, the prior works of identifying attributes all incur a high memory cost in the data plane. This paper presents MEME, a scheme that clusters the attributes in packets to reduce the memory usage. MEME also leverages match-action tables and reconfigurable parsers on modern hardware switches to achieve 87.7% lower memory usage, and applies a graph algorithm to achieve 1-2 orders of magnitude faster compilation time than the prior state of the art [12]. These performance gains pave the way for deployment of a real system desired by the world's largest Internet Exchange Points.
Publication Date: 2020
Citation: Pan, Mengying, Robert MacDavid, Shir Landau-Feibish, and Jennifer Rexford. "Memory-Efficient Membership Encoding in Switches." In Proceedings of the Symposium on SDN Research (2020): pp. 110-116. doi:10.1145/3373360.3380842
DOI: 10.1145/3373360.3380842
Pages: 110 - 116
Type of Material: Conference Article
Journal/Proceeding Title: Proceedings of the Symposium on SDN Research
Version: Author's manuscript

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.