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

1. 发明申请

US20120271944A1 DISTRIBUTED COMPUTING BASED ON MULTIPLE NODES WITH DETERMINED CAPACITY SELECTIVELY JOINING RESOURCE GROUPS HAVING RESOURCE REQUIREMENTS 有权
标题翻译：基于具有确定能力的多个节点的分布式计算具有资源需求的选择性资源组
公开(公告)号：US20120271944A1
公开(公告)日：2012-10-25
申请号：US13541621
申请日：2012-07-03
申请人： Bryan C. TURNER , John TOEBES , Douglas Jay WALKER
发明人： Bryan C. TURNER , John TOEBES , Douglas Jay WALKER
IPC分类号： G06F15/173
CPC分类号： G06F9/5072 , G06F2209/5011 , G06F2209/505
摘要： A network provides distributed computing services based on participation in respective resource groups by computing nodes, each resource group including a corresponding resource requirement for any computing node that joins the corresponding resource group for execution of the corresponding distributed computing service. Each computing node, in response to determining its corresponding available node capacity, is configured for selectively creating and joining at least one new resource group for execution of a corresponding distributed computing service having a corresponding resource requirement, and/or selectively joining at least one of the available resource groups, based on the corresponding available node capacity satisfying the corresponding resource requirement. Each computing node also is configured for selectively leaving any one of the joined resource groups based on determined conditions. Hence, each computing node may choose to participate in as many resource groups as needed for respective computing services, based on the corresponding available node capacity.
摘要翻译：网络通过计算节点提供基于参与相应资源组的分布式计算服务，每个资源组包括加入相应资源组以执行相应分布式计算服务的任何计算节点的相应资源需求。响应于确定其对应的可用节点容量，每个计算节点被配置用于选择性地创建和加入至少一个新的资源组，以执行具有相应资源需求的对应的分布式计算服务，和/或选择性地将至少一个可用资源组，基于相应的可用节点容量，满足相应的资源需求。每个计算节点还被配置为基于确定的条件选择性地离开所连接的资源组中的任何一个。因此，基于相应的可用节点容量，每个计算节点可以选择参与相应计算服务所需的尽可能多的资源组。

2. 发明申请

US20120096312A1 ARRANGEMENT FOR RECOVERY OF DATA BY NETWORK NODES BASED ON RETRIEVAL OF ENCODED DATA DISTRIBUTED AMONG THE NETWORK NODES 有权
标题翻译：基于网络节点分发的编码数据检索网络节点数据恢复的安排
公开(公告)号：US20120096312A1
公开(公告)日：2012-04-19
申请号：US13334930
申请日：2011-12-22
申请人： Bryan C. TURNER , John TOEBES , Douglas Jay WALKER
发明人： Bryan C. TURNER , John TOEBES , Douglas Jay WALKER
IPC分类号： G06F11/14
CPC分类号： G06F11/1076 , G06F2211/1028 , G06F2211/1057 , H04L67/06 , H04L67/1095 , H04L67/1097 , H04L69/14 , H04L69/40 , H04Q2213/13034 , H04Q2213/13174 , H04Q2213/13215
摘要： Distributed data, having been stored in a distributed storage system as a collection of distributed data elements, is recovered based on connection of multiple user nodes, each user node having stored selected distributed data elements as a corresponding portion of the distributed data during replication of the distributed data elements throughout the distributed storage system. Each distributed data element is identifiable by a corresponding unique object identifier (OID). Each user node includes a discovery resource for discovering reachable user nodes, a local cache configured for identifying at least the corresponding portion of the distributed data based on the respective OIDs, and an identification service module configured for resolving a data object to a corresponding OID, via the corresponding local cache, or based on sending a query to the reachable user nodes. Hence, user nodes can recover distributed data based on exchanging resolution information and OID information.
摘要翻译：已经存储在作为分布式数据元素的集合的分布式存储系统中的分布式数据基于多个用户节点的连接来恢复，每个用户节点在复制期间具有存储的选择的分布式数据元素作为分布式数据的对应部分分布式数据元素遍布分布式存储系统。每个分布式数据元素可以通过对应的唯一对象标识符（OID）来识别。每个用户节点包括用于发现可达到的用户节点的发现资源，配置用于基于相应的OID识别分布式数据的至少相应部分的本地高速缓存，以及被配置为将数据对象解析为相应的OID的标识服务模块，通过相应的本地缓存，或者基于向可达到的用户节点发送查询。因此，用户节点可以基于交换分辨率信息和OID信息来恢复分布式数据。

3. 发明申请

