1 / 12

Authors: Yang Xu, Zhaobo Liu, Zhuoyuan Zhang, H. Jonathan Chao Conf. : ANCS 2009

An ultra high throughput and memory efficient pipeline architecture for multi-match packet classification without TCAMs. Authors: Yang Xu, Zhaobo Liu, Zhuoyuan Zhang, H. Jonathan Chao Conf. : ANCS 2009 Presenter : JHAO-YAN JIAN Date : 2011/12/14. INTRODUCTION.

idania
Download Presentation

Authors: Yang Xu, Zhaobo Liu, Zhuoyuan Zhang, H. Jonathan Chao Conf. : ANCS 2009

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An ultra high throughput and memory efficient pipeline architecture for multi-match packet classification without TCAMs Authors:Yang Xu, Zhaobo Liu, Zhuoyuan Zhang, H. Jonathan Chao Conf. :ANCS 2009 Presenter : JHAO-YAN JIAN Date : 2011/12/14

  2. INTRODUCTION • decompose the operation of multi-match packet classification from the complicated multi-dimensional search to several single-dimensional searches • present an asynchronous pipeline architecture based on a signature tree structure to combine the intermediate results returned from single-dimensional searches. • propose two edge-grouping algorithms to partition the hash table at each stage of the pipeline into multiple hash tables.

  3. PROBLEM STATEMENT Coming packet Return by single-dimensional searches

  4. SIGNATURE TREE

  5. ASYNCHRONOUS PIPELINE ARCHITECTURE

  6. Character-Based Edge-Grouping • reserve the first log2 (M +1) bit of each character to be the locating prefix, whose value is between 0 and M. • Given the M+1 edge sets after the edge-grouping, we could store edges of each independent edge set into an individual hash table, while duplicate edges of the residual edge set into all M hash tables. • Given M work-conserving hash tables and y matching characters, the processing of each activenode ID can be finished within y /M parallel hash accesses.

  7. Character-Based Edge-Grouping

  8. Node-Character-Based Edge-Grouping • NCB_EG scheme stores the grouping information of each edge in both the encoding of the edge’s associated character, and the ID of the edge’s source node • locating prefix(sft) :first log2 (M +1) bit of each character • shifting prefix(loc) :first log2 M bits of each node • hash table indexed by (sft+loc-1) mod M +1 • If loc equals 0, the edge is a residual edge, and could be found in any partitioned hash tables.

  9. Node-Character-Based Edge-Grouping

  10. EVALUATION RESULTS

  11. EVALUATION RESULTS

  12. EVALUATION RESULTS Suppose the on-chip SRAM access frequency is 400 MHz, the smallest size of IP packet is 64 bytes. The proposed pipeline can achieve a throughput between 19.5Gbps and 91Gbps with different types of classifiers.

More Related