Quaternary content-addressable memory

    公开(公告)号:US20060161729A1

    公开(公告)日:2006-07-20

    申请号:US11037646

    申请日:2005-01-18

    CPC classification number: G11C15/04 G11C11/56

    Abstract: A quaternary content-addressable memory includes multiple entries configured to match a lookup word, with each of these entries including multiple cells and with the lookup word including multiple lookup bits for matching corresponding cells of each of the entries. Each of the cells is individually configurable to be in one of multiple states identified by two bits, with these states including a first matching state for matching a value of a corresponding bit of the lookup word with the value having a first matching value, a second matching state for matching the value of the corresponding bit having a second matching value, a wildcard state for matching the value of the corresponding bit having either the first or the second matching value, and an ignore state for indicating to ignore the cell in determining whether or not the entry to which the cell belongs matches the lookup word.

    Implementation of a switch-box using a subfield method
    2.
    发明申请
    Implementation of a switch-box using a subfield method 有权
    使用子字段方法实现开关盒

    公开(公告)号:US20060093136A1

    公开(公告)日:2006-05-04

    申请号:US10976533

    申请日:2004-10-28

    CPC classification number: G06F7/726 H04L9/0631

    Abstract: Methods and systems for implementing a switch box (S-box) in a cryptographic application are described. An input to the S-box is converted from a Galois field representation GF(N2) to a Galois subfield representation GF(N)2. The input is converted using a generating polynomial of the form x2+Ax+B, where A and B are elements in GF(N) and where A has a value other than unity. The multiplicative inverse of the Galois subfield representation GF(N)2 is determined. The multiplicative inverse is converted back to the Galois field representation GF(N2). An affine transformation of the multiplicative inverse is then performed.

    Abstract translation: 描述在密码应用中实现开关盒(S盒)的方法和系统。 将S-box的输入从伽罗瓦域表示GF(N <2> 2>)转换为伽罗瓦子场表示GF(N) 2。 使用形式为x 2 + Ax + B的生成多项式来转换输入,其中A和B是GF(N)中的元素,并且其中A具有不同于1的值。 确定Galois子场表示GF(N) 2 的乘法逆。 乘法逆转换回伽罗瓦域表示GF(N 2> 2)。 然后执行乘法逆的仿射变换。

    Weighted random scheduling particularly applicable to packet switching systems
    3.
    发明申请
    Weighted random scheduling particularly applicable to packet switching systems 失效
    加权随机调度特别适用于分组交换系统

    公开(公告)号:US20050226263A1

    公开(公告)日:2005-10-13

    申请号:US10822908

    申请日:2004-04-12

    Abstract: Weighted random scheduling is preformed, which may be particularly applicable to packet switching systems. For each particular input of multiple switch inputs, a request to send a packet to one of the outputs of the switch is generated by weighted randomly selecting one of the outputs to which the particular input has one or more packets to send. One of the requests is granted for each different one of the outputs for which one or more requests were generated. Packets are sent between the inputs and the output corresponding to the granted requests. The weighted random selection is typically weighted based on the number of packets or bytes to send to each of the outputs by a corresponding input of the inputs, the last times packets were sent from a corresponding input of the inputs to each of the outputs, and/classes of service associated with packets to send to each of the outputs by a corresponding input of the inputs.

    Abstract translation: 进行加权随机调度,这可能特别适用于分组交换系统。 对于多个开关输入的每个特定输入,通过加权随机选择特定输入具有一个或多个分组要发送的输出之一来产生向交换机的输出之一发送分组的请求。 其中一个请求被授予生成一个或多个请求的每个不同的输出。 数据包在输入和对应于授权请求的输出之间发送。 加权随机选择通常基于通过输入的相应输入发送到每个输出的分组或字节的数量进行加权,最后一次分组从输入的相应输入发送到每个输出,以及 /与通过输入的相应输入发送到每个输出的分组相关联的服务等级。

    METHOD AND SYSTEM FOR DATA PLANE ABSTRACTION TO ENABLE A DYNAMIC CREATION OF NETWORK APPLICATIONS
    4.
    发明申请
    METHOD AND SYSTEM FOR DATA PLANE ABSTRACTION TO ENABLE A DYNAMIC CREATION OF NETWORK APPLICATIONS 有权
    用于数据平面提取的方法和系统,以实现网络应用的动态创建

    公开(公告)号:US20140237456A1

    公开(公告)日:2014-08-21

    申请号:US13771026

    申请日:2013-02-19

    CPC classification number: G06F8/41 H04L67/10 H04L67/34

    Abstract: The method includes receiving, by a data plane definition language compiler, a first data plane definition describing customized functionality of a data plane of a first network application, and compiling the data plane definition to generate a first set of customized data processing modules and a program interface that allows a control plane of the network application to access the first set of customized data processing modules. The method also includes loading the first set of customized data processing modules into a data plane container, wherein the network application is executed via a network operating system, and wherein, upon execution of the network application the customized data processing module causes the data plane container of the network application to process packets differently than prior to loading the customized data processing module in the data plane container.

    Abstract translation: 该方法包括通过数据平面定义语言编译器接收描述第一网络应用的数据平面的定制功能的第一数据平面定义,以及编译数据平面定义以生成第一组定制数据处理模块和程序 接口,允许网络应用程序的控制平面访问第一组定制数据处理模块。 该方法还包括将第一组定制数据处理模块加载到数据平面容器中,其中通过网络操作系统执行网络应用,并且其中,在执行网络应用时,定制数据处理模块使数据平面容器 的网络应用程序处理数据包的方式与将数据处理模块加载到数据平面容器之前不同。

    Galois field multiplication system and method

    公开(公告)号:US20060080376A1

    公开(公告)日:2006-04-13

    申请号:US10964850

    申请日:2004-10-13

    CPC classification number: G06F7/724

    Abstract: A present invention Galois field multiplier system and method utilize lookup tables to generate one partial product term and one feedback term in one clock cycle. In one embodiment, a Galois field multiplier system includes a plurality of shift registers, a plurality of exclusive OR components, a partial product lookup table, and a feedback table lookup table. The plurality of shift registers perform shift multiplication operation and are coupled to the plurality of shift registers that perform addition operations. The partial product lookup table and feedback lookup tables are selectively coupled to the exclusive OR components and values from the partial product lookup table and feedback lookup tables are fed into the selectively coupled exclusive OR components. Coefficients of the partial product term and feedback term are utilized as indexes to the partial product lookup table and feedback lookup table respectively.

Patent Agency Ranking