Many-Field Packet Classification for Software-Defined Networking Switches

Hsieh, Cheng-Liang; Weng, Ning

doi:10.1145/2881025.2881036

Cited by 17 publications

(6 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although this approach decreases memory consumption as well as increases classification speed, it still suffers from rule duplication and cut decision configuration cost. Inoue et al [12] proposed multidimensional-cutting via selective bit-concatenation to accelerate many-field packet classification. However, the method they propose to generate lookup tables is complicated and there is no guarantee for a correct classification.…”

Section: :19mentioning

confidence: 99%

“…For a large size of rules and a manyfield packet, the complexity of building the trie will become large. Several other software-based packet classification algorithms have been proposed, which only deal with some specific rules or sub-rules but not the general form of the matching problem [10,12,14,27,36,37]. By contrast, GenMatcher is a generic arbitrary matching mechanism for any form of matching.…”

Section: :19mentioning

confidence: 99%

See 1 more Smart Citation

GenMatcher

Wang

McHale

Gratz

et al. 2018

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

Packet classification methods rely upon packet content/header matching against rules. Thus, throughput of matching operations is critical in many networking applications. Further, with the advent of Software Defined Networking (SDN), efficient implementation of software approaches to matching are critical for the overall system performance. This article presents 1 GenMatcher, a generic, software-only, arbitrary matching framework for fast, efficient searches. The key idea of our approach is to represent arbitrary rules with efficient prefix-based tries. To support arbitrary wildcards, we rearrange bits within the rules such that wildcards accumulate to one side of the bitstring. Since many non-contiguous wildcards often remain, we use multiple prefix-based tries. The main challenge in this context is to generate efficient trie groupings and expansions to support all arbitrary rules. Finding an optimal mix of grouping and expansion is an NP-complete problem. Our contribution includes a novel, clustering-based grouping algorithm to group rules based upon their bit-level similarities. Our algorithm generates near-optimal trie groupings with low configuration times and provides significantly higher match throughput compared to prior techniques. Experiments with synthetic traffic show that our method can achieve a 58.9X speedup compared to the baseline on a single core processor under a given memory constraint.

show abstract

Section: :19mentioning

confidence: 99%

Section: :19mentioning

confidence: 99%

GenMatcher

Wang

McHale

Gratz

et al. 2018

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

show abstract

“…However, efficient rule table mapping is still in its infancy. Open vSwitch [9] provides flexible flow processing, but with low performance for many-field packet classification [15]. Pan [24] discussed how to compute action for compositional SDN.…”

Section: Related Workmentioning

confidence: 99%

FlowConvertor: Enabling portability of SDN applications

Pan

Xie

et al. 2017

IEEE INFOCOM 2017 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

Abstract-Software-Defined Networking (SDN) provides network administrators opportunities to control network devices more simply and easily than in traditional networking. However, heterogeneity in switch hardware, especially in forwarding pipeline architecture, renders the task of network application developers and network administrators tedious, by hampering portability across switch models.In this paper, we propose FlowConvertor, an algorithm capable of converting rules from any forwarding pipeline to any other different forwarding pipeline, as long as both pipelines offer compatible operations. More precisely, FlowConvertor is an online algorithm that operates on flow updates issued to the origin pipeline and computes the corresponding updates for the target pipeline in real time. Performance evaluation shows that the latency introduced by FlowConvertor on the path between the SDN controller and the target switch is of the order of 1ms in most cases, and is thus acceptable for practical deployment.

show abstract

“…We generate synthetic 10K 5-tuple rules and OpenFlow1.0 rules from well-known ClassBench [30] and the lastest ClassBench-ng [31] to evaluate our scheme. It is reasonable to choose rules around 10K since recent researches [32,33] have validated against dozens of thousands of rules. Experimental results show that SplitBV reduces the update latency by average 37% and 41% compared with TPBV on the two typical rulesets respectively.…”

mentioning

confidence: 99%

Enabling Packet Classification with Low Update Latency for SDN Switch on FPGA

et al. 2020

Sustainability

View full text Add to dashboard Cite

Field Programmable Gate Array (FPGA) is widely used in real-time network processing such as Software-Defined Networking (SDN) switch due to high performance and programmability. Bit-Vector (BV)-based approaches can implement high-performance multi-field packet classification, on FPGA, which is the core function of the SDN switch. However, the SDN switch requires not only high performance but also low update latency to avoid controller failure. Unfortunately, the update latency of BV-based approaches is inversely proportional to the number of rules, which means can hardly support the SDN switch effectively. It is reasonable to split the ruleset into sub-rulesets that can be performed in parallel, thereby reducing update latency. We thus present SplitBV for the efficient update by using several distinguishable exact-bits to split the ruleset. SplitBV consists of a constrained recursive algorithm for selecting the bit positions that can minimize the latency and a hybrid lookup pipeline. It can achieve a significant reduction in update latency with negligible memory growth and comparable high performance. We implement SplitBV and evaluate its performance by simulation and FPGA prototype. Experimental results show that our approach can reduce 73% and 36% update latency on average for synthetic 5-tuple rules and OpenFlow rules respectively.

show abstract

Many-Field Packet Classification for Software-Defined Networking Switches

Cited by 17 publications

References 26 publications

GenMatcher

GenMatcher

FlowConvertor: Enabling portability of SDN applications

Enabling Packet Classification with Low Update Latency for SDN Switch on FPGA

Contact Info

Product

Resources

About