Patents by Inventor Cezary Dubnicki

Cezary Dubnicki has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8019728
    Abstract: Data is stored in a distributed data storage system comprising a plurality of disks. When a disk fails, system reliability is restored by executing a set of reconstructions according to a schedule. System reliability is characterized by a dynamic Normalcy Deviation Score. The schedule for executing the set of reconstructions is determined by a minimum intersection policy. A set of reconstructions is received and divided into a set of queues rank-ordered by redundancy level ranging from a lowest redundancy level to a highest redundancy level. For reconstructions in each queue, an intersection matrix is calculated. Diskscores for each disk are calculated. The schedule for the set of reconstructions is based at least in part on the intersection matrices, the Normal Deviation Scores, and the diskscores.
    Type: Grant
    Filed: March 4, 2009
    Date of Patent: September 13, 2011
    Assignee: NEC Laboratories America, Inc.
    Inventors: Rekha N Bachwani, Leszek R Gryz, Ricardo G Bianchini, Cezary Dubnicki
  • Patent number: 7992037
    Abstract: Exemplary systems and methods in accordance with embodiments of the present invention may provide a plurality of data services by employing splittable, mergable and transferable redundant chains of data containers. The chains and containers may be automatically split and/or merged in response to changes in storage node network configurations and may be stored in erasure coded fragments distributed across different storage nodes. Data services provided in a distributed secondary storage system utilizing redundant chains of containers may include global deduplication, dynamic scalability, support for multiple redundancy classes, data location, fast reading and writing of data and rebuilding of data due to node or disk failures.
    Type: Grant
    Filed: July 29, 2009
    Date of Patent: August 2, 2011
    Assignee: NEC Laboratories America, Inc.
    Inventors: Cezary Dubnicki, Cristian Ungureanu
  • Publication number: 20110161168
    Abstract: An online data storage system (100) is disclosed in which users may store a variety of personal documents in accordance with a common document structure that can include tag structures that are tailored to specific types of documents. The document and tag structures permit convenient access of the documents and enable providers of goods and services to generate targeted conditional offers while ensuring the privacy of individuals storing the documents.
    Type: Application
    Filed: August 28, 2010
    Publication date: June 30, 2011
    Inventor: Cezary Dubnicki
  • Patent number: 7870218
    Abstract: The present invention is directed to improving utilization in a peer-to-peer network. Each node in a peer-to-peer network is assigned a number of preferably fixed-size storage slots proportional to the node storage, a first portion of which is allocated to storage zones and a second portion of which is allocated as a free slot reserve. In accordance with an embodiment of an aspect of the invention, this split of a storage zone is delayed until the storage zone becomes full, referred to herein as “lazy splitting”. In accordance with an embodiment of another aspect of the invention, it is advantageous to allocate more storage slots at a node than its actual physical capacity referred to herein as “oversubscription”. In accordance with an embodiment of another aspect of the invention, each physical node is allocated at least one storage zone, even as a new node is added to the system.
    Type: Grant
    Filed: March 30, 2004
    Date of Patent: January 11, 2011
    Assignee: NEC Laboratories America, Inc.
    Inventors: Cezary Dubnicki, Cristian Ungureanu
  • Patent number: 7844581
    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.
    Type: Grant
    Filed: December 1, 2006
    Date of Patent: November 30, 2010
    Assignee: NEC Laboratories America, Inc.
    Inventors: Cezary Dubnicki, Krzysztof Lichota, Erik Kruus, Cristian Ungureanu
  • Patent number: 7747663
    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.
    Type: Grant
    Filed: March 5, 2008
    Date of Patent: June 29, 2010
    Assignee: NEC Laboratories America, Inc.
    Inventors: Benjamin Atkin, Grzegorz Calkowski, Cristian Ungureanu, Cezary Dubnicki
  • Publication number: 20100070698
    Abstract: In accordance with exemplary embodiments of the present invention, a content addressable data structure system may include directed acyclic graphs (DAGs) of data content that are addressed using both a user-defined search key and content of data blocks. Internal keys of retention roots of the DAGs may be derived from the user-defined search key while the remaining blocks may be content addressed. As opposed to using a content address, the user may provide the search key when retrieving and deleting DAGs retaining the data content. In addition, the internal keys may be implemented using internal content addressable storage operations, such as applying a hash function and employing a distributed hash table.
    Type: Application
    Filed: August 13, 2009
    Publication date: March 18, 2010
    Applicant: NEC Laboratories America, Inc.
    Inventors: Cristian Ungureanu, Cezary Dubnicki
  • Publication number: 20100064166
    Abstract: Exemplary systems and methods in accordance with embodiments of the present invention may provide a plurality of data services by employing splittable, mergable and transferable redundant chains of data containers. The chains and containers may be automatically split and/or merged in response to changes in storage node network configurations and may be stored in erasure coded fragments distributed across different storage nodes. Data services provided in a distributed secondary storage system utilizing redundant chains of containers may include global deduplication, dynamic scalability, support for multiple redundancy classes, data location, fast reading and writing of data and rebuilding of data due to node or disk failures.
    Type: Application
    Filed: July 29, 2009
    Publication date: March 11, 2010
    Applicant: NEC Laboratories America, Inc.
    Inventors: Cezary Dubnicki, Cristian Ungureanu
  • Publication number: 20090265360
    Abstract: Data is stored in a distributed data storage system comprising a plurality of disks. When a disk fails, system reliability is restored by executing a set of reconstructions according to a schedule. System reliability is characterized by a dynamic Normalcy Deviation Score. The schedule for executing the set of reconstructions is determined by a minimum intersection policy. A set of reconstructions is received and divided into a set of queues rank-ordered by redundancy level ranging from a lowest redundancy level to a highest redundancy level. For reconstructions in each queue, an intersection matrix is calculated. Diskscores for each disk are calculated. The schedule for the set of reconstructions is based at least in part on the intersection matrices, the Normal Deviation Scores, and the diskscores.
    Type: Application
    Filed: March 4, 2009
    Publication date: October 22, 2009
    Applicant: NEC LABORATORIES AMERICA, INC.
    Inventors: Rekha N. Bachwani, Leszek R. Gryz, Ricardo G. Bianchini, Cezary Dubnicki
  • Publication number: 20090228511
    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.
    Type: Application
    Filed: March 5, 2008
    Publication date: September 10, 2009
    Applicant: NEC LABORATORIES AMERICA, INC.
    Inventors: Benjamin Atkin, Grzegorz Calkowski, Cristian Ungureanu, Cezary Dubnicki
  • Patent number: 7516346
    Abstract: A system and method for reducing energy consumption in an information storage system is disclosed which takes advantage of the redundancy in a typical storage system.
    Type: Grant
    Filed: October 25, 2005
    Date of Patent: April 7, 2009
    Assignee: NEC Laboratories America, Inc.
    Inventors: Eduardo Pinheiro, Ricardo Bianchini, Cezary Dubnicki
  • Publication number: 20080221856
    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.
    Type: Application
    Filed: February 27, 2008
    Publication date: September 11, 2008
    Applicant: NEC LABORATORIES AMERICA, INC.
    Inventors: Cezary Dubnicki, Cristian Ungureanu, Christian Toelg
  • Publication number: 20080201428
    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.
    Type: Application
    Filed: January 31, 2008
    Publication date: August 21, 2008
    Applicant: NEC LABORATORIES AMERICA, INC.
    Inventors: Cezary Dubnicki, Leszek Gryz, Krzysztof Lichota, Cristian Ungureanu
  • Publication number: 20080201335
    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.
    Type: Application
    Filed: January 31, 2008
    Publication date: August 21, 2008
    Applicant: NEC LABORATORIES AMERICA, INC.
    Inventors: Cezary Dubnicki, Leszek Gryz, Krzysztof Lichota, Cristian Ungureanu
  • Publication number: 20080133446
    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.
    Type: Application
    Filed: December 1, 2006
    Publication date: June 5, 2008
    Applicant: NEC Laboratories America, Inc.
    Inventors: Cezary Dubnicki, Krzysztof Lichota, Erik Kruus, Cristian Ungureanu
  • Publication number: 20080133561
    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 or/and 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 or/and 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.
    Type: Application
    Filed: December 1, 2006
    Publication date: June 5, 2008
    Applicant: NEC Laboratories America, Inc.
    Inventors: Cezary Dubnicki, Erik Kruus, Cristian Ungureanu
  • Patent number: 7304994
    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.
    Type: Grant
    Filed: March 30, 2004
    Date of Patent: December 4, 2007
    Assignee: NEC Laboratories America, Inc.
    Inventors: Cezary Dubnicki, Cristian Ungureanu
  • Publication number: 20060107099
    Abstract: A system and method for reducing energy consumption in an information storage system is disclosed which takes advantage of the redundancy in a typical storage system.
    Type: Application
    Filed: October 25, 2005
    Publication date: May 18, 2006
    Applicant: NEC LABORATORIES AMERICA, INC.
    Inventors: Eduardo Pinheiro, Ricardo Bianchini, Cezary Dubnicki
  • Publication number: 20050135381
    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.
    Type: Application
    Filed: March 30, 2004
    Publication date: June 23, 2005
    Applicant: NEC Laboratories America, Inc.
    Inventors: Cezary Dubnicki, Cristian Ungureanu
  • Publication number: 20040215622
    Abstract: An architecture for a peer-to-peer network is disclosed which advantageously improves system utilization.
    Type: Application
    Filed: March 30, 2004
    Publication date: October 28, 2004
    Applicant: NEC Laboratories America, Inc.
    Inventors: Cezary Dubnicki, Cristian Ungureanu