公开(公告)号：US07418479B2

公开(公告)日：2008-08-26

申请号：US11376397

申请日：2006-03-15

Applicant: Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

Inventor： Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

IPC: G06F15/173

CPC classification number: H04L67/104 ,  H04L29/12009 ,  H04L29/12047 ,  H04L61/15 ,  H04L63/0823 ,  H04L63/126 ,  H04L63/1458 ,  Y10S707/99939

Abstract: A security infrastructure and methods are presented that inhibit the ability of a malicious node from disrupting the normal operations of a peer-to-peer network. The methods of the invention allow both secure and insecure identities to be used by nodes by making them self-verifying. When necessary or opportunistic, ID ownership is validated by piggybacking the validation on existing messages. The probability of connecting initially to a malicious node is reduced by randomly selecting to which node to connect. Further, information from malicious nodes is identified and can be disregarded by maintaining information about prior communications that will require a future response. Denial of service attacks are inhibited by allowing the node to disregard requests when its resource utilization exceeds a predetermined limit. The ability for a malicious node to remove a valid node is reduced by requiring that revocation certificates be signed by the node to be removed.

Abstract translation: 提出了一种防止恶意节点中断对等网络的正常操作的能力的安全基础设施和方法。 本发明的方法允许节点通过使其自我验证来使用安全和不安全的身份。 在必要或机会主义的情况下，通过捎带现有消息的验证来验证身份所有权。 通过随机选择连接到哪个节点来减少初始连接到恶意节点的概率。 此外，来自恶意节点的信息被识别，并且可以通过维护关于将要响应的先前通信的信息而被忽略。 通过允许节点在其资源利用超过预定限制时忽略请求，禁止拒绝服务攻击。 恶意节点删除有效节点的能力通过要求撤销证书由要删除的节点进行签名来减少。

公开(公告)号：US07397922B2

公开(公告)日：2008-07-08

申请号：US10608768

申请日：2003-06-27

Applicant: Alexandru Gavrilescu ,  Graham A. Wheeler ,  Grigori M. Somin ,  John L. Miller ,  Rohit Gupta

Inventor： Alexandru Gavrilescu ,  Graham A. Wheeler ,  Grigori M. Somin ,  John L. Miller ,  Rohit Gupta

IPC: H04K1/00

CPC classification number: H04L63/0823 ,  G06F21/604 ,  G06F21/6218 ,  G06F2221/2117 ,  H04L9/0833 ,  H04L9/3265

Abstract: A system and method for providing security to a graph of interconnected nodes includes a grouping multiplexing layer configured to monitor calls to the system, a graphing dynamic link layer configured to transmit and receive data to and from the graph, and a group security manager coupled to the grouping multiplexing layer and coupled to the graphing dynamic link layer; the group security manager is configured to perform security-related acts via interacting with a group database to propagate security-related information to members of a group within the graph. The group security manager is configured to provide role-based authorization on publication of one or more records and provide membership control for admission to a graph of interconnected nodes. The group security manager provides membership control by providing credentials to potential members of the graph to enable a connection and by providing a governed system for renewal and revocation of members.

Abstract translation: 用于向互连节点的图形提供安全性的系统和方法包括被配置为监视对系统的呼叫的分组多路复用层，被配置为向和从图形发送和接收数据的图形动态链路层，以及耦合到 分组复用层并耦合到图形动态链路层; 组安全管理器被配置为通过与组数据库交互来执行与安全相关的动作，以将安全性信息传播到图中的组的成员。 组安全管理器被配置为在一个或多个记录的发布上提供基于角色的授权，并提供用于允许互连节点的图形的成员资格控制。 集团安全经理通过为图表的潜在成员提供凭据来提供成员资格控制，以实现连接，并通过提供受管理的系统来更新和撤销成员。

公开(公告)号：US07251694B2

公开(公告)日：2007-07-31

申请号：US11375748

