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

1. 发明申请

US20050207409A1 Method and apparatus to support a large internet protocol forwarding information base 有权
标题翻译：支持大型互联网协议转发信息库的方法和装置
公开(公告)号：US20050207409A1
公开(公告)日：2005-09-22
申请号：US10804485
申请日：2004-03-18
申请人： Uday Naik , Alok Kumar , Eswar Eduri , Donald Hooper
发明人： Uday Naik , Alok Kumar , Eswar Eduri , Donald Hooper
IPC分类号： H04L12/56
CPC分类号： H04L45/54 , H04L45/04 , H04L45/742 , H04L45/745 , H04L45/7457 , Y10S707/99942
摘要： Method and apparatus to support a large Internet Protocol Forwarding Information Base. A packet is received at a network device, the packet including a destination address. A table is indexed into using a portion of the destination address to locate an entry in the table associated with the portion of the destination address. A pool index is derived from the portion of the destination address and is used to identify a pool of data blocks from among a plurality of pools of data blocks. The entry and the pool of data blocks are navigated to find a next-hop for the packet.
摘要翻译：支持大型互联网协议转发信息库的方法和装置。在网络设备处接收到分组，该分组包括目的地地址。将表索引到使用目标地址的一部分来定位与目标地址的该部分相关联的表中的条目。池索引从目的地地址的部分导出，并且用于从多个数据块池中识别数据块池。数据块的入口和池被导航以找到分组的下一跳。

2. 发明申请

US20080040494A1 Partitioning a Transmission Control Protocol (TCP) Control Block (TCB) 审中-公开
标题翻译：传输控制协议（TCP）控制块（TCB）
公开(公告)号：US20080040494A1
公开(公告)日：2008-02-14
申请号：US11496072
申请日：2006-07-28
申请人： Alok Kumar , Prashant Chandra , Eswar Eduri , Uday Naik
发明人： Alok Kumar , Prashant Chandra , Eswar Eduri , Uday Naik
IPC分类号： G06F15/16
CPC分类号： H04L69/16 , H04L69/161 , H04L69/163
摘要： Partitioning of a Transmission Control Protocol (TCP) Control Block (TCB) associated with a TCP connection into multiple, independently accessible data structures. A first of the data structures includes TCB data used in handling an egress direction of the TCP connection while a second of the data structures includes TCB data used in handling an ingress direction of the TCP connection.
摘要翻译：将与TCP连接相关联的传输控制协议（TCP）控制块（TCB）分为多个独立可访问的数据结构。第一数据结构包括用于处理TCP连接的出口方向的TCB数据，而第二数据结构包括用于处理TCP连接的入方向的TCB数据。

3. 发明申请

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.
摘要翻译：通常描述使用至少一个存储器通道来满足给定内容吞吐量的方法和装置。根据本发明的一个示例性实施例，一种使用至少一个存储器信道来满足给定内容吞吐量的方法，包括：将接收的内容的至少一部分的大小与至少一个存储器内的单个连续位置的容量进行比较信道以满足给定的吞吐量并且至少部分地基于比较来确定是否分发穿过所述至少一个存储器信道的接收的内容的至少部分。

4. 发明授权

US09007898B2 System to share network bandwidth among competing applications 有权
标题翻译：系统在竞争应用中共享网络带宽
公开(公告)号：US09007898B2
公开(公告)日：2015-04-14
申请号：US13018967
申请日：2011-02-01
申请人： Sushant Jain , Anand Raghuraman , Alok Kumar , Uday Naik , Aspi Siganporia
发明人： Sushant Jain , Anand Raghuraman , Alok Kumar , Uday Naik , Aspi Siganporia
IPC分类号： H04L12/26 , H04L12/24 , H04L12/851 , H04L12/927 , H04L12/911
CPC分类号： H04L47/801 , H04L41/0896 , H04L43/0894 , H04L47/11 , H04L47/2441 , H04L47/808 , H04L47/823 , H04L47/828
摘要： The present invention pertains to the allocation of bandwidth on a global large scale network. Systems and methods are provided to base bandwidth allocation on the predicted bandwidth demands of the network users. In allocating bandwidth, each user is assigned a user weight value, and is to be allocated bandwidth in proportion to that value. In addition, the bandwidth allocation is enforced so as to ensure that bandwidth allocation policies are maintained.
摘要翻译：本发明涉及全球大规模网络上的带宽分配。提供了系统和方法来基于网络用户预测的带宽需求的带宽分配。在分配带宽时，为每个用户分配一个用户权重值，并且与该值成比例地分配带宽。另外，实施带宽分配，以确保维护带宽分配策略。

