Invention Grant
US08799507B2 Longest prefix match searches with variable numbers of prefixes 有权
最长的前缀匹配用可变数量的前缀进行搜索

Longest prefix match searches with variable numbers of prefixes
Abstract:
An example network device includes a control plane and a filter lookup module that includes a Bloom filter that supports parallel lookup of a maximum number of different prefix lengths. The filter lookup module accesses the Bloom filter to determine a longest length prefix that matches an entry in a set of prefixes. The control plane receives prefix lengths that include more than the maximum number of different prefix lengths supported by the Bloom filter, wherein the set of prefix lengths is associated with one application, generates, based on the received set of prefix lengths, two or more groups of different prefix lengths, wherein each of the two or more groups of different prefix lengths includes no more than the maximum number of different prefix lengths, and programs the filter lookup module with the two or more groups of different prefix lengths associated with the one application.
Public/Granted literature
Information query
Patent Agency Ranking
0/0