会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Dynamic chain creation and segmentation of the packet-forwarding plane
    • 分组转发平面的动态链创建和分段
    • US08204967B2
    • 2012-06-19
    • US10824725
    • 2004-04-14
    • Rajiv GoelJianyu ChenScott MolloyChung T. NguyenDavid WardJohn BettinkPeramanayagam Marimuthu
    • Rajiv GoelJianyu ChenScott MolloyChung T. NguyenDavid WardJohn BettinkPeramanayagam Marimuthu
    • G06F15/177
    • H04L12/4633
    • A method is disclosed for dynamically creating encapsulation and decapsulation chains and segmenting the packet-forwarding plane. A distributed router may comprise multiple cards, each exposing a subset of the router's physical interfaces. Some physical interfaces may be configured to send/receive only certain types and destinations of data packets. Some cards might not expose any physical interfaces configured to send/receive a particular type and destination of packet, making encapsulation and/or decapsulation chains for virtual interfaces that process data packets of the particular type useless on those cards. Therefore, instead of always creating both encapsulation and decapsulation chains for a virtual interface on a card, an aspect of the method dynamically determines which of the encapsulation and decapsulation chains are useful for a virtual interface on that card, and creates only those chains that are useful on that card. Thus, the packet-forwarding plane is segmented into independent encapsulation and decapsulation segments.
    • 公开了一种用于动态地创建封装和解封装链以及对分组转发平面进行分段的方法。 分布式路由器可以包括多个卡,每个卡暴露路由器的物理接口的子集。 一些物理接口可以被配置为仅发送/接收数据分组的某些类型和目的地。 某些卡可能不会将任何物理接口配置为发送/接收数据包的特定类型和目标,从而为处理特定类型的数据包在这些卡上无用的虚拟接口进行封装和/或解封装链。 因此,代替总是为卡上的虚拟接口创建封装和解封装链,该方法的一个方面动态地确定哪个封装和解封装链对于该卡上的虚拟接口是有用的,并且仅创建那些链 对该卡有用 因此,分组转发平面被分割为独立的封装和解封装段。
    • 2. 发明申请
    • Dynamic chain creation and segmentation of the packet-forwarding plane
    • 分组转发平面的动态链创建和分段
    • US20050251582A1
    • 2005-11-10
    • US10824725
    • 2004-04-14
    • Rajiv GoelJianyu ChenScott MolloyChung NguyenDavid WardJohn BettinkPeramanayagam Marimuthu
    • Rajiv GoelJianyu ChenScott MolloyChung NguyenDavid WardJohn BettinkPeramanayagam Marimuthu
    • G06F15/173H04L12/46
    • H04L12/4633
    • A method is disclosed for dynamically creating encapsulation and decapsulation chains and segmenting the packet-forwarding plane. A distributed router may comprise multiple cards, each exposing a subset of the router's physical interfaces. Some physical interfaces may be configured to send/receive only certain types and destinations of data packets. Some cards might not expose any physical interfaces configured to send/receive a particular type and destination of packet, making encapsulation and/or decapsulation chains for virtual interfaces that process data packets of the particular type useless on those cards. Therefore, instead of always creating both encapsulation and decapsulation chains for a virtual interface on a card, an aspect of the method dynamically determines which of the encapsulation and decapsulation chains are useful for a virtual interface on that card, and creates only those chains that are useful on that card. Thus, the packet-forwarding plane is segmented into independent encapsulation and decapsulation segments.
    • 公开了一种用于动态地创建封装和解封装链以及对分组转发平面进行分段的方法。 分布式路由器可以包括多个卡,每个卡暴露路由器的物理接口的子集。 一些物理接口可以被配置为仅发送/接收数据分组的某些类型和目的地。 某些卡可能不会暴露任何配置为发送/接收数据包的特定类型和目的地的物理接口,从而为处理特定类型的数据包在这些卡上无用的虚拟接口进行封装和/或解封装链。 因此,代替总是为卡上的虚拟接口创建封装和解封装链,该方法的一个方面动态地确定哪个封装和解封装链对该卡上的虚拟接口是有用的,并且仅创建那些链 对该卡有用 因此,分组转发平面被分割为独立的封装和解封装段。
    • 5. 发明申请
    • Data structure for storing and accessing multiple independent sets of forwarding information
    • 用于存储和访问多个独立转发信息集的数据结构
    • US20070091899A1
    • 2007-04-26
    • US11256462
    • 2005-10-21
    • David WardPawan UberoyJohn BettinkShyamsundar Maniyar
    • David WardPawan UberoyJohn BettinkShyamsundar Maniyar
    • H04L12/56H04L12/28
    • H04L45/00H04L45/48H04L45/7457
    • Stored in the leaf nodes of a data structure that can be used for identifying the longest prefix matching an address are corresponding values from multiple forwarding information bases. A single common address lookup data structure (e.g., a tree, trie, etc.) can be used, and a leaf node can contain information from multiple forwarding information bases. If lookup operations are performed for a single address in multiple forwarding information bases, the single common address lookup data structure may only need to be traversed once. For example, the forwarding information for another forwarding information base may be stored in the same leaf, further down in the data structure requiring traversal from the current position, or above requiring traversal from the root of the lookup data structure. Information can be stored in the leaf node to indicate which traversal option is appropriate for a particular forwarding information base.
    • 存储在可用于识别匹配地址的最长前缀的数据结构的叶节点中的是来自多个转发信息库的相应值。 可以使用单个公共地址查找数据结构(例如,树,特里等),并且叶节点可以包含来自多个转发信息库的信息。 如果在多个转发信息库中对单个地址执行查找操作,则单个公共地址查找数据结构可能只需要遍历一次。 例如,用于另一个转发信息库的转发信息可以存储在需要从当前位置进行遍历的数据结构中,或者在上述需要从查找数据结构的根遍历的同一叶中。 信息可以存储在叶子节点中,以指示哪个遍历选项适用于特定的转发信息库。