利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

4 条记录 (耗时 0.018 秒)

    CCN ROUTING USING HARDWARE-ASSISTED HASH TABLES
    1.
    发明申请
    CCN ROUTING USING HARDWARE-ASSISTED HASH TABLES 审中-公开

    公开(公告)号：US20170180252A1

    公开(公告)日：2017-06-22

    申请号：US15451015

    申请日：2017-03-06

    申请人： CISCO SYSTEMS, INC.

    发明人： Marc E. Mosko ,  Ignacio Solis

    IPC分类号： H04L12/745 ,  H04L29/12 ,  H04L12/743

    CPC分类号： H04L45/748 ,  H04L45/7453 ,  H04L61/1552 ,  H04L61/3005 ,  H04L61/303 ,  H04L67/327 ,  H04L69/329

    摘要： One embodiment provides a system that facilitates forwarding of packets with variable length names. During operation, the system receives a packet with a hierarchically structured variable length identifier (HSVLI) which comprises contiguous name components ordered from a most general level to a most specific level. The system performs a longest prefix match lookup by selecting an entry from a first data structure of entries. The entries indicate a name component, forwarding information for the name component, and a plurality of entry identifiers that chain an entry to another entry. If a size of the name component is less than or equal to a predetermined threshold, the system selects an entry based on the name component. If the size is greater, the system selects an entry based on a compressed key which can be a hash of the name component. The system also resolves collisions associated with the selected entry.

    CCN routing using hardware-assisted hash tables
    3.
    发明授权
    CCN routing using hardware-assisted hash tables 有权
    使用硬件辅助哈希表的CCN路由

    公开(公告)号：US09590948B2

    公开(公告)日：2017-03-07

    申请号：US14570144

    申请日：2014-12-15

    申请人： CISCO SYSTEMS, INC.

    发明人： Marc E. Mosko ,  Ignacio Solis

    IPC分类号： H04L29/12 ,  H04L29/08 ,  H04L12/745 ,  H04L12/743

    CPC分类号： H04L45/748 ,  H04L45/7453 ,  H04L61/1552 ,  H04L61/3005 ,  H04L61/303 ,  H04L67/327 ,  H04L69/329

    摘要： One embodiment provides a system that facilitates forwarding of packets with variable length names. During operation, the system receives a packet with a hierarchically structured variable length identifier (HSVLI) which comprises contiguous name components ordered from a most general level to a most specific level. The system performs a longest prefix match lookup by selecting an entry from a first data structure of entries. The entries indicate a name component, forwarding information for the name component, and a plurality of entry identifiers that chain an entry to another entry. If a size of the name component is less than or equal to a predetermined threshold, the system selects an entry based on the name component. If the size is greater, the system selects an entry based on a compressed key which can be a hash of the name component. The system also resolves collisions associated with the selected entry.

    摘要翻译： 一个实施例提供了一种便于转发具有可变长度名称的分组的系统。 在操作期间，系统接收具有分层结构的可变长度标识符（HSVLI）的分组，其包括从最通用级别到最特定级别排序的连续名称组件。 系统通过从条目的第一个数据结构中选择一个条目来执行最长的前缀匹配查找。 条目指示名称组件，用于名称组件的转发信息，以及将条目链接到另一个条目的多个条目标识符。 如果名称组件的大小小于或等于预定阈值，则系统基于名称组件来选择一个条目。 如果大小较大，系统将根据可能是名称组件的哈希值的压缩密钥来选择一个条目。 系统还可以解决与所选条目关联的冲突。