申请日：2006-03-15

Applicant: Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

Inventor： Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

IPC: G06F15/16

CPC classification number: H04L67/104 ,  H04L29/12009 ,  H04L29/12047 ,  H04L61/15 ,  H04L63/0823 ,  H04L63/126 ,  H04L63/1458 ,  Y10S707/99939

Abstract: A security infrastructure and methods are presented that inhibit the ability of a malicious node from disrupting the normal operations of a peer-to-peer network. The methods of the invention allow both secure and insecure identities to be used by nodes by making them self-verifying. When necessary or opportunistic, ID ownership is validated by piggybacking the validation on existing messages. The probability of connecting initially to a malicious node is reduced by randomly selecting to which node to connect. Further, information from malicious nodes is identified and can be disregarded by maintaining information about prior communications that will require a future response. Denial of service attacks are inhibited by allowing the node to disregard requests when its resource utilization exceeds a predetermined limit. The ability for a malicious node to remove a valid node is reduced by requiring that revocation certificates be signed by the node to be removed.

Abstract translation: 提出了一种防止恶意节点中断对等网络的正常操作的能力的安全基础设施和方法。 本发明的方法允许节点通过使其自我验证来使用安全和不安全的身份。 在必要或机会主义的情况下，通过捎带现有消息的验证来验证身份所有权。 通过随机选择连接到哪个节点来减少初始连接到恶意节点的概率。 此外，来自恶意节点的信息被识别，并且可以通过维护关于将要响应的先前通信的信息而被忽略。 通过允许节点在其资源利用超过预定限制时忽略请求，禁止拒绝服务攻击。 恶意节点删除有效节点的能力通过要求撤销证书由要删除的节点进行签名来减少。

公开(公告)号：US20070047638A1

公开(公告)日：2007-03-01

申请号：US11551581

申请日：2006-10-20

Applicant: Bruce Lam ,  Andrew Bell ,  Douglas Solomon ,  Rohit Gupta

Inventor： Bruce Lam ,  Andrew Bell ,  Douglas Solomon ,  Rohit Gupta

IPC: H03K9/08 ,  H04B14/04

CPC classification number: G10L19/10

Abstract: A system and method are provided for decoding an audio signal. In one embodiment, a first pulse is identified with a predetermined relative duration with respect to a second pulse. A sampling frequency is then calculated based on such identification. In another embodiment, an audio signal is decoded utilizing a threshold. In still yet another embodiment, a decoder is provided for decoding an audio signal utilizing a clock that is independent of the audio signal.

Abstract translation: 提供了一种用于对音频信号进行解码的系统和方法。 在一个实施例中，以相对于第二脉冲的预定相对持续时间来识别第一脉冲。 然后基于这种识别计算采样频率。 在另一个实施例中，利用阈值解码音频信号。 在又一个实施例中，提供了一种解码器，用于利用独立于音频信号的时钟对音频信号进行解码。

公开(公告)号：US20060239279A1

公开(公告)日：2006-10-26

申请号：US11112135

申请日：2005-04-22

Applicant: Andre Classen ,  Anirudh Anirudh ,  David Thaler ,  Kevin Tao ,  Ravi Rao ,  Rohit Gupta ,  Tomer Weisberg ,  Upshur Parks

Inventor： Andre Classen ,  Anirudh Anirudh ,  David Thaler ,  Kevin Tao ,  Ravi Rao ,  Rohit Gupta ,  Tomer Weisberg ,  Upshur Parks

IPC: H04L12/28

CPC classification number: H04L67/104 ,  H04L67/24

