Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

DRES: Dynamic Range Encoding Scheme for TCAM Coprocessors

Published: 01 July 2008 Publication History

Abstract

One of the most critical resource management issues in the use of ternary content addressable memory (TCAM) for packet classification/filtering is how to effectively support filtering rules with ranges, known as range matching. In this paper, a Dynamic Range Encoding Scheme (DRES) is proposed to significantly improve TCAM storage efficiency for range matching. Unlike the existing range encoding schemes requiring additional hardware support, DRES uses the TCAM coprocessor itself to assist range encoding. Hence, DRES can be readily programmed in a network processor using a TCAM coprocessor for packet classification. A salient feature of DRES is its ability to allow a subset of ranges to be encoded and hence to have full control over the range code size. This feature allows DRES to exploit the TCAM structure to maximize TCAM storage efficiency. DRES is a comprehensive solution, including a dynamic range selection algorithm, a search key encoding scheme, a range encoding scheme, and a dynamic encoded range update algorithm. While the dynamic range selection algorithm running in software allows optimal selection of ranges to be encoded to maximize the TCAM storage efficiency, the dynamic encoded range update algorithm allows the TCAM database to be updated lock-free without interrupting the TCAM database lookup process. DRES is evaluated based on real-world databases and the results show that DRES can reduce the TCAM storage expansion ratio from 6.20 to 1.23. The performance analysis of DRES based on a probabilistic model demonstrates that DRES significantly improves TCAM storage efficiency for a wide spectrum of range distributions.

Cited By

View all
  • (2022)TD-NUCAProceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis10.5555/3571885.3571991(1-15)Online publication date: 13-Nov-2022
  • (2019)Ingredients to enhance the performance of two-stage TCAM-based packet classifiers in internet of things: greedy layering, bit auctioning and range encodingEURASIP Journal on Wireless Communications and Networking10.1186/s13638-019-1617-82019:1Online publication date: 30-Dec-2019
  • (2019)How to deal with range-based packet classifiersProceedings of the 2019 ACM Symposium on SDN Research10.1145/3314148.3314346(29-35)Online publication date: 3-Apr-2019
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers
IEEE Transactions on Computers  Volume 57, Issue 7
July 2008
144 pages

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 July 2008

Author Tags

  1. Associative memories
  2. Composite structures
  3. Network repositories/data mining/backup
  4. Storage/repositories

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2022)TD-NUCAProceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis10.5555/3571885.3571991(1-15)Online publication date: 13-Nov-2022
  • (2019)Ingredients to enhance the performance of two-stage TCAM-based packet classifiers in internet of things: greedy layering, bit auctioning and range encodingEURASIP Journal on Wireless Communications and Networking10.1186/s13638-019-1617-82019:1Online publication date: 30-Dec-2019
  • (2019)How to deal with range-based packet classifiersProceedings of the 2019 ACM Symposium on SDN Research10.1145/3314148.3314346(29-35)Online publication date: 3-Apr-2019
  • (2018)A Sorted-Partitioning Approach to Fast and Scalable Dynamic Packet ClassificationIEEE/ACM Transactions on Networking10.1109/TNET.2018.285271026:4(1907-1920)Online publication date: 1-Aug-2018
  • (2018)Encoding Short Ranges in TCAM Without ExpansionIEEE/ACM Transactions on Networking10.1109/TNET.2018.279769026:2(835-850)Online publication date: 1-Apr-2018
  • (2018)CutSplit: A Decision-Tree Combining Cutting and Splitting for Scalable Packet ClassificationIEEE INFOCOM 2018 - IEEE Conference on Computer Communications10.1109/INFOCOM.2018.8485947(2645-2653)Online publication date: 16-Apr-2018
  • (2017)RFCComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2017.02.016118:C(54-61)Online publication date: 8-May-2017
  • (2016)Exploiting order independence for scalable and expressive packet classificationIEEE/ACM Transactions on Networking10.5555/3001647.300169124:2(1251-1264)Online publication date: 1-Apr-2016
  • (2016)Encoding Short Ranges in TCAM Without ExpansionProceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/2935764.2935769(35-46)Online publication date: 11-Jul-2016
  • (2016)Packet classification using binary content addressable memoryIEEE/ACM Transactions on Networking10.1109/TNET.2016.253361324:3(1295-1307)Online publication date: 1-Jun-2016
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media