公开(公告)号：WO2008109321A1

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

申请号：PCT/US2008/055247

申请日：2008-02-28

Applicant: NEC LABORATORIES AMERICA, INC.

Inventor： DUBNICKI, Cezary ,  UNGUREANU, Cristian ,  TOELG, Christian

IPC: G06F7/22

CPC classification number: H04L67/1097 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/067 ,  G06F11/1662 ,  G06F11/2094 ,  G06F2206/1012 ,  G06F2211/1057 ,  G06F2211/1059 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/1029 ,  H04L67/1031 ,  H04L67/1034 ,  H04L67/104 ,  H04L67/1048

Abstract: The present invention generally provides a method for grid storage including balancing read and write requests from applications across a first group of nodes in a grid storage system for avoiding hot spots and optimizing performance through smart caching; balancing storage capacity across a second group of nodes in the grid storage system, nodes in the first and second groups being at least one of hardware interchangeable online, capable of being added to change performance or capacity of the grid storage system and capable of being removed to change performance or capacity of the grid storage system; and self managing of the first and second groups of nodes for providing at least one of scalability, self healing after failure of components in the grid storage, non-disruptive upgrades to the grid storage system, and eliminating duplicate data on an object or sub-object level in the grid storage system.

Abstract translation: 本发明通常提供一种用于网格存储的方法，包括平衡来自网格存储系统中的第一组节点的应用的读和写请求，以避免热点并通过智能高速缓存优化性能; 平衡在网格存储系统中的第二组节点上的存储容量，第一和第二组中的节点是在线可互换的硬件中的至少一个，能够被添加以改变电网存储系统的性能或容量并且能够被去除 改变电网存储系统的性能或容量; 以及第一和第二组节点的自我管理，用于提供可扩展性，网格存储中的组件故障之后的自愈，对网格存储系统的非中断升级以及消除对象或子组件上的重复数据中的至少一个， 网格存储系统中的对象级别。

公开(公告)号：WO2008070484A3

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

申请号：PCT/US2007/085686

申请日：2007-11-28

Applicant: NEC LABORATORIES AMERICA, INC.

Inventor： DUBNICKI, Cezary ,  KRUUS, Erik ,  UNGUREANU, Cristian

IPC: G06F11/16

Abstract: System(s) and method(s) are provided for data management and data processing. For example, various embodiments may include systems and methods relating to relatively larger groups of data being selected with comparable or better performing selection results (e.g. high data redundancy elimination and/or average chunk size). In various embodiments, the system(s) and method(s) may include, for example a data group, block, or chunk combining technique and/or a data group, block, or chunk splitting technique. Various embodiments may include a first standard or typical data grouping, blocking, or chunking technique and/or data group, block or chunk combining technique and/or a data group, block, or chunk splitting technique. Exemplary system(s) and method(s) may relate to data hashing and/or data elimination. Embodiments may include a look-ahead buffer and determine whether to emit small chunks or large chunks based on characteristics of underlying data and/or particular application of the invention (e.g. for backup).

公开(公告)号：WO2012030358A1

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

申请号：PCT/US2010/058681

申请日：2010-12-02

Applicant: NEC LABORATORIES AMERICA, INC.

Inventor： UNGUREANU, Cristian

IPC: G06F12/08

CPC classification number: G06F12/0866 ,  G06F2212/1024 ,  G06F2212/222

Abstract: A system and method for storing data in a content-addressable system is provided. The system includes a content-addressable storage system and a persistent cache. The persistent cache includes a temporary address generator that is configured to generate a temporary address which is associated with data to be stored in the persistent cache, and a non-content-addressable storage system configured to store and retrieve data in the persistent cache using the temporary address. The persistent cache further comprises an address translator configured to map a temporary address associated with the data in the non-content addressable storage system with a content address associated with the data in the content-addressable storage system.

Abstract translation: 提供了一种在内容可寻址系统中存储数据的系统和方法。 该系统包括内容可寻址存储系统和持久缓存。 所述持久缓存包括临时地址生成器，其被配置为生成与要存储在所述持久性高速缓存中的数据相关联的临时地址，以及非内容可寻址存储系统，被配置为使用所述永久高速缓存来存储和检索所述持久高速缓存中的数据 临时地址。 永久缓存还包括地址转换器，其被配置为将与非可内容寻址存储系统中的数据相关联的临时地址与与内容可寻址存储系统中的数据相关联的内容地址进行映射。

