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

51. 发明授权

US08792374B1 Managing network routes from a central server 有权
标题翻译：从中央服务器管理网络路由
公开(公告)号：US08792374B1
公开(公告)日：2014-07-29
申请号：US13314015
申请日：2011-12-07
申请人： Sushant Jain , Alok Kumar , James M. Wanderer , Aspi Homi Siganporia , Anand Raghuraman , Subhasree Mandal , Arjun Singh , Subbaiah Naidu Kotla Venkata
发明人： Sushant Jain , Alok Kumar , James M. Wanderer , Aspi Homi Siganporia , Anand Raghuraman , Subhasree Mandal , Arjun Singh , Subbaiah Naidu Kotla Venkata
IPC分类号： H04L12/26 , H04L12/56
CPC分类号： H04L47/10 , H04L45/42
摘要： Embodiments are directed towards managing network routes using a centralized service on behalf of a network of a plurality of forwarding devices. The centralized service develops a global view of the network based on information from the forwarding devices. The centralized service computes changes to the routing policy for each of the nodes. The centralized service then generates an operational command schedule that is distributed to the forwarding devices using a “make before break” sequence to ensure that transient black holes do not happen as the new routing policy is being implemented.
摘要翻译：实施例涉及使用代表多个转发设备的网络的集中式服务来管理网络路由。集中式业务基于转发设备的信息，构建了网络的全局视图。集中式服务计算每个节点对路由策略的更改。然后，集中式服务生成使用“make before break”序列分配给转发设备的操作命令调度，以确保在执行新的路由策略时不会发生暂时的黑洞。

52. 发明申请

US20130121146A1 ITERATIVE MAX-MIN FAIRNESS ALGORITHMS 有权
标题翻译：迭代最大最小公平算法
公开(公告)号：US20130121146A1
公开(公告)日：2013-05-16
申请号：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/56
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解决方案的有效迭代算法。所描述的方法和系统可以有效地，分布地和异步地实现。

53. 发明授权

US08060876B2 Methods and apparatus for creating an isolated partition for a virtual trusted platform module 有权
标题翻译：为虚拟可信平台模块创建隔离分区的方法和装置
公开(公告)号：US08060876B2
公开(公告)日：2011-11-15
申请号：US11837378
申请日：2007-08-10
申请人： Ned M. Smith , Willard M. (Monty) Wiseman , Faraz A. Siddiqi , Tasneem Brutch , Vincent R. Scarlata , Alok Kumar , Kalpana M. Roge , Murari Kumar
发明人： Ned M. Smith , Willard M. (Monty) Wiseman , Faraz A. Siddiqi , Tasneem Brutch , Vincent R. Scarlata , Alok Kumar , Kalpana M. Roge , Murari Kumar
IPC分类号： G06F9/455 , G06F9/46
CPC分类号： G06F21/53 , G06F21/57
摘要： A data processing system isolates a virtual trusted platform module (vTPM) manager in the processing system from other management software in the processing system. In one example process, the processing system launches a virtual machine monitor (VMM) that includes a memory-mapped input/output (MMIO) trap. The processing system also launches a vTPM manager in a first virtual machine (VM). In addition, the processing system launches a second VM to contain virtual machine management programs other than the vTPM manager and the MMIO trap. Other embodiments are described and claimed.
摘要翻译：数据处理系统将处理系统中的虚拟可信平台模块（vTPM）管理器与处理系统中的其他管理软件隔离开来。在一个示例过程中，处理系统启动包括存储器映射输入/输出（MMIO）陷阱的虚拟机监视器（VMM）。处理系统还在第一个虚拟机（VM）中启动一个vTPM管理器。此外，处理系统启动第二个虚拟机以包含除vTPM管理器和MMIO陷阱之外的虚拟机管理程序。描述和要求保护其他实施例。

54. 发明授权

