Fastup: Compute a better TCAM update scheme in less time for SDN switches

  • Ying Wan
  • , Haoyu Song
  • , Hao Che
  • , Yang Xu
  • , Yi Wang
  • , Chuwen Zhang
  • , Zhijun Wang
  • , Tian Pan
  • , Hao Li
  • , Hong Jiang
  • , Chengchen Hu
  • , Zhikang Chen
  • , Bin Liu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

—While widely used for flow tables in SDN switches, TCAM faces challenges for rule updates. Both the computation time and interrupt time need to be short. We propose FastUp, a new TCAM update algorithm, which improves the previous dynamic programming-based algorithms. Evaluations show that FastUp shortens the computation time by 40~100x and the interrupt time by 1.2~2.5x. In addition, we are the first to prove the NP-hardness of the optimal TCAM update problem, and provide a practical method to evaluate an algorithm's degree of optimality. Experiments show that FastUp's optimality reaches 90%.

Original languageEnglish
Title of host publicationProceedings - 2020 IEEE 40th International Conference on Distributed Computing Systems, ICDCS 2020
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1175-1176
Number of pages2
ISBN (Electronic)9781728170022
DOIs
StatePublished - Nov 2020
Event40th IEEE International Conference on Distributed Computing Systems, ICDCS 2020 - Singapore, Singapore
Duration: 29 Nov 20201 Dec 2020

Publication series

NameProceedings - International Conference on Distributed Computing Systems
Volume2020-November

Conference

Conference40th IEEE International Conference on Distributed Computing Systems, ICDCS 2020
Country/TerritorySingapore
CitySingapore
Period29/11/201/12/20

Fingerprint

Dive into the research topics of 'Fastup: Compute a better TCAM update scheme in less time for SDN switches'. Together they form a unique fingerprint.

Cite this