1 / 15

Efficient TCAM Encoding Schemes for Packet Classification using Gray Code

Efficient TCAM Encoding Schemes for Packet Classification using Gray Code. Authors: Yeim-Kuan Chang and Cheng-Chien Su Publisher: the IEEE Globecom 2007 conference Present : Chen-Rong Chang Date: December , 10, 2008. Department of Computer Science and Information Engineering

newman
Download Presentation

Efficient TCAM Encoding Schemes for Packet Classification using Gray Code

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. Efficient TCAM Encoding Schemes for Packet Classification using Gray Code Authors:Yeim-Kuan Chang and Cheng-Chien Su Publisher:the IEEE Globecom 2007 conference Present:Chen-Rong Chang Date:December, 10, 2008 Department of Computer Science and Information Engineering National Cheng Kung University, Taiwan R.O.C.

  2. Outline • Introduction • Related Works • Proposed range encoding shemes • Performance

  3. Introduction • A traditional solution for storing ranges in TCAM is the direct range-to-prefix conversion which individually converts each range into multiple prefixes. • A set of encoding schemes called parallel packet classification encoding (PPCE) is proposed based on the concept of elementary intervals.

  4. Elementary intervals

  5. Direct range-to-prefix & Elementary interval-based encoding scheme Direct range-to-prefix conversion: EX: R2 = [2 6] 0 0 0 1 0 0 0 0 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 1 0 Elementary interval-based encoding scheme: EX: R2 = [1 1] 0 0 0 1 R3 = [4 7] 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 For tatal: 17 5-bit prefix 0 0 0 1 * 0 0 1 0 * 0 0 1 1 0 For tatal: 6 4-bit prefix 0 1 * *

  6. Parallel packet classification encoding (PPCE) scheme

  7. Proposed Range Encoding Schemes

  8. Proposed Range Encoding Schemes (cont.)

  9. BRGC range group The following rules are satisfied: • no range is disjoint from the other ranges in the group • each range covers exactly consecutive elementary intervals • theidentifiers assigned to these intervals can be merged into one ternary string Perfect range group: it covers 2d – 1 valid elementary intervals which need 2d – 1 distinct identifiers.

  10. Perfect BRGC range group (cont.)

  11. Imperfect BRGC range groups

  12. Many-to-one code assignment • The many-to-one code assignment scheme achieves the goal of using only one ternary string to encode a range by assigning more than one code to an elementary interval.

  13. One-to-many code assignment • The one-to-many code assignment scheme extends the use of a common code from the default elementary intervals to the valid elementary intervals by assigning a common code to the valid elementary intervals covered by the same subset of original ranges

  14. Performance

  15. Performance (cont.)

More Related