TY - JOUR
T1 - Range-Enhanced Packet Classification Design on FPGA
AU - Chang, Yeim Kuan
AU - Hsueh, Chun Sheng
PY - 2016/4/1
Y1 - 2016/4/1
N2 - The future of fast Internet needs powerful routers to support abundant network functionalities, such as firewall, QoS, and virtual private networks, by classifying the packets into different categories based on a set of predefined rules, so-called multi-field packet classification. Traditional packet classification that considers only 5-Tuple fields is not sufficient for today's complicated network requirements. OpenFlow switch was born to take care of these complex requirements using a rule set with the rich definition as the software-hardware interface. This paper considers OpenFlow1.0, consisting of 12-Tuple header fields. We propose two schemes to process the range fields. The first scheme has the same characteristic as StrideBV [15] using specially designed codes to store the pre-computed results in memory. The second scheme uses a simple sub-range comparison method to find the matching result in a sequential fashion. To show the performance and compare with other proposed schemes, we implement the proposed schemes on Xilinx Virtex-6 XC6VLX760 FPGA device. Experimental results show that our designs can handle 5 K more OpenFlow rules on Virtex-6 XC6VLX760. To the best of our knowledge, our proposed scheme is the first range supported method that can sustain the throughputs of more than 380 MHz.
AB - The future of fast Internet needs powerful routers to support abundant network functionalities, such as firewall, QoS, and virtual private networks, by classifying the packets into different categories based on a set of predefined rules, so-called multi-field packet classification. Traditional packet classification that considers only 5-Tuple fields is not sufficient for today's complicated network requirements. OpenFlow switch was born to take care of these complex requirements using a rule set with the rich definition as the software-hardware interface. This paper considers OpenFlow1.0, consisting of 12-Tuple header fields. We propose two schemes to process the range fields. The first scheme has the same characteristic as StrideBV [15] using specially designed codes to store the pre-computed results in memory. The second scheme uses a simple sub-range comparison method to find the matching result in a sequential fashion. To show the performance and compare with other proposed schemes, we implement the proposed schemes on Xilinx Virtex-6 XC6VLX760 FPGA device. Experimental results show that our designs can handle 5 K more OpenFlow rules on Virtex-6 XC6VLX760. To the best of our knowledge, our proposed scheme is the first range supported method that can sustain the throughputs of more than 380 MHz.
UR - http://www.scopus.com/inward/record.url?scp=84976508237&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84976508237&partnerID=8YFLogxK
U2 - 10.1109/TETC.2015.2449666
DO - 10.1109/TETC.2015.2449666
M3 - Article
AN - SCOPUS:84976508237
SN - 2168-6750
VL - 4
SP - 214
EP - 224
JO - IEEE Transactions on Emerging Topics in Computing
JF - IEEE Transactions on Emerging Topics in Computing
IS - 2
M1 - 7140750
ER -