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

1. 发明授权

US07493363B2 Peer-to-peer group management and method for maintaining peer-to-peer graphs 失效
标题翻译：点对点组管理和维护对等图的方法
公开(公告)号：US07493363B2
公开(公告)日：2009-02-17
申请号：US09955923
申请日：2001-09-19
申请人： Christian Huitema , Alexandru Gavrilescu , Noel W. Anderson , Xiaohai Zhang
发明人： Christian Huitema , Alexandru Gavrilescu , Noel W. Anderson , Xiaohai Zhang
IPC分类号： G06F15/16
CPC分类号： H04L29/12292 , H04L29/06 , H04L61/2069 , H04L67/104 , H04L67/1044 , H04L67/1046 , H04L67/1048 , H04L67/306 , H04L69/329
摘要： A system and method of serverless peer-to-peer group management and maintenance is presented. Group formation and discovery of private, public, and enumerated groups are provided, as is a method of joining such a peer-to-peer group. Group information management provided by the present invention ensures that each node maintains a current database from the initial joining of the group through the run phase of membership. Group graph maintenance utilizes a group signature to ensure that partitions in a graph may be detected and repaired. The utility of connections within the graph are also monitored so that non-productive connections may be dropped to increase the efficiency of the group. The diameter of the graph is also monitored and adjusted to ensure rapid information transfer throughout the group. A disconnect procedure is used to maintain the graph integrity and prevent partitions resulting from the departure of a group member.
摘要翻译：提出了无服务器对等组群管理和维护的系统和方法。提供私有，公共和枚举组的组合和发现，以及加入这种对等组的方法。通过本发明提供的组信息管理确保每个节点保持从组的初始加入到成员的运行阶段的当前数据库。组图维护使用组签名来确保图中的分区可能被检测和修复。还监视图中连接的效用，以便可以降低非生产性连接以提高组的效率。还会对图形的直径进行监控和调整，以确保整个组内快速的信息传递。使用断开连接程序来维护图形的完整性，并防止由于组成员的离开导致的分区。

2. 发明授权

US07068789B2 Peer-to-peer name resolution protocol (PNRP) group security infrastructure and method 失效
公开(公告)号：US07068789B2
公开(公告)日：2006-06-27
申请号：US09955924
申请日：2001-09-19
申请人： Christian Huitema , Alexandru Gavrilescu , Xiaohai Zhang
发明人： Christian Huitema , Alexandru Gavrilescu , Xiaohai Zhang
IPC分类号： H04L9/00
CPC分类号： H04L63/04 , H04L29/12009 , H04L29/12047 , H04L41/0893 , H04L61/15 , H04L63/0428 , H04L63/08 , H04L63/104 , H04L63/1441 , H04L63/1458 , H04L67/104
摘要： A method for ensuring valid and secure peer-to-peer communications in a group structure. Specifically, the system of the present invention presents a method of ensuring secure peer-to-peer group formation, group member addition, group member eviction, group information distribution, etc. Such functionality may be distributed to the individual peers in the group to further enhance the overall security of the group while enhancing flexibility. The P2P group security allows every peer who is a valid member of the group to invite new members. The recipients of these invitations are then able to contact any member of the group to join the group, not only the inviter. Further, groups may function when the group creator is not online. Likewise, the method allows the creation of secure groups with users from different security domains, relying on their security credentials in those domains for initial authentication.

3. 发明授权

US07689720B2 Method for establishing and maintaining a shared view of time in a peer-to-peer network 失效
标题翻译：在对等网络中建立和维护时间共享视图的方法
公开(公告)号：US07689720B2
公开(公告)日：2010-03-30
申请号：US10702405
申请日：2003-11-05
申请人： Jeremy L. Dewey , Christian Huitema , Xiaohai Zhang
发明人： Jeremy L. Dewey , Christian Huitema , Xiaohai Zhang
IPC分类号： G06F15/16 , G06F15/177
CPC分类号： H04L67/104 , H04L67/1095 , H04L69/28
摘要： A shared concept of time, called “graph time,” is agreed upon by all nodes within a graph. Each node maintains its own local delta representative of a difference in the node's system clock and graph time. Upon connecting to a neighbor node in a graph, a node is sent graph time as perceived by the neighbor node. In accordance with an embodiment, the node assumes that the lag time in receiving the graph time from the neighbor node is one-half of the lag time between the request for the connection and the receipt of the graph time. Graph time as sent by the neighbor node is added to one-half of the total delay and the sum is subtracted from the node's system time to calculate the delta for the node requesting connection.
摘要翻译：一个共享的时间概念，称为“图形时间”，由图中的所有节点同意。每个节点维护其本身的局部增量，表示节点的系统时钟和图形时间的差异。在连接到图中的邻居节点时，节点被发送图形时间，如邻居节点所感知的。根据实施例，节点假设从邻居节点接收图形时间的滞后时间是连接请求与图形时间的接收之间的滞后时间的一半。由相邻节点发送的图形时间被添加到总延迟的一半，并且从节点的系统时间中减去总和以计算请求连接的节点的增量。

