Packet Classification on Multiple Fields 참고 논문 : Pankaj Gupta and Nick McKeown SigComm 1999.

Slides:



Advertisements
Similar presentations
Access Control List (ACL)
Advertisements

August 17, 2000 Hot Interconnects 8 Devavrat Shah and Pankaj Gupta
Router/Classifier/Firewall Tables Set of rules—(F,A)  F is a filter Source and destination addresses. Port number and protocol. Time of day.  A is an.
Fast Updating Algorithms for TCAMs Devavrat Shah Pankaj Gupta IEEE MICRO, Jan.-Feb
Packet Classification using Hierarchical Intelligent Cuttings
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.
OpenFlow overview Joint Techs Baton Rouge. Classic Ethernet Originally a true broadcast medium Each end-system network interface card (NIC) received every.
Fast Firewall Implementation for Software and Hardware-based Routers Lili Qiu, Microsoft Research George Varghese, UCSD Subhash Suri, UCSB 9 th International.
© 2009 Cisco Systems, Inc. All rights reserved. SWITCH v1.0—4-1 Implementing Inter-VLAN Routing Deploying Multilayer Switching with Cisco Express Forwarding.
Ultra-High Throughput Low-Power Packet Classification
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.
Survey of Packet Classification Algorithms. Outline Background and problem definition Classification schemes – One dimensional classification – Two dimensional.
1 TCAM Razor: A Systematic Approach Towards Minimizing Packet Classifiers in TCAMs Department of Computer Science and Information Engineering National.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—4-1 Managing IP Traffic with ACLs Introducing ACLs.
ClassBench: A Packet Classification Benchmark
Efficient Multi-match Packet Classification with TCAM Fang Yu Randy H. Katz EECS Department, UC Berkeley {fyu,
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.
CS 268: Route Lookup and Packet Classification Ion Stoica March 11, 2003.
Efficient Multi-Match Packet Classification with TCAM Fang Yu
1 Energy Efficient Packet Classification Hardware Accelerator Alan Kennedy, Xiaojun Wang HDL Lab, School of Electronic Engineering, Dublin City University.
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.
Packet Classification George Varghese. Original Motivation: Firewalls Firewalls use packet filtering to block say ssh and force access to web and mail.
CS 268: Route Lookup and Packet Classification
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.
March 1, Packet Classification and Filtering for Network Processors JC Ho.
Chapter 9 Classification And Forwarding. Outline.
Cs6390 summer 2000 Tradeoffs for Packet Classification 1 Tradeoffs for Packet Classification Members: Jinxiao Song & Yan Tong.
1 Efficient packet classification using TCAMs Authors: Derek Pao, Yiu Keung Li and Peng Zhou Publisher: Computer Networks 2006 Present: Chen-Yu Lin Date:
Workpackage 3 New security algorithm design ICS-FORTH Paris, 30 th June 2008.
ECE 526 – Network Processing Systems Design Network Processor Architecture and Scalability Chapter 13,14: D. E. Comer.
SIGCOMM 2002 New Directions in Traffic Measurement and Accounting Focusing on the Elephants, Ignoring the Mice Cristian Estan and George Varghese University.
Applied Research Laboratory Edward W. Spitznagel 7 October Packet Classification for Core Routers: Is there an alternative to CAMs? Paper by: Florin.
Access Control List (ACL) W.lilakiatsakun. ACL Fundamental ► Introduction to ACLs ► How ACLs work ► Creating ACLs ► The function of a wildcard mask.
Timothy Whelan Supervisor: Mr Barry Irwin Security and Networks Research Group Department of Computer Science Rhodes University Hardware based packet filtering.
Vladimír Smotlacha CESNET Full Packet Monitoring Sensors: Hardware and Software Challenges.
Access Control List (ACL)
ECE 526 – Network Processing Systems Design Networking: protocols and packet format Chapter 3: D. E. Comer Fall 2008.
Wire Speed Packet Classification Without TCAMs ACM SIGMETRICS 2007 Qunfeng Dong (University of Wisconsin-Madison) Suman Banerjee (University of Wisconsin-Madison)
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,
1. Outline Introduction Related work on packet classification Grouper Performance Analysis Empirical Evaluation Conclusions 2/42.
1 Packet Classification تنظیم : محمدعلی عظیمی. Classifier Example 2.
1 Fast packet classification for two-dimensional conflict-free filters Department of Computer Science and Information Engineering National Cheng Kung University,
SCALABLE PACKET CLASSIFICATION USING INTERPRETING A CROSS-PLATFORM MULTI-CORE SOLUTION Author: Haipeng Cheng, Zheng Chen, Bei Hua and Xinan Tang Publisher/Conf.:
Efficient Cache Structures of IP Routers to Provide Policy-Based Services Graduate School of Engineering Osaka City University
Restricting Access in the network
A Smart Pre-Classifier to Reduce Power Consumption of TCAMs for Multi-dimensional Packet Classification Yadi Ma, Suman Banerjee University of Wisconsin-Madison.
Workpackage 3 New security algorithm design ICS-FORTH Ipswich 19 th December 2007.
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.
Packet classification on Multiple Fields Authors: Pankaj Gupta and Nick McKcown Publisher: ACM 1999 Presenter: 楊皓中 Date: 2013/12/11.
Packet Classification Using Multidimensional Cutting Sumeet Singh (UCSD) Florin Baboescu (UCSD) George Varghese (UCSD) Jia Wang (AT&T Labs-Research) Reviewed.
Dynamic Algorithms with Worst-case Performance for Packet Classification Pankaj Gupta and Nick McKeown Stanford University {pankaj,
A Fast and Scalable IPv6 Packet Classification Author: Xiaoju Zhou, Xiaohong Huang, Qiong Sun, Wei Yang, Yan Ma Publisher: Network Infrastructure and Digital.
Hierarchical packet classification using a Bloom filter and rule-priority tries Source : Computer Communications Authors : A. G. Alagu Priya 、 Hyesook.
Author : Lynn Choi, Hyogon Kim, Sunil Kim, Moon Hae Kim Publisher/Conf : IEEE/ACM TRANSACTIONS ON NETWORKING Speaker : De yu Chen Data :
Packet Classification Using Multi- Iteration RFC Author: Chun-Hui Tsai, Hung-Mao Chu, Pi-Chung Wang Publisher: 2013 IEEE 37th Annual Computer Software.
By: Yaron Levy Supervisors: Dr. Shlomo Greenberg Mr. Hagai David.
IP Routers – internal view
Transport Layer Systems Packet Classification
Implementing an OpenFlow Switch on the NetFPGA platform
Presentation transcript:

Packet Classification on Multiple Fields 참고 논문 : Pankaj Gupta and Nick McKeown SigComm 1999

2 IP Lookup Longest-prefix address lookup Rule: Each Prefix Action: Next hop Classifier: Forwarding table

3 Outline Packet Classification Application, Information, Characteristics Design Goal Previous Work Recursive Flow Classification (RFC)

4 Packet classification (Application) Packet Filtering Deny all traffic from ISP3 destined to E2 Accounting & Billing Treat all video traffic to E1 as highest priority and perform accounting for the traffic sent this way

5 Packet classification (Application)

6 Packet Header

7 Example

8 Example (Cont.)

9 Definition of Packet Classification Each rule Specifies a class Based on criterion on F fields Associates with an identifier, classID i-th component of the rule R, R[i]  A regular expression on the i-th filed of the packet header

10 Characteristics of P-C 793 packet classifiers 101 different ISP and enterprise networks Total rules ? Data representative? Conclusion: Trivial or non-trivial?

11 Distribution of total number of rules per classifier

12 Characteristics 1 The classifiers do not contain a large number of rules. 0.7% of the classifiers contain more than 1000 rules Mean number: 50 rules

13 Characteristics 2 The syntax allows a maximum of 8 fields to be specified: Source/destination Network-Layer address(32-bits) Source/destination Transport-layer port number(16-bits for TCP/UDP) Type-of-service field(8-bits) Protocol field (8-bits) Transport-Layer protocol flags(8-bits)

14 Characteristics 3-4 Transport-Layer protocol field is restricted to a small set of values: TCP, UDP, ICMP, IGMP, (E)IGRP, GRE and IPINIP or wildcard Transport-layer fields Many (10.2%) are range specifications

15 Characteristics % of all the classifiers had a rule with a non-contiguous mask. Many different rules share a number of field specifications.

16 Characteristics 7 Redundant Backward redundancy  Rule T appears earlier than Rule R, and R is a subset of T. Forward redundancy  Rule T apperas after R R is a subset of T R, T have the same action Rules inbetween R and T The same action Disjoint from R. 8% of the rules were redundant.

17 Goals Fast enough Matching on arbitrary fields Support general classification rules Prefixes, operators(like range, less than, greater than…) and wildcards. Suitable for software and hardware implementation Memory efficient Scalability For steady classifier

18 Previous Work Sequential evaluations Grid of Tries Crossproducting Bit-level parallelism TCAM

19 Abstract The point location problem in multidimensional space Find the enclosing region of a point, given a set of regions. Complexity O(logn) in time with O(n F ) space O(log F-1 n) time with O(n) space

20 Structure of classifiers

21 Overlapping is small For the biggest classifier with 1734 rules, the number of distinct overlapping regions in four dimensions to be 4316, compared to a worst possible case of approximately

22 Recursive Flow Classification

23 Chunks of Packet header

24 Packet flow in RFC

25 Phase number =3

26 Phase number =4

27 Select Phase number Combine those chunks together which have the most “correlation”. Combine as many chunks as possible without causing unreasonable memory consumption. Best case: P=3 Tree B P=4 Tree A

28 Performance (Storage requirement for P=2)

29 Performance (Storage requirement for P=3)

30 Performance (Storage requirement for P=4)

31 Preprocess Time

32 Hardware implementation

33 Larger classifiers I Concatenating the classifiers belonging to the same network.

34 Larger classifiers II Concatenate all the classifiers of a few (up to ten) different networks. RFC frequently runs into storage problems for classifiers with more than 6000 rules.

35 Variations Process a larger number of fields in each packet header. Use available fast lookup algorithms Use Adjacency group

36 Adjacency Groups Two rules (R, S)are considered adjacent R appears first The same Action All but one field have the same specification All rules in between R and S  Either have the same action  Disjoint from R

37 An example

38 Storage (Adjacency groups)

39 Comments Trade off? Memory, Speed, Dynamic Change, etc Application and Demand oriented Further discussion? Thank you!