NETWORK ADAPTER
    4.
    发明公开
    NETWORK ADAPTER 有权
    NETZSCHNITTSTELLE

    公开(公告)号:EP1362464A2

    公开(公告)日:2003-11-19

    申请号:EP02712095.5

    申请日:2002-02-20

    IPC分类号: H04L29/06

    摘要: A method and system for reducing the number of accesses to memory to obtain the desired field information in frame control blocks. In one embodiment of the present invention, a system comprises a processor configured to process frames of data. The processor may comprise a data flow unit configured to receive and transmit frames of data, where each frame of data may have an associated frame control block. Each frame control block comprises a first and a second control block. The processor may further comprise a first memory coupled to the data flow unit configured to store field information for the first control block. The processor may further comprise a scheduler coupled to the data flow unit where the scheduler is configured to schedule frames of data received by data flow unit. The scheduler may comprise a second memory configured to store field information for the second control block.

    摘要翻译: 一种用于减少对存储器的访问次数以在帧控制块中获得期望的字段信息的方法和系统。 在本发明的一个实施例中,系统包括被配置为处理数据帧的处理器。 处理器可以包括被配置为接收和发送数据帧的数据流单元,其中每个数据帧可以具有相关联的帧控制块。 每个帧控制块包括第一和第二控制块。 处理器还可以包括耦合到数据流单元的第一存储器,其被配置为存储用于第一控制块的字段信息。 处理器还可以包括与数据流单元耦合的调度器,其中调度器被配置为调度由数据流单元接收的数据帧。 调度器可以包括被配置为存储第二控制块的字段信息的第二存储器。

    METHOD AND SYSTEM FOR SCHEDULING INFORMATION USING CALENDARS
    7.
    发明公开
    METHOD AND SYSTEM FOR SCHEDULING INFORMATION USING CALENDARS 有权
    方法和设备,用于使用日历的信息

    公开(公告)号:EP1273140A2

    公开(公告)日:2003-01-08

    申请号:EP01917224.6

    申请日:2001-03-26

    IPC分类号: H04L12/56 H04Q11/04

    摘要: A system and method of moving information units from a network processor toward a data transmission network in a prioritized sequence which accommodates several different levels of service. The present invention includes a method and system for scheduling the egress of processed information units (or frames) from a network processing unit according to stored priorities associated with the various sources of the information units. The priorities in the preferred embodiment include a low latency service, a minimum bandwidth, a weighted fair queueing and a system for preventing a user from continuing to exceed his service levels over an extended period. The present invention includes a plurality of calendars with different service rates to allow a user to select the service rate which he desires. If a customer has chosen a high bandwidth for service, the customer will be included in a calendar which is serviced more often than if the customer has chosen a lower bandwidth.

    摘要翻译: 的系统和从向数据传输网络中的网络处理器中的优先顺序,其容纳几个不同级别的服务的移动信息单元的方法。 本发明包括一种用于从网络处理单元gemäß与信息单元的各个源相关联的存储的优先级的调度处理的信息单元(或帧)的出口的方法和系统。 在优选的实施方案重点包括低延迟服务,最小带宽,加权公平排队,并从持续了超过在较长时间内他的服务水平,防止用户的系统。 本发明包括不同的服务费率日历的多元化,以允许用户选择他期望的服务速度。 如果客户选择了服务高带宽,客户将被包含在一个日历所有这一切都被服务往往比如果客户选择了一个较低的带宽。

    LINKING FRAME DATA BY INSERTING QUALIFIERS IN CONTROL BLOCKS
    10.
    发明公开
    LINKING FRAME DATA BY INSERTING QUALIFIERS IN CONTROL BLOCKS 有权
    连接机架数据。通过确定控制块添加字段

    公开(公告)号:EP1362465A2

    公开(公告)日:2003-11-19

    申请号:EP02712096.3

    申请日:2002-02-20

    IPC分类号: H04L29/06

    摘要: A method and system for reducing memory accesses by inserting qualifiers in control blocks. In one embodiment, a system comprises a processor configured to process frames of data. The processor may comprise a plurality of buffers configured to store frames of data where each frame of data may be associated with a frame control block. Each frame control block associated with a frame of data may be associated with one or more buffer control blocks. Each control block, e.g., frame control block, buffer control block, may comprise one or more qualifier fields that comprise information unrelated to the current control block. Instead, qualifiers may comprise information related to an another control block. The last frame control block in a queue as well as the last buffer control block associated with a frame control block may comprise fields with no information thereby reducing memory accesses to access information in those fields.