会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Bidirectional packet flow transformation
    • 双向分组流转换
    • US08619782B2
    • 2013-12-31
    • US13325624
    • 2011-12-14
    • Claude BassoJean L CalvignacNatarajan VaidhyanathanFabrice Verplanken
    • Claude BassoJean L CalvignacNatarajan VaidhyanathanFabrice Verplanken
    • H04L12/28H04L12/56G06F7/00G06F17/00
    • H04L29/0653H04L45/50H04L47/2441
    • A network packet includes a packet key that includes one or more source-destination field pairs that each include a source field and a destination field. For each selected source-destination field pair, first and second sections are selected in the packet key. A source field value is extracted from the source field and a destination field value is extracted from the destination field. For each source bit of the source field value: a destination bit is selected from the destination field; an OR logic function is applied to the source bit and the destination bit to generate a first resulting value is stored at the same bit position as the source bit in the first section; an AND logic function is applied to the source bit and the destination bit to generate a second resulting value stored at the same bit position as the source bit in the second section.
    • 网络分组包括分组密钥,其包括一个或多个源 - 目的地字段对,每个源对目的字段对都包括源字段和目的地字段。 对于每个选择的源 - 目的地字段对,在分组密钥中选择第一和第二部分。 从源字段提取源字段值,并从目标字段提取目的字段值。 对于源字段值的每个源位:从目标字段中选择目标位; 将OR逻辑功能应用于源位,并将目标位产生为第一结果值,存储在与第一段中的源位相同的位位置; 将AND逻辑功能应用于源位和目标位,以产生存储在与第二部分中的源位相同的位位置处的第二个结果值。
    • 4. 发明申请
    • CHECKSUM VERIFICATION ACCELERATOR
    • 检查验证加速器
    • US20120151307A1
    • 2012-06-14
    • US13302688
    • 2011-11-22
    • Francois AbelClaude BassoJean L. CalvignacNatarajan VaidhyanathanFabrice Verplanken
    • Francois AbelClaude BassoJean L. CalvignacNatarajan VaidhyanathanFabrice Verplanken
    • G06F11/00
    • H04L1/0079H04L1/0061H04L1/0072
    • Disclosed is a method and system for validating a data packet by a network processor supporting a first network protocol and a second network protocol and utilizing shared hardware. The network processor receives a data packet; identifies a network packet protocol for the data packet; and processes the data packet according to the network packet protocol comprising: updating a first register with a first partial packet length specific to the first network protocol; updating a second register with a second partial packet length specific to the second network protocol; and updating a third register with a first checksum computed from fields independent of the network protocol. The system produces a second checksum utilizing a function that combines values from the first register, the second register, and the third register. The system validates the data packet by comparing the data packet checksum to the second checksum.
    • 公开了一种用于通过支持第一网络协议和第二网络协议的网络处理器来验证数据分组并利用共享硬件的方法和系统。 网络处理器接收数据包; 识别数据包的网络包协议; 并根据网络分组协议对数据分组进行处理,包括:以第一网络协议特有的第一部分分组长度更新第一寄存器; 用第二网络协议特有的第二部分分组长度更新第二寄存器; 以及用独立于网络协议的字段计算的具有第一校验和的更新第三寄存器。 该系统利用组合来自第一寄存器,第二寄存器和第三寄存器的值的函数产生第二校验和。 系统通过将数据包校验和与第二个校验和进行比较来验证数据包。
    • 9. 发明申请
    • Systems and methods for weighted best effort scheduling
    • 加权最佳努力调度的系统和方法
    • US20060233177A1
    • 2006-10-19
    • US11108485
    • 2005-04-18
    • Claude BassoJean CalvignacChih-jen ChangNatarajan VaidhyanathanFabrice Verplanken
    • Claude BassoJean CalvignacChih-jen ChangNatarajan VaidhyanathanFabrice Verplanken
    • H04L12/56H04L12/54
    • H04L47/568H04L45/00H04L45/60H04L47/50H04L47/527
    • Systems and methods for scheduling data packets in a network processor are disclosed. Embodiments provide a network processor that comprises a best-effort scheduler with a minimal calendar structure for addressing schedule control blocks. In one embodiment, a three-entry calendar structure provides for weighted best effort scheduling. Each of a plurality different flows has an associated schedule control block. Schedule control blocks are stored as linked lists in a last-in-first-out buffer. Each calendar entry is associated with a different linked list by storing in the calendar entry the address of the first-out schedule control block in the linked list. Each schedule control block has a counter and is assigned a weight according to the bandwidth priority of the flow to which the corresponding packet belongs. Each time a schedule control block is accessed from a last-in-first-out buffer storing the linked list, the scheduler generates a scheduling event and the counter of the schedule control block is incremented. When an incremented counter of a schedule control block equals its weight, the schedule control block is temporarily removed from further scheduling.
    • 公开了一种用于在网络处理器中调度数据分组的系统和方法。 实施例提供了一种网络处理器,其包括具有用于寻址日程控制块的最小日历结构的尽力而为调度器。 在一个实施例中,三入口日历结构提供加权最佳努力调度。 多个不同的流中的每一个具有相关的进度控制块。 计划控制块作为链表存储在先进先出缓冲区中。 通过在日历条目中存储链表中的先出时间表控制块的地址来将每个日历条目与不同的链表相关联。 每个调度控制块具有计数器,并根据相应分组所属的流的带宽优先级分配权重。 每当从存储链表的最先进先出缓冲器访问调度控制块时,调度器生成调度事件,并且调度控制块的计数器递增。 当调度控制块的递增计数器等于其权重时,调度控制块暂时从进一步调度中移除。