| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To realize high-speed table retrieval and high-speed table updating. <P>SOLUTION: A Patricia tree held as software is updated on the basis of updating information, the set of nodes having overlapped prefixes is extracted concerning this updated Patricia tree, registered information written in the extracted set of the nodes is registered in a Patricia tree held as hardware, and registered information written in any nodes except for the extracted set of the nodes is registered in a TCAM. <P>COPYRIGHT: (C)2003,JPO</p> |