US20120265782A1 ARRANGEMENT FOR A DISTRIBUTED FILE SYSTEM HAVING DATA OBJECTS MAPPED INDEPENDENT OF ANY DATA OBJECT ATTRIBUTE 有权
公开(公告)号：US20120265782A1
公开(公告)日：2012-10-18
申请号：US13527541
申请日：2012-06-19
申请人： Bryan C. TURNER , John TOEBES , Douglas Jay WALKER
发明人： Bryan C. TURNER , John TOEBES , Douglas Jay WALKER
IPC分类号： G06F17/30
CPC分类号： G06F17/30215 , G06F17/30067 , Y10S707/959 , Y10S707/96
摘要： Each data file of a distributed file system is identified by a corresponding globally-unique object identifier that is independent of any attribute of the data file. A node in the distributed file system has a file system that includes a plurality of directory entries, where each directory entry has a file name field, an attributes field, and an object identifier field configured for specifying a globally-unique object identifier. The globally-unique object identifier is universally reachable by any node of the distributed file system and uniquely identifies the data file, enabling the data file to be universally identifiable by any node based on the corresponding object identifier. The data file can be stored independently of a device file system based on providing a resolution between the data file name and its object identifier, followed by a resolution between the object identifier and a selected location for the data file.

4. 发明申请

US20110314160A1 DISTRIBUTED COMPUTING BASED ON MULTIPLE NODES WITH DETERMINED CAPACITY SELECTIVELY JOINING RESOURCE GROUPS HAVING RESOURCE REQUIREMENTS 有权
标题翻译：基于具有确定能力的多个节点的分布式计算具有资源需求的选择性资源组
公开(公告)号：US20110314160A1
公开(公告)日：2011-12-22
申请号：US13221625
申请日：2011-08-30
申请人： Bryan C. TURNER , John TOEBES , Douglas Jay WALKER
发明人： Bryan C. TURNER , John TOEBES , Douglas Jay WALKER
IPC分类号： G06F15/173
CPC分类号： G06F9/5072 , G06F2209/5011 , G06F2209/505
摘要： A network provides distributed computing services based on participation in respective resource groups by computing nodes, each resource group including a corresponding resource requirement for any computing node that joins the corresponding resource group for execution of the corresponding distributed computing service. Each computing node, in response to determining its corresponding available node capacity, is configured for selectively creating and joining at least one new resource group for execution of a corresponding distributed computing service having a corresponding resource requirement, and/or selectively joining at least one of the available resource groups, based on the corresponding available node capacity satisfying the corresponding resource requirement. Each computing node also is configured for selectively leaving any one of the joined resource groups based on determined conditions. Hence, each computing node may choose to participate in as many resource groups as needed for respective computing services, based on the corresponding available node capacity.
摘要翻译：网络通过计算节点提供基于参与相应资源组的分布式计算服务，每个资源组包括加入相应资源组以执行相应分布式计算服务的任何计算节点的相应资源需求。响应于确定其对应的可用节点容量，每个计算节点被配置用于选择性地创建和加入至少一个新的资源组，以执行具有相应资源需求的对应的分布式计算服务，和/或选择性地将至少一个可用资源组，基于相应的可用节点容量，满足相应的资源需求。每个计算节点还被配置为基于确定的条件选择性地离开所连接的资源组中的任何一个。因此，基于相应的可用节点容量，每个计算节点可以选择参与相应计算服务所需的尽可能多的资源组。

5. 发明申请

US20110016351A1 ARRANGEMENT FOR RECOVERY OF DATA BY NETWORK NODES BASED ON RETRIEVAL OF ENCODED DATA DISTRIBUTED AMONG THE NETWORK NODES 有权
标题翻译：基于网络节点分发的编码数据检索网络节点数据恢复的安排
公开(公告)号：US20110016351A1
公开(公告)日：2011-01-20
申请号：US12891690
申请日：2010-09-27
申请人： Bryan C. TURNER , John TOEBES , Douglas Jay WALKER
发明人： Bryan C. TURNER , John TOEBES , Douglas Jay WALKER
IPC分类号： G06F11/00 , G06F11/16
CPC分类号： G06F11/1076 , G06F2211/1028 , G06F2211/1057 , H04L67/06 , H04L67/1095 , H04L67/1097 , H04L69/14 , H04L69/40 , H04Q2213/13034 , H04Q2213/13174 , H04Q2213/13215
摘要： Distributed data, having been stored in a distributed storage system as a collection of distributed data elements, is recovered based on connection of multiple user nodes, each user node having stored selected distributed data elements as a corresponding portion of the distributed data during replication of the distributed data elements throughout the distributed storage system. Each distributed data element is identifiable by a corresponding unique object identifier (OID). Each user node includes a discovery resource for discovering reachable user nodes, a local cache configured for identifying at least the corresponding portion of the distributed data based on the respective OIDs, and an identification service module configured for resolving a data object to a corresponding OID, via the corresponding local cache, or based on sending a query to the reachable user nodes. Hence, user nodes can recover distributed data based on exchanging resolution information and OID information.
摘要翻译：已经存储在作为分布式数据元素的集合的分布式存储系统中的分布式数据基于多个用户节点的连接来恢复，每个用户节点在复制期间具有存储的选择的分布式数据元素作为分布式数据的对应部分分布式数据元素遍布分布式存储系统。每个分布式数据元素可以通过对应的唯一对象标识符（OID）来识别。每个用户节点包括用于发现可到达用户节点的发现资源，配置用于基于相应OID识别分布式数据的至少相应部分的本地高速缓存，以及被配置为将数据对象解析为对应的OID的标识服务模块，通过相应的本地缓存，或者基于向可达到的用户节点发送查询。因此，用户节点可以基于交换分辨率信息和OID信息来恢复分布式数据。

6. 发明申请

US20100250668A1 ARRANGEMENT FOR SELECTING A SERVER TO PROVIDE DISTRIBUTED SERVICES FROM AMONG MULTIPLE SERVERS BASED ON A LOCATION OF A CLIENT DEVICE 审中-公开
标题翻译：选择服务器的安排，根据客户端的位置从多个服务器提供分布式服务
公开(公告)号：US20100250668A1
公开(公告)日：2010-09-30
申请号：US12793900
申请日：2010-06-04
申请人： John TOEBES , Bryan C. TURNER , Douglas Jay WALKER
发明人： John TOEBES , Bryan C. TURNER , Douglas Jay WALKER
IPC分类号： G06F15/16 , G06F9/46
CPC分类号： H04L67/1021
摘要： A selection resource executed within the network is configured for selecting from among a plurality of servers, distributed throughout the network at respective network-based server locations and each configured for providing a specified service, a selected server for providing the specified service for a client device at a network-based client location. The selection resource selects the selected server based on the corresponding server location relative to the client location, and causes a request having been generated by the client device to be sent to the selected server. Hence, the selection resource optimizes client-server interactions in a distributed computing network, based on the client location and the server location.
摘要翻译：在网络内执行的选择资源被配置用于从在各个基于网络的服务器位置分布在整个网络中的多个服务器中进行选择，并且每个被配置用于提供指定的服务，所选择的服务器为客户端设备提供指定的服务在基于网络的客户端位置。选择资源基于相对于客户端位置的相应服务器位置来选择所选择的服务器，并且使由客户端设备生成的请求被发送到所选择的服务器。因此，选择资源基于客户端位置和服务器位置优化分布式计算网络中的客户端 - 服务器交互。

7. 发明申请

US20130067030A1 STREAMING NETWORK CODING 审中-公开
标题翻译：流网络编码
公开(公告)号：US20130067030A1
公开(公告)日：2013-03-14
申请号：US13610518
申请日：2012-09-11
申请人： Bryan C. TURNER , John TOEBES
发明人： Bryan C. TURNER , John TOEBES
IPC分类号： G06F15/16
CPC分类号： H04L67/1076 , H04L65/607 , H04L67/104 , H04L67/108
摘要： In one embodiment, a method comprises supplying, by a network node to a peer network node, a randomization seed assigned to the network node for generating a prescribed sequence of pseudorandom numbers according to a prescribed pseudorandom number generation function; encoding each data block having a corresponding position in an ordered sequence of a stream of data blocks, into a corresponding differentially-encoded data block based on applying a product of the corresponding data block and the corresponding pseudorandom number, having the corresponding position in the prescribed sequence, to a corresponding successively-preceding differentially-encoded data block from the prescribed ordered sequence, the data block recoverable solely based on a determined difference between the corresponding differentially-encoded data block and the corresponding successively-preceding differentially-encoded data block relative to the corresponding pseudorandom number; and outputting each differentially-encoded data block in a corresponding packet that identifies the network node and the corresponding position.
摘要翻译：在一个实施例中，一种方法包括：由网络节点向对等网络节点提供分配给网络节点的随机化种子，用于根据规定的伪随机数生成函数产生规定的伪随机数序列; 将具有数据块流的有序序列中的相应位置的每个数据块基于将相应的数据块和对应的伪随机数的乘积应用于相应的差分编码数据块中，具有相应位置在规定的序列到来自规定有序序列的相应连续先前的差分编码数据块，该数据块可以仅基于相应的差分编码数据块和相应的先前差分编码数据块之间确定的差相对于相应的伪随机数; 并将每个差分编码的数据块输出到标识网络节点的相应分组和对应的位置。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式