Country
Full text data for US,EP,CN
Type
Legal Validity
Legal Status
Filing Date
Publication Date
Inventor
Assignee
Click to expand
IPC(Section)
IPC(Class)
IPC(Subclass)
IPC(Group)
IPC(Subgroup)
LOC
Agent
Agency
Claims Number
Figures Number
Citation Number of Times
Assignee Number
No. Publication Number Title Publication/Patent Number Publication/Patent Number Publication Date Publication Date
Application Number Application Number Filing Date Filing Date
Inventor Inventor Assignee Assignee IPC IPC
1
US11063870B2
Selective route download traffic sampling
Publication/Patent Number: US11063870B2 Publication Date: 2021-07-13 Application Number: 14/967,084 Filing Date: 2015-12-11 Inventor: Dale, Lincoln Travis   Assignee: Arista Networks, Inc.   IPC: H04L12/745 Abstract: A network device includes a forwarding information base (FIB). The FIB includes a first number of entries and a default entry. The network device includes a routing information base that includes a second number of entries. The network device includes a FIB entry optimizer that ranks a first portion of the second number of entries based on access information of the first number of entries; ranks a second portion of the second number of entries based on access information of the default entry; and updates at least one entry of the FIB based on the ranks of the first portion of the second number of entries and the ranks of the second portion of the second number of entries. The first number of entries is less than the second number of entries.
2
EP3777055A1
LONGEST PREFIX MATCHING
Publication/Patent Number: EP3777055A1 Publication Date: 2021-02-17 Application Number: 19720230.2 Filing Date: 2019-04-05 Inventor: Hasani, Naader   Gupta, Shishir   Ward, David Delano   Tatar, Mohammed Ismael   Habibi, Shahin   Ravipalli, Sreedhar   Barach, David Richard   Assignee: Cisco Technology, Inc.   IPC: H04L12/743
3
US2021036956A1
IDENTIFICATION OF ROUTE-MAP CLAUSES USING PREFIX TREES
Publication/Patent Number: US2021036956A1 Publication Date: 2021-02-04 Application Number: 16/568,278 Filing Date: 2019-09-12 Inventor: Thanikachalam, Naveen   Assignee: VMWARE, INC.   IPC: H04L12/745 Abstract: Described herein are systems and methods to apply route-map configurations in a computing network. In one implementation, a routing computing system may identify a route for redistribution in a computing network and identify a longest prefix in a radix tree associated with the route. The routing computing system may further identify a highest priority route-map clause associated with the longest prefix match or any parent prefixes of the longest prefix match in the radix tree. Once identified, the computing system may perform an action associated with the highest priority route-map clause.
4
CN112887212A
基于可变步宽trie树的高速路由查找方法和装置
Substantial Examination
Publication/Patent Number: CN112887212A Publication Date: 2021-06-01 Application Number: 202110214076.4 Filing Date: 2021-02-25 Inventor: 张雨轩   杨芫   徐明伟   Assignee: 清华大学   IPC: H04L12/741 Abstract: 本发明提出一种基于可变步宽trie树的高速路由查找方法和装置,其中,方法包括:根据路由表中的所有前缀构建至少一个根节点;以每个根节点对应的预设步宽s,对所有前缀接下来的s位二进制数据匹配,得到2个子节点;对内部节点重复执行上述步骤,直至子节点都为叶子节点完成对初始trie树的创建;根据初始trie树中的子节点的节点类型,构建与叶子节点对应的leaf_string和与内部节点对应的innode_string;根据预设的分段长度w分别对leaf_string和innode_string分段得到多个分段数据,通过计数器对每个分段数据计数得到对应的计数结果,以便于根据计数结果查询目的IP地址对应的路由。由此,在保证查找效率的基础上,通过对于可变步宽的支持,提高了算法的灵活性。
5
US2021083977A1
Packet Transmission Method, and Communications Apparatus and System
Publication/Patent Number: US2021083977A1 Publication Date: 2021-03-18 Application Number: 17/103,297 Filing Date: 2020-11-24 Inventor: Ren, Shoushou   Yu, Delei   Assignee: Huawei Technologies Co., Ltd.   IPC: H04L12/745 Abstract: Embodiments of this application provide a packet transmission method, and a communications apparatus and system. The method includes: generating a packet based on address information of forwarding nodes on a packet forwarding path, where the packet includes a first indication field, the first indication field is used to indicate a compressed first element and a compressed second element, the first element and the second element are address information of different forwarding nodes, and different address compression manners are used for the first element and the second element; and sending the packet.
6
CN107528783B
利用对前缀长度进行两个搜索阶段的IP路由缓存
Grant
Publication/Patent Number: CN107528783B Publication Date: 2021-04-27 Application Number: 201710406074.9 Filing Date: 2017-06-01 Inventor: 费马·克拉夫齐克   佩德罗·雷维列戈   萨尔瓦托·蓬塔雷利   埃维夫·科菲尔   阿米尔·罗伊特施泰因   吉尔·利维   Assignee: 迈络思科技TLV有限公司   IPC: H04L12/747 Abstract: 本申请涉及利用对前缀长度进行两个搜索阶段的IP路由缓存。数据包在网元中被接收。网元具有高速缓冲存储器,其中缓存条目表示被储存在主存储器中的地址的一部分。目的地址和缓存条目各自包括二进制数。做出缓存条目的和目的地址的M个最高有效位是相同的第一确定。做出缓存条目的和目的地址的附加的M+L个最高有效位是相同的第二确定。路由信息随后被从高速缓冲存储器中检索出来,并且包根据该路由信息进行处理。
7
US2021144093A1
ADDRESS PROCESSING METHOD AND NETWORK DEVICE
Publication/Patent Number: US2021144093A1 Publication Date: 2021-05-13 Application Number: 17/153,028 Filing Date: 2021-01-20 Inventor: Ren, Shoushou   Yu, Delei   Hu, Shihui   Li, Guangpeng   Assignee: HUAWEI TECHNOLOGIES CO., LTD.   IPC: H04L12/745 Abstract: This application provides an address processing method and a network device. The method includes: obtaining, by a first network device, an address; determining, by the first network device, a length of a valid address of the address, where the valid address of the address is a 1st bit, whose bit value is 1, of the address to a last bit of the address; and adding, by the first network device when the length of the valid address of the address is less than a table width of a target table, S zeros before the valid address of the address to obtain an adjusted address, and processing the adjusted address based on the adjusted address and the target table, where S is a difference between the table width of the target table and the length of the valid address of the address.
8
US2021266379A1
SELECTING FROM A PLURALITY OF ITEMS WHICH MATCH AN INTEREST
Publication/Patent Number: US2021266379A1 Publication Date: 2021-08-26 Application Number: 16/763,770 Filing Date: 2018-11-16 Inventor: D'acunto, Lucia   Trichias, Konstantinos   Wissingh, Bastiaan   Assignee: KONINKLIJKE KPN N.V.   NEDERLANDSE ORGANISATIE VOOR TOEGEPAST-NATUURWETENSCHAPPELIJK ONDERZOEK TNO   IPC: H04L29/08 Abstract: A network node (1) is configured to receive an interest message comprising a request for a data object and metadata. The metadata specifies one or more criteria for selecting a subset of a plurality of items. The network node is further configured to determine whether there is a match between the requested data object and a plurality of items (e.g. from a CS or FIB) and select a subset of the plurality of items by applying the one or more criteria if the match has been determined to exist. At least one of the criteria is a preference specified for at least one of: factual properties of the plurality of items, usage data related to the plurality of items, usage data related to the at least one communication interface, an effort to obtain data from another network node, and a position in a range specified in the interest message.
9
US2021099536A1
Directory Assisted Routing of Content in an Information Centric Network
Publication/Patent Number: US2021099536A1 Publication Date: 2021-04-01 Application Number: 17/119,685 Filing Date: 2020-12-11 Inventor: John, Nitish   Assignee: Gramboo Inc.   IPC: H04L29/08 Abstract: A method is disclosed. The method includes: obtaining, by an authoritative directory router in an information centric network (ICN), a publish message associated with a publisher node and including: an identifier associated with a content item; and a first anchor prefix for a first anchor directory router for the publisher node; determining that a bidirectional code for the identifier falls within an authoritative code range assigned to the authoritative directory router; and updating, in response to the bidirectional code falling within the authoritative code range, a local code repository associated with the authoritative directory router with the first anchor prefix and the identifier.
10
US2021006495A1
ROUTING PROTOCOL AND DISTRIBUTED ROUTER
Publication/Patent Number: US2021006495A1 Publication Date: 2021-01-07 Application Number: 16/875,886 Filing Date: 2020-05-15 Inventor: Yeh, Chiang   Farrington, Nathan   Minkenberg, Cyriel   Assignee: ROCKLEY PHOTONICS LIMITED   IPC: H04L12/745 Abstract: A routing protocol, the routing protocol includes the steps of: receiving a packet at an ingress node of a distributed router, the ingress node having an ingress node address, and the packet having a packet header containing a global destination address; converting the global destination address into a local destination address, the local destination address identifying a location on the distributed router; and routing the packet to the local destination address. A distributed router includes a plurality of internal network nodes, the plurality of internal network nodes including an ingress node configured to receive a packet, the ingress node having an ingress node address, and the packet having a packet header containing a global destination address for that packet; means for converting the global destination address into a local destination address, the local destination address identifying a location on the distributed router; and a routing engine configured to route the packet to the local destination address.
11
CN110460529B
一种内容路由器转发信息库存储结构的数据处理方法和芯片
Grant
Publication/Patent Number: CN110460529B Publication Date: 2021-06-08 Application Number: 201910572071.1 Filing Date: 2019-06-28 Inventor: 闫柳   李卓   刘开华   Assignee: 天津大学   IPC: H04L12/741 Abstract: 本发明公开了一种内容路由器FIB存储结构,包含一个片内存储单元和一个片外存储单元。片内存储单元使用高速存储器,部署多个与不同名称前缀组件数对应的索引结构,以实现基于最长名称前缀匹配机制的名称数据快速索引;片外存储单元使用大容量低速存储器,部署多个与索引结构对应的FIB存储池,以存储实际转发信息。其中,片内索引结构基于神经网络实现,通过学习索引内容在存储器中的分布情况,提高存储效率。对于片内索引结构可能产生的误判,在片外FIB存储池中使用链地址法来处理冲突,即映射到相同地址的数据以链表的形式连接。本发明的结构适合于当前存储器硬件水平,可以有效支持最长名称前缀匹配机制,并提高名称数据的检索速度。
12
US2021281507A1
PARAMETER NOTIFICATION AND OBTAINING METHODS AND DEVICES, AND STORAGE MEDIUM
Publication/Patent Number: US2021281507A1 Publication Date: 2021-09-09 Application Number: 16/321,598 Filing Date: 2017-09-20 Inventor: Peng, Shaofu   Jin, Feical   Chen, Ran   Assignee: ZTE CORPORATION   IPC: H04L12/707 Abstract: The present application provides parameter notification and obtaining methods and devices. The parameter notification method comprises: a first node determines parameters comprised in non-default maximally redundant tree (MRT) Profile; the first node notifies the parameters comprised in the non-default MRT Profile to a second node by means of interior gateway protocol (IGP) extensions. Embodiments of the present application also provide a computer storage medium.
13
CN113328990A
基于多重过滤的网间路由劫持检测方法及电子设备
Public
Publication/Patent Number: CN113328990A Publication Date: 2021-08-31 Application Number: 202110432558.7 Filing Date: 2021-04-21 Inventor: 张沛   黄小红   徐鹏举   赵仕祺   舒琨博   白峻东   Assignee: 北京邮电大学   IPC: H04L29/06 Abstract: 本公开提供一种基于多重过滤的网间路由劫持检测方法及电子设备,能够高效、准确确定路由劫持事件,易于部署实施。所述方法根据路由快照提取路由前缀以及相应的自治域相关信息以构建路由前缀地址树;根据路由报文的类型与报文内容,结合所述路由前缀地址对当前事件进行分析以确定多个劫持嫌疑事件,并根据多个所述劫持嫌疑事件的事件信息生成嫌疑事件列表;根据所述事件信息结合自治域信息查询字典、已分配地址前缀树、注册路由前缀树对所述嫌疑事件列表中的多个所述劫持嫌疑事件进行多重过滤;根据过滤结果确定劫持事件,并确定所述劫持事件相应的攻击方与受害方。所述电子设备用于实施所述劫持检测方法。
14
EP3761575A1
SEARCH APPARATUS AND METHOD
Publication/Patent Number: EP3761575A1 Publication Date: 2021-01-06 Application Number: 20164779.9 Filing Date: 2014-04-30 Inventor: Gong, Jun   Liu, Shuying   Hu, Jing   Assignee: Huawei Technologies Co., Ltd.   IPC: H04L12/741 Abstract: This application provides a search apparatus, including a global dispatcher, a global arbiter, and N search engines. The N search engines can access a first search table. The global dispatcher is configured to: determine that a first search keyword is corresponding to the first search table, determine that the first search table is corresponding to the N search engines, and dispatch the first search keyword to the N search engines. Each search engine in the N search engines is configured to: search, according to a first search algorithm, one subtable that is of the first search table and can be accessed by each search engine in the N search engines, to determine whether an entry that matches the first search keyword exists; and output a search result to the global arbiter. The global arbiter is configured to arbitrate the search result output by each search engine, to obtain a search result corresponding to the first search table. In addition, another apparatus and a corresponding method are further provided. The foregoing solutions are helpful in improving flexibility of a search engine.
15
US10887412B2
Directory assisted routing of content in an information-centric network
Publication/Patent Number: US10887412B2 Publication Date: 2021-01-05 Application Number: 16/432,713 Filing Date: 2019-06-05 Inventor: John, Nitish   Assignee: Gramboo Inc.   IPC: H04L29/08 Abstract: A method is disclosed. The method includes: obtaining, by an authoritative directory router in an information centric network (ICN), a publish message associated with a publisher node and including: an identifier associated with a content item; and a first anchor prefix for a first anchor directory router for the publisher node; determining that a bidirectional code for the identifier falls within an authoritative code range assigned to the authoritative directory router; and updating, in response to the bidirectional code falling within the authoritative code range, a local code repository associated with the authoritative directory router with the first anchor prefix and the identifier.
16
US10917338B2
System and method for building a hierarchical data structure
Publication/Patent Number: US10917338B2 Publication Date: 2021-02-09 Application Number: 16/294,171 Filing Date: 2019-03-06 Inventor: Liu, Yaoqing   Grigoryan, Garegin   Assignee: Clarkson University   IPC: H04L12/741 Abstract: A system and method for building a data structure for determining if multiple routing or forwarding tables yield the same or different forwarding behaviors. VeriTable uses a single tree/trie traversal to quickly check if multiple forwarding tables are forwarding equivalent, yield routing loops, or black holes. VeriTable also uses the Longest Prefix Matching rule for lookups, e.g., checking if route updates in control plane are consistent with the ones in forwarding plane. VeriTable can be applied to network-wide abnormality diagnosis of network problems, such as scalable and efficient forwarding loop detection and avoidance in the data plane of a network. In addition, VeriTable can be extended to handle incremental updates applied to the forwarding tables in a network.
17
US10893022B1
Routing protocol security using a distributed ledger
Publication/Patent Number: US10893022B1 Publication Date: 2021-01-12 Application Number: 16/228,540 Filing Date: 2018-12-20 Inventor: Li, Danjue   Durrani, Muhammad   Xi, Chen   Sheikh, Imam   Assignee: EQUINIX, INC.   IPC: H04L29/06 Abstract: In one example, a method includes receiving, by a first network device via a routing protocol peering session with a peer router in a first autonomous system, a plurality of routing protocol routes to destination addresses, each routing protocol route specifying a network address prefix and an identifier of the autonomous system that originated the routing protocol route; receiving network address prefix ownership information from a distributed ledger storing a plurality of associations between respective network address prefixes and respective autonomous system identifiers of autonomous systems confirmed to own the respective network address prefixes; determining, based at least on the prefix ownership information, whether any of the plurality of routing protocol routes specifies an autonomous system identifier different than specified by the associations; and in response to determining that one of the routes specifies an autonomous system identifier different than specified by the plurality of associations, performing an action.
18
US2021119917A1
LABEL FORWARDING ENTRY GENERATION METHOD AND APPARATUS, PACKET SENDING METHOD AND APPARATUS, AND DEVICE
Publication/Patent Number: US2021119917A1 Publication Date: 2021-04-22 Application Number: 17/136,590 Filing Date: 2020-12-29 Inventor: Yu, Shusong   Assignee: HUAWEI TECHNOLOGIES CO., LTD.   IPC: H04L12/745 Abstract: This application provides an example label forwarding entry generation method, applied to a first network device. The method includes obtaining a first packet sent by a second network device, where the first packet carries an address of a third network device and a prefix segment identifier of the third network device, the first network device and the second network device belong to a first area, and the third network device belongs to a second area. The method also includes determining a routing entry that matches the address of the third network device, where the routing entry includes an address of a next-hop network device of the first network device. The method further includes generating a label forwarding entry based on the prefix segment identifier and the address of the next-hop network device.
19
US10917345B2
Generating a hash table in accordance with a prefix length
Publication/Patent Number: US10917345B2 Publication Date: 2021-02-09 Application Number: 15/745,448 Filing Date: 2015-07-17 Inventor: Wickeraad, John A.   Assignee: Hewlett Packard Enterprise Development LP   IPC: H04L12/743 Abstract: Examples herein disclose a generation of a hash table. The examples identify a prefix length from a routing table of various prefix lengths and corresponding distribution of entries. The identified prefix length corresponds to a larger distribution of entries in the routing table. The examples generate the hash table in accordance with the identified prefix length.
20
US2021144089A1
EFFICIENT ALGORITHM TO ELIMINATE REDUNDANT SPECIFIC PREFIXES IN FORWARDING INFORMATION BASE USING TRIE
Publication/Patent Number: US2021144089A1 Publication Date: 2021-05-13 Application Number: 17/115,592 Filing Date: 2020-12-08 Inventor: Narayanan, Kumaran   Regmi, Sudip   Srinivas, Prashant   Kasiviswanathan, Venkitraman   Assignee: Arista Networks, Inc.   IPC: H04L12/753 Abstract: In general, the invention relates to a method for programming a network element. The method includes detecting an addition of a first route in a routing information base (RIB) on the network element, adding, in response to detecting the addition, a first route network prefix associated with the first route to a network prefix trie (NPT), identifying, based on the adding, a first parent network prefix for the first route network prefix using the NPT, making a first determination that the first route network prefix and the first parent network prefix are reachable via a first common next hop connected to the network element, and waiving, based on the first determination, a creation of a forwarding information base (FIB) entry associated with the first route network prefix in a FIB on the network element.
Total 31 pages