US07730501B2 Method for parallel processing of events within multiple event contexts maintaining ordered mutual exclusion 失效
标题翻译：用于并行处理多个事件上下文中保持有序互斥的事件的方法
公开(公告)号：US07730501B2
公开(公告)日：2010-06-01
申请号：US10718497
申请日：2003-11-19
申请人： Alok Kumar , Prashant R. Chandra
发明人： Alok Kumar , Prashant R. Chandra
IPC分类号： G06F9/44
CPC分类号： G06F9/542
摘要： Techniques for parallel processing of events within multiple event contexts include dynamically binding an event context to an execution context in response to receiving an event by storing arriving events into a global event queue and storing events from the global event queue in per-execution context event queues are described. The techniques associate event queues with the execution contexts to temporarily store the events for a duration of the binding and thus dynamically bind the events received on a per-event basis in the context queues.
摘要翻译：用于并行处理多个事件上下文中的事件的技术包括通过将到达的事件存储到全局事件队列中并将来自全局事件队列的事件存储在每执行上下文事件队列中来响应于接收事件来动态地将事件上下文绑定到执行上下文被描述。这些技术将事件队列与执行上下文相关联，以在绑定的持续时间内临时存储事件，并因此在上下文队列中动态地绑定在每个事件基础上接收的事件。

55. 发明申请

US20090089582A1 METHODS AND APPARATUS FOR PROVIDING UPGRADEABLE KEY BINDINGS FOR TRUSTED PLATFORM MODULES 有权
标题翻译：提供可升级的平台模块的可升级主要功能的方法和设备
公开(公告)号：US20090089582A1
公开(公告)日：2009-04-02
申请号：US11863233
申请日：2007-09-27
申请人： TASNEEM BRUTCH , Alok Kumar , Vincent R. Scarlata , Faraz A. Siddiqi , Ned M. Smith , Willard M. Wiseman
发明人： TASNEEM BRUTCH , Alok Kumar , Vincent R. Scarlata , Faraz A. Siddiqi , Ned M. Smith , Willard M. Wiseman
IPC分类号： H04L9/30
CPC分类号： G06F21/602 , G06F21/57 , H04L9/0825 , H04L9/0836 , H04L9/0897
摘要： A processing system with a trusted platform module (TPM) supports migration of digital keys. For instance, an application in the processing system may create a first configuration key as a child of a TPM storage root key (SRK) when the processing system has a first configuration. The application may also create an upgradable root user key associated with an upgrade authority as a child of the first configuration key. The application may also create a user key as a child of the upgradable root user key. When the processing system has a second configuration, the application may create a second configuration key as a child of the SRK. The application may request migration approval from the upgrade authority. In response to receiving the approval from the upgrade authority, the application may migrate the root user key to be a child of the second configuration key. Other embodiments are described and claimed.
摘要翻译：具有可信平台模块（TPM）的处理系统支持数字密钥的迁移。例如，当处理系统具有第一配置时，处理系统中的应用可以创建作为TPM存储根密钥（SRK）的子节点的第一配置密钥。应用还可以创建与作为第一配置密钥的子级的升级授权机相关联的可升级根用户密钥。应用程序还可以创建用户密钥作为可升级的根用户密钥的子级。当处理系统具有第二配置时，应用可以创建作为SRK的子节点的第二配置密钥。该应用程序可能请求迁移批准从升级授权。响应于接收到升级授权的批准，应用程序可以将root用户密钥迁移为第二个配置密钥的子节点。描述和要求保护其他实施例。

56. 发明申请

US20090086979A1 VIRTUAL TPM KEYS ROOTED IN A HARDWARE TPM 有权
标题翻译：虚拟TPM KEYS在硬件TPM中销售
公开(公告)号：US20090086979A1
公开(公告)日：2009-04-02
申请号：US11864512
申请日：2007-09-28
申请人： Tasneem Brutch , Alok Kumar , Vincent Scarlata , Faraz A. Siddiqi , Ned M. Smith , Willard M. Wiseman
发明人： Tasneem Brutch , Alok Kumar , Vincent Scarlata , Faraz A. Siddiqi , Ned M. Smith , Willard M. Wiseman
IPC分类号： H04L9/08
CPC分类号： H04L9/0836 , H04L2209/127
摘要： The present subject matter related to trusted computing, and more particularly, to virtual trusted platform module keys rooted in a hardware trusted platform module. Some embodiments include a trusted platform virtualization module operable to capture virtual machine trusted platform module calls and operates to generate, maintain, and utilize hardware trusted platform module keys on behalf of the one or more virtual machines. Some embodiments include virtual trusted platform module keys having a public portion on top of an private portion including an encrypted hardware trusted platform module key.
摘要翻译：与可信计算相关的本主题，更具体地，涉及植根于硬件可信平台模块中的虚拟可信平台模块键。一些实施例包括可操作以捕获虚拟机可信平台模块调用并且代表一个或多个虚拟机生成，维护和利用硬件可信平台模块密钥的可信平台虚拟化模块。一些实施例包括虚拟可信平台模块密钥，其具有位于私有部分之上的公共部分，包括加密的硬件可信平台模块密钥。

