发明申请
- 专利标题: Longest prefix match lookup using hash function
- 专利标题(中): 使用哈希函数的最长前缀匹配查找
-
申请号: US11353841申请日: 2006-02-14
-
公开(公告)号: US20060173831A1公开(公告)日: 2006-08-03
- 发明人: Claude Basso , Jean Calvignac , Gordon Davis , Piyush Patel
- 申请人: Claude Basso , Jean Calvignac , Gordon Davis , Piyush Patel
- 申请人地址: US NY Armonk
- 专利权人: International Business Machines Corporation
- 当前专利权人: International Business Machines Corporation
- 当前专利权人地址: US NY Armonk
- 主分类号: G06F17/30
- IPC分类号: G06F17/30
摘要:
A method and apparatus are used for finding the longest prefix match in a variable length prefix search when searching a direct table within a routing table structure of a network processor. The search through the routing table structure is expedited by hashing a first segment of an internet protocol address with a virtual private network number followed by concatenating the unhashed bits of the IP address to the result of the hash operation to form an input key. Patterns are compared a bit at a time until an exact match or the best match is found. The search is conducted in a search tree that provides that the matching results will be the best possible match.
公开/授权文献
- US07702630B2 Longest prefix match lookup using hash function 公开/授权日:2010-04-20
信息查询