Two stage bloom filter for longest prefix match
    11.
    发明授权
    Two stage bloom filter for longest prefix match 有权
    两阶段绽放过滤器,用于最长的前缀匹配

    公开(公告)号:US09596181B1

    公开(公告)日:2017-03-14

    申请号:US14518400

    申请日:2014-10-20

    Abstract: A device may receive a packet that includes a destination address. The device may analyze a first Bloom filter, based on the destination address, in order to identify a prefix range entry associated with the destination address and included in a set of prefix range entries associated with the first Bloom filter. The device may analyze a second Bloom filter, based on the destination address and the identified prefix range entry, in order to identify a prefix length entry associated with the destination address and included in a set of prefix length entries associated with the second Bloom filter. The device may determine routing information associated with the identified prefix length entry. The routing information may identify a longest prefix match associated with the destination address. The device may provide the packet based on the routing information.

    Abstract translation: 设备可以接收包括目的地地址的分组。 设备可以基于目的地地址来分析第一布隆过滤器,以便识别与目的地地址相关联并且包括在与第一布隆过滤器相关联的一组前缀范围条目中的前缀范围条目。 该设备可以基于目的地地址和所识别的前缀范围条目来分析第二布隆过滤器,以便识别与目的地地址相关联并包括在与第二布隆过滤器相关联的一组前缀长度条目中的前缀长度条目。 设备可以确定与所标识的前缀长度条目相关联的路由信息​​。 路由信息可以标识与目的地址相关联的最长前缀匹配。 设备可以基于路由信息提供分组。

Patent Agency Ranking