5. 发明申请

US20120195209A1 SYSTEM TO SHARE NETWORK BANDWIDTH AMONG COMPETING APPLICATIONS 有权
标题翻译：系统在竞争性应用中分享网络带宽
公开(公告)号：US20120195209A1
公开(公告)日：2012-08-02
申请号：US13018967
申请日：2011-02-01
申请人： Sushant Jain , Anand Raghuraman , Alok Kumar , Uday Naik , Aspi Siganporia
发明人： Sushant Jain , Anand Raghuraman , Alok Kumar , Uday Naik , Aspi Siganporia
IPC分类号： H04W72/04 , H04L12/26
CPC分类号： H04L47/801 , H04L41/0896 , H04L43/0894 , H04L47/11 , H04L47/2441 , H04L47/808 , H04L47/823 , H04L47/828
摘要： The present invention pertains to the allocation of bandwidth on a global large scale network. Systems and methods are provided to base bandwidth allocation on the predicted bandwidth demands of the network users. In allocating bandwidth, each user is assigned a user weight value, and is to be allocated bandwidth in proportion to that value. In addition, the bandwidth allocation is enforced so as to ensure that bandwidth allocation policies are maintained.
摘要翻译：本发明涉及全球大规模网络上的带宽分配。提供了系统和方法来基于网络用户预测的带宽需求的带宽分配。在分配带宽时，为每个用户分配一个用户权重值，并且与该值成比例地分配带宽。另外，实施带宽分配，以确保维护带宽分配策略。

6. 发明授权

US07159051B2 Free packet buffer allocation 失效
标题翻译：免费包缓冲区分配
公开(公告)号：US07159051B2
公开(公告)日：2007-01-02
申请号：US10668550
申请日：2003-09-23
申请人： Prashant R. Chandra , Uday Naik , Alok Kumar , Ameya S. Varde
发明人： Prashant R. Chandra , Uday Naik , Alok Kumar , Ameya S. Varde
IPC分类号： G06F3/00
CPC分类号： H04L49/3018 , H04L49/103
摘要： According to some embodiments, systems an apparatuses may have a communication path to exchange information packets. A processor may process information packets. A buffer pool cache local to the processor may store free buffer handles for information packets when the buffer pool cache local to the processor is not full. A non-local memory may store the free buffer handles for information packets when the buffer pool cache local to the processor is full.
摘要翻译：根据一些实施例，设备可以具有用于交换信息分组的通信路径的系统。处理器可以处理信息包。当处理器本地的缓冲池缓存未满时，处理器本地的缓冲池缓存可以存储信息包的空闲缓冲区句柄。当处理器本地缓冲池缓存已满时，非本地内存可能会存储信息包的空闲缓冲区句柄。

7. 发明申请

US20060067347A1 Cell-based queue management in software 审中-公开
标题翻译：基于单元的队列管理软件
公开(公告)号：US20060067347A1
公开(公告)日：2006-03-30
申请号：US10953159
申请日：2004-09-29
申请人： Uday Naik , Alok Kumar
发明人： Uday Naik , Alok Kumar
IPC分类号： G06F3/00 , H04L12/28
CPC分类号： H04L47/6255 , H04L47/50 , H04L49/90 , H04L49/901 , H04L49/9073
摘要： A system and method to implement cell-based queue management in software. Packets are received from a packet-based medium. In response, packet pointers are enqueued into a virtual output queue (“VOQ”). When a dequeue request to dequeue a cell for the VOQ is received, one of the packet pointers is speculatively prefetched from the VOQ. A cell is then transmitted onto a cell-based fabric containing at least a portion of one of the packets received from the medium and designated by a current packet pointer from among the packet pointers of the VOQ.
摘要翻译：一种在软件中实现基于单元的队列管理的系统和方法。从基于分组的媒体接收分组。作为响应，分组指针被排入虚拟输出队列（“VOQ”）。当接收到用于VOQ的单元出队的出队请求时，从VOQ推测性地预取分组指针之一。然后，将单元传输到基于单元的结构，其中包含从介质接收的一个分组的至少一部分，并由VOQ的分组指针中的当前分组指针指定。

