会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明申请
    • Longest Prefix Match Scheme
    • 最长前缀匹配方案
    • US20130031077A1
    • 2013-01-31
    • US13284829
    • 2011-10-28
    • Jian LiuPhilip Lynn LeichtyHow Tung LimJohn Michael TerryMahesh Srinivasa MadduryWing CheungKung Ling Ko
    • Jian LiuPhilip Lynn LeichtyHow Tung LimJohn Michael TerryMahesh Srinivasa MadduryWing CheungKung Ling Ko
    • G06F17/30
    • G06F7/02H04L45/7457H04L45/748
    • A LPM search engine includes a plurality of exact match (EXM) engines and a moderately sized TCAM. Each EXM engine uses a prefix bitmap scheme that allows the EXM engine to cover multiple consecutive prefix lengths. Thus, instead of covering one prefix length L per EXM engine, the prefix bitmap scheme enables each EXM engine to cover entries having prefix lengths of L, L+1, L+2 and L+3, for example. As a result, fewer EXM engines are potentially underutilized, which effectively reduces quantization loss. Each EXM engine provides a search result with a determined fixed latency when using the prefix bitmap scheme. The results of multiple EXM engines and the moderately sized TCAM are combined to provide a single search result, representative of the longest prefix match. In one embodiment, the LPM search engine supports 32-bit IPv4 (or 128-bit IPv6) search keys, each having associated 15-bit level 3 VPN identification values.
    • LPM搜索引擎包括多个精确匹配(EXM)引擎和中等大小的TCAM。 每个EXM引擎使用前缀位图方案,允许EXM引擎涵盖多个连续的前缀长度。 因此,代替覆盖每个EXM引擎的一个前缀长度L,例如,前缀位图方案使得每个EXM引擎能够覆盖具有前缀长度为L,L + 1,L + 2和L + 3的条目。 因此,较少的EXM引擎潜在地未充分利用,这有效地减少了量化损失。 当使用前缀位图方案时,每个EXM引擎提供具有确定的固定延迟的搜索结果。 多个EXM引擎和中等大小的TCAM的结果被组合以提供单个搜索结果,代表最长的前缀匹配。 在一个实施例中,LPM搜索引擎支持32位IPv4(或128位IPv6)搜索密钥,每个具有关联的15位3级VPN标识值。
    • 8. 发明授权
    • Longest prefix match scheme
    • 最长前缀匹配方案
    • US08880494B2
    • 2014-11-04
    • US13284829
    • 2011-10-28
    • Jian LiuPhilip Lynn LeichtyHow Tung LimJohn Michael TerryMahesh Srinivasa MadduryWing CheungKung Ling Ko
    • Jian LiuPhilip Lynn LeichtyHow Tung LimJohn Michael TerryMahesh Srinivasa MadduryWing CheungKung Ling Ko
    • G06F17/30H04L12/743G06F7/02H04L12/745
    • G06F7/02H04L45/7457H04L45/748
    • A LPM search engine includes a plurality of exact match (EXM) engines and a moderately sized TCAM. Each EXM engine uses a prefix bitmap scheme that allows the EXM engine to cover multiple consecutive prefix lengths. Thus, instead of covering one prefix length L per EXM engine, the prefix bitmap scheme enables each EXM engine to cover entries having prefix lengths of L, L+1, L+2 and L+3, for example. As a result, fewer EXM engines are potentially underutilized, which effectively reduces quantization loss. Each EXM engine provides a search result with a determined fixed latency when using the prefix bitmap scheme. The results of multiple EXM engines and the moderately sized TCAM are combined to provide a single search result, representative of the longest prefix match. In one embodiment, the LPM search engine supports 32-bit IPv4 (or 128-bit IPv6) search keys, each having associated 15-bit level 3 VPN identification values.
    • LPM搜索引擎包括多个精确匹配(EXM)引擎和中等大小的TCAM。 每个EXM引擎使用前缀位图方案,允许EXM引擎涵盖多个连续的前缀长度。 因此,代替覆盖每个EXM引擎的一个前缀长度L,例如,前缀位图方案使每个EXM引擎能够覆盖具有前缀长度为L,L + 1,L + 2和L + 3的条目。 因此,较少的EXM引擎潜在地未充分利用,这有效地减少了量化损失。 当使用前缀位图方案时,每个EXM引擎提供具有确定的固定延迟的搜索结果。 多个EXM引擎和中等大小的TCAM的结果被组合以提供单个搜索结果,代表最长的前缀匹配。 在一个实施例中,LPM搜索引擎支持32位IPv4(或128位IPv6)搜索密钥,每个具有关联的15位3级VPN标识值。