题名 | FastUp: Fast TCAM update for SDN switches in datacenter networks |
作者 | |
通讯作者 | Liu,Bin |
DOI | |
发表日期 | 2021-07-01
|
会议名称 | 41st IEEE International Conference on Distributed Computing Systems (ICDCS)
|
ISSN | 1063-6927
|
ISBN | 978-1-6654-4514-6
|
会议录名称 | |
卷号 | 2021-July
|
页码 | 887-897
|
会议日期 | JUL 07-10, 2021
|
会议地点 | null,null,ELECTR NETWORK
|
出版地 | 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
|
出版者 | |
摘要 | TCAM is widely used for flow table lookup in Software-Defined Networking (SDN) switches for datacenter and enterprise networks. While its lookup throughput is unparalleled, TCAM updating, particularly for new rule insertions, can impair the overall system performance. A rule insertion entails two steps: 1) Computing the rule moving operations; and 2) Interrupting the TCAM lookups to apply the operations. In previous work, the performance gain on one step is always at the expense of the performance loss on the other. However, update throughput and latency depend on both. In this paper, we present a faster and more balanced TCAM update scheme, which not only achieves the shortest interrupt time so far but also significantly reduces the computation time. By using a novel sequential stack, FastUp reduces the time and space complexity of the state-of-the-art schemes from $O(m^{2})$ and $O(m)$ to $O(m\log h)$ and $O(h)$, respectively, where $h << m$. Evaluations show that FastUp shortens the computation time and the interrupt time by $100\times$ and $1.6\times$, respectively, which is equivalent to update delay ${15\times}$ reduction and $\mathbf{10\times}$ update throughput gain against the state-of-the-art schemes. Moreover, we debunk a common mistake and show the dynamic programming based algorithm cannot be used to solve the reorder problem, and instead we use a bidirectional rule moving method to address the problem. In addition, we propose a practical method to find the theoretical lower bound of interrupt time in relatively large TCAM, which can be used to evaluate the optimality degree of TCAM update schemes. Evaluations show that FastUp achieves 90 % optimality. |
关键词 | |
学校署名 | 其他
|
语种 | 英语
|
相关链接 | [Scopus记录] |
收录类别 | |
资助项目 | Guangdong Basic and Applied Basic Research Foundation[2019B1515120031]
; National Natural Science Foundation of China[62032013,61872213,61432009,"LZC0019"]
|
WOS研究方向 | Computer Science
|
WOS类目 | Computer Science, Hardware & Architecture
; Computer Science, Information Systems
; Computer Science, Software Engineering
; Computer Science, Theory & Methods
|
WOS记录号 | WOS:000728379200080
|
EI入藏号 | 20214211032608
|
EI主题词 | Dynamic programming
; Ternary content adressable memory
|
EI分类号 | Data Storage, Equipment and Techniques:722.1
; Computer Programming:723.1
; Optimization Techniques:921.5
|
Scopus记录号 | 2-s2.0-85117122597
|
来源库 | Scopus
|
全文链接 | https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9546528 |
引用统计 |
被引频次[WOS]:5
|
成果类型 | 会议论文 |
条目标识符 | http://sustech.caswiz.com/handle/2SGJ60CL/254261 |
专题 | 南方科技大学 未来网络研究院 |
作者单位 | 1.Tsinghua University,China 2.Futurewei Technologies,United States 3.University of Texas at Arlington,United States 4.Fudan University,China 5.Southern University of Science and Technology,China 6.Xilinx,Singapore,Singapore 7.Xi'An Jiaotong University,China 8.Beijing University of Posts and Telecommunications,China |
推荐引用方式 GB/T 7714 |
Wan,Ying,Song,Haoyu,Che,Hao,et al. FastUp: Fast TCAM update for SDN switches in datacenter networks[C]. 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA:IEEE COMPUTER SOC,2021:887-897.
|
条目包含的文件 | 条目无相关文件。 |
|
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论