8. 发明申请

US20120195324A1 SHARING BANDWIDTH AMONG MULTIPLE USERS OF NETWORK APPLICATIONS 有权
标题翻译：在多个网络应用程序中共享带宽
公开(公告)号：US20120195324A1
公开(公告)日：2012-08-02
申请号：US13364705
申请日：2012-02-02
申请人： Anand Raghuraman , Alok Kumar , Uday Naik , Aspi Siganporia , Sushant Jain
发明人： Anand Raghuraman , Alok Kumar , Uday Naik , Aspi Siganporia , Sushant Jain
IPC分类号： H04L12/28
CPC分类号： H04L47/00 , H04W72/0446
摘要： A system and method are provided that allocate bandwidth on a global large scale network. Bandwidth allocation is based on the predicted bandwidth demands of the network users. Each user may be assigned one of a plurality of different values that determines the amount of bandwidth allocated to that user. In instances where an application runs on behalf of a plurality of remote clients, a system and method is provided that allows for the allocation of bandwidth based each individual remote client.
摘要翻译：提供了一种在全球大规模网络上分配带宽的系统和方法。带宽分配是基于网络用户预测的带宽需求。可以为每个用户分配多个不同的值中的一个，其确定分配给该用户的带宽量。在应用程序代表多个远程客户端运行的情况下，提供允许基于每个单独的远程客户端分配带宽的系统和方法。

9. 发明申请

US20070192543A1 Techniques to manage a flow cache 有权
标题翻译：管理流缓存的技术
公开(公告)号：US20070192543A1
公开(公告)日：2007-08-16
申请号：US11353600
申请日：2006-02-13
申请人： Uday Naik , Alok Kumar , Harshawardhan Vipat
发明人： Uday Naik , Alok Kumar , Harshawardhan Vipat
IPC分类号： G06F12/00
CPC分类号： G06F12/0891 , H04L47/2441
摘要： Techniques are described herein that may be used to invalidate all entries in a table. For example, the table may be a flow cache. For example, an expiry time may be associated with one or more entries in the table. The expiry time of an entry may be initially set to the sum of the system time, the expiry time of the protocol associated with the entry, and a global time variable. To check if the entry is expired at any time, the current system time may be added to the global time variable and if the result is greater than the expiry time in the entry, then the entry is expired. To invalidate all the entries, the global time variable may be incremented by a large amount which may equal the maximum expiry time of all protocols. This may cause all entries to expire. New entries may be added using the new incremented value of the global time variable and will hence not expire.
摘要翻译：本文描述了可用于使表中的所有条目无效的技术。例如，表可以是流缓存。例如，到期时间可能与表中的一个或多个条目相关联。条目的到期时间可以初始设置为系统时间，与条目相关联的协议的到期时间和全局时间变量之和。要检查该条目是否在任何时间过期，当前系统时间可能会添加到全局时间变量中，如果结果大于条目中的到期时间，则该条目过期。为了使所有条目无效，全局时间变量可以递增大量，这可能等于所有协议的最大到期时间。这可能会导致所有条目过期。可以使用全局时间变量的新增加值添加新条目，因此不会过期。

10. 发明申请

US20050147038A1 Method for optimizing queuing performance 有权
标题翻译：优化排队性能的方法
公开(公告)号：US20050147038A1
公开(公告)日：2005-07-07
申请号：US10746273
申请日：2003-12-24
申请人： Prashant Chandra , Uday Naik , Alok Kumar , Ameya Varde , David Romano
发明人： Prashant Chandra , Uday Naik , Alok Kumar , Ameya Varde , David Romano
IPC分类号： G06F13/12 , H04L1/00
CPC分类号： G06F13/128
摘要： Techniques for optimizing queuing performance include passing, from a ring having M slots, one or more enqueue requests and one or more dequeue requests to a queue manager, and determining whether the ring is full, and if the ring is full, sending only an enqueue request to the queue manager when one of the M slots is next available, otherwise, sending both an enqueue request and a dequeue request to the queue manager.
摘要翻译：用于优化排队性能的技术包括从具有M个时隙的环路将一个或多个入队请求和一个或多个出队请求传递到队列管理器，以及确定该环是否已满，并且如果该环已满，则仅发送一个入队当M个时隙中的一个下一个可用时，请求队列管理器，否则，向队列管理器发送入队请求和出队请求。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式