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

71. 发明授权

US07336675B2 Optimized back-to-back enqueue/dequeue via physical queue parallelism 有权
标题翻译：通过物理队列并行性优化背对背排队/排队
公开(公告)号：US07336675B2
公开(公告)日：2008-02-26
申请号：US10743392
申请日：2003-12-22
申请人： Uday R. Naik , Prashant R. Chandra , Alok Kumar , Ameya S. Varde
发明人： Uday R. Naik , Prashant R. Chandra , Alok Kumar , Ameya S. Varde
IPC分类号： H04L12/28 , H04L12/54
CPC分类号： H04L47/6295 , H04L49/90
摘要： A method and apparatus to receive a plurality of packet from an inflow of a single packet flow. In response to receiving the plurality of packets, a plurality of packet pointers is enqueued into multiple physical queues. Each of the plurality of packet pointers designates one of the plurality of packets from the single packet flow. The plurality of packet pointers are dequeued from the multiple physical queues to transmit the plurality of packets along an outflow of the single packet flow.
摘要翻译：一种从单个分组流的流入接收多个分组的方法和装置。响应于接收到多个分组，多个分组指针被排队到多个物理队列中。多个分组指针中的每一个从单个分组流指定多个分组中的一个。多个分组指针从多个物理队列出出，以沿着单个分组流的流出发送多个分组。

72. 发明申请

US20070070907A1 Method and apparatus to implement a very efficient random early detection algorithm in the forwarding path 审中-公开
标题翻译：在转发路径中实现非常有效的随机早期检测算法的方法和装置
公开(公告)号：US20070070907A1
公开(公告)日：2007-03-29
申请号：US11238474
申请日：2005-09-29
申请人： Alok Kumar , Uday Naik
发明人： Alok Kumar , Uday Naik
IPC分类号： H04J1/16 , H04L12/56
CPC分类号： H04L47/10 , H04L47/11 , H04L47/29 , H04L47/30 , H04L47/326
摘要： A method and apparatus for implementing a very efficient random early detection algorithm in the forwarding path of a network device. Under one embodiment of the method flows are associated with corresponding Weighted Random Early Detection (WRED) drop profile parameters, and a flow queue is allocated to each of multiple flows. Estimated drop probability values are repeatedly generated for the flow queues based on existing flow queue state data in combination with WRED drop profile parameters. In parallel, various packet forwarding operations are performed, including packet classification, which assigns a packet to a flow queue for enqueing. In conjunction with this, a determination is made to whether to enqueue the packet in the flow queue or drop it by comparing the estimated drop probability value for the flow queue with a random number that is generated in the forwarding path.
摘要翻译：一种用于在网络设备的转发路径中实现非常有效的随机早期检测算法的方法和装置。在该方法的一个实施例下，流与相应的加权随机早期检测（WRED）丢弃简档参数相关联，并且将流队列分配给多个流中的每一个。基于现有流队列状态数据与WRED丢弃配置文件参数相结合，针对流队列重复生成估计丢弃概率值。并行地，执行各种分组转发操作，包括分组分类，其将分组分配给用于进入的流队列。结合这一点，确定是否排入流队列中的分组或通过将流队列的估计丢弃概率值与在转发路径中生成的随机数进行比较来丢弃它。

73. 发明申请

US20070014240A1 Using locks to coordinate processing of packets in a flow 审中-公开
标题翻译：使用锁来协调流中数据包的处理
公开(公告)号：US20070014240A1
公开(公告)日：2007-01-18
申请号：US11180938
申请日：2005-07-12
申请人： Alok Kumar , Santosh Balakrishnan
发明人： Alok Kumar , Santosh Balakrishnan
IPC分类号： H04L12/26
CPC分类号： H04L47/6205 , H04L47/10 , H04L47/17 , H04L47/2441 , H04L47/50
摘要： In general, in one aspect, the disclosure describes a method that includes accessing a first set of bits from data associated with a flow identifier of a packet and accessing flow data based on the first set of bits. The method also includes accessing a second set of bits from the data associated with the flow identifier of the packet and accessing lock data based on the second set of bits.
摘要翻译：一般来说，一方面，本发明描述了一种方法，其包括从与分组的流标识符相关联的数据访问第一组位，并且基于第一组位访问流数据。该方法还包括从与分组的流标识符相关联的数据中访问第二组位，并且基于第二组位访问锁定数据。

74. 发明申请