4. 发明授权

US07478120B1 System and method for providing a peer indexing service 失效
标题翻译：提供对等索引服务的系统和方法
公开(公告)号：US07478120B1
公开(公告)日：2009-01-13
申请号：US10832657
申请日：2004-04-27
申请人： Xiaohai Zhang
发明人： Xiaohai Zhang
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L67/1065 , H04L67/1089
摘要： A peer graph is formed by assigning published identifiers to peer nodes that each map to network addresses. A signed number space is defined based on the published identifiers. Given a key, a closest peer node is determined by maintaining data identifying other peer nodes. Index information identifying the key and an associated value are stored as a pair on a storing peer node. Further key and value pairs are maintained in a local indexing database. Hierarchically structured levels are organized in a peer indexing database as a factor of the number space size. A group identifier is stored at a peer indexing database level determined as a function of the storing peer node, level and number space size factor. The key is hashed as a function of the initial group identifier and number space size factor to identify a closest peer node. Key and value pairs are transiently maintained.
摘要翻译：通过将发布的标识符分配给每个映射到网络地址的对等节点来形成对等体图。基于已发布的标识符定义已签名的号码空间。给定密钥，通过维护识别其他对等节点的数据来确定最接近的对等节点。识别密钥和关联值的索引信息作为一对存储在存储对等节点上。在本地索引数据库中维护更多的密钥和值对。作为数字空间大小的因素，层次结构化的级别被组织在对等索引数据库中。组标识符存储在根据存储对等节点确定的对等索引数据库级别，级别和数量空间大小因子。密钥作为初始组标识符和数字空间大小因子的函数进行散列，以识别最接近的对等节点。密钥和值对被短暂维护。

5. 发明申请

US20050108373A1 Method for establishing and maintaining a shared view of time in a peer-to-peer network 失效
标题翻译：在对等网络中建立和维护时间共享视图的方法
公开(公告)号：US20050108373A1
公开(公告)日：2005-05-19
申请号：US10702405
申请日：2003-11-05
申请人： Jeremy Dewey , Christian Huitema , Xiaohai Zhang
发明人： Jeremy Dewey , Christian Huitema , Xiaohai Zhang
IPC分类号： G06F15/173 , H04L29/06 , H04L29/08
CPC分类号： H04L67/104 , H04L67/1095 , H04L69/28
摘要： A shared concept of time, called “graph time,” is agreed upon by all nodes within a graph. Each node maintains its own local delta representative of a difference in the node's system clock and graph time. Upon connecting to a neighbor node in a graph, a node is sent graph time as perceived by the neighbor node. In accordance with an embodiment, the node assumes that the lag time in receiving the graph time from the neighbor node is one-half of the lag time between the request for the connection and the receipt of the graph time. Graph time as sent by the neighbor node is added to one-half of the total delay and the sum is subtracted from the node's system time to calculate the delta for the node requesting connection.
摘要翻译：一个共享的时间概念，称为“图形时间”，由图中的所有节点同意。每个节点维护其本身的局部增量，表示节点的系统时钟和图形时间的差异。在连接到图中的邻居节点时，节点被发送图形时间，如邻居节点所感知的。根据实施例，节点假设从邻居节点接收图形时间的滞后时间是连接请求与图形时间的接收之间的滞后时间的一半。由相邻节点发送的图形时间被添加到总延迟的一半，并且从节点的系统时间中减去总和以计算请求连接的节点的增量。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式