公开(公告)号：WO2008103569A1

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

申请号：PCT/US2008/053568

申请日：2008-02-11

Applicant: NEC LABORATORIES AMERICA, INC.

Inventor： DUBNICKI, Cezary ,  GRYZ, Lezsek ,  LICHOTA, Krzysztof ,  UNGUREANU, Cristian

IPC: H04L12/28

CPC classification number: G06F17/30067

Abstract: A fixed prefix peer to peer network has a number of physical nodes. The nodes are logically divided into a number of storage slots. Blocks of data are erasure coded into original and redundant data fragments and the resultant fragments of data are stored in slots on separate physical nodes such that no physical node has more than one original and/or redundant fragment. The storage locations of all of the fragments are organized into a logical virtual node (e.g., a supernode). Thus, the supernode and the original block of data can be recovered even if some of the physical nodes are lost.

Abstract translation: 固定前缀对等网络具有多个物理节点。 节点在逻辑上划分为多个存储槽。 数据块被擦除编码成原始和冗余数据片段，并且所得到的数据片段存储在分开的物理节点上的时隙中，使得没有物理节点具有多于一个的原始和/或冗余片段。 所有片段的存储位置被组织成逻辑虚拟节点（例如，超级节点）。 因此，即使某些物理节点丢失，超节点和原始数据块也可以被恢复。

公开(公告)号：WO2004092871A2

公开(公告)日：2004-10-28

申请号：PCT/US2004/010484

申请日：2004-04-06

Applicant: NEC LABORATORIES AMERICA, INC.

Inventor： DUBNICKI, Cezary ,  UNGUREANU, Cristian

IPC: G06F

CPC classification number: H04L67/104 ,  H04L29/06 ,  H04L45/00 ,  H04L67/1046 ,  H04L67/1065 ,  H04L67/1072 ,  H04L67/108 ,  H04L69/329

Abstract: An architecture for a peer-to-peer network is disclosed which advantageously is able to maintain short fixed path length routing as the network grows.

Abstract translation: 公开了一种对等网络的架构，其有利地能够在网络增长时维持短的固定路径长度路由。

公开(公告)号：WO2004091277A2

公开(公告)日：2004-10-28

申请号：PCT/US2004/010547

申请日：2004-04-06

Applicant: NEC LABORATORIES AMERICA, INC. ,  DUBNICKI, Cezary ,  UNGUREANU, Cristian

Inventor： DUBNICKI, Cezary ,  UNGUREANU, Cristian

IPC: G06F7/00 ,  H04L12/28 ,  H04L12/56 ,  H04L29/06 ,  H04L29/08

CPC classification number: H04L67/104 ,  H04L29/06 ,  H04L45/00 ,  H04L67/1046 ,  H04L67/1065 ,  H04L67/1072 ,  H04L67/108 ,  H04L69/329

Abstract: An architecture for a peer-to-peer network is disclosed which advantageously improves system utilization.

Abstract translation: 公开了一种用于对等网络的架构，其有利地提高了系统利用率。

公开(公告)号：WO2012023953A1

公开(公告)日：2012-02-23

申请号：PCT/US2010/058727

申请日：2010-12-02

Applicant: NEC LABORATORIES AMERICA, INC.

Inventor： RAGO, Stephen ,  UNGUREANU, Cristian

IPC: G06F12/08 ,  G06F3/06 ,  G06F13/14

CPC classification number: G06F12/121 ,  G06F12/0866 ,  G06F12/0888

Abstract: A system and method are disclosed for improving the efficiency of a storage system. At least one application-oriented property is associated with data to be stored on a storage system. Based on the at least one application-oriented property, a manner of implementing at least one caching function in the storage system is determined. Data placement and data movement are controlled in the storage system to implement the at least one caching function.

Abstract translation: 公开了一种用于提高存储系统的效率的系统和方法。 至少一个面向应用的属性与要存储在存储系统上的数据相关联。 基于至少一个面向应用的属性，确定在存储系统中实现至少一个高速缓存功能的方式。 在存储系统中控制数据放置和数据移动以实现至少一个缓存功能。

公开(公告)号：WO2009110912A1

公开(公告)日：2009-09-11

申请号：PCT/US2008/057191

申请日：2008-03-17

Applicant: NEC LABORATORIES AMERICA, INC.

