A Smart Pre-Classifier to Reduce Power Consumption of TCAMs for Multi-dimensional Packet Classification Yadi Ma, Suman Banerjee University of Wisconsin-Madison.

Slides:



Advertisements
Similar presentations
August 17, 2000 Hot Interconnects 8 Devavrat Shah and Pankaj Gupta
Advertisements

Packet Classification using Hierarchical Intelligent Cuttings
Multi-dimensional Packet Classification on FPGA: 100Gbps and Beyond
1 IP-Lookup and Packet Classification Advanced Algorithms & Data Structures Lecture Theme 08 – Part I Prof. Dr. Th. Ottmann Summer Semester 2006.
Balajee Vamanan, Gwendolyn Voskuilen, and T. N. Vijaykumar School of Electrical & Computer Engineering SIGCOMM 2010.
1 An Efficient, Hardware-based Multi-Hash Scheme for High Speed IP Lookup Hot Interconnects 2008 Socrates Demetriades, Michel Hanna, Sangyeun Cho and Rami.
Fast Firewall Implementation for Software and Hardware-based Routers Lili Qiu, Microsoft Research George Varghese, UCSD Subhash Suri, UCSB 9 th International.
Bio Michel Hanna M.S. in E.E., Cairo University, Egypt B.S. in E.E., Cairo University at Fayoum, Egypt Currently is a Ph.D. Student in Computer Engineering.
IP Routing Lookups Scalable High Speed IP Routing Lookups.
HybridCuts: A Scheme Combining Decomposition and Cutting for Packet Classification Author: Wenjun Li, Xianfeng Li Publisher: 2013 IEEE 21 st Annual Symposium.
Outline Introduction Related work on packet classification Grouper Performance Empirical Evaluation Conclusions.
A Ternary Unification Framework for Optimizing TCAM-Based Packet Classification Systems Author: Eric Norige, Alex X. Liu, and Eric Torng Publisher: ANCS.
1 TCAM Razor: A Systematic Approach Towards Minimizing Packet Classifiers in TCAMs Department of Computer Science and Information Engineering National.
Low Power TCAM Forwarding Engine for IP Packets Authors: Alireza Mahini, Reza Berangi, Seyedeh Fatemeh and Hamidreza Mahini Presenter: Yi-Sheng, Lin (
Subscription Subsumption Evaluation for Content-Based Publish/Subscribe Systems Hojjat Jafarpour, Bijit Hore, Sharad Mehrotra, and Nalini Venkatasubramanian.
Fast Filter Updates for Packet Classification using TCAM Authors: Haoyu Song, Jonathan Turner. Publisher: GLOBECOM 2006, IEEE Present: Chen-Yu Lin Date:
Worst-Case TCAM Rule Expansion Ori Rottenstreich (Technion, Israel) Joint work with Isaac Keslassy (Technion, Israel)
Packet Classification on Multiple Fields Pankaj Gupta and Nick McKeown Stanford University {pankaj, September 2, 1999.
1 Energy Efficient Multi-match Packet Classification with TCAM Fang Yu
CS 268: Lectures 13/14 (Route Lookup and Packet Classification) Ion Stoica April 1/3, 2002.
Efficient Multidimensional Packet Classification with Fast Updates Author: Yeim-Kuan Chang Publisher: IEEE TRANSACTIONS ON COMPUTERS, VOL. 58, NO. 4, APRIL.
1 Partition Filter Set for Power- Efficient Packet Classification Authors: Haibin Lu, MianPan Publisher: IEEE GLOBECOM 2006 Present: Chen-Yu Lin Date:
PC-DUOS: Fast TCAM Lookup and Update for Packet Classifiers Author: Tania Banerjee-Mishra, Sartaj Sahni,Gunasekaran Seetharaman Publisher: IEEE Symposium.
1 A Fast IP Lookup Scheme for Longest-Matching Prefix Authors: Lih-Chyau Wuu, Shou-Yu Pin Reporter: Chen-Nien Tsai.
Two stage packet classification using most specific filter matching and transport level sharing Authors: M.E. Kounavis *,A. Kumar,R. Yavatkar,H. Vin Presenter:
An Efficient IP Lookup Architecture with Fast Update Using Single-Match TCAMs Author: Jinsoo Kim, Junghwan Kim Publisher: WWIC 2008 Presenter: Chen-Yu.
Algorithms for Advanced Packet Classification with TCAMs Karthik Lakshminarayanan UC Berkeley Joint work with Anand Rangarajan and Srinivasan Venkatachary.
1 Wire Speed Packet Classification Without TCAMs: A Few More Registers (And A Bit of Logic) Are Enough Author: Qunfeng Dong, Suman Banerjee, Jia Wang, Dheeraj.
EaseCAM: An Energy And Storage Efficient TCAM-based IP-Lookup Architecture Rabi Mahapatra Texas A&M University;
Worst-Case TCAM Rule Expansion Ori Rottenstreich (Technion, Israel) Joint work with Isaac Keslassy (Technion, Israel)
Cs6390 summer 2000 Tradeoffs for Packet Classification 1 Tradeoffs for Packet Classification Members: Jinxiao Song & Yan Tong.
1 Route Table Partitioning and Load Balancing for Parallel Searching with TCAMs Department of Computer Science and Information Engineering National Cheng.
PARALLEL TABLE LOOKUP FOR NEXT GENERATION INTERNET
Applied Research Laboratory Edward W. Spitznagel 7 October Packet Classification for Core Routers: Is there an alternative to CAMs? Paper by: Florin.
Multi-dimensional Packet Classification on FPGA 100 Gbps and Beyond Author: Yaxuan Qi, Jeffrey Fong, Weirong Jiang, Bo Xu, Jun Li, Viktor Prasanna Publisher:
Author: Haoyu Song, Fang Hao, Murali Kodialam, T.V. Lakshman Publisher: IEEE INFOCOM 2009 Presenter: Chin-Chung Pan Date: 2009/12/09.
ORange: Multi Field OpenFlow based Range Classifier Liron Schiff Tel Aviv University Yehuda Afek Tel Aviv University Anat Bremler-Barr Inter Disciplinary.
Wire Speed Packet Classification Without TCAMs ACM SIGMETRICS 2007 Qunfeng Dong (University of Wisconsin-Madison) Suman Banerjee (University of Wisconsin-Madison)
Fast Packet Classification Using Bloom filters Authors: Sarang Dharmapurikar, Haoyu Song, Jonathan Turner, and John Lockwood Publisher: ANCS 2006 Present:
Packet Classification on Multiple Fields 참고 논문 : Pankaj Gupta and Nick McKeown SigComm 1999.
Packet Classifiers In Ternary CAMs Can Be Smaller Qunfeng Dong (University of Wisconsin-Madison) Suman Banerjee (University of Wisconsin-Madison) Jia Wang.
Multi-Field Range Encoding for Packet Classification in TCAM Author: Yeim-Kuan Chang, Chun-I Lee and Cheng-Chien Su Publisher: INFOCOM 2011 Presenter:
Applied Research Laboratory Edward W. Spitznagel 24 October Packet Classification using Extended TCAMs Edward W. Spitznagel, Jonathan S. Turner,
Balajee Vamanan and T. N. Vijaykumar School of Electrical & Computer Engineering CoNEXT 2011.
Author : Guangdeng Liao, Heeyeol Yu, Laxmi Bhuyan Publisher : Publisher : DAC'10 Presenter : Jo-Ning Yu Date : 2010/10/06.
1. Outline Introduction Related work on packet classification Grouper Performance Analysis Empirical Evaluation Conclusions 2/42.
IP Address Lookup Masoud Sabaei Assistant professor
StrideBV: Single chip 400G+ packet classification Author: Thilan Ganegedara, Viktor K. Prasanna Publisher: HPSR 2012 Presenter: Chun-Sheng Hsueh Date:
1 Packet Classification تنظیم : محمدعلی عظیمی. Classifier Example 2.
Scalable High Speed IP Routing Lookups Scalable High Speed IP Routing Lookups Authors: M. Waldvogel, G. Varghese, J. Turner, B. Plattner Presenter: Zhqi.
High-Speed Policy-Based Packet Forwarding Using Efficient Multi-dimensional Range Matching Lakshman and Stiliadis ACM SIGCOMM 98.
Cross-Product Packet Classification in GNIFS based on Non-overlapping Areas and Equivalence Class Author: Mohua Zhang, Ge Li Publisher: AISS 2012 Presenter:
CS 740: Advanced Computer Networks IP Lookup and classification Supplemental material 02/05/2007.
1 Bit Weaving: A Non-Prefix Approach to Compressing Packet Classifiers in TCAMs Author: Chad R. Meiners, Alex X. Liu, and Eric Torng Publisher: IEEE/ACM.
Packet Classification Using Multidimensional Cutting Sumeet Singh (UCSD) Florin Baboescu (UCSD) George Varghese (UCSD) Jia Wang (AT&T Labs-Research) Reviewed.
Author: Weirong Jiang and Viktor K. Prasanna Publisher: The 18th International Conference on Computer Communications and Networks (ICCCN 2009) Presenter:
On-Chip Logic Minimization Roman Lysecky & Frank Vahid* Department of Computer Science and Engineering University of California, Riverside *Also with the.
IP Routing table compaction and sampling schemes to enhance TCAM cache performance Author: Ruirui Guo a, Jose G. Delgado-Frias Publisher: Journal of Systems.
A NOVEL LEVEL-BASED IPV6 ROUTING LOOKUP ALGORITHM Author: Xiaohong Huang, Xiaoyu Zhao, Guofeng Zhao, Wenjian Jiang, Dongqu Zheng, Qiong Sun and Yan Ma.
1 IP Routing table compaction and sampling schemes to enhance TCAM cache performance Author: Ruirui Guo, Jose G. Delgado-Frias Publisher: Journal of Systems.
Hierarchical packet classification using a Bloom filter and rule-priority tries Source : Computer Communications Authors : A. G. Alagu Priya 、 Hyesook.
DRES: Dynamic Range Encoding Scheme for TCAM Coprocessors 2008 YU-ANTL Lab Seminar June 11, 2008 JeongKi Park Advanced Networking Technology Lab. (YU-ANTL)
A Classification for Access Control List To Speed Up Packet-Filtering Firewall CHEN FAN, LONG TAN, RAWAD FELIMBAN and ABDELSHAKOUR ABUZNEID Department.
Scalable Multi-match Packet Classification Using TCAM and SRAM Author: Yu-Chieh Cheng, Pi-Chung Wang Publisher: IEEE Transactions on Computers (2015) Presenter:
Toward Advocacy-Free Evaluation of Packet Classification Algorithms
Transport Layer Systems Packet Classification
Packet Classification Using Coarse-Grained Tuple Spaces
Authors: Ding-Yuan Lee, Ching-Che Wang, An-Yeu Wu Publisher: 2019 VLSI
MEET-IP Memory and Energy Efficient TCAM-based IP Lookup
Packet Classification Using Binary Content Addressable Memory
Presentation transcript:

A Smart Pre-Classifier to Reduce Power Consumption of TCAMs for Multi-dimensional Packet Classification Yadi Ma, Suman Banerjee University of Wisconsin-Madison

Packet classification R Internet S1 S2 Subnet ASubnet B D FromToTraffic typeAction S1DPort 80Forward via L1 S2D*Drop all traffic AB*Reserve 50 Mbps L1 L2 Classifier at Router R

Definition Packet classification: given a classifier, find the first (highest priority) matching rule for each incoming packet A classifier contains a set of rules ordered by priority Our focus: n-tuple classification Example classifier: Given a packet header: ( , , 80,1040, UDP) Rule #Source IPDest. IPSource PortDest. PortProtocolAction 1* *.* *TCPdeny ** UDPdeny ** *UDPdeny 4*****permit

Packet classification schemes Software-based schemes –Tradeoff between memory usage and speed –Examples: HiCuts, HyperCuts, EffiCuts, etc Hardware (TCAM)-based schemes –Popular for high-throughput packet classification

TCAM TCAM (Ternary Content Addressable Memory) TCAM Result A 18Mbit TCAM stores ~ 100K IPv4 rules, consumes up to 15W/Gbps! Problem: Lookups in large classifiers (>100k rules) burns a lot of power! High power consumption Used blocks Unused blocks

Problem Statement TCAMs are power-hungry Design a TCAM-based method that: –Greatly reduces power consumption of TCAMs, especially for large classifiers –Uses commodity TCAMs –Is easy to implement

Activate a small number of blocks? Result TCAM How to know which blocks to activate? Low power consumption

Our approach: SmartPC Result Pre-classifier Low power consumption SmartPC: Smart Pre-Classifier –Two-stage classification system Challenge: How to build an efficient pre-classifier?

Outline Introduction and motivation Design of SmartPC –Algorithms to manage two-stage classification Evaluation methods and results Conclusion

Packet classification system for SmartPC Two-stage classification –First stage: pre-classifier –Second stage: two parallel searches Index TCAM (Pre-classifier entries) Match index Index SRAM TCAM (Classifier rules) Associated SRAM (priorities + actions) “General” blocks Priority resolution Action “Specific” block How to build an efficient pre-classifier?

Pre-classifier How to build a pre-classifier? –Built on two dimensions: source IP address and destination IP addresses –By expanding and combining two dimensional rules recursively Also shuffle original rules into different TCAM blocks accordingly

Why 5d to 2d is a good choice? Maximum number of overlapping rules in the two-dimensional space Analyze more than 200 real classifiers ranging in size from 3 to 15,181 Maximum number of overlapping rules is an order of magnitude smaller than classifier size.

An example classifier containing 14 rules

Regular TCAM Rules are stored in order by priority Result Suppose block size = 5 TCAM 0,1,2,3,45, 6, 7,8,9 10,11,12,13 0,1,2,3,45, 6, 7,8,9 10,11,12,13

Same example classifier containing 14 rules

16 SmartPC / /12/13 Dst_addr Src_addr P0 P1 P0,P1 TCAM Pre-classifier

17 SmartPC / /12/13 Dst_addr Src_addr P0 P1 0,1,5,6,8 P0,P1 TCAM Pre-classifier

18 SmartPC / /12/13 Dst_addr Src_addr P0 P1 0,1,5,6,82, 3,4,9,10 P0,P1 Specific blocks TCAM Pre-classifier

19 SmartPC / /12/13 Dst_addr Src_addr P0 P1 0,1,5,6,82, 3,4,9,10 P0,P1 TCAM Pre-classifier General block 7,11,12,13 Specific blocks

20 SmartPC / /12/13 Dst_addr Src_addr P0 P1 0,1,5,6,82, 3,4,9,10 7,11,12,13P0,P1 packet Specific blocks General block TCAM P0,P1 0,1,5,6,8 7,11,12,13 Pre-classifier

21 Example: how to build a pre-classifier / /12/13 Dst_addr Src_addr P0 2

22 Example: how to build a pre-classifier / /12/13 Dst_addr Src_addr P0 0 2

23 Example: how to build a pre-classifier / /12/13 Dst_addr Src_addr P0 0 2, 1

24 Example: how to build a pre-classifier / /12/13 Dst_addr Src_addr P0 0 2, 1

25 Example: how to build a pre-classifier / /12/13 Dst_addr Src_addr P0 0 2, 1, 5, 6

26 Example: how to build a pre-classifier / /12/13 Dst_addr Src_addr P0 0 2, 1, 5, 6 7

27 Example: how to build a pre-classifier / /12/13 Dst_addr Src_addr P0 0 2, 1, 5, 6 7, 8

28 Example: how to build a pre-classifier / /12/13 Dst_addr Src_addr P0 0 2, 1, 5, 6 7,11,12,13, 8

29 Example: how to build a pre-classifier / /12/13 Dst_addr Src_addr P0 0 2, 1, 5, 6 7,11,12,13, 8 P1, P1

30 Example: how to build a pre-classifier / /12/13 Dst_addr Src_addr P0 0, 1, 5, 6 7,11,12,13, 8 P1 2, 3,4,9,10, P1 Specific blocks General block Pre-classifier packet

31 Index TCAM (Pre-classifier entries) Match index Incoming packet Index SRAM 0, 1, 5, 6, 8 7, 11, 12, 13 TCAM (Classifier rules) Associated SRAM (priorities + actions) General block(s) 1, accept Priority resolution accept 7, deny P0 P1 2,3, 4, 9, 10 Specific block Packet classification system for SmartPC 0, 1, 5, 6, 8 7, 11, 12, 13 1, accept 7, deny

Properties of pre-classifiers Entries in a pre-classifier are non-overlapping Each rule in a classifier is either covered by only one pre-classifier entry, or marked as general

Rule update Rule update overhead of SmartPC is generally smaller than that of regular TCAMs The ordering of TCAM entries is kept within one specific block or within a small number of general blocks, rather than throughout all the blocks Rule update –Insert a rule –Delete a rule

Outline Introduction and motivation Design of SmartPC –Algorithms to manage two-stage classification Evaluation methods and results Conclusion

Experimental setup (1) Summary of classifiers NameSizeMaxOveralpsWildcard S S S S S S S S S S real classifiers10 synthetic classifiers NameSizeMaxOveralpsWildcard R R R R R R R R R R

Experimental setup (2) Block size of TCAMs –Evaluated various sizes: 32, 64, 128, 256, 512 and 1024, respectively. Metric –Power reductions Percentage of reductions on activated blocks –Storage overhead of pre-classifier entries Percentage of pre-classifier size compared to the size of a whole classifier Schemes –SmartPC –Default TCAM (without SmartPC) –A naïve scheme named Naive-divide

Power reductions With block size 128, the median and average power reductions are 91% and 88%, respectively Real classifiers Synthetic classifiers Percentage of power reductions vs. TCAM block size

Storage overhead Real classifiers Synthetic classifiers Small storage overhead, less than 4% for every classifier. Fraction of storage overhead vs. TCAM block size

Comparison of SmartPC with Naïve-divide Real classifiersSynthetic classifiers SmartPC outperforms naïve-divide by more than 20% on average. Percentage of power reductions with block size 128

Discussion Effect of prefix distribution and prefix length Power reduction on small classifiers Power reduction on IPv6 classifiers

Conclusion Uses commodity TCAMs Is easy to implement Greatly reduces power consumptions of TCAMs, especially for larger classifiers Propose SmartPC, which:

Questions

Thanks