Name
Abstract | ||
|---|---|---|
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 1 byte 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). |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Networking and Internet Architecture | Byte,Architecture,Computer architecture,Computer science,Flow (psychology),Network packet,Computer network,Field-programmable gate array,Throughput,Latency (engineering),Ternary search tree |
DocType | Volume | Citations |
Journal | abs/1801.00840 | 0 |
PageRank | References | Authors |
0.34 | 26 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rashid Hatamia | 1 | 0 | 0.34 |
| Hossein Bahramgiria | 2 | 0 | 0.34 |
| Ahmad Khonsari | 3 | 210 | 42.43 |