专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

31. 发明授权

US09391920B2 Iterative max-min fairness algorithms 有权
标题翻译：迭代最大最小公平算法
公开(公告)号：US09391920B2
公开(公告)日：2016-07-12
申请号：US13599958
申请日：2012-08-30
申请人： Avinatan Hassidim , Emilie Jeanne Anne Danna , Alok Kumar , Dan Raz , Michal Segalov
发明人： Avinatan Hassidim , Emilie Jeanne Anne Danna , Alok Kumar , Dan Raz , Michal Segalov
IPC分类号： H04L12/911 , H04L12/923 , H04L12/927 , H04L12/24 , H04L12/801 , H04W72/02 , H04W72/06
CPC分类号： H04L47/125 , H04L45/22 , H04L45/24 , H04L45/302 , H04L45/38 , H04L47/762 , H04L47/781 , H04L47/805
摘要： Systems and methods are provided for allocating resources of a network among a plurality of traffic demands to optimize fairness and network utilization. Methods based on flow-increase dynamics converge toward an upward max-min fair (UMMF) allocation, in which the value of each traffic demand cannot be increased, along any of its paths, even if larger traffic demands are removed from the network. An efficient iterative algorithm that converges to a UMMF solution is also provided. The described methods and systems can be implemented efficiently, distributively, and asynchronously.
摘要翻译：提供了用于在多个业务需求中分配网络的资源以优化公平性和网络利用的系统和方法。基于流量增加动力学的方法收敛于向上的最大 - 最小公平（UMMF）分配，其中每个流量需求的值不能沿其任何路径增加，即使从网络中移除较大的流量需求。还提供了一种收敛于UMMF解决方案的有效迭代算法。所描述的方法和系统可以有效地，分布地和异步地实现。

32. 发明授权

US08630185B1 Optimizing traffic in a data network 有权
标题翻译：优化数据网络中的流量
公开(公告)号：US08630185B1
公开(公告)日：2014-01-14
申请号：US13302952
申请日：2011-11-22
申请人： Michael Alex Frumkin , Alok Kumar
发明人： Michael Alex Frumkin , Alok Kumar
IPC分类号： H04L12/26
CPC分类号： H04L45/12 , H04L45/18
摘要： Systems and methods for optimizing traffic in a data network. Network traffic may be optimized by associating costs with data links that connect network nodes. A set of lowest cost paths between a source network node and a destination network node may be determined by analyzing paths in the data network. An explored path may be extended to another network node based on whether the other network node is able to reach the destination network node without forming a loop with the explored path.
摘要翻译：用于优化数据网络中的流量的系统和方法。可以通过将成本与连接网络节点的数据链路相关联来优化网络流量。可以通过分析数据网络中的路径来确定源网络节点和目的地网络节点之间的一组最低成本路径。探索的路径可以基于另一个网络节点是否能够到达目的地网络节点而不与探索的路径形成循环来扩展到另一个网络节点。

33. 发明申请

US20100318670A1 System and Method for Adapting an Application Source Rate to a Load Condition 有权
标题翻译：将应用源速率适应到负载条件的系统和方法
公开(公告)号：US20100318670A1
公开(公告)日：2010-12-16
申请号：US12816329
申请日：2010-06-15
申请人： Mazin Al-Shalash , Yunsong Yang , Alok Kumar
发明人： Mazin Al-Shalash , Yunsong Yang , Alok Kumar
IPC分类号： G06F15/16
CPC分类号： H04L47/25 , H04L65/1016 , H04L65/1069 , H04L65/602 , H04L65/608 , H04M7/006 , H04W28/02 , H04W76/10 , H04W84/042 , H04W88/181
摘要： A system and method for adapting an application source rate to a load condition are provided. A method for forming a connection includes receiving a service authorization request for service between the first device and the second device, requesting a formation of a first bearer at a first data rate between the first device and the second device, and determining if the first bearer was formed. The method also includes transmitting a first positive response if the first bearer was formed, forming a second bearer at a second data rate if the first bearer was not formed, and completing the connection. The service authorization request includes a request to establish a connection at the first data rate, and the second data rate is different from the first data rate.
摘要翻译：提供了一种用于使应用源速率适应负载条件的系统和方法。一种用于形成连接的方法包括：在第一设备和第二设备之间接收服务授权请求，以第一设备和第二设备之间的第一数据速率请求形成第一承载，以及确定第一承载形成了该方法还包括如果形成第一承载则发送第一肯定响应，如果没有形成第一承载，则以第二数据速率形成第二承载，并且完成连接。服务授权请求包括以第一数据速率建立连接的请求，并且第二数据速率与第一数据速率不同。

34. 发明申请

