会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Bandwidth allocation in accordance with shared queue output limit
    • 带宽分配按照共享队列输出限制
    • US06701389B2
    • 2004-03-02
    • US09876358
    • 2001-06-07
    • Brahmanand Kumar GortiDongming HwangClark Debs JeffriesMichael Steven SiegelKartik Sudeep
    • Brahmanand Kumar GortiDongming HwangClark Debs JeffriesMichael Steven SiegelKartik Sudeep
    • G06F300
    • H04L47/30H04L47/10H04L47/263H04L47/32Y02D50/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。 在替代实施例中,用于特定管道的瞬时过量带宽信号与一个或多个附加过量带宽信号进行逻辑“与”,以形成复合瞬时过量带宽信号。 响应于存在多余的队列带宽,管道的流量线性增加,同时响应于缺少多余的队列带宽,管道的流量呈指数下降。
    • 6. 发明授权
    • Method and system for providing differentiated services in computer networks
    • 在计算机网络中提供差异化​​服务的方法和系统
    • US06657960B1
    • 2003-12-02
    • US09448197
    • 1999-11-23
    • Clark Debs JeffriesBrahmanand Kumar GortiMichael Steven Siegel
    • Clark Debs JeffriesBrahmanand Kumar GortiMichael Steven Siegel
    • H04L1228
    • H04L47/10H04L47/29H04L47/30
    • A method and system for controlling a plurality of pipes in a computer network is disclosed. The computer network includes at least one processor for a switch. The at least one processor has a queue. The plurality of pipes utilizes the queue for transmitting traffic through the switch. The method and system include allowing a minimum flow and a maximum flow to be set for each of the plurality of pipes and determining if excess bandwidth exists for the queue. The method and system also include linearly increasing a flow for a pipe of the plurality of pipes based on the minimum flow or the maximum flow if excess bandwidth exists and if the flow for the pipe of the plurality of pipes is less than the maximum flow for the pipe. The method and system also include exponentially decreasing the flow for the pipe of the plurality of pipes based on the minimum flow or the maximum flow if excess bandwidth does not exist and the flow is greater than the minimum flow for the pipe. Thus, the traffic through the queue is stable.
    • 公开了一种用于控制计算机网络中的多个管道的方法和系统。 计算机网络包括用于交换机的至少一个处理器。 至少一个处理器具有队列。 多个管道利用队列通过交换机传输业务。 该方法和系统包括允许针对多个管道中的每个管道设置最小流量和最大流量,并确定队列是否存在超额带宽。 该方法和系统还包括如果存在多余管道时基于最小流量或最大流量线性地增加多个管道中的管道的流量,并且如果多个管道的管道流量小于最大流量 管道。 该方法和系统还包括如果超出带宽不存在并且流量大于管道的最小流量,则基于最小流量或最大流量,指数地减少多个管道的管道的流量。 因此,通过队列的流量是稳定的。
    • 8. 发明授权
    • Scaleable and robust solution for reducing complexity of resource identifier distribution in a large network processor-based system
    • 可扩展和可靠的解决方案,用于降低基于大型网络处理器的系统中资源标识符分发的复杂性
    • US06473434B1
    • 2002-10-29
    • US09838916
    • 2001-04-20
    • Yonas ArayaClaude BassoBrahmanand Kumar Gorti
    • Yonas ArayaClaude BassoBrahmanand Kumar Gorti
    • H04L1254
    • H04L47/10H04L47/2408
    • In a router comprising one or more network processing (NP) devices for routing data packets from a source NP device to a destination device via a switch fabric, with each network processing device supporting a number of interface ports, each port capable of interfacing with one or more data queues for receiving packets associated with a class-of-service characterizing the routing of the packets, a system and method for routing packets comprising: classifying a packet to be forwarded from a source NP device according to a particular class-of-service and determining outgoing interface port information of a destination NP device to forward the packet, the interface port having a pre-defined queue base address associated therewith; encoding a queue index offset for the packet associated with a particular class-of-service associated with the packet to be routed; forwarding the packet, queue index offset and outgoing interface port information to the destination NP; and, determining a queue identifier from the base address and transmitted queue index offset for indicating a particular queue by which the classified packet is to be forwarded, wherein the queue identifier is determined locally at the destination NP device forwarding the packet.
    • 在包括一个或多个网络处理(NP)设备的路由器中,所述网络处理(NP)设备用于经由交换结构将数据分组从源NP设备路由到目的地设备,每个网络处理设备支持多个接口端口,每个端口能够与一个接口 或更多数据队列,用于接收与表征所述分组路由的服务等级相关联的分组,用于路由分组的系统和方法,包括:根据特定类别的分组对从源NP设备转发的分组进行分类, 服务和确定目的地NP设备的出接口端口信息以转发该分组,该接口端口具有与之相关联的预定义的队列基地址; 编码与要路由的分组相关联的特定服务类别的分组的队列索引偏移量; 转发报文,队列索引偏移和出接口端口信息到目的端口NP; 以及从所述基地址和所发送的队列索引偏移量确定队列标识符,以指示所述分类分组将被转发的特定队列,其中所述队列标识符是在转发所述分组的目的地NP设备处本地确定的。
    • 10. 发明授权
    • Algorithm to bypass L4 processing in an internet protocol forwarding processor
    • 在互联网协议转发处理器中绕过L4处理的算法
    • US06654372B1
    • 2003-11-25
    • US09543144
    • 2000-04-05
    • Francis ArtsOlivier Didier DuroyonAnthony Matteo GalloBrahmanand Kumar GortiDonald Newland JonesNatarajan VaidhyanathanColin Beaton Verrilli
    • Francis ArtsOlivier Didier DuroyonAnthony Matteo GalloBrahmanand Kumar GortiDonald Newland JonesNatarajan VaidhyanathanColin Beaton Verrilli
    • H04L1256
    • H04L45/00H04L45/302
    • A controllable mechanism for by-passing Layer 4 (L4) classification is based on the insertion into a set of MAC rules in SA MAC lookup means a set of Layer 4 (L4) Skip Classification Flags. Routing is accomplished by selecting which rule to apply to the packet and reading the state of the corresponding L4 Skip Classification Flag. In response to a first state of said corresponding L4 Skip Classification Flag, performing an L4 classification followed by a routing of the data packet. In response to a second state of said corresponding L4 Skip Classification Flag, reading the state of a Global Classification Flag. In response to a first state of said Global Classification Flag, performing an L4 classification followed by a routing of said data packet. In response to a second state of said Global Classification Flag performing a routing of the data packet. The L4 Skip option change does not use the option change of reading the L4 Skip Classification Flag from the port table, whereas the second embodiment uses this option. The third and fourth embodiments are similar to the first and second embodiments but with the. addition of inserting into a set of Layer 3 (L3) rules in L3 lookup means a set of Layer 4 (L4) Classification Required Flags. The third embodiment does not use the option of reading the L4 Skip Classification Flag from the port table, whereas the fourth embodiment uses this option.
    • 用于旁路第4层(L4)分类的可控机制是基于在SA MAC查找中插入一组MAC规则的方法,即一组第4层(L4)跳过分类标志。 通过选择哪个规则应用于分组并读取相应的L4跳过分类标志的状态来完成路由。 响应于所述对应的L4跳过分类标志的第一状态,执行L4分类,然后进行数据分组的路由。 响应于所述对应的L4跳过分类标志的第二状态,读取全局分类标志的状态。 响应于所述全局分类标志的第一状态,执行L4分类,然后进行所述数据分组的路由。 响应于所述全局分类标志的第二状态执行数据分组的路由。 L4跳过选项更改不使用从端口表读取L4跳过分类标志的选项更改,而第二个实施例使用此选项。 第三和第四实施例类似于第一和第二实施例,但是与。 在L3查找中插入到一组第3层(L3)规则中的添加意味着一组第4层(L4)分类要求标志。 第三实施例不使用从端口表读取L4跳过分类标志的选项,而第四实施例使用该选项。