会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明公开
    • WEIGHTED RANDOM SCHEDULING
    • GEWICHTETE ZUFALLSEINTEILUNG
    • EP1741229A1
    • 2007-01-10
    • EP05724365.1
    • 2005-03-02
    • Cisco Technology, Inc., c/o Robert Barr
    • PANIGRAHY, RinaNEMAT, Awais, Bin
    • H04L12/26
    • H04L49/253H04L49/205H04L49/254H04L49/30H04L49/3045
    • 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.
    • 执行加权随机调度,这可能特别适用于分组交换系统。 对于多个开关输入的每个特定输入,通过加权随机选择特定输入具有一个或多个分组要发送的输出之一来产生向交换机的输出之一发送分组的请求。 其中一个请求被授予生成一个或多个请求的每个不同的输出。 数据包在输入和对应于授权请求的输出之间发送。 加权随机选择通常基于通过输入的相应输入发送到每个输出的分组或字节的数量进行加权,最后一次分组从输入的相应输入发送到每个输出,以及 /与通过输入的相应输入发送到每个输出的分组相关联的服务等级。
    • 5. 发明公开
    • ASSOCIATIVE MEMORY WITH ENHANCED CAPABILITIES
    • ASSOZIATIVER SPEICHER MIT ERWEITERTENMÖGLICHKEITEN
    • EP1530763A2
    • 2005-05-18
    • EP03784783.7
    • 2003-07-19
    • Cisco Technology, Inc.,c/o Robert Barr
    • EATHERTON, William, N.LEE, JaushinPRIYADARSHAN, Bangalore, L.WARKHEDE, Priyank, RameshERTEMALP, FusunHOLBROOK, Hugh, WeberDEVIREDDY, Dileep, KumarKANEKAR, Bhushan, MangeshPULLELA, Venkateshwar, Rao
    • G06F17/30
    • G06F17/30982
    • Methods and apparatus are disclosed for performing lookup operations using associative memories, including, but not limited to modifying search keys within an associative memory based on modification mappings, forcing a no-hit condition in response to a highest-priority matching entry including a force no-hit indication, selecting among various sets or banks of associative memory entries in determining a lookup result, and detecting and propagating error conditions. In one implementation, each block retrieves a modification mapping from a local memory and modifies a received search key based on the mapping and received modification data. In one implementation, each of the associative memory entries includes a field for indicating that a successful match on the entry should or should not force a no-hit result. In one implementation, an indication of which associative memory blocks or sets of entries to use in a particular lookup operation is retrieved from a memory.
    • 公开了用于使用关联存储器执行查找操作的方法和装置,包括但不限于:基于修改映射修改关联存储器内的搜索关键字,响应于最高优先级的匹配条目来响应不受限制的条件,包括力 - 指示,在确定查找结果中选择各种组或组合的联想存储器条目,以及检测和传播错误条件。 在一个实现中,每个块从本地存储器检索修改映射,并且基于映射和接收到的修改数据修改接收的搜索密钥。 在一个实现中,每个关联存储器条目包括用于指示条目上的成功匹配应该或不应该强制无命中结果的字段。 在一个实现中,从存储器检索在特定查找操作中使用的哪些关联存储器块或条目集合的指示。