发明名称 LONGEST PREFIX MATCH SEARCHES WITH VARIABLE NUMBERS OF PREFIXES
摘要 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.
申请公布号 US2013246651(A1) 申请公布日期 2013.09.19
申请号 US201213418907 申请日期 2012.03.13
申请人 KEEN JOHN;FRAILONG JEAN-MARC;GOEL DEEPAK;JAGANNADHAN SRINIVASAN;ADUSUMALLI SRILAKSHMI;JUNIPER NETWORKS, INC. 发明人 KEEN JOHN;FRAILONG JEAN-MARC;GOEL DEEPAK;JAGANNADHAN SRINIVASAN;ADUSUMALLI SRILAKSHMI
分类号 G06F15/173 主分类号 G06F15/173
代理机构 代理人
主权项
地址