GB2377528A - A method and apparatus for wire-speed application layer classification of data packets - Google Patents

A method and apparatus for wire-speed application layer classification of data packets

Info

Publication number
GB2377528A
GB2377528A GB0223453A GB0223453A GB2377528A GB 2377528 A GB2377528 A GB 2377528A GB 0223453 A GB0223453 A GB 0223453A GB 0223453 A GB0223453 A GB 0223453A GB 2377528 A GB2377528 A GB 2377528A
Authority
GB
United Kingdom
Prior art keywords
bit
memory
wire
data packets
hash
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
GB0223453A
Other versions
GB2377528B (en
GB0223453D0 (en
Inventor
Nun Michael Ben
Sagi Ravid
Itzhak Barak
Offer Weil
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
P Cube Ltd
Original Assignee
P Cube Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by P Cube Ltd filed Critical P Cube Ltd
Priority to GB0409365A priority Critical patent/GB2399199B/en
Publication of GB0223453D0 publication Critical patent/GB0223453D0/en
Publication of GB2377528A publication Critical patent/GB2377528A/en
Application granted granted Critical
Publication of GB2377528B publication Critical patent/GB2377528B/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/745—Address table lookup; Address filtering
    • H04L45/7453—Address table lookup; Address filtering using hashing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/19—Flow control; Congestion control at layers above the network layer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A data packet classifier to classify a plurality of N-bit input tuples, said classifier comprising a hash address, a memory and a comparison unit. The hash address generator generate a plurality of M-bit hash addresses from said plurality of N-bit input tuples, wherein M is significantly smaller than N. The memory has a plurality of memory entries and is addressable by said plurality of M-bit hash addresses, each such address corresponding to a plurality of memory entries, each of said plurality of memory entries capable of storing one of said plurality of N-bit tuples and an associated process flow information. The comparison unit determines if an incoming N-bit tuple can be matched with a stored N-bit tuple. The associated process flow information is output if a match is found and wherein a new entry is created in the memory for the incoming N-bit tuple if a match is not found.
GB0223453A 2000-04-11 2001-04-04 A method for wire-speed generation of an m-bit hash address from an n-bit tuple of a packet Expired - Lifetime GB2377528B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
GB0409365A GB2399199B (en) 2000-04-11 2001-04-04 A method and apparatus for wire-speed application layer classification of data packets

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US54703400A 2000-04-11 2000-04-11
PCT/IB2001/000697 WO2001078309A2 (en) 2000-04-11 2001-04-04 A method and apparatus for wire-speed application layer classification of data packets

Publications (3)

Publication Number Publication Date
GB0223453D0 GB0223453D0 (en) 2002-11-13
GB2377528A true GB2377528A (en) 2003-01-15
GB2377528B GB2377528B (en) 2004-10-27

Family

ID=24183070

Family Applications (1)

Application Number Title Priority Date Filing Date
GB0223453A Expired - Lifetime GB2377528B (en) 2000-04-11 2001-04-04 A method for wire-speed generation of an m-bit hash address from an n-bit tuple of a packet

Country Status (3)

Country Link
AU (1) AU4870801A (en)
GB (1) GB2377528B (en)
WO (1) WO2001078309A2 (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7209996B2 (en) * 2001-10-22 2007-04-24 Sun Microsystems, Inc. Multi-core multi-thread processor
US7093092B2 (en) 2002-12-10 2006-08-15 Isic Corporation Methods and apparatus for data storage and retrieval
CN1633111B (en) * 2005-01-14 2010-04-28 中国科学院计算技术研究所 High-speed network traffic flow classification method
JP6323099B2 (en) * 2014-03-20 2018-05-16 カシオ計算機株式会社 Display device, terminal device, and program
US10721160B2 (en) 2014-05-15 2020-07-21 Samsung Electronics Co., Ltd. Method of distributing data and device supporting the same

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0694845A1 (en) * 1994-07-28 1996-01-31 Sun Microsystems, Inc. Low-latency memory indexing method and structure
WO1999013620A2 (en) * 1997-09-09 1999-03-18 Sics A lookup device and a method for classification and forwarding of packets in packet-switched networks
US5920900A (en) * 1996-12-30 1999-07-06 Cabletron Systems, Inc. Hash-based translation method and apparatus with multiple level collision resolution

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0694845A1 (en) * 1994-07-28 1996-01-31 Sun Microsystems, Inc. Low-latency memory indexing method and structure
US5920900A (en) * 1996-12-30 1999-07-06 Cabletron Systems, Inc. Hash-based translation method and apparatus with multiple level collision resolution
WO1999013620A2 (en) * 1997-09-09 1999-03-18 Sics A lookup device and a method for classification and forwarding of packets in packet-switched networks

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
CHANDRANMENON G P ET AL:"TRADING PACKET HEADERS FOR PACKET PROCESSING"IEEE/ACM TRANSACTIONS ON NETWORKING,IEEE INC.NEW YORK,US,vol.4,no.2,01/04/96 pp 141-152,XP000582666 ISSN:1063-6692 abs p 144,col 1,line 41-54 p 144,col 2,line 30-p 145,col1,line 4 p 146,col 1,line 40-46 fig 1 *
RAMAKRISHNA M V ET AL:"Perfect hashing functions for hardware applications"PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON DATA ENGINEERING.KOBE,JP,8-12/04/91,LOS ALAMITOS,IEEE COMP.SOC.PRESS,US,vol.CONF.7,(08/04/91),pp 464-470,XP010022765 ISBN:0-8186-2138-9 p.466,col.2,line 7-p.467,col.2,line 4 p469 *

Also Published As

Publication number Publication date
WO2001078309A3 (en) 2002-05-16
GB2377528B (en) 2004-10-27
AU4870801A (en) 2001-10-23
GB0223453D0 (en) 2002-11-13
WO2001078309A2 (en) 2001-10-18

Similar Documents

Publication Publication Date Title
AU2003228273A1 (en) Vlan table management for memory efficient lookups and inserts in hardware-based packet switches
US8780926B2 (en) Updating prefix-compressed tries for IP route lookup
US9647941B2 (en) Hierarchical hashing for longest prefix matching
US20060248095A1 (en) Efficient RAM lookups by means of compressed keys
US8489849B2 (en) Method for paramaterized application specific integrated circuit (ASIC)/field programmable gate array (FPGA) memory-based ternary content addressable memory (TCAM)
US8571023B2 (en) Methods and Apparatus Related to Packet Classification Based on Range Values
US7933282B1 (en) Packet classification device for storing groups of rules
Bando et al. FlashTrie: beyond 100-Gb/s IP route lookup using hash-based prefix-compressed trie
US8599859B2 (en) Iterative parsing and classification
WO2020114239A1 (en) Multicast message processing method and apparatus, storage medium and processor
JP2010506322A (en) Improvements to pattern detection
US20170286006A1 (en) Pipelined hash table with reduced collisions
CN101620623A (en) Method and device for managing list item of content addressable memory CAM
Lim et al. High speed IP address lookup architecture using hashing
CN106713144A (en) Read-write method of message exit information and forwarding engine
Nikitakis et al. A memory-efficient FPGA-based classification engine
US7409526B1 (en) Partial key hashing memory
GB2377528A (en) A method and apparatus for wire-speed application layer classification of data packets
US6671771B2 (en) Hash CAM having a reduced width comparison circuitry and its application
US9305115B1 (en) Method and apparatus for reducing power consumption during rule searches in a content search system
TWI239476B (en) Address search
WO2024067746A1 (en) Method and system for mask matching implemented on basis of fpga
US20060198379A1 (en) Prefix optimizations for a network search engine
Huang et al. Fast routing table lookup based on deterministic multi-hashing
Nourani et al. A single-cycle multi-match packet classification engine using tcams

Legal Events

Date Code Title Description
PE20 Patent expired after termination of 20 years

Expiry date: 20210403