High-performance architecture for flow-table lookup in SDN on FPGA

被引：7

作者：

Hatami, Rashid ^{[1
]}

Bahramgiri, Hossein ^{[1
]}

机构：

[1] Maleke Ashtar Univ Technol, Tehran, Iran

来源：

JOURNAL OF SUPERCOMPUTING | 2019年 / 75卷 / 01期

关键词：

Software-defined networking (SDN); Flow-table; Range-based ternary search tree (RTST); Field-programmable gate array (FPGA); Pipeline architecture; PACKET CLASSIFICATION; TREE; LTE;

D O I：

10.1007/s11227-018-02732-2

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We propose range-based ternary search tree (RTST), a tree-based approach for flow-table lookup in SDN. RTST builds upon flow-tables in SDN switches to provide a fast lookup among flows. We present a parallel multi-pipeline architecture for implementing RTST that benefits from high throughput and low latency. The proposed RTST and architecture achieve a memory efficiency of 1byte of memory for each byte of flow. We also present a set of techniques to support dynamic updates. Experimental results reveal that RTST can be used to improve the performance of flow-lookup. It achieves a throughput of 670 million packets per second (MPPS), for a 1K 15-tuple flow-table, on a state-of-the-art FPGA (Virtex 6 XC6VLX760).

引用

页码：384 / 399

页数：16

共 29 条

[1]

[Anonymous], 2011, CONEXT 11

[2]

Arabnia H. R., 1986, Computer Graphics Forum, V5, P179, DOI 10.1111/j.1467-8659.1986.tb00296.x

[3] A parallel numerical algorithm on a reconfigurable multi-ring network [J].