发明授权
US08972453B2 Method and system for longest prefix matching of variable-sized hierarchical names by treelets
有权
通过小树可变大小的分层名称匹配最长前缀的方法和系统
- 专利标题: Method and system for longest prefix matching of variable-sized hierarchical names by treelets
- 专利标题(中): 通过小树可变大小的分层名称匹配最长前缀的方法和系统
-
申请号: US13469528申请日: 2012-05-11
-
公开(公告)号: US08972453B2公开(公告)日: 2015-03-03
- 发明人: Jianming Wu , Guangyu Shi , Fu Li
- 申请人: Jianming Wu , Guangyu Shi , Fu Li
- 申请人地址: US TX Plano
- 专利权人: Futurewei Technologies, Inc.
- 当前专利权人: Futurewei Technologies, Inc.
- 当前专利权人地址: US TX Plano
- 代理机构: Conley Rose, P.C.
- 代理商 Grant Rodolph; Brandt D. Howell
- 主分类号: G06F7/00
- IPC分类号: G06F7/00 ; G06F17/30
摘要:
A method for determining a location of a requested resource, comprising receiving a request for a resource, wherein the resource is identified by a hierarchically structured name, decomposing the hierarchically structured name into a plurality of segments, comparing each of the plurality of segments to parent nodes of a plurality of two-level treelets, wherein the comparing of at least two of the plurality of segments to parent nodes of the plurality of two-level treelets is performed in a parallel manner, wherein combinations of two-level treelets comprise a hierarchical name of a network resource, and determining a longest prefix match of the hierarchically structured name.
公开/授权文献
信息查询