Packet Classification Packet Classification, D.-C. Fleury & D. Francis, 2002-03-14. This document was prepared by Denis-Claude Fleury & Dany Francis in partial fulfillment of the requirements for the course ELG/CEG4183. Presentation Summary What is Packet Classification
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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Packet Classification, D.-C. Fleury & D. Francis, 2002-03-14.
This document was prepared by Denis-Claude Fleury & Dany Francis in partial fulfillment of the requirements for the course ELG/CEG4183.
Packet Classification is:
Packet classification is important for applications such as:
Internet: Mesh of Routers 
Background: Motivation of Packet Classification is the need for Differentiated Services 
Problem Definition :
Given a classifier C with N rules, Rj, 1 j N, where Rj consists of three entities:
Classifier (policy database)
Direction of transmission of packet
Transport layer header
Network layer header
DA = Destination Address
SA = Source Address
PROT = Protocol
SP = Source port
DP = Destination port
L2 = layer 2 (e.g., Ethernet)
L3 = layer 3 (e.g., IP)
L4 = layer 4 (e.g., TCP)
Performance metrics for classification algorithms 
Classification algorithms 
One possible Algorithm:
Use binary tree paths to encode prefixes.
E.g. 001xx 2
Here using IP addressing rules:
Packet with destination address 22.214.171.124 is sent to interface 2, as 12.82.100.xxx is the longest prefix matching packet's destination address: