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

公开(公告)号：US08224898B2

公开(公告)日：2012-07-17

申请号：US11956481

申请日：2007-12-14

Applicant: Ashutosh Tripathi ,  Jonathan Shriver-Blake ,  Amit Kripalani ,  Dharmanand Singh ,  Rohit Gupta ,  Shirish Koti

Inventor： Ashutosh Tripathi ,  Jonathan Shriver-Blake ,  Amit Kripalani ,  Dharmanand Singh ,  Rohit Gupta ,  Shirish Koti

IPC: G06F17/00

CPC classification number: G06F17/30011

Abstract: Technologies are described herein for relevance-based expiration of data. An initial expiration time for the data is computed based upon an expiration duration associated with the data. The expiration time for the data is periodically re-computed in order to extend the expiration time. A relevance value for the meeting data is computed and the expiration time is set as a function of the computed relevance value. The relevance value may be computed as a product of a user-settable relevance value for the meeting data and a dynamic relevance point for the meeting data. When the computed expiration time for meeting data has been reached, the meeting data is expired, such as through the deletion of the meeting data.

Abstract translation: 本文描述了基于相关性的数据到期的技术。 基于与数据相关联的到期持续时间来计算数据的初始到期时间。 定期重新计算数据的到期时间，以延长到期时间。 计算会议数据的相关性值，并将过期时间设置为所计算的相关性值的函数。 可以将相关性值计算为会议数据的用户可设置相关性值和会议数据的动态相关性点的乘积。 当达到计算的会议数据的到期时间时，会议数据已过期，例如通过删除会议数据。

公开(公告)号：US20100290355A1

公开(公告)日：2010-11-18

申请号：US12467919

申请日：2009-05-18

Applicant: Sumit Roy ,  Rohit Gupta

Inventor： Sumit Roy ,  Rohit Gupta

IPC: H04L12/26

CPC classification number: H04W28/18 ,  H04L47/14 ,  H04W24/10 ,  H04W48/16 ,  H04W74/0808 ,  H04W84/12

Abstract: Examples of achieving quality of service in a wireless local area network via meeting communication channel performance criteria to include a minimum signal-to-noise plus interference ratio and a proportional fairness limit are disclosed.

Abstract translation: 公开了通过满足通信信道性能标准在无线局域网中实现服务质量以包括最小信噪比加干扰比和比例公平限制的示例。

公开(公告)号：US07466676B2

公开(公告)日：2008-12-16

申请号：US10999389

申请日：2004-11-30

Applicant: Rohit Gupta ,  Ravindra Singh ,  Sajal Kumar Das

Inventor： Rohit Gupta ,  Ravindra Singh ,  Sajal Kumar Das

IPC: H04Q7/00

CPC classification number: H04W74/002 ,  H04L47/14 ,  H04W16/14 ,  H04W74/0833 ,  H04W80/02 ,  H04W84/18

Abstract: A multi-tone synchronous collision resolution system permits communication nodes within a MANET to contend simultaneously for a plurality of available channels. The communication nodes contend for access using a synchronous signaling mechanism that utilizes multiple tones in a synchronous manner to resolve contentions. Contentions are arbitrated locally, and a surviving subset of communication nodes is selected. The communication nodes of the surviving subset then transmit data packets simultaneously across the available communication channels.

Abstract translation: 多音同步冲突解决系统允许MANET内的通信节点同时争用多个可用信道。 通信节点使用同步信令机制来竞争接入，该同步信令机制以同步方式利用多个音调来解决争用。 争用在本地进行仲裁，并选择一个幸存的通信节点子集。 幸存子集的通信节点然后在可用的通信信道上同时传输数据分组。

公开(公告)号：US07430747B2

公开(公告)日：2008-09-30

申请号：US10309865

申请日：2002-12-04

Applicant: Todd R. Manion ,  Jeremy L. Dewey ,  Robert D. Donner ,  Scott A. Senkeresty ,  Rohit Gupta ,  Upshur Warren Parks, III ,  Noel W. Anderson

Inventor： Todd R. Manion ,  Jeremy L. Dewey ,  Robert D. Donner ,  Scott A. Senkeresty ,  Rohit Gupta ,  Upshur Warren Parks, III ,  Noel W. Anderson

IPC: G06F3/00 ,  G06F9/44 ,  G06F9/46 ,  G06F13/00

CPC classification number: H04L67/104 ,  H04L67/1042 ,  H04L67/1089

Abstract: Application programming interfaces and methods that provide graph management in a peer-to-peer (P2P) network are provided. More specifically, new and improved P2P application programming interfaces (APIs) and methods for the creation and access of graphs, the retrieval of node and graph information, the addition, modification, deletion and management of records (data), the importation and exportation of graph data, the direct communication between graph nodes, the addition of a security provider to a graph, the setting and retrieval of presence information, the registering for event notifications, and other utility and support functions are presented. Each of these interfaces utilize various parameters that are passed in from an application program that uses these interfaces to manage and utilize graphs. The interfaces return a value that indicates the success or failure of the function. For failures, the interfaces provide an indication as to the problem resulting in the failure.

Abstract translation: 提供了在点对点（P2P）网络中提供图形管理的应用程序编程接口和方法。 更具体地说，新的和改进的P2P应用编程接口（API）和图形创建和访问方法，节点和图形信息的检索，记录（数据）的添加，修改，删除和管理，输入和输出 呈现图形数据，图形节点之间的直接通信，图形中的安全提供者的添加，存在信息的设置和检索，事件通知的注册以及其他实用和支持功能。 这些接口中的每一个都使用从使用这些接口的应用程序传入的各种参数来管理和利用图形。 接口返回一个值，表示该函数的成功或失败。 对于故障，接口提供了导致故障的问题的指示。

公开(公告)号：US20080013537A1

公开(公告)日：2008-01-17

申请号：US11486544

申请日：2006-07-14

Applicant: Jeremy L. Dewey ,  Noah Horton ,  Rohit Gupta ,  Todd R. Manion

Inventor： Jeremy L. Dewey ,  Noah Horton ,  Rohit Gupta ,  Todd R. Manion

IPC: H04L12/56

CPC classification number: H04L63/0823 ,  H04L63/083

Abstract: A system, apparatus, method, and computer-readable medium are provided for authorizing a computing node to participate in a group of computing nodes utilizing a shared group password. According to one method described herein, an invitation to join a group is transmitted to a tentative group member node. The invitation is used to establish a connection with a group member node of the group. The tentative group member node generates a hash of a group password and transmits the hash to the group member node. When the group member node receives the hash, the group member node compares the received value to a previously stored hash of the group password. If the previously stored value is identical to the value received from the tentative group member node, then the tentative group member node is authorized as a new member of the group. Otherwise the tentative group member node is not permitted to become a member of the group.

Abstract translation: 提供了一种系统，装置，方法和计算机可读介质，用于使用共享组密码来授权计算节点参与一组计算节点。 根据本文描述的一种方法，将加入组的邀请传送到临时组成员节点。 该邀请用于与该组的组成员节点建立连接。 临时组成员节点生成组密码的散列，并将散列发送到组成员节点。 当组成员节点接收到散列时，组成员节点将接收到的值与先前存储的组密码的散列进行比较。 如果先前存储的值与从暂定组成员节点接收到的值相同，那么临时组成员节点被授权为该组的新成员。 否则暂时的组成员节点不允许成为组的成员。