Low-Power TCAMs for Very Large Forwarding Tables

Slides:



Advertisements
Similar presentations
Name: ___________________________________ I filled _______________________’s bucket today. I filled a bucket by _________________________ _________________________________________.
Advertisements

A Scalable and Reconfigurable Search Memory Substrate for High Throughput Packet Processing Sangyeun Cho and Rami Melhem Dept. of Computer Science University.
An On-Chip IP Address Lookup Algorithm Author: Xuehong Sun and Yiqiang Q. Zhao Publisher: IEEE TRANSACTIONS ON COMPUTERS, 2005 Presenter: Yu Hao, Tseng.
1 Fast Routing Table Lookup Based on Deterministic Multi- hashing Zhuo Huang, David Lin, Jih-Kwon Peir, Shigang Chen, S. M. Iftekharul Alam Department.
Advanced Data Structures
Authors: Balajee Vamanan and T. N. Vijaykumar Conf. : ACM CoNEXT 2011 Presenter : JHAO-YAN JIAN Date : 2012/5/9 1 TreeCAM: Decoupling Updates and Lookups.
CS 171: Introduction to Computer Science II
1 On a trie partitioning algorithm for power-efficient TCAMs Authors: Haibin Lu Presenter: Yi-Sheng, Lin ( 林意勝 ) Date: Publisher/Conf. : INTERNATIONAL.
Recursively Partitioned Static IP Router Tables Author: Wencheng Lu,Sartaj Sahni Publisher: IEEE TC,2010 Presenter: Jia-Wei Yo Date: 2011/09/14 1.
1 A Tree Based Router Search Engine Architecture With Single Port Memories Author: Baboescu, F.Baboescu, F. Tullsen, D.M. Rosu, G. Singh, S. Tullsen, D.M.Rosu,
Power Efficient IP Lookup with Supernode Caching Lu Peng, Wencheng Lu*, and Lide Duan Dept. of Electrical & Computer Engineering Louisiana State University.
Efficient IP-Address Lookup with a Shared Forwarding Table for Multiple Virtual Routers Author: Jing Fu, Jennifer Rexford Publisher: ACM CoNEXT 2008 Presenter:
Kymberly Fergusson CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A12 – Binary Trees.
Tree Traversal. Traversal Algorithms preorder inorder postorder.
1 Partition Filter Set for Power- Efficient Packet Classification Authors: Haibin Lu, MianPan Publisher: IEEE GLOBECOM 2006 Present: Chen-Yu Lin Date:
Parallel-Search Trie-based Scheme for Fast IP Lookup
PC-DUOS: Fast TCAM Lookup and Update for Packet Classifiers Author: Tania Banerjee-Mishra, Sartaj Sahni,Gunasekaran Seetharaman Publisher: IEEE Symposium.
1 OC-3072 Packet Classification Using BDDs and Pipelined SRAMs Author: Amit Prakash, Adnan Aziz Publisher: Hot Interconnects 9, Presenter: Hsin-Mao.
4/17/2017 Section 9.3 Tree Traversal ch9.3.
Kymberly Fergusson CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A12 – Binary Trees.
Low Power TCAMs For Very Large Forwarding Tables Authors: Wencheng Lu and Sartaj Sahni Presenter: Yi-Sheng, Lin ( 林意勝 ) Date: May. 13, 2008 Publisher/Conf.
Fast binary and multiway prefix searches for pachet forwarding Author: Yeim-Kuan Chang Publisher: COMPUTER NETWORKS, Volume 51, Issue 3, pp , February.
Three Types of Depth-First Search Alyce Brady CS 470: Data Structures CS 510: Computer Algorithms.
1 Efficient packet classification using TCAMs Authors: Derek Pao, Yiu Keung Li and Peng Zhou Publisher: Computer Networks 2006 Present: Chen-Yu Lin Date:
1 Route Table Partitioning and Load Balancing for Parallel Searching with TCAMs Department of Computer Science and Information Engineering National Cheng.
Data Structures Arrays both single and multiple dimensions Stacks Queues Trees Linked Lists.
Binary Trees 2 Overview Trees. Terminology. Traversal of Binary Trees. Expression Trees. Binary Search Trees.
Tree (new ADT) Terminology:  A tree is a collection of elements (nodes)  Each node may have 0 or more successors (called children)  How many does a.
1 Recursively Partitioned Static IP Router Table Department of Computer Science and Information Engineering National Cheng Kung University, Taiwan R.O.C.
Fast Packet Classification Using Bloom filters Authors: Sarang Dharmapurikar, Haoyu Song, Jonathan Turner, and John Lockwood Publisher: ANCS 2006 Present:
Lecture – Searching a Tree Neil Ghani University of Strathclyde.
Routing Prefix Caching in Network Processor Design Huan Liu Department of Electrical Engineering Stanford University
CLUE: Achieving Fast Update over Compressed Table for Parallel Lookup with Reduced Dynamic Redundancy Author: Tong Yang, Ruian Duan, Jianyuan Lu, Shenjiang.
Compact Trie Forest: Scalable architecture for IP Lookup on FPGAs Author: O˘guzhan Erdem, Aydin Carus and Hoang Le Publisher: ReConFig 2012 Presenter:
1 Power-Efficient TCAM Partitioning for IP Lookups with Incremental Updates Author: Yeim-Kuan Chang Publisher: ICOIN 2005 Presenter: Po Ting Huang Date:
Computer Science 112 Fundamentals of Programming II Introduction to Trees.
Bit Weaving: A Non-Prefix Approach to Compressing Packet Classifiers in TCAMs Author: Chad R. Meiners, Alex X. Liu, and Eric Torng Publisher: 2012 IEEE/ACM.
Binary Trees In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left.
1 Chapter 7 Objectives Upon completion you will be able to: Create and implement binary search trees Understand the operation of the binary search tree.
Traversing a tree means visiting each node in a specified order. There are different ways to traverse a tree. Tree Traversing Depth first search Pre-orderIn-orderPost-order.
Updating Designed for Fast IP Lookup Author : Natasa Maksic, Zoran Chicha and Aleksandra Smiljani´c Conference: IEEE High Performance Switching and Routing.
Data Structures: A Pseudocode Approach with C, Second Edition 1 Chapter 7 Objectives Create and implement binary search trees Understand the operation.
Binary Tree Implementation. Binary Search Trees (BST) Nodes in Left subtree has smaller values Nodes in right subtree has bigger values.
PC-TRIO: A Power Efficient TACM Architecture for Packet Classifiers Author: Tania Banerjee, Sartaj Sahni, Gunasekaran Seetharaman Publisher: IEEE Computer.
Data Structures Azhar Maqsood School of Electrical Engineering and Computer Sciences (SEECS-NUST) Binary Trees.
Lecture 7: Searching a Tree Neil Ghani University of Strathclyde.
Packet Classification Using Multi- Iteration RFC Author: Chun-Hui Tsai, Hung-Mao Chu, Pi-Chung Wang Publisher: 2013 IEEE 37th Annual Computer Software.
IP Address Lookup Masoud Sabaei Assistant professor Computer Engineering and Information Technology Department, Amirkabir University of Technology.
DS.T.1 Trees Chapter 4 Overview Tree Concepts Traversals Binary Trees Binary Search Trees AVL Trees Splay Trees B-Trees.
Scalable Multi-match Packet Classification Using TCAM and SRAM Author: Yu-Chieh Cheng, Pi-Chung Wang Publisher: IEEE Transactions on Computers (2015) Presenter:
Trees Chapter 15.
Inc. 32 nm fabrication process and Intel SpeedStep.
Planning & System installation
Binary Search Tree (BST)
Toward Advocacy-Free Evaluation of Packet Classification Algorithms
Tree.
Section 8.1 Trees.
Abstract Data Structures
CSE 373, Copyright S. Tanimoto, 2002 Binary Trees -
Binary Tree Chapter 8 (cont’) Part2.
Binary Search Trees Chapter 7 Objectives
CSE 373, Copyright S. Tanimoto, 2001 Binary Trees -
Publisher : TRANSACTIONS ON NETWORKING Author : Haoyu Song, Jonathan S
Chapter 20: Binary Trees.
Binary Tree Implementation
Author: Yaron Weinsberg ,Shimrit Tzur-David ,Danny Dolev and Tal Anker
Worst-Case TCAM Rule Expansion
A Binary Tree is a tree in which each node has at most 2 children
Authors: Ding-Yuan Lee, Ching-Che Wang, An-Yeu Wu Publisher: 2019 VLSI
Packet Classification Using Binary Content Addressable Memory
Presentation transcript:

Low-Power TCAMs for Very Large Forwarding Tables Authors: Wencheng Lu and Sartaj Sahni, Fellow, IEEE Conf. : IEEE/ACM Transactions on networking, 2010 Presenter : JHAO-YAN JIAN Date : 2011/3/15

The simplest TCAM solution The simplest TCAM solution to packet forwarding requires one TCAM search and one SRAM access to forward a packet. The power consumption is that for a TCAM of this size.

SUBTREE SPLIT(CoolCAM)

POSTORDER SPLIT(CoolCAM)

SUBTREE SPLIT

SUBTREE SPLIT

POSTORDER SPLIT The DTCAM buckets are filled using as many rounds of feasible tree carving and packing as needed to completely carve out . In each round, we select the bucket B with the fewest forwarding-table prefixes. The preorder traversal.

POSTORDER SPLIT(SP1)

POSTORDER SPLIT(SP2)

SIMPLE TCAM WITH WIDE SRAM

SIMPLE TCAM WITH WIDE SRAM 25 (50) is a rather crude estimate of the number of instructions needed to process a 72-bit (144-bit) suffix node. We can make 100 M SRAM accesses per second using a 10-ns SRAM and perform about 20 G instruction per second using a 3.2-GHz dual-core processor. Therefore, about 200 instructions can be executed in the time it takes to make an SRAM access. The time to process a 72-bit (144-bit) suffix node is only about 1/8 (1/4) that of an SRAM access.

EXPERIMENTAL RESULTS(1)

EXPERIMENTAL RESULTS(2)

EXPERIMENTAL RESULTS(3)

EXPERIMENTAL RESULTS(4)

EXPERIMENTAL RESULTS(5)