发明名称 |
LONGEST MATCH RETRIEVAL CIRCUIT, ITS METHOD, ITS PROGRAM, AND RECORDING MEDIUM |
摘要 |
PROBLEM TO BE SOLVED: To economically provide a retrieval method at high speed where a large scale of Patricia tree is used. SOLUTION: The address of a node constituting the Patricia tree, information concerning the noted bit position of entry data corresponding to the address, and information of a destination node or a terminal end point with respect to a value to be taken by entry data corresponding to the noted bit position are recorded through the use of an inexpensive memory such as a RAM. The destination node or the terminal end point of entry data is retrieved in accordance with the value of the bit of interest successively at every node from the start point of the Patricia tree to the downstream. COPYRIGHT: (C)2003,JPO
|
申请公布号 |
JP2003224581(A) |
申请公布日期 |
2003.08.08 |
申请号 |
JP20020024068 |
申请日期 |
2002.01.31 |
申请人 |
NIPPON TELEGR & TELEPH CORP <NTT> |
发明人 |
YAMANAKA NAOAKI;SHIOMOTO KOHEI;KATAYAMA MASARU;UGA MASANORI |
分类号 |
G06F7/24;G06F17/30;H04L12/70;(IPC1-7):H04L12/56 |
主分类号 |
G06F7/24 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|