Abstract: Systems and methods are described that facilitate the management of contact information, at least some of the contact information related to entities in a serverless, peer-to-peer system. A contact store may store information regarding which other entities of a plurality of other entities are authorized to monitor presence of a user entity. Presence of an entity may generally indicate the willingness and/or ability of the entity to communicate and/or collaborate with other entities, for example. The contact store may also store information regarding which other entities of the plurality of other entities the presence of which should be monitored by the system. A user entity may be able to add contacts to and/or delete contacts from the contact store, for example. The user entity may also be able to modify the contact store to modify which other entities are authorized to monitor presence of the user entity and/or which other entities the presence information of which should be monitored by the system, for example.

公开(公告)号：US20060193265A1

公开(公告)日：2006-08-31

申请号：US11064940

申请日：2005-02-25

Applicant: Radu Simionescu ,  Rohit Gupta ,  Christian Huitema ,  John Miller ,  Ravi Rao ,  Adam Sapek

Inventor： Radu Simionescu ,  Rohit Gupta ,  Christian Huitema ,  John Miller ,  Ravi Rao ,  Adam Sapek

IPC: H04L12/28 ,  H04J1/16 ,  H04L12/56

CPC classification number: H04L67/104 ,  H04L29/08846 ,  H04L67/28 ,  H04L67/2823 ,  H04L67/2828 ,  H04L69/40

Abstract: A system, method, and computer product for a host node to participate in a peer network through a proxy, wherein the peer network includes a plurality of nodes, each node having a peer identifier (ID) and a cache of peer IDs for one or more known nodes, is provided. The method comprises acquiring the peer ID of a proxy node in the peer network; requesting the proxy node to act as a proxy; sending a message to at least one node in the peer network through the proxy node; and receiving a response from the at least one node in the peer network through the proxy node, wherein the at least one node in the peer network is unaware of a network address for the host node.

Abstract translation: 一种用于主机节点通过代理参与对等网络的系统，方法和计算机产品，其中对等网络包括多个节点，每个节点具有对等体标识符（ID）和用于一个或多个节点的对等体ID的高速缓存 提供更多已知节点。 该方法包括获取对等网络中的代理节点的对等体ID; 请求代理节点充当代理; 通过代理节点向对等网络中的至少一个节点发送消息; 以及通过所述代理节点从所述对等网络中的所述至少一个节点接收响应，其中所述对等网络中的所述至少一个节点不知道所述主机节点的网络地址。

公开(公告)号：US20060174005A1

公开(公告)日：2006-08-03

申请号：US11375749

申请日：2006-03-15

Applicant: Rohit Gupta ,  Alexandru Gavrilescu ,  John Miller ,  Graham Wheeler

Inventor： Rohit Gupta ,  Alexandru Gavrilescu ,  John Miller ,  Graham Wheeler

IPC: G06F15/173

CPC classification number: H04L67/104 ,  H04L29/12009 ,  H04L29/12047 ,  H04L61/15 ,  H04L63/0823 ,  H04L63/126 ,  H04L63/1458 ,  Y10S707/99939

Abstract: A security infrastructure and methods are presented that inhibit the ability of a malicious node from disrupting the normal operations of a peer-to-peer network. The methods of the invention allow both secure and insecure identities to be used by nodes by making them self-verifying. When necessary or opportunistic, ID ownership is validated by piggybacking the validation on existing messages. The probability of connecting initially to a malicious node is reduced by randomly selecting to which node to connect. Further, information from malicious nodes is identified and can be disregarded by maintaining information about prior communications that will require a future response. Denial of service attacks are inhibited by allowing the node to disregard requests when its resource utilization exceeds a predetermined limit. The ability for a malicious node to remove a valid node is reduced by requiring that revocation certificates be signed by the node to be removed.

公开(公告)号：US07051102B2

公开(公告)日：2006-05-23

申请号：US10134780

申请日：2002-04-29

Applicant: Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

Inventor： Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

IPC: G06F15/16

CPC classification number: H04L67/104 ,  H04L29/12009 ,  H04L29/12047 ,  H04L61/15 ,  H04L63/0823 ,  H04L63/126 ,  H04L63/1458 ,  Y10S707/99939