US20060221956A1 Methods for performing packet classification via prefix pair bit vectors 审中-公开
标题翻译：通过前缀对比特向量执行分组分类的方法
公开(公告)号：US20060221956A1
公开(公告)日：2006-10-05
申请号：US11170230
申请日：2005-06-28
申请人： Harsha Narayan , Alok Kumar
发明人： Harsha Narayan , Alok Kumar
IPC分类号： H04L12/28
CPC分类号： H04L63/101 , H04L29/12801 , H04L45/00 , H04L45/54 , H04L45/7457 , H04L61/6004
摘要： Methods for performing packet classification via prefix pair bit vectors. Unique prefix pairs in an access control list (ACL) are identified, with each prefix pair comprising a unique combination of a source prefix and a destination prefix. Corresponding prefix pair bit vectors (PPBVs) are defined for each unique source prefix and unique destination prefix in the ACL, with each PPBV including a string of bits and each bit position in the string associated with a corresponding prefix pair. A list of transport field value combinations are associated with each prefix pair based on corresponding entries in the ACL. During packet-processing operations, PPBV lookups are made using the source and destination prefix header values, and the PPBVs are logically ANDed to identify applicable prefix pairs. A search is then performed on transport field value combinations corresponding to the prefix pairs and the packet header to identify a highest priority rule.
摘要翻译：通过前缀对比特向量执行分组分类的方法。标识访问控制列表（ACL）中的唯一前缀对，每个前缀对包含源前缀和目标前缀的唯一组合。为ACL中的每个唯一的源前缀和唯一的目的地前缀定义相应的前缀对比特向量（PPBV），其中每个PPBV包括与一个对应的前缀对相关联的比特串和每个比特位置。根据ACL中的相应条目，传输字段值组合的列表与每个前缀对相关联。在分组处理操作期间，使用源和目标前缀头值进行PPBV查找，并且PPBV在逻辑上进行AND运算以识别适用的前缀对。然后对与前缀对和分组报头相对应的传输字段值组合执行搜索以识别最高优先级规则。

75. 发明申请

US20050201398A1 Optimized back-to-back enqueue/dequeue via physical queue parallelism 有权
标题翻译：通过物理队列并行性优化背对背排队/排队
公开(公告)号：US20050201398A1
公开(公告)日：2005-09-15
申请号：US10743392
申请日：2003-12-22
申请人： Uday Naik , Prashant Chandra , Alok Kumar , Ameya Varde
发明人： Uday Naik , Prashant Chandra , Alok Kumar , Ameya Varde
IPC分类号： H04L12/56
CPC分类号： H04L47/6295 , H04L49/90
摘要： A method and apparatus to receive a plurality of packet from an inflow of a single packet flow. In response to receiving the plurality of packets, a plurality of packet pointers is enqueued into multiple physical queues. Each of the plurality of packet pointers designates one of the plurality of packets from the single packet flow. The plurality of packet pointers are dequeued from the multiple physical queues to transmit the plurality of packets along an outflow of the single packet flow.
摘要翻译：一种从单个分组流的流入接收多个分组的方法和装置。响应于接收到多个分组，多个分组指针被排队到多个物理队列中。多个分组指针中的每一个从单个分组流指定多个分组中的一个。多个分组指针从多个物理队列出出，以沿着单个分组流的流出发送多个分组。

76. 发明申请

US20050198361A1 Method and apparatus for meeting a given content throughput using at least one memory channel 审中-公开
标题翻译：用于使用至少一个存储器通道来满足给定内容吞吐量的方法和装置
公开(公告)号：US20050198361A1
公开(公告)日：2005-09-08
申请号：US10748780
申请日：2003-12-29
申请人： Prashant Chandra , Uday Naik , Alok Kumar , Ameya Varde , Donald Hooper , Debra Bernstein , Myles Wilde , Mark Rosenbluth
发明人： Prashant Chandra , Uday Naik , Alok Kumar , Ameya Varde , Donald Hooper , Debra Bernstein , Myles Wilde , Mark Rosenbluth
IPC分类号： G06F15/16 , G06F15/173
CPC分类号： H04L49/901 , H04L45/125
摘要： A method and apparatus for meeting a given content throughput using at least one memory channel is generally described. In accordance with one example embodiment of the invention, a method to meet a given content throughput using at least one memory channel comprising, comparing the size of at least a portion of received content to a capacity of a single contiguous location within at least one memory channel to meet a given throughput and determining whether to distribute the at least portion of received content across the at least one memory channel, based at least in part, on the comparison.
摘要翻译：通常描述使用至少一个存储器通道来满足给定内容吞吐量的方法和装置。根据本发明的一个示例性实施例，一种使用至少一个存储器信道来满足给定内容吞吐量的方法，包括：将接收的内容的至少一部分的大小与至少一个存储器内的单个连续位置的容量进行比较信道以满足给定的吞吐量并且至少部分地基于比较来确定是否分发穿过所述至少一个存储器信道的接收的内容的至少部分。

77. 发明申请

