IMDEA Networks Institute Publications Repository

General Ternary Bit Strings on Commodity Longest-Prefix-Match Infrastructures

Chuprikov, Pavel and Kogan, Kirill and Nikolenko, Sergey (2017) General Ternary Bit Strings on Commodity Longest-Prefix-Match Infrastructures. In: The 25th IEEE International Conference on Network Protocols (IEEE ICNP 2017), 10-13 October 2017, Toronto, Canada.

[img] PDF (General Ternary Bit Strings on Commodity Longest-Prefix-Match Infrastructures) - Published Version
Download (432Kb)

Abstract

Ternary Content-Addressable Memory (TCAM) is a powerful tool to represent network services with line-rate lookup time. There are various software-based approaches to represent multi-field packet classifiers. Unfortunately, all of them either require exponential memory or apply additional constraints on field representations (e.g, prefixes or exact values) to have line-rate lookup time. In this work, we propose alternatives to TCAM and introduce a novel approach to represent packet classifiers based on ternary bit strings (without constraining field representation) on commodity longest-prefix-match (LPM) infrastructures. These representations are built on a novel property, prefix reorderability, that defines how to transform an ordered set of ternary bit strings to prefixes with LPM priorities in linear memory. Our results are supported by evaluations on large-scale packet classifiers with real parameters from ClassBench; moreover, we have developed a prototype in P4 to support these types of transformations.

Item Type: Conference or Workshop Papers (Paper)
Uncontrolled Keywords: Packet classification; forwarding information base.
Subjects: UNSPECIFIED
Divisions: UNSPECIFIED
Depositing User: Kirill Kogan
Date Deposited: 05 Sep 2017 09:47
Last Modified: 05 Sep 2017 15:53
URI: http://eprints.networks.imdea.org/id/eprint/1653

Actions (login required)

View Item View Item