会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Method and apparatus for implementing a quality of service policy in a data communications network
    • 用于在数据通信网络中实现服务质量策略的方法和装置
    • US06798746B1
    • 2004-09-28
    • US10156971
    • 2002-05-28
    • Raymond J. KlothThomas J. EdsallMichael FineDinesh G. Dutt
    • Raymond J. KlothThomas J. EdsallMichael FineDinesh G. Dutt
    • G01R3108
    • H04L47/32H04L47/10H04L47/20H04L47/215H04L47/24H04L47/2441H04L47/29H04L49/90
    • A content addressable memory (CAM or L3 Table) contains flow information for each active flow of packets passing through a given node of a data communications network. The CAM has associated with each entry (corresponding to each active flow) a packet counter, a byte counter, a token bucket and a contract value. Each flow is assigned one of a plurality of output queues and optionally at least one output threshold value. A token bucket algorithm is employed on each flow to determine whether packets from that flow exceed the contract value. Such packets may be dropped or optimally modified to reflect an alternate output queue and/or alternate threshold before being sent to the selected output queue for transmission from the node. In another aspect an access control list CAM (ACLCAM) contains masked flow information. The ACLCAM provides an index to internal token bucket counters and preconfigured contract values of an aggregate flow table which becomes affected by the packet statistics. In this way flows are aggregated for assignment of output queues and thresholds, possible dropping and possible modification of packets. In another aspect the CAM contains active flow information, the ACLCAM and the aggregate flow table are combined in one system and used to produce in parallel a pair of traffic rate limiting and prioritizing decisions for each packet. The two results are then resolved to yield a single result.
    • 内容可寻址存储器(CAM或L3表)包含通过数据通信网络的给定节点的分组的每个活动流的流信息。 CAM与分组计数器,字节计数器,令牌桶和合同值的每个条目(对应于每个活动流)相关联。 每个流被分配多个输出队列中的一个和可选的至少一个输出阈值。 在每个流中使用令牌桶算法来确定来自该流的分组是否超过了合同值。 在发送到所选择的输出队列以便从节点传输之前,可以丢弃或最佳地修改这样的分组以反映替代输出队列和/或替代阈值。 在另一方面,访问控制列表CAM(ACLCAM)包含被屏蔽的流信息。 ACLCAM为内部令牌桶计数器提供索引,并为分组统计信息影响的聚合流表的预配置合同值。 以这种方式,聚合流量以分配输出队列和阈值,可能丢弃和可能的修改数据包。 在另一方面,CAM包括活动流信息,ACLCAM和聚合流表在一个系统中组合并且用于并行地产生一对每个分组的业务速率限制和优先级决定。 然后解析两个结果以产生单个结果。
    • 6. 发明授权
    • Search engine for forwarding table content addressable memory
    • 搜索引擎转发表内容可寻址内存
    • US06570877B1
    • 2003-05-27
    • US09287301
    • 1999-04-07
    • Raymond J. KlothKevin D. MorishigeVenkateshwar Rao Pullela
    • Raymond J. KlothKevin D. MorishigeVenkateshwar Rao Pullela
    • G06F1338
    • H04L45/00H04L45/7453H04L49/90
    • A hardware search engine facility is provided to allow CPU search and update of a Forwarding Table CAM under the control of software running on the CPU. The hardware search engine provides one or more comparand-mask pairs which allow for a match, exclusion or magnitude comparison on specific entry values and/or the option to ignore or “don't care” certain bits of the entry. Control registers may be set in software to specify a start address and stop address in the CAM for the search. An indication of valid or invalid entries may be provided as well. Once the search is initiated by software, the search engine will read the entries sequentially starting from the programmed start address. It will perform a compare using the comparand-mask pair and attempt to identify a match. The locations in the CAM which match the search criteria may be put into a CPU-accessible memory. If the memory fills up before it can be read by the software, the search may be halted until the memory is emptied. A programmable action may instead, or in addition, be set to take place in the event of a match. Such programmable actions may include, but are not limited to, marking the entry, deleting the entry, change status bits corresponding to the entry, rewriting some of the entry, and the like.
    • 提供硬件搜索引擎设备,以便在CPU上运行的软件控制下CPU搜索和更新转发表CAM。 硬件搜索引擎提供一个或多个比较屏蔽对,其允许对特定输入值进行匹配,排除或幅度比较和/或忽略或“不关心”条目的某些位的选项。 软件中可以设置控制寄存器,以指定搜索的CAM中的起始地址和停止地址。 也可以提供有效或无效的条目的指示。 一旦搜索由软件启动,搜索引擎将从编程的起始地址顺序读取条目。 它将使用比较掩码对执行比较,并尝试识别匹配。 符合搜索条件的CAM中的位置可以放入CPU可访问的存储器中。 如果在软件读取之前内存填满,则可能会停止搜索,直到内存清空为止。 可以替代地或另外设置可编程动作,以在匹配的情况下进行。 这样的可编程动作可以包括但不限于标记条目,删除条目,对应于条目的改变状态位,重写条目中的一些等等。
    • 10. 发明授权
    • Scalable approach to large scale queuing through dynamic resource allocation
    • 通过动态资源分配进行大规模排队的可扩展方法
    • US08199764B2
    • 2012-06-12
    • US10648624
    • 2003-08-25
    • Robert HoffmanRaymond J. KlothAlessandro Fulli
    • Robert HoffmanRaymond J. KlothAlessandro Fulli
    • H04L12/56
    • H04L49/9047H04L47/6215H04L49/30H04L49/3045H04L49/90
    • Methods and devices are provided for the efficient allocation and deletion of virtual output queues. According to some implementations, incoming packets are classified according to a queue in which the packet (or classification information for the packet) will be stored, e.g., according to a “Q” value. For example, a Q value may be a Q number defined as {Egress port number∥Priority number∥Ingress port number}. Only a single physical queue is allocated for each classification. When a physical queue is empty, the physical queue is preferably de-allocated and added to a “free list” of available physical queues. Accordingly, the total number of allocated physical queues preferably does not exceed the total number of classified packets. Because the input buffering requirements of Fiber Channel (“FC”) and other protocols place limitations on the number of incoming packets, the dynamic allocation methods of the present invention result in a sparse allocation of physical queues.
    • 提供了方法和设备,用于有效分配和删除虚拟输出队列。 根据一些实现方式,输入分组根据其中将存储分组(或分组的分类信息)的队列进行分类,例如根据“Q”值。 例如,Q值可以是定义为{出口端口号|优先级号|入口端口号}的Q号。 每个分类只分配一个物理队列。 当物理队列为空时,物理队列优选地被去分配并被添加到可用物理队列的“空闲列表”中。 因此,分配的物理队列的总数优选地不超过分类分组的总数。 由于光纤通道(“FC”)和其他协议的输入缓冲要求对输入数据包数量的限制,本发明的动态分配方法导致物理队列的稀疏分配。