57. 发明授权

US07499399B2 Method and system to determine whether a circular queue is empty or full 失效
标题翻译：确定循环队列是空还是满的方法和系统
公开(公告)号：US07499399B2
公开(公告)日：2009-03-03
申请号：US10735146
申请日：2003-12-12
申请人： Alok Kumar , Uday R. Naik
发明人： Alok Kumar , Uday R. Naik
IPC分类号： H04L12/26
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指针以确定循环队列的新的入队时隙之后，确定循环队列是否已满，通过重新执行该检查可以将第二队列元素排入队列。

58. 发明授权

US07408932B2 Method and apparatus for two-stage packet classification using most specific filter matching and transport level sharing 有权
标题翻译：使用最具体的过滤器匹配和传输级别共享的两阶段分组分类的方法和装置
公开(公告)号：US07408932B2
公开(公告)日：2008-08-05
申请号：US10690301
申请日：2003-10-20
申请人： Michael E. Kounavis , Alok Kumar , Raj Yavatkar , Harrick M. Vin
发明人： Michael E. Kounavis , Alok Kumar , Raj Yavatkar , Harrick M. Vin
IPC分类号： H04L12/56 , H04L29/06 , G06F15/16
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.
摘要翻译：一种用于两阶段分组分类的方法和装置，所述两阶段分组方案包括第一阶段和第二阶段。在第一分类阶段，基于分组的网络路径对分组进行分类。在分类的第二阶段，基于分组的一个或多个传输（或其他）字段对分组进行分类。还公开了最具体的滤波器匹配和传输级别共享的实施例，并且这些技术中的一个或两个可以在两级分类方法中实现。

59. 发明申请

US20060153184A1 Reducing memory access bandwidth consumption in a hierarchical packet scheduler 失效
公开(公告)号：US20060153184A1
公开(公告)日：2006-07-13
申请号：US11024318
申请日：2004-12-27
申请人： Michael Kounavis , Alok Kumar , Raj Yavatkar
发明人： Michael Kounavis , Alok Kumar , Raj Yavatkar
IPC分类号： H04L12/56
CPC分类号： H04L47/60 , H04L47/50
摘要： Reducing memory access bandwidth consumption in a hierarchical packet scheduler. A hierarchical packet scheduler is maintained, wherein the hierarchical packet scheduler includes one or more levels, each level including one or more schedulers, wherein one or more threads serve each level. Scheduling operations are performed at each scheduler of the hierarchical packet scheduler by reading a portion of scheduler state from external memory.

60. 发明申请

US20060067325A1 Method and apparatus for sorting packets in packet schedulers using a connected trie data structure 有权
标题翻译：使用连接的特里数据结构对分组调度器中的分组进行排序的方法和装置
公开(公告)号：US20060067325A1
公开(公告)日：2006-03-30
申请号：US10956326
申请日：2004-09-30
申请人： Michael Kounavis , Alok Kumar , Raj Yavatkar
发明人： Michael Kounavis , Alok Kumar , Raj Yavatkar
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L49/901 , H04L47/2441 , H04L47/50 , H04L47/564 , H04L47/568
摘要： A method and apparatus for sorting packets by packet schedulers using a connected trie data structure is described. According to one embodiment of the invention, the packet scheduler receives a packet on a network and assigns the packet a time stamp value. The packet is inserted into a trie data structure that represents a scheduling horizon and includes a plurality of packets. The packet scheduler transmits the packet over the network based on its sorted order within the trie data structure.
摘要翻译：描述了使用连接的特里数据结构通过分组调度器对分组进行排序的方法和装置。根据本发明的一个实施例，分组调度器在网络上接收分组，并为分组分配时间戳值。该分组被插入到表示调度水平并且包括多个分组的特里数据结构中。分组调度器基于其在特里数据结构内的排序顺序，通过网络发送分组。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式