利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

80 条记录 (耗时 0.035 秒)

    Bandwidth allocation in accordance with shared queue output limit
    62.
    发明授权
    Bandwidth allocation in accordance with shared queue output limit 失效
    带宽分配按照共享队列输出限制

    公开(公告)号：US06701389B2

    公开(公告)日：2004-03-02

    申请号：US09876358

    申请日：2001-06-07

    申请人： Brahmanand Kumar Gorti ,  Dongming Hwang ,  Clark Debs Jeffries ,  Michael Steven Siegel ,  Kartik Sudeep

    发明人： Brahmanand Kumar Gorti ,  Dongming Hwang ,  Clark Debs Jeffries ,  Michael Steven Siegel ,  Kartik Sudeep

    IPC分类号： G06F300

    CPC分类号： H04L47/30 ,  H04L47/10 ,  H04L47/263 ,  H04L47/32 ,  Y02D50/10

    摘要： A method for dynamically adjusting the flow rate of a plurality of logical pipes that share a common output queue. In accordance with the method of the present invention, a minimum flow rate and a maximum flow rate are set for each of the pipes. Next a determination is made of whether or not excess queue bandwidth exists in accordance with the output flow rate of the shared queue. The determination of whether or not excess bandwidth exists comprises comparing the output flow rate of the shared queue with a pre-determined threshold queue output value. An instantaneous excess bandwidth signal has a value of 1 if there is excess bandwidth and is otherwise 0 if there is no excess bandwidth. In an alternate embodiment, the instantaneous excess bandwidth signal for a particular pipe is logically ANDed with one or more additional excess bandwidth signals to form a composite instantaneous excess bandwidth signal. In response to the existence of excess queue bandwidth, a flow rate of a pipe is linearly increased while in response to a lack of excess queue bandwidth, the flow rate of the pipe is exponentially decreased.

    摘要翻译： 一种用于动态调整共享公共输出队列的多个逻辑管道的流量的方法。 根据本发明的方法，为每个管设定最小流量和最大流量。 接下来，根据共享队列的输出流量确定是否存在过量队列带宽。 确定是否存在超量带宽包括将共享队列的输出流量与预定阈值队列输出值进行比较。 如果存在过多的带宽，则瞬时过量带宽信号的值为1，如果没有超额带宽，则为0。 在替代实施例中，用于特定管道的瞬时过量带宽信号与一个或多个附加过量带宽信号进行逻辑“与”，以形成复合瞬时过量带宽信号。 响应于存在多余的队列带宽，管道的流量线性增加，同时响应于缺少多余的队列带宽，管道的流量呈指数下降。

    Full match (FM) search algorithm implementation for a network processor
    63.
    发明授权
    Full match (FM) search algorithm implementation for a network processor 失效
    网络处理器的完全匹配（FM）搜索算法实现

    公开(公告)号：US06675163B1

    公开(公告)日：2004-01-06

    申请号：US09543531

    申请日：2000-04-06

    申请人： Brian Mitchell Bass ,  Jean Louis Calvignac ,  Marco C. Heddes ,  Antonios Maragkos ,  Piyush Chunilal Patel ,  Michael Steven Siegel ,  Fabrice Jean Verplanken

    发明人： Brian Mitchell Bass ,  Jean Louis Calvignac ,  Marco C. Heddes ,  Antonios Maragkos ,  Piyush Chunilal Patel ,  Michael Steven Siegel ,  Fabrice Jean Verplanken

    IPC分类号： G06F1730

    CPC分类号： H04L45/742 ,  H04L45/7453 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99936 ,  Y10S707/99937 ,  Y10S707/99943 ,  Y10S707/99945

    摘要： Novel data structures, methods and apparatus for finding a full match between a search pattern and a pattern stored in a leaf of the search tree. A key is input, a hash function is performed on the key, a direct table (DT) is accessed, and a tree is walked through pattern search control blocks (PSCBs) until reaching a leaf. The search mechanism uses a set of data structures that can be located in a few registers and regular memory, and then used to build a Patricia tree structure that can be manipulated by a relatively simple hardware macro. Both keys and corresponding information needed for retrieval are stored in the Patricia tree structure. The hash function provides an n→n mapping of the bits of the key to the bits of the hash key. The data structure that is used to store the hash key and the related information in the tree is called a leaf. Each leaf corresponds to a single key that matches exactly with the input key. The leaf contains the key as well as additional information. The length of the leaf is programmable, as is the length of the key. The leaf is stored in random access memory and is implemented as a single memory entry. If the key is located in the direct table then it is called a direct leaf.

    摘要翻译： 用于在搜索图案和存储在搜索树的叶中的模式之间找到完全匹配的新型数据结构，方法和装置。 键输入，对密钥执行哈希函数，访问直接表（DT），并通过模式搜索控制块（PSCB），树直到达到叶。 搜索机制使用一组可以位于几个寄存器和常规内存中的数据结构，然后用于构建可由相对简单的硬件宏操作的Patricia树结构。 检索所需的两个密钥和相应的信息都存储在Patricia树结构中。 散列函数提供密钥的比特到散列密钥的比特的n> n映射。 用于存储散列键和树中相关信息的数据结构称为叶。 每个叶对应于与输入键完全匹配的单个键。 叶包含关键以及其他信息。 叶片的长度是可编程的，密钥的长度也是可编程的。 叶存储在随机存取存储器中，并被实现为单个存储器条目。 如果键位于直接表中，则称为直接叶。

    Method and system for managing congestion in a network
    64.
    发明授权
    Method and system for managing congestion in a network 失效
    管理网络拥塞的方法和系统

    公开(公告)号：US06657962B1

    公开(公告)日：2003-12-02

    申请号：US09546651

    申请日：2000-04-10

    申请人： Peter Irma August Barri ,  Brian Mitchell Bass ,  Jean Louis Calvignac ,  Ivan Oscar Clemminck ,  Marco C. Heddes ,  Clark Debs Jeffries ,  Michael Steven Siegel ,  Fabrice Jean Verplanken ,  Miroslav Vrana

    发明人： Peter Irma August Barri ,  Brian Mitchell Bass ,  Jean Louis Calvignac ,  Ivan Oscar Clemminck ,  Marco C. Heddes ,  Clark Debs Jeffries ,  Michael Steven Siegel ,  Fabrice Jean Verplanken ,  Miroslav Vrana

    IPC分类号： H04L1256

    CPC分类号： H04L47/2441 ,  H04L47/10 ,  H04L47/12 ,  H04L47/30 ,  H04L47/32 ,  H04L49/103 ,  H04L49/3018 ,  H04L49/50 ,  H04L49/90

    摘要： A system for minimizing congestion in a communication system is disclosed. The system comprises at least one ingress system for providing data. The ingress system includes a first free queue and a first flow queue. The system also includes a first congestion adjustment module for receiving congestion indications from the free queue and the flow queue. The first congestion adjustment module generates end stores transmit probabilities and performs per packet flow control actions. The system further includes a switch fabric for receiving data from the ingress system and for providing a congestion indication to the ingress system. The system further includes at least one egress system for receiving the data from the switch fabric. The egress system includes a second free queue and a second flow queue. The system also includes a second congestion adjustment module for receiving congestion indications from the second free queue and the second flow queue. The second congestion adjustment module generates and stores transmit probabilities and performs per packet flow control actions. Finally, the system includes a scheduler for determining the order and timing of transmission of packets out the egress system and to another node or destination. A method and system in accordance with the present invention provides for a unified method and system for logical connection of congestion with the appropriate flow control responses. The method and system utilizes congestion indicators within the ingress system, egress system, and the switch fabric in conjunction with a coarse adjustment system and fine adjustment system within the ingress device and the egress device to intelligently manage the system.

    摘要翻译： 公开了一种用于最小化通信系统中的拥塞的系统。 该系统包括用于提供数据的至少一个入口系统。 入口系统包括第一空闲队列和第一流队列。 该系统还包括用于从空闲队列和流队列接收拥塞指示的第一拥塞调整模块。 第一拥塞调整模块生成终端存储发送概率并执行每个分组流控制动作。 该系统还包括用于从入口系统接收数据并向入口系统提供拥塞指示的交换结构。 该系统还包括用于从交换结构接收数据的至少一个出口系统。 出口系统包括第二空闲队列和第二流队列。 该系统还包括第二拥塞调整模块，用于从第二空闲队列和第二流队列接收拥塞指示。 第二拥塞调整模块生成并存储发送概率，并执行每个分组流控制动作。 最后，该系统包括一个调度器，用于确定出口系统和另一个节点或目的地的分组传输的顺序和定时。 根据本发明的方法和系统提供了用于将拥塞与适当流控制响应逻辑连接的统一方法和系统。 该方法和系统利用入口系统，出口系统和交换结构中的拥塞指示符与入口设备和出口设备内的粗调系统和精细调整系统结合，智能地管理系统。

    Priority based bandwidth allocation within real-time and non-real-time traffic streams
    66.
    发明授权
    Priority based bandwidth allocation within real-time and non-real-time traffic streams 失效
    实时和非实时业务流中基于优先级的带宽分配

    公开(公告)号：US07899069B2

    公开(公告)日：2011-03-01

    申请号：US12114767

    申请日：2008-05-03

    申请人： Brahmanand Kumar Gorti ,  Marco Heddes ,  Clark Debs Jeffries ,  Andreas Kind ,  Michael Steven Siegel

    发明人： Brahmanand Kumar Gorti ,  Marco Heddes ,  Clark Debs Jeffries ,  Andreas Kind ,  Michael Steven Siegel

    IPC分类号： H04L12/28 ,  H04L12/56

    CPC分类号： H04L47/6215 ,  H04L47/10 ,  H04L47/2416 ,  H04L47/2433 ,  H04L47/30 ,  H04L47/32 ,  H04L47/50 ,  H04L47/52 ,  H04L47/56

    摘要： A method and system for transmitting packets in a packet switching network. Packets received by a packet processor may be prioritized based on the urgency to process them. Packets that are urgent to be processed may be referred to as real-time packets. Packets that are not urgent to be processed may be referred to as non-real-time packets. Real-time packets have a higher priority to be processed than non-real-time packets. A real-time packet may either be discarded or transmitted into a real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time queue congestion conditions. A non-real-time packet may either be discarded or transmitted into a non-real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time and non-real-time queue congestion conditions.

    摘要翻译： 一种用于在分组交换网络中传送分组的方法和系统。 可以基于处理它们的紧急性来优先考虑由分组处理器接收的分组。 紧急处理的数据包可以称为实时数据包。 不紧急处理的数据包可能被称为非实时数据包。 实时数据包的优先级要高于非实时数据包。 可以根据其值优先级，该值优先级的最小和最大速率以及当前实时队列拥塞条件，将实时分组丢弃或传输到实时队列中。 可以基于其值优先级，该值优先级的最小和最大速率以及当前的实时和非实时队列拥塞将非实时分组丢弃或发送到非实时队列 条件。

    Flow control in computer networks
    67.
    发明授权
    Flow control in computer networks 失效
    计算机网络中的流量控制

    公开(公告)号：US07646709B2

    公开(公告)日：2010-01-12

    申请号：US11560088

    申请日：2006-11-15

    申请人： Clark Debs Jeffries ,  Jitesh Ramachandran Nair ,  Michael Steven Siegel ,  Rama Mohan Yedavalli

    发明人： Clark Debs Jeffries ,  Jitesh Ramachandran Nair ,  Michael Steven Siegel ,  Rama Mohan Yedavalli

    IPC分类号： H04L12/26

    CPC分类号： H04L47/30 ,  H04L47/10 ,  H04L47/29 ,  H04L47/32

    摘要： The decision within a packet processing device to transmit a newly arriving packet into a queue to await processing or to discard the same packet is made by a flow control method and system. The flow control is updated with a constant period determined by storage and flow rate limits. The update includes comparing current queue occupancy to thresholds and also comparing present queue occupancy to previous queue occupancy. The outcome of the update is a new transmit probability value. The value is stored for the subsequent period of flow control and packets arriving during that period are subject to a transmit or discard decision that uses that value.

    摘要翻译： 通过流控制方法和系统来进行分组处理装置中将新到达的分组发送到队列中等待处理或丢弃相同分组的决定。 流量控制以由存储和流量限制确定的恒定周期进行更新。 该更新包括将当前队列占用率与阈值进行比较，还将当前队列占用率与先前队列占用率进行比较。 更新的结果是新的传输概率值。 该值存储在随后的流量控制周期中，并且在该时间段期间到达的分组经受使用该值的发送或丢弃决定。

    Method and Apparatus for Preventing Starvation in a Slotted Ring Data Communications Network
    69.
    发明申请
    Method and Apparatus for Preventing Starvation in a Slotted Ring Data Communications Network 失效
    用于在开槽环数据通信网络中预防饥饿的方法和装置

    公开(公告)号：US20070297441A1

    公开(公告)日：2007-12-27

    申请号：US11426746

    申请日：2006-06-27

    申请人： Timothy Hume Heil ,  Michael Steven Siegel ,  Jeffrey R. Summers ,  Steven Paul VanderWiel

    发明人： Timothy Hume Heil ,  Michael Steven Siegel ,  Jeffrey R. Summers ,  Steven Paul VanderWiel

    IPC分类号： H04L12/43

    CPC分类号： H04L12/4035 ,  H04L12/423

    摘要： In a slotted ring network, a node may transmit a non-renewable slot reservation with any unreserved slot. The reservation restricts other nodes from transmitting a new packet in the slot. When the slot returns around the ring to the reserving node, the slot will be available. Preferably, reservation is made responsive to a starvation condition in the reserving node, which may be detected in any of various ways. In an optional enhancement, a reservation identifies the reserving node, and another node on the ring is free to transmit a new packet in the reserved slot if the new packet will reach its destination at or before the reserving node, and thus will not interfere with the reservation.

    摘要翻译： 在时隙环网络中，节点可以用任何未预留的时隙发送不可更新的时隙预留。 该预约限制其他节点在时隙中发送新的分组。 当插槽返回环到保留节点时，插槽将可用。 优选地，响应于预留节点中的饥饿状况做出预约，其可以以各种方式中的任一种来检测。 在可选增强中，预留识别预留节点，并且如果新分组将在保留节点处或之前到达其目的地，则环上的另一个节点可以自由地在保留时隙中发送新分组，并且因此不会干扰 预订。

    Method and system for network processor scheduling outputs using queueing
    70.
    发明授权
    Method and system for network processor scheduling outputs using queueing 失效
    使用排队的网络处理器调度输出的方法和系统

    公开(公告)号：US06952424B1

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

    申请号：US09548912

    申请日：2000-04-13

    申请人： Brian Mitchell Bass ,  Jean Louis Calvignac ,  Marco C. Heddes ,  Michael Steven Siegel ,  Fabrice Jean Verplanken

    发明人： Brian Mitchell Bass ,  Jean Louis Calvignac ,  Marco C. Heddes ,  Michael Steven Siegel ,  Fabrice Jean Verplanken

    IPC分类号： H04L12/28 ,  H04L12/56 ,  H04L29/06

    CPC分类号： H04L49/90

    摘要： 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 weighted fair queueing system where the position of the next service in a best efforts system for using bandwidth which is not used by committed bandwidth is determined based on the length of the frame and the weight of the particular flow. A “back pressure” system keeps a flow from being selected if its output cannot accept an additional frame because the current level of that port queue exceeds a threshold.

    摘要翻译： 一种将信息单元从网络处理器移动到数据传输网络的系统和方法，其以容纳几个不同级别的服务的优先顺序排列。 本发明包括一种方法和系统，用于根据存储的与信息单元的各种源相关联的优先级来调度来自网络处理单元的处理的信息单元（或帧）的出口。 优选实施例中的优先级包括低延迟服务，最小带宽，加权公平排队以及用于在较长时间内防止用户继续超过其服务水平的系统。 本发明包括一个加权公平排队系统，其中基于帧的长度和特定流的权重确定用于使用未被承诺带宽使用的带宽的最佳努力系统中的下一个服务的位置。 如果该端口队列的当前级别超过阈值，则“背压”系统的输出不能接受额外的帧，从而保持流量的选择。