Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
PACKAGING OF FULL MATCHING SEARCH ALGORITHM FOR NETWORK PROCESSOR
Document Type and Number:
Japanese Patent JP3651589
Kind Code:
B2
Abstract:

PROBLEM TO BE SOLVED: To provide novel data structure, method and device for finding out full matching(FM) between a search pattern and a pattern stored in the leaf of a search tree.
SOLUTION: A key is inputted, a hash function is executed to a key, a direct table(DT) is accessed, and walk-through of the tree is performed until reaching the leaf through a pattern search control block(PSCB). Both the key and correspondent information required for retrieval are stored in a Patricia tree structure and the hash function performs mapping of n->n from the bit of the key to the bit of a hashed key.


Inventors:
Brian Mitchell Bus
Jean-Louis Calvinac
Marco Sea Hedes
Antonio Maragucos
Michael Stephen Siegel
Fabrice Jean Velplanken
Application Number:
JP2001091839A
Publication Date:
May 25, 2005
Filing Date:
March 28, 2001
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
INTERNATIONAL BUSINESS MASCHINES CORPORATION
International Classes:
G06F17/30; H04L12/46; H04L12/56; (IPC1-7): H04L12/56; G06F17/30
Domestic Patent References:
JP2002024293A
JP10257066A
JP5167640A
JP10162013A
JP2260334A
Foreign References:
US5946679
US5857196
WO1996000945A1
Attorney, Agent or Firm:
Hiroshi Sakaguchi
Yoshihiro City