US20060221967A1 Methods for performing packet classification 审中-公开
标题翻译：执行分组分类的方法
公开(公告)号：US20060221967A1
公开(公告)日：2006-10-05
申请号：US11096960
申请日：2005-03-31
申请人： Harsha Narayan , Alok Kumar
发明人： Harsha Narayan , Alok Kumar
IPC分类号： H04L12/56 , H04L12/28 , G01R31/08 , G08C15/00 , H04L12/26 , G06F11/00 , H04J3/14 , H04J1/16 , H04L1/00
CPC分类号： H04L45/00 , H04L29/12801 , H04L45/54 , H04L45/7457 , H04L61/6004 , H04L63/101
摘要： Methods for performing packet classification via partitioned bit vectors. Rules in an access control list (ACL) are partitioned into a plurality of partitions, wherein each partition is defined by a meta-rule comprising a set of filter dimension ranges and/or values covering the rules in that partition. Filter data structures comprising rule bit vectors are then built, each including multiple filter entries defining packet header filter criteria corresponding to one or more filter dimensions. Partition bit vectors identifying, for each filter entry, any partition having a meta-rule defining a filter dimension range or value that covers that entry's packet header filter criteria are also generated and stored in a corresponding data structure.
摘要翻译：通过分割位向量进行分组分类的方法。访问控制列表（ACL）中的规则被划分成多个分区，其中每个分区由包括一组过滤器维度范围和/或覆盖该分区中的规则的值的元规则定义。然后，构建包括规则位向量的过滤器数据结构，每个包括定义与一个或多个过滤器维度相对应的包头过滤标准的多个过滤条目。对于每个过滤器条目，分配位向量识别具有限定覆盖该条目的包头过滤器标准的过滤器维度范围或值的元规则的任何分区也被生成并存储在相应的数据结构中。

35. 发明申请

US20060221954A1 Methods for performing packet classification 失效
标题翻译：执行分组分类的方法
公开(公告)号：US20060221954A1
公开(公告)日：2006-10-05
申请号：US11097628
申请日：2005-03-31
申请人： Harsha Narayan , Alok Kumar
发明人： Harsha Narayan , Alok Kumar
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/306 , H04L47/2441
摘要： Methods for performing packet classification. In one embodiment, packets are classified using a rule bit vector optimization scheme, wherein original rule bit vectors in recursive flow classification (RFC) chunks are optimized by removing useless bits that have no effect on the ultimate rule identified by an associated RFC lookup process. The unique optimized rule bit vectors for associated chunks are then cross-producted to produce an optimized downstream chunk. In another embodiment, a rule database splitting scheme is employed. Under this technique, split criteria is defined to split a rule database, such as splitting based on a particular field value or range. A respective set of downstream chunks is then generated for each partition, beginning with the chunks in a split phase. The applicable rule bit vectors for the chunks associated with a common group and partition are identified, and then unique applicable rule bit vectors for those chunks are cross-producted to produce downstream chunks.
摘要翻译：执行分组分类的方法。在一个实施例中，使用规则位向量优化方案对分组进行分类，其中递归流分类（RFC）块中的原始规则位向量通过去除对由相关RFC查找过程所标识的最终规则没有影响的无用位来优化。然后将相关块的唯一优化规则位向量交叉产生以产生优化的下游块。在另一个实施例中，采用规则数据库分割方案。根据这种技术，分割条件被定义为拆分规则数据库，例如基于特定字段值或范围的分割。然后，对于每个分区，生成相应的下游组块，从分割阶段的组块开始。识别与公共组和分区相关联的块的适用规则位向量，然后交叉产生这些块的唯一适用规则位向量以产生下游块。

36. 发明申请

US20060140201A1 Hierarchical packet scheduler using hole-filling and multiple packet buffering 失效
标题翻译：分层数据包调度程序使用填充和多个数据包缓冲
公开(公告)号：US20060140201A1
公开(公告)日：2006-06-29
申请号：US11020942
申请日：2004-12-23
申请人： Alok Kumar , Michael Kounavis , Raj Yavatkar
发明人： Alok Kumar , Michael Kounavis , Raj Yavatkar
IPC分类号： H04L1/00
CPC分类号： H04L47/60 , H04L47/15 , H04L47/50 , H04L47/564
摘要： A hierarchical packet scheduler using hole-filling and multiple packet buffering. Packet references are enqueued into a hierarchical packet scheduler, wherein the hierarchical packet scheduler includes one or more levels, each level including one or more schedulers being served by one or more threads, wherein the number of threads serving a particular level is not dependent on the number of schedulers on the particular level. Packet references are dequeued from the hierarchical packet scheduler at a root level scheduler of the one or more schedulers.
摘要翻译：分层分组调度器，使用填充空穴和多个分组缓冲。分组参考被排入到分级分组调度器中，其中分级分组调度器包括一个或多个级别，每个级别包括由一个或多个线程服务的一个或多个调度器，其中服务于特定级别的线程数量不依赖于特定级别的调度程序数量。分组引用在一个或多个调度器的根级调度器处从分层分组调度器出发。

37. 发明申请

US20060095494A1 Method and apparatus for efficient software-based integer division 审中-公开
标题翻译：高效的基于软件的整数除法的方法和装置
公开(公告)号：US20060095494A1
公开(公告)日：2006-05-04
申请号：US10975319
申请日：2004-10-28
申请人： Alok Kumar
发明人： Alok Kumar
IPC分类号： G06F7/38
CPC分类号： G06F7/535 , G06F2207/5356
摘要： A method and apparatus to perform efficient software-based integer division. The equivalent of a hardware-based integer division operation is enabled via a reciprocal multiplication operation that is facilitated by a minimum combination of multiplication (and/or add) and shift operations. Properties and equations are derived for determining minimum multiplication and shift instructions to perform an integer division of a variable dividend and constant divisor using reciprocal multiplication. Computer functions are disclosed for determining parameters from which the minimum multiplication and shift instructions can be derived. Software/firmware is then coded employing the minimum multiplication and shift instructions to perform software-based integer division operations via reciprocal multiplication. In one embodiment, the integer division operations are employed to determine a minimum number of cells required to store the data in a packet or frame that is processed by a network processor.
摘要翻译：一种执行高效的基于软件的整数除法的方法和装置。相当于基于硬件的整数除法运算通过相乘乘法运算来实现，该乘法运算由乘法（和/或加法）和移位运算的最小组合促成。导出属性和方程，用于确定最小乘法和移位指令，以使用相乘乘法执行可变除数和常数除数的整数除法。公开了计算机功能，用于确定可以从其导出最小乘法和移位指令的参数。然后使用最小乘法和移位指令对软件/固件进行编码，以通过相互乘法执行基于软件的整数除法运算。在一个实施例中，采用整数除法运算来确定将数据存储在由网络处理器处理的分组或帧中所需的最小单元数。

38. 发明申请

US20050120195A1 Allocating memory 审中-公开
标题翻译：分配内存
公开(公告)号：US20050120195A1
公开(公告)日：2005-06-02
申请号：US10713776
申请日：2003-11-13
申请人： Alok Kumar
发明人： Alok Kumar
IPC分类号： G06F9/00 , G06F9/50 , G06F15/00 , G06F15/76
CPC分类号： G06F9/5016
摘要： A method includes allocating a memory entry in a memory device to instructions executed on a multithreaded engine included in a packet processor, a portion of the memory entry includes a unique identifier assigned to the instructions.
摘要翻译：一种方法包括将存储器设备中的存储器条目分配给在包处理器中包括的多线程引擎上执行的指令，存储器条目的一部分包括分配给指令的唯一标识符。

39. 发明授权

US5414177A Immobilized Lewis acid catalysts 失效
标题翻译：固定化路易斯酸催化剂
公开(公告)号：US5414177A
公开(公告)日：1995-05-09
申请号：US154228
申请日：1993-11-18
申请人： Tze-Chiang Chung , Frank J. Chen , Jon E. Stanat , Alok Kumar
发明人： Tze-Chiang Chung , Frank J. Chen , Jon E. Stanat , Alok Kumar
IPC分类号： C08F4/02 , C08F4/00 , C08F4/06 , C08F4/14 , C08F8/00 , C08F10/00 , C07C2/30
CPC分类号： C08F10/00
摘要： Immobilized Lewis acid catalysts comprising a polymer having at least one Lewis acid immobilized within the polymer structure, said polymer having the monomer units represented by the structural formula: ##STR1## where D is OR', NH.sub.2, NHR', OM' or OM"; E is at least one Lewis acid residue, R is an alkyl group or cycloalkyl group; R.sup.2 is a divalent hydrocarbyl group, R' is an alkyl, cycloalkyl, aryl or alkylaryl group, M' is an alkali metal and M" is an alkaline earth metal. The immobilized Lewis acid catalyst is useful in olefin polymerization and in alkylation or aromatic or isoparrafinic hydrocarbons with an olefin.
摘要翻译：固定化路易斯酸催化剂，其包含具有固定在聚合物结构内的至少一种路易斯酸的聚合物，所述聚合物具有由以下结构式表示的单体单元：其中D为OR'，NH 2，NHR'，OM'或OM' '; E是至少一个路易斯酸残基，R是烷基或环烷基; R2是二价烃基，R'是烷基，环烷基，芳基或烷基芳基，M'是碱金属，M“是碱土金属。固定化的路易斯酸催化剂可用于烯烃聚合和烷基化，或芳烃或异链烯烃与烯烃。

40. 发明授权

US10621950B2 System and method for correcting photosensitive epilepsy luminance flashes in a video 有权
公开(公告)号：US10621950B2
公开(公告)日：2020-04-14
申请号：US15908835
申请日：2018-03-01
申请人： Alok Kumar , Bhupender Kumar , Shekhar Madnani
发明人： Alok Kumar , Bhupender Kumar , Shekhar Madnani
IPC分类号： G09G5/00 , G09G5/10 , G09G3/36
CPC分类号： G09G5/10 , G09G3/3648 , G09G2320/0247
摘要： A system and a method for adjusting luminance flashes in a video stream are disclosed. The method includes identifying a sequence of frames, having the luminance flashes, from the video stream. The sequence of frames is extended at both sides (start and end) based on a predefined threshold. The method further comprises dividing an extended sequence of frames into at least three segments. Further, the method includes determining a correction factor and a correction constant for each of the at least three segments. Thereafter, the method includes modifying luminance values of pixels of each of the at least three segments based on the correction factor and the correction constant, thereby adjusting the luminance flashes in the video stream.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式