Abstract: A security infrastructure and methods are presented that inhibit the ability of a malicious node from disrupting the normal operations of a peer-to-peer network. The methods of the invention allow both secure and insecure identities to be used by nodes by making them self-verifying. When necessary or opportunistic, ID ownership is validated by piggybacking the validation on existing messages. The probability of connecting initially to a malicious node is reduced by randomly selecting to which node to connect. Further, information from malicious nodes is identified and can be disregarded by maintaining information about prior communications that will require a future response. Denial of service attacks are inhibited by allowing the node to disregard requests when its resource utilization exceeds a predetermined limit. The ability for a malicious node to remove a valid node is reduced by requiring that revocation certificates be signed by the node to be removed.

公开(公告)号：US09152207B2

公开(公告)日：2015-10-06

申请号：US13530095

申请日：2012-06-21

Applicant: Gur Prasad Srivastava ,  Parampreet Singh Baweja ,  Rohit Gupta

Inventor： Gur Prasad Srivastava ,  Parampreet Singh Baweja ,  Rohit Gupta

IPC: G06F1/00 ,  G06F1/32 ,  G06F1/26 ,  H04L29/06 ,  H04W52/02

CPC classification number: G06F1/3215 ,  G06F1/26 ,  G06F1/32 ,  G06F1/3237 ,  G06F1/3278 ,  G06F2213/0038 ,  H04L63/0414 ,  H04L63/08 ,  H04L63/1416 ,  H04W52/0225 ,  Y02D10/128

Abstract: A system for reducing dynamic power consumption of a wakeup source includes a receiver interface coupled to the wakeup source. A data packet, received by the receiver interface, transmits the data packet to the wakeup source. The wakeup source processes the data packet to identify a predetermined code for initiating a wakeup sequence. The wakeup source is put into a deep sleep mode if it is idle for a predetermined time period.

Abstract translation: 用于降低唤醒源的动态功耗的系统包括耦合到唤醒源的接收器接口。 由接收器接口接收的数据包将数据包发送到唤醒源。 唤醒源处理数据分组以识别用于发起唤醒序列的预定代码。 如果唤醒源在预定时间段内空闲，则将其置于深度睡眠模式。

公开(公告)号：US08817031B2

公开(公告)日：2014-08-26

申请号：US12894001

申请日：2010-09-29

Applicant: Ziyad S. Hakura ,  Rohit Gupta ,  Michael C. Shebanow ,  Emmett M. Kilgariff

Inventor： Ziyad S. Hakura ,  Rohit Gupta ,  Michael C. Shebanow ,  Emmett M. Kilgariff

IPC: G06F15/80

CPC classification number: G06T1/00

Abstract: A technique for performing stream output operations in a parallel processing system is disclosed. A stream synchronization unit is provided that enables the parallel processing unit to track batches of vertices being processed in a graphics processing pipeline. A plurality of stream output units is also provided, where each stream output unit writes vertex attribute data to one or more stream output buffers for a portion of the batches of vertices. A messaging protocol is implemented between the stream synchronization unit and the plurality of stream output units that ensures that each of the stream output units writes vertex attribute data for the particular batch of vertices distributed to that particular stream output unit in the same order in the stream output buffers as the order in which the batch of vertices was received from a device driver by the parallel processing unit.

Abstract translation: 公开了一种用于在并行处理系统中执行流输出操作的技术。 提供流同步单元，其使并行处理单元能够跟踪在图形处理流水线中正在处理的顶点的批次。 还提供了多个流输出单元，其中每个流输出单元将顶点属性数据写入一批或多个顶点的一部分的流输出缓冲器。 在流同步单元和多个流输出单元之间实现消息传递协议，确保每个流输出单元以流中相同的顺序写入分配给该特定流输出单元的特定批次的顶点的顶点属性数据 输出缓冲器作为由并行处理单元从设备驱动器接收到顶点批次的顺序。