US20050129046A1 Method and system to determine whether a circular queue is empty or full 失效
标题翻译：确定循环队列是空还是满的方法和系统
公开(公告)号：US20050129046A1
公开(公告)日：2005-06-16
申请号：US10735146
申请日：2003-12-12
申请人： Alok Kumar , Uday Naik
发明人： Alok Kumar , Uday Naik
IPC分类号： H04L12/56
CPC分类号： H04L49/90
摘要： A method and apparatus to determine whether a circular queue having N slots is empty or fill. A first queue element is dequeued from a current dequeue slot (“CDS”) of the N slots designated by a CDS pointer. The CDS pointer is incremented to designate a new CDS. It is determined whether the circular queue is empty after the incrementing via executing a check comparing relative positions within the circular queue designated by the CDS pointer and a last enqueue slot (“LES”) pointer. It is determined whether the circular queue is full after setting the LES pointer to designate a new enqueue slot of the circular queue into which a second queue element may be enqueued via re-executing the check.
摘要翻译：确定具有N个时隙的圆形队列是空的还是填充的方法和装置。第一个队列元素从CDS指针指定的N个时隙的当前出队时隙（“CDS”）中出发。增加CDS指针以指定新的CDS。通过执行比较由CDS指针指定的循环队列中的相对位置和最后一个入站时隙（“LES”）指针之间的校验来确定递增之后循环队列是否为空。在设置LES指针以确定循环队列的新的入队时隙之后，确定循环队列是否已满，通过重新执行该检查可以将第二队列元素排入队列。

78. 发明申请

US20050083935A1 Method and apparatus for two-stage packet classification using most specific filter matching and transport level sharing 有权
标题翻译：使用最具体的过滤器匹配和传输级别共享的两阶段分组分类的方法和装置
公开(公告)号：US20050083935A1
公开(公告)日：2005-04-21
申请号：US10690301
申请日：2003-10-20
申请人： Michael Kounavis , Alok Kumar , Raj Yavatkar , Harrick Vin
发明人： Michael Kounavis , Alok Kumar , Raj Yavatkar , Harrick Vin
IPC分类号： H04L12/56 , H04L29/06
CPC分类号： H04L47/10 , H04L45/00 , H04L47/14 , H04L47/20 , H04L47/2441 , H04L63/0263
摘要： A method and apparatus for two-stage packet classification, the two-stage packet classification scheme including a first stage and a second stage. In the first classification stage, a packet is classified on the basis of the packet's network path. In the second stage of classification, the packet is classified on the basis of one or more transport (or other) fields of the packet. Also disclosed are embodiments of most specific filter matching and transport level sharing, and either one or both of these techniques may be implemented in the two-stage classification method.
摘要翻译：一种用于两阶段分组分类的方法和装置，所述两阶段分组方案包括第一阶段和第二阶段。在第一分类阶段，基于分组的网络路径对分组进行分类。在分类的第二阶段，基于分组的一个或多个传输（或其他）字段对分组进行分类。还公开了最具体的滤波器匹配和传输级别共享的实施例，并且这些技术中的一个或两个可以在两级分类方法中实现。

79. 发明授权

US09326186B1 Hierarchical fairness across arbitrary network flow aggregates 有权
标题翻译：任意网络流量聚合的分层公平
公开(公告)号：US09326186B1
公开(公告)日：2016-04-26
申请号：US13617523
申请日：2012-09-14
申请人： Alok Kumar , Uday Ramakrishna Naik
发明人： Alok Kumar , Uday Ramakrishna Naik
IPC分类号： H04W28/02 , H04W28/00
CPC分类号： H04W28/0289 , H04L47/762 , H04L47/828 , H04W28/0231
摘要： Systems and methods are provided for allocating network resources across network flow aggregates to apply fairness at different levels of flow aggregation. Utility functions of member flows in each aggregate may be adjusted based on a target aggregate utility function. Processes for allocating network resources may then be performed using the adjusted member utility functions.
摘要翻译：提供了系统和方法，用于跨网络流聚合分配网络资源，以在不同级别的流聚合中应用公平性。每个聚合中成员流的实用功能可以基于目标聚合效用函数进行调整。然后可以使用经调整的成员效用函数来执行用于分配网络资源的过程。

80. 发明授权

US08699350B1 Optimizing traffic in a data network 有权
标题翻译：优化数据网络中的流量
公开(公告)号：US08699350B1
公开(公告)日：2014-04-15
申请号：US13233362
申请日：2011-09-15
申请人： Alok Kumar , Michael Frumkin
发明人： Alok Kumar , Michael Frumkin
IPC分类号： H04L12/26
CPC分类号： H04L45/70 , H04L45/18 , H04L45/24
摘要： Systems and methods for optimizing traffic in a data network are provided. Network traffic may be optimized by associating costs with data links that connect network nodes. The method includes determining a set of lowest cost paths between a source network node and a destination network node. Paths that contain loops may be excluded from the set of lowest cost paths. Exploration of certain paths may also be delayed or prevented entirely.
摘要翻译：提供了用于优化数据网络中的流量的系统和方法。可以通过将成本与连接网络节点的数据链路相关联来优化网络流量。该方法包括确定源网络节点和目的地网络节点之间的一组最低成本路径。包含循环的路径可能会从最低成本路径集中排除。某些路径的探索也可能被完全延迟或阻止。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式