会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • CONSISTENT RING NAMESPACES FACILITATING DATA STORAGE AND ORGANIZATION IN NETWORK INFRASTRUCTURES
    • 网络基础设施中数据存储和组织的一致性名称
    • WO2013152358A1
    • 2013-10-10
    • PCT/US2013/035675
    • 2013-04-08
    • EXABLOX CORPORATION
    • HARDIN, CharlesSUBRAMANIAM, SridharHUNT, TadBARRUS, Frank, E.
    • G06F15/177
    • G06F17/30339G06F17/3033H04L61/1582H04L67/1097
    • Computer-implemented methods and systems for managing data objects within a computer network infrastructure that facilitate more efficient and reliable data storage and access are provided. An exemplary method may comprise establishing a physical identifier for each storage resource. A plurality of unique virtual identifiers for each storage resource is generated based on the physical identifier. The plurality of unique virtual identifiers is stored in a consistent ring namespace accessible to every node. An object identifier associated with a location of a data object to be stored in a storage resource is generated. The object identifier is mapped to the consistent ring namespace. The method may also include enabling traversing the consistent ring namespace from any node in the computer network to locate and access the data object.
    • 提供了用于管理计算机网络基础设施内的数据对象的计算机实现的方法和系统,其促进更有效和可靠的数据存储和访问。 示例性方法可以包括为每个存储资源建立物理标识符。 基于物理标识符生成每个存储资源的多个唯一虚拟标识符。 多个唯一虚拟标识符存储在每个节点可访问的一致的环名称空间中。 生成与要存储在存储资源中的数据对象的位置相关联的对象标识符。 对象标识符映射到一致的环名称空间。 该方法还可以包括实现从计算机网络中的任何节点遍历一致的环名称空间以定位和访问数据对象。
    • 2. 发明申请
    • MANAGEMENT AND PROVISIONING OF CLOUD CONNECTED DEVICES
    • 云连接设备的管理和提供
    • WO2015088761A1
    • 2015-06-18
    • PCT/US2014/067110
    • 2014-11-24
    • EXABLOX CORPORATION
    • TARLANO, Anthony JohnHUNT, Tad
    • H04L29/08
    • H04L41/0806G06F21/31H04L63/08H04L67/02H04L67/10H04L67/16
    • A method for provisioning of a device or a group of devices discovery and registration service comprises receiving availability messages from unbound devices, receiving a request for the service, correlating the service identifying data to the device identifying data, selecting candidate unbound devices, prompting the user to select an unbound device, or an unbound group of devices, receiving a selected unbound device, or a selected unbound group of devices, from the user, sending a machine generated code to an output device associated with the selected unbound device or group of devices, prompting the user to confirm ownership of the selected unbound device or group of devices, by entering the machine generated code, receiving, from the user, a human entered code, comparing the machine generated code to the human entered code, and based on the comparison, selectively binding the selected device, or the selected group of devices, to the service.
    • 用于提供设备或一组设备发现和注册服务的方法包括从未绑定的设备接收可用性消息,接收对服务的请求,将服务标识数据与设备标识数据相关联,选择候选未绑定设备,提示用户 从用户中选择未绑定的设备或未绑定的设备组,从用户接收所选择的未绑定设备或选定的未绑定设备组,将机器生成的代码发送到与所选择的未绑定设备或设备组相关联的输出设备 ,通过输入机器产生的代码,从用户接收人类输入的代码,将机器生成的代码与人类输入的代码进行比较,并且基于该输入的代码,提示用户确认所选择的未绑定的设备或一组设备的所有权 比较,选择性地将所选设备或所选择的设备组绑定到服务。
    • 4. 发明申请
    • CONTENT BASED ORGANIZATION OF FILE SYSTEMS
    • 基于内容的文件系统组织
    • WO2015120071A2
    • 2015-08-13
    • PCT/US2015/014492
    • 2015-02-04
    • EXABLOX CORPORATION
    • HUNT, TadBARRUS, Frank E.
    • G06F17/30
    • G06F17/30097
    • The methods and systems for organizing and managing a file system on top of a content addressable object store are provided. User content is associated with a record including a content hash associated with an address in the content addressable object store. The content hash is a function of user content and determined by dividing the file into data objects, generating a pointer tree of hashes on top of the data objects, and calculating a hash of the root of the pointer tree. The record, the pointer tree, and the file are stored in the object store. Reading user content from the object store includes reading the record, fetching the content hash to find a root of the pointer tree, descending leaves of the pointer tree to read the hashes of the data objects associated with user content, and reassembling the data objects in sequential file data.
    • 提供了用于在内容可寻址对象存储之上组织和管理文件系统的方法和系统。 用户内容与包括与内容可寻址对象存储中的地址相关联的内容散列的记录相关联。 内容散列是用户内容的函数,通过将文件划分为数据对象,生成数据对象顶部的散列指针树,并计算指针树根的散列值来确定。 记录,指针树和文件存储在对象存储中。 从对象存储器读取用户内容包括读取记录,获取内容散列以找到指针树的根,指针树的下降沿读取与用户内容相关联的数据对象的散列,并重新组合数据对象 顺序文件数据。
    • 5. 发明申请
    • AUTOMATIC DATA RING DISCOVERY AND CONFIGURATION
    • 自动数据环发现和配置
    • WO2014190093A1
    • 2014-11-27
    • PCT/US2014/039036
    • 2014-05-21
    • EXABLOX CORPORATION
    • HUNT, TadBARRUS, Frank E.
    • H04L12/28
    • H04L43/08H04L12/42
    • Computer-implemented methods and systems for automatic ring discovery and configuration are provided. An exemplary method may comprise connecting a data node to a network. When connected, the data node periodically sends an advertisement to the network and monitors the network for one or more further advertisements of further data nodes associated with one or more data rings. The monitoring is performed for a predetermined time period. If one or more further advertisements are received, the data node determines which data ring to join using predefined criteria. The predetermined criteria may include a number of data nodes in the data ring, free space in the data ring, allowable number of the data nodes, compatibility of software versions of the data node and the data ring. Alternatively, if no advertisements are received within the predetermined time period, the data node creates a new data ring.
    • 提供了用于自动环发现和配置的计算机实现的方法和系统。 示例性方法可以包括将数据节点连接到网络。 当连接时,数据节点周期性地向网络发送广告并且监视网络以获得与一个或多个数据环相关联的另外的数据节点的一个或多个进一步的广告。 监视执行预定时间段。 如果接收到一个或多个其他广告,则数据节点使用预定义的准则来确定要连接哪个数据环。 预定标准可以包括数据环中的多个数据节点,数据环中的可用空间,数据节点的可允许数量,数据节点的软件版本与数据环的兼容性。 或者,如果在预定时间段内没有接收到广告,则数据节点创建新的数据环。
    • 7. 发明申请
    • CRYPTOGRAPHIC HASH DATABASE
    • CRYPTOGRAPHIC HASH数据库
    • WO2013152357A1
    • 2013-10-10
    • PCT/US2013/035673
    • 2013-04-08
    • EXABLOX CORPORATION
    • HUNT, TadBARRUS, Frank, E.
    • H04L12/56
    • G06F17/3033
    • A method for bursting a hash table of a key-value database comprises receiving a key and a value, traversing trie nodes of the key-value database from a root node to a leaf node by recursively dividing the key into a prefix and a suffix, reaching the leaf node, the leaf node being the hash table, determining that the key is not stored in the hash table, determining that the hash table is not able to store the key and the value, removing the hash table, associating a new trie node with a parent trie node of the hash table, associating two or more new hash tables with the new trie node, moving all keys and associated values from the hash table into one of the two or more new hash tables, and inserting the key and the associated value into one of the two or more new hash tables.
    • 用于突发密钥值数据库的散列表的方法包括:通过将密钥递归地划分为前缀和后缀来接收密钥和值,从密钥值数据库的根节点遍历到叶节点的特里节点, 到达叶节点,叶节点是散列表,确定密钥未被存储在哈希表中,确定哈希表不能存储密钥和值,去除哈希表,将新的特征相关联 节点,其具有散列表的父特里节点,将两个或多个新的散列表与新的特里节点相关联,将所有密钥和相关联的值从散列表移动到两个或更多个新的哈希表中的一个,并且插入密钥和 将相关联的值转换为两个或更多个新的哈希表之一。