公开(公告)号：US07061867B2

公开(公告)日：2006-06-13

申请号：US10115229

申请日：2002-04-02

Applicant: Anguo T. Huang ,  Jing Ling ,  Jean-Michel Caia ,  Juan-Carlos Calderon ,  Vivek Joshi

Inventor： Anguo T. Huang ,  Jing Ling ,  Jean-Michel Caia ,  Juan-Carlos Calderon ,  Vivek Joshi

IPC: H04J1/16 ,  H04L1/00 ,  H04L12/26 ,  G01R31/08

CPC classification number: H04L47/6215 ,  H04L47/10 ,  H04L47/39 ,  H04L47/50 ,  H04L47/521 ,  H04L47/627

Abstract: The rate-based scheduling for a network application is used to control the bandwidth available to a flow while scheduling the transmission of the flow. The rate-based scheduling uses rate credits to represent the amount of data a flow is permitted to transmit and only permits a flow to transmit if the flow has rate credit available. A flow is permitted to transmit only if the peak packet rate for the scheduler has not been exceeded.

公开(公告)号：US07065628B2

公开(公告)日：2006-06-20

申请号：US10158409

申请日：2002-05-29

Applicant: Juan-Carlos Calderon ,  Jing Ling ,  Jean-Michel Caia ,  Vivek Joshi ,  Anguo T. Huang

Inventor： Juan-Carlos Calderon ,  Jing Ling ,  Jean-Michel Caia ,  Vivek Joshi ,  Anguo T. Huang

IPC: G06F12/00

CPC classification number: H04L49/103 ,  H04L49/109 ,  H04L49/254

Abstract: Memory access efficiency for packet applications may be improved by transferring full partitions of data. The number of full partitions written to external memory may be increased by temporarily storing packets using on-chip memory that is on a chip with the processor. Before writing packets to external memory, packets of length smaller than the external memory partition size may be temporarily stored in the on-chip memory until an amount corresponding to a full or nearly full partition has been collected, at which point the data can be efficiently written to an external memory partition.

公开(公告)号：US06944728B2

公开(公告)日：2005-09-13

申请号：US10329283

申请日：2002-12-23

Applicant: Juan-Carlos Calderon ,  Jean-Michel Caia ,  Vivek Joshi ,  Jing Ling ,  Anguo T. Huang

Inventor： Juan-Carlos Calderon ,  Jean-Michel Caia ,  Vivek Joshi ,  Jing Ling ,  Anguo T. Huang

IPC: G06F12/00 ,  H04L12/56

CPC classification number: H04L49/103

Abstract: Interleaving memory access includes enabling data included in a receive flow of data to be stored in a first memory bank, enabling data included in a transmit flow of data to be stored in a second memory bank, and alternating access of data in the first memory bank with access of data in the second memory bank.

Abstract translation: 交错存储器访问包括允许包含在接收数据流中的数据被存储在第一存储体中，使包含在数据传输流中的数据能够存储在第二存储体中，以及交替访问第一存储体中的数据 具有访问第二存储体中的数据。

公开(公告)号：US06892284B2

公开(公告)日：2005-05-10

申请号：US10242580

申请日：2002-09-11

Applicant: Jing Ling ,  Juan-Carlos Calderon ,  Jean-Michel Caia ,  Vivek Joshi ,  Anguo T. Huang ,  Steve J. Clohset

Inventor： Jing Ling ,  Juan-Carlos Calderon ,  Jean-Michel Caia ,  Vivek Joshi ,  Anguo T. Huang ,  Steve J. Clohset

IPC: G06F12/00 ,  G06F12/02 ,  H04L12/56

CPC classification number: H04L49/9047 ,  H04L49/90 ,  H04L49/901 ,  H04L2012/5681 ,  Y10S707/99953 ,  Y10S707/99956

Abstract: A memory is divided into a number of partitions. The partitions are grouped into a first group of partitions and a second group of partitions. When required by a port, a partition is assigned to the port from a pool of un-assigned partitions. The pool of un-assigned partitions comprises of un-assigned partitions from the first group of partitions and un-assigned partitions from the second group of partitions. The un-assigned partitions from the first group of partitions are assigned to the port until a first threshold is reached. The un-assigned partitions from the second group of partitions are assigned to the port after the first threshold is reached. A second threshold is used to limit a total number of partitions assigned to the port.

Abstract translation: 内存分为多个分区。 分区被分组成第一组分区和第二组分区。 当端口需要时，从未分配的分区池将分区分配给该端口。 未分配分区的池包括来自第一组分区的未分配分区和来自第二组分区的未分配分区。 来自第一组分区的未分配分区被分配给端口，直到达到第一阈值。 来自第二组分区的未分配分区在达到第一个阈值后分配给该端口。 第二个阈值用于限制分配给端口的分区的总数。

公开(公告)号：US07295564B2

公开(公告)日：2007-11-13

申请号：US10337615

申请日：2003-01-06

Applicant: Jing Ling ,  Juan-Carlos Calderon ,  Jean-Michel Caia ,  Anguo T. Huang ,  Vivek Joshi

Inventor： Jing Ling ,  Juan-Carlos Calderon ,  Jean-Michel Caia ,  Anguo T. Huang ,  Vivek Joshi

IPC: H04L12/54

CPC classification number: H04L49/3045 ,  H04L47/50 ,  H04L47/621 ,  H04L47/624 ,  H04L49/205 ,  H04L49/3027 ,  H04L49/3072 ,  H04L49/90 ,  H04L49/901 ,  H04L49/9094

Abstract: A method and apparatus for providing a virtual output queue (VoQ) from a received set of data packets in a multi-service system. Each packet is divided into at least one partition, including a last partition that includes packet information, such as error status and packet length. The system receives the packet from a flow, parses the packet into partitions, including a first partition and the last partition, places each last partition into a linked list based on a time when the last partition was received, links the last partition to the first partition, and employs the linked list as the output queue. This system allows for rapid compilation and transmission of different sized packets, and obviates the need for the receiving processor to wait for the last partition to discard a bad packet.

Abstract translation: 一种用于在多业务系统中从接收的一组数据分组提供虚拟输出队列（VoQ）的方法和装置。 每个分组被分成至少一个分区，包括包括分组信息的最后一个分区，例如错误状态和分组长度。 系统从流接收数据包，将数据包解析为分区，包括第一个分区和最后一个分区，根据接收到最后一个分区的时间，将最后一个分区放入链表中，将最后一个分区链接到第一个分区 分区，并使用链表作为输出队列。 该系统允许不同大小的分组的快速编译和传输，并且避免了接收处理​​器等待最后一个分区丢弃坏分组的需要。

公开(公告)号：US07154853B2

公开(公告)日：2006-12-26

申请号：US10137753

申请日：2002-05-02

Applicant: Jean-Michel Caia ,  Jing Ling ,  Juan-Carlos Calderon ,  Vivek Joshi ,  Anguo T. Huang

Inventor： Jean-Michel Caia ,  Jing Ling ,  Juan-Carlos Calderon ,  Vivek Joshi ,  Anguo T. Huang

IPC: G01R31/08 ,  G06F11/00

CPC classification number: H04L12/5601 ,  H04L2012/5636 ,  H04L2012/5637

Abstract: A rate policing algorithm for packet flows is based on counters and threshold checking. The rate policing algorithm utilizes a state machine having four links: (1) compliant state to compliant state; (2) transition from compliant state to non-compliant state; (3) non-compliant state to non-compliant state; and (4) transition from non-compliant state to compliant state. Depending on the values obtained from the counters and utilizing the threshold values, it is determined whether a flow rate for packets is compliant or non-compliant.