发明授权
- 专利标题: Apparatus and method for efficient longest prefix match lookup
- 专利标题(中): 用于有效最长前缀匹配查找的装置和方法
-
申请号: US12609549申请日: 2009-10-30
-
公开(公告)号: US08018944B1公开(公告)日: 2011-09-13
- 发明人: Yaniv Kopelman , Carmi Arad , Nafea Bishara
- 申请人: Yaniv Kopelman , Carmi Arad , Nafea Bishara
- 申请人地址: IL Yokneam
- 专利权人: Marvell Israel (M.I.S.L.) Ltd.
- 当前专利权人: Marvell Israel (M.I.S.L.) Ltd.
- 当前专利权人地址: IL Yokneam
- 主分类号: H04L12/56
- IPC分类号: H04L12/56
摘要:
A packet processor includes a forwarding table configured to store address prefixes and a search engine configured to receive a packet and to search the forwarding table. The search engine includes a set bit counter configured to receive an address of the packet, to count set bits of a first bit vector associated with the packet, and to output a number of the set bits. A next hop table is configured to store a next hop pointer. A next bucket pointer receives the number of set bits and outputs one of the next hop pointers and the next bucket pointer based on the number of set bits.