- Patent Title: Efficient longest prefix matching techniques for network devices
-
Application No.: US14192579Application Date: 2014-02-27
-
Publication No.: US09819637B2Publication Date: 2017-11-14
- Inventor: Amir Roitshtein , Gil Levy , Carmi Arad
- Applicant: MARVELL WORLD TRADE LTD.
- Applicant Address: BM St. Michael
- Assignee: Marvell World Trade Ltd.
- Current Assignee: Marvell World Trade Ltd.
- Current Assignee Address: BM St. Michael
- Main IPC: H04L29/12
- IPC: H04L29/12 ; H04L12/745 ; H04L12/743 ; G06F15/167 ; G06F15/173

Abstract:
A network address associated with a packet is obtained at a search engine of a network device. The search engine includes a plurality of Bloom filters that represent prefixes of respective lengths in the routing table. Respective Bloom filters are applied to respective prefixes of the network address to determine a set of one or more prefixes for which a match potentially exists in the routing table. A number of accesses to the memory are performed using prefixes in set of prefixes, beginning with a longest prefix and continuing in decreasing order of prefix lengths until a matching entry is found in the routing table, and routing information for the packet is retrieved. If the number of performed memory accesses exceeds a threshold, the routing table is adapted to reduce a number of memory accesses to be performed for subsequent packets associated with the network address.
Public/Granted literature
- US20140244779A1 Efficient Longest Prefix Matching Techniques for Network Devices Public/Granted day:2014-08-28
Information query