Abstract

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.

Highlights

  • Software-Defined Networking (SDN) [1] satisfies both flexibility and programmability for routers

  • We present SplitBV to ensure as small latency as possible for high-performance SDN switches on Field Programmable Gate Array (FPGA)

  • The SplitHP consists of two stages, the first stage is composed of the splitting elements (SEs), and the second stage is composed of several horizontal two-dimensional pipelines composed of processing elements (PEs) and priority encoders (PrEncs)

Read more

Summary

Introduction

Software-Defined Networking (SDN) [1] satisfies both flexibility and programmability for routers. The SDN switches use lookup tables with match-action rules to enforce the forwarding strategy, which is essentially a multi-field packet classification problem [2]. We present SplitBV to ensure as small latency as possible for high-performance SDN switches on FPGA. SplitBV selects several distinguishable exact-bits to split the ruleset into independent sub-rulesets without rule replication These diminutive sub-rulesets can be implemented parallelly in BV-based pipelines, reducing update latency tremendously. The update and lookup processes between different pipelines do not conflict with each other, which further reduces the damage of rule updates to classification performance. SplitAL first determines the searching steps of matching fields based on greedy strategy and employs a constrained recursive algorithm to resolve the problem of exponential computational complexity.

Multi-Field Packet Classification
Rule Updates on SDN Switch
Packet Classification Algorithms
BV-Based Solutions Analyses
10 Latency
Ideas and Architecture
Brute Force Strategy
Split Algorithm
Distinguish by field
Select-Bits Combination
A Example
Hybrid SplitHP
Update Strategy
Experimental Setup
Split-Bits Trade-Off
Update Latency
Memory Consumption
Resource and Throughput
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call