1 / 13

Content-Based Route Lookup using CAMs

Content-Based Route Lookup using CAMs. Authors : Yan Sun, Norbert Egi, Guangyu Shi, and Jianming Wu Publisher GLOBECOM 2012 Presenter : Chai-Yi Chu Date : 2013/02/20. Outline. Introduction Proposed Algorithm Evaluation. Introduction.

carnig
Download Presentation

Content-Based Route Lookup using CAMs

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. Content-Based Route Lookup using CAMs Authors:Yan Sun, Norbert Egi, Guangyu Shi, and Jianming Wu PublisherGLOBECOM 2012 Presenter : Chai-Yi Chu Date : 2013/02/20

  2. Outline • Introduction • Proposed Algorithm • Evaluation

  3. Introduction • Name-based route lookup for content-centric networks using CAMs. • Hybrid of TCAMs and BCAMs • Hash-based • hash prefixes into short hash values.

  4. Proposed Algorithm • Use a fixed length of block as the processing unit • Include the delimiter character(s) as part of the name • Set the block length to 64-bit • Use CRC-64 as the hash function to hash multiple 64-bit blocks to a single 64-bit value.

  5. To increase the efficiency of the lookup algorithm • Group the entries & store a group ID for every entry of the lookup table in an SRAM.

  6. If there is an entry in the lookup table that is a prefix of other entries in the table, all these entries including the shortest one are allocated a unique group ID and stored in a SRAM with the belonging entry numbers.

  7. For each group, the shortest prefix is the prefix of all other entries in the same group and it does not overlap with any entries in other groups. • Store the length of the longest prefix in every group. • do not process an incoming name any further than the longest prefix in the group it has already found a match in.

  8. Evaluation • Realistic names - 314,284 URLs • collected from several universities’ servers in the US • Generated names - 100,000 URL prefixes • based on the collected URLs • Xilinx Virtex-5 TX240T FPGA

More Related