Inventor： ATKIN, Benjamin ,  CALKOWSKI, Grzegorz ,  UNGUREANU, Cristian ,  DUBNICKI, Cezary

IPC: G06F17/40 ,  G06F17/30

CPC classification number: G06F17/30076

Abstract: Information, such as files received from a client, etc. is stored in a storage system, such as a content addressable storage system. A file server receives data from a client and chunks the data into blocks of data. The file server also generates metadata for use in forming a data structure. The blocks of data are stored in a block store and a copy of the data blocks and the metadata are locally cached at the file server. A commit server retrieves the metadata. In at least one embodiment, the metadata is retrieved from an update log shared between the file server and the commit server. Based on the retrieved metadata, the commit server generates a version of a data structure. The data structure is then stored at the block store.

Abstract translation: 诸如从客户端接收的文件等的信息被存储在诸如内容可寻址存储系统的存储系统中。 文件服务器从客户端接收数据，并将数据块分成数据块。 文件服务器还生成用于形成数据结构的元数据。 数据块被存储在块存储器中，并且数据块和元数据的副本被本地缓存在文件服务器。 提交服务器检索元数据。 在至少一个实施例中，从文件服务器和提交服务器之间共享的更新日志检索元数据。 基于检索的元数据，提交服务器生成数据结构的版本。 然后将数据结构存储在块存储中。

公开(公告)号：WO2008103568A1

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

申请号：PCT/US2008/053564

申请日：2008-02-11

Applicant: NEC LABORATORIES AMERICA, INC.

Inventor： DUBNICKI, Cezary ,  LICHOTA, Krzysztof ,  GRYZ, Leszek ,  UNGUREANU, Cristian

IPC: H04L12/56 ,  H04N7/173

CPC classification number: G06F17/30067

Abstract: A fixed prefix peer to peer network has a number of physical nodes. The nodes are logically divided into a number of storage slots. Blocks of data are erasure coded into original and redundant data fragments and the resultant fragments of data are stored in slots on separate physical nodes such that no physical node has more than one original and/or redundant fragment. The storage locations of all of the fragments are organized into a logical virtual node (e.g., a supernode). Thus, the supernode and the original block of data can be recovered even if some of the physical nodes are lost.

Abstract translation: 固定前缀对等网络具有多个物理节点。 节点在逻辑上划分为多个存储槽。 数据块被擦除编码为原始和冗余数据片段，并且所得到的数据片段存储在分开的物理节点上的时隙中，使得没有物理节点具有多于一个原始和/或冗余片段。 所有片段的存储位置被组织成逻辑虚拟节点（例如，超级节点）。 因此，即使某些物理节点丢失，超节点和原始数据块也可以被恢复。

公开(公告)号：WO2008067226A1

公开(公告)日：2008-06-05

申请号：PCT/US2007/085357

申请日：2007-11-21

Applicant: NEC LABORATORIES AMERICA, INC.

Inventor： DUBNICKI, Cezary ,  LICHOTA, Krzysztof ,  KRUUS, Erik ,  UNGUREANU, Cristian

IPC: G06F7/24

CPC classification number: G06F17/30159

Abstract: Systems and methods for data management and data processing are provided. Embodiments may include systems and methods relating to fast data selection with reasonably high quality results, and may include a faster data selection function and a slower data selection function. Various embodiments may include systems and methods relating to data hashing and/or data redundancy identification and elimination for a data set or a string of data. Embodiments may include a first selection function is used to pre-select boundary points or data blocks/windows from a data set or data stream and a second selection function is used to refine the boundary points or data blocks/windows. The second selection function may be better at determining the best places for boundary points or data blocks/windows in the data set or data stream. In various embodiments, data may be processed by a first faster hash function and slower more discriminating second hash function.

Abstract translation: 提供了数据管理和数据处理的系统和方法。 实施例可以包括与具有相当高质量结果的快速数据选择相关的系统和方法，并且可以包括更快的数据选择功能和较慢的数据选择功能。 各种实施例可以包括与用于数据集或一串数据的数据散列和/或数据冗余识别和消除有关的系统和方法。 实施例可以包括第一选择功能用于从数据集或数据流中预先选择边界点或数据块/窗口，并且使用第二选择功能来细化边界点或数据块/窗口。 在确定数据集或数据流中的边界点或数据块/窗口的最佳位置时，第二选择功能可能更好。 在各种实施例中，可以通过第一更快的散列函数和较慢的更多辨别的第二散列函数来处理数据。