Patents by Inventor Alexander Aizman

Alexander Aizman 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: 10244053
    Abstract: The present disclosure provides methods and systems for multicast collaborative erasure encoding and methods and systems for distributed parity protection. One embodiment relates to a method of multicast collaborative erasure encoding of a chunk stored in a distributed object storage cluster. A roll-call request is multicast to every storage server in a negotiating group for the chunk. Roll-call inventory responses are generated and multicast by every storage server in the negotiating group. The roll-call inventory responses are collected by every storage server in the negotiating group from other storage servers in the negotiating group to form a set of roll-call inventory responses. A logical evaluation of the set of roll-call inventory responses may then be performed by every storage server in the negotiating group. Other embodiments, aspects and features are also disclosed.
    Type: Grant
    Filed: January 31, 2018
    Date of Patent: March 26, 2019
    Assignee: Nexenta Systems, Inc.
    Inventors: Caitlin Bestler, Alexander Aizman, Robert E. Novak
  • Patent number: 10216577
    Abstract: The present invention introduces a specific form of parity protection chunk (PPC) that allows for distributed creation of coordinated PPCs that can reliably provide protection against the concurrent loss of two or more storage servers of devices. Coordinated PPCs can protect against the concurrent loss of multiple lost chunks by ensuring that the PPCSs protecting any specific chunk have at most a single overlapping failure domain. This is done without requiring full centralized control over the assignment of protected chunks to specific PPCs. The PPCs are created as part of the put transaction for a chunk. The chunk itself is stored as a whole replica, and the PPCs provide parity protection for the chunk.
    Type: Grant
    Filed: July 14, 2016
    Date of Patent: February 26, 2019
    Assignee: Nexenta Systems, Inc.
    Inventors: Caitlin Bestler, Alexander Aizman
  • Patent number: 10185730
    Abstract: The present disclosure provides systems and methods for Key-Value-Tuple-encoded (KVT-encoded) object storage. In accordance with an embodiment of the invention, chunks of objects, storing payload data or metadata, are persistently stored by servers using KVT-encoded storage. Furthermore, the KVT encoding may be applied to advantageously re-structure content within a distributed object storage cluster, especially for object storage systems that allow payload references to be cached extensively. For such systems, it is of considerable value to honor (use as valid) existing chunk references after the underlying content has been re-structured. Further, the KVT encoding taught herein is completely compatible with a fully-distributed object storage cluster. One embodiment relates to a storage server that includes a persistent storage module that provides a key-value application programming interface that encodes multiple key-value-tuple (KVT) entries for one chunk.
    Type: Grant
    Filed: August 8, 2015
    Date of Patent: January 22, 2019
    Assignee: Nexenta Systems, Inc.
    Inventors: Caitlin Bestler, Robert E. Novak, Alexander Aizman
  • Patent number: 10110676
    Abstract: The present disclosure provides an innovative technique for parallel transparent restructuring of immutable content in a distributed object storage system. The content restructuring technique disclosed herein may be implemented with parallel operations by multiple storage servers in a live system. The restructuring is transparent in that the original CHIT may still be used to retrieve and validate the original content, such that a client requesting the original content need not be aware that the original content has been restructured. Furthermore, the restructuring is performed while maintaining support for pre-existing immutable metadata. Other embodiments, aspects and features are also disclosed. The content remains immutable from the perspective of the end user, but still may be advantageously restructured to optimize storage efficiency.
    Type: Grant
    Filed: December 24, 2015
    Date of Patent: October 23, 2018
    Assignee: NEXENTA SYSTEMS, INC.
    Inventors: Caitlin Bestler, Alexander Aizman, Robert E. Novak
  • Publication number: 20180152516
    Abstract: The present disclosure provides methods and systems for multicast collaborative erasure encoding and methods and systems for distributed parity protection. One embodiment relates to a method of multicast collaborative erasure encoding of a chunk stored in a distributed object storage cluster. A roll-call request is multicast to every storage server in a negotiating group for the chunk. Roll-call inventory responses are generated and multicast by every storage server in the negotiating group. The roll-call inventory responses are collected by every storage server in the negotiating group from other storage servers in the negotiating group to form a set of roll-call inventory responses. A logical evaluation of the set of roll-call inventory responses may then be performed by every storage server in the negotiating group. Other embodiments, aspects and features are also disclosed.
    Type: Application
    Filed: January 31, 2018
    Publication date: May 31, 2018
    Applicant: NEXENTA SYSTEMS, INC.
    Inventors: Caitlin BESTLER, Alexander AIZMAN, Robert E. NOVAK
  • Patent number: 9923970
    Abstract: The present disclosure provides methods and systems for multicast collaborative erasure encoding and methods and systems for distributed parity protection. One embodiment relates to a method of multicast collaborative erasure encoding of a chunk stored in a distributed object storage cluster. A roll-call request is multicast to every storage server in a negotiating group for the chunk. Roll-call inventory responses are generated and multicast by every storage server in the negotiating group. The roll-call inventory responses are collected by every storage server in the negotiating group from other storage servers in the negotiating group to form a set of roll-call inventory responses. A logical evaluation of the set of roll-call inventory responses may then be performed by every storage server in the negotiating group. Other embodiments, aspects and features are also disclosed.
    Type: Grant
    Filed: August 21, 2015
    Date of Patent: March 20, 2018
    Assignee: Nexenta Systems, Inc.
    Inventors: Caitlin Bestler, Alexander Aizman, Robert E. Novak
  • Publication number: 20180018229
    Abstract: The present invention introduces a specific form of parity protection chunk (PPC) that allows for distributed creation of coordinated PPCs that can reliably provide protection against the concurrent loss of two or more storage servers of devices. Coordinated PPCs can protect against the concurrent loss of multiple lost chunks by ensuring that the PPCSs protecting any specific chunk have at most a single overlapping failure domain. This is done without requiring full centralized control over the assignment of protected chunks to specific PPCs. The PPCs are created as part of the put transaction for a chunk. The chunk itself is stored as a whole replica, and the PPCs provide parity protection for the chunk.
    Type: Application
    Filed: July 14, 2016
    Publication date: January 18, 2018
    Inventors: Caitlin BESTLER, Alexander AIZMAN
  • Patent number: 9767130
    Abstract: The present disclosure also provides systems and methods for sharding objects stored in a distributed storage system. In accordance with one embodiment disclosed herein, a key sharding technique is used. Key sharding is an advantageously efficient technique when dealing with an object containing a collection of key-value records. In accordance with an embodiment of the invention, referenced chunks identified by the key shards may each store a subset of the collection of the key-value records, and the key-value records in the subset have key hashes that have a range of matching bits in common. One embodiment disclosed herein provides a method of performing a delta edit of a named object stored in a distributed storage system in which a payload of the named object is stored in key shards. Other embodiments, aspects and features are also disclosed.
    Type: Grant
    Filed: August 8, 2015
    Date of Patent: September 19, 2017
    Assignee: Nexenta Systems, Inc.
    Inventors: Caitlin Bestler, Robert E. Novak, Alexander Aizman
  • Patent number: 9747319
    Abstract: The present disclosure provides systems and methods for sharding objects stored in a distributed storage system. Such sharding may be advantageously utilized for an object that stores a collection of key-value records and for otherwise encoded objects. The object sharding techniques disclosed herein advantageously enable a read-modify-write process at the storage server level. One embodiment disclosed herein provides a method of creating a new chunk by modifying a payload of an existing chunk at the storage server level in a distributed object storage system. The method includes validating the new chunk at the gateway server. Other embodiments, aspects and features are also disclosed.
    Type: Grant
    Filed: August 8, 2015
    Date of Patent: August 29, 2017
    Assignee: Nexenta Systems, Inc.
    Inventors: Caitlin Bestler, Robert E. Novak, Alexander Aizman
  • Patent number: 9710535
    Abstract: The present invention relates to object storage systems that support hierarchical directories within a namespace manifest stored as an object. The namespace manifest is stored as namespace manifest shards that are determined based on a partial key derived from the full name of the referenced version manifest in each directory entry. Each storage server maintains a local transaction log that keeps track of changes to the namespace manifest in response to put transactions. The namespace manifest can be updated after each put transaction is acknowledged, which minimizes the number of write operations required for a put transaction. Updates to the namespace manifest are batched, distributed, and processed concurrently and in parallel by the storage servers that store the corresponding shards. This reduces the latency that would otherwise exist in the object storage cluster as a result of a put transaction. Updates to namespace manifest shards optionally occur in a batch process using MapReduce techniques.
    Type: Grant
    Filed: August 6, 2015
    Date of Patent: July 18, 2017
    Assignee: Nexenta Systems, Inc.
    Inventors: Alexander Aizman, Caitlin Bestler, Robert E. Novak
  • Publication number: 20170187819
    Abstract: The present invention defines a new type of negotiating proxy server which optimizes a multi-node collaboration of distributed servers, where the goal of the negotiation is to synchronize rendezvous interactions between the initiator and subsets of servers in multicast groups. For example, in distributed storage clusters servers commit to receiving and then storing a chunk of data in parallel at a specified time, while in compute clusters servers perform one portion of a calculation in parallel. Negotiating proxy server optimizes these interactions as disclosed herein.
    Type: Application
    Filed: December 29, 2015
    Publication date: June 29, 2017
    Inventors: Alexander AIZMAN, Caitlin BESTLER
  • Publication number: 20170123931
    Abstract: The present invention relates to a distributed object storage system that supports snapshots and clones without requiring any form of distributed locking—or any form of centralized processing. A clone tree can be modified in isolation and the modifications then either discarded or merged into the main tree of the distributed object storage system.
    Type: Application
    Filed: November 3, 2015
    Publication date: May 4, 2017
    Inventors: Alexander AIZMAN, Caitlin BESTLER
  • Patent number: 9547774
    Abstract: The present disclosure relates to an advantageous system and related methods for distributed deduplication of encrypted chunks. One embodiment relates to a method for storing encrypted chunks in which an encryption key is generated independently from a chunk payload. With this method, two encrypted chunks are identifiable as having identical chunk payloads even when the chunk payloads are encrypted with different encryption keys. Other embodiments, aspects and features are also disclosed.
    Type: Grant
    Filed: April 16, 2015
    Date of Patent: January 17, 2017
    Assignee: Nexenta Systems, Inc.
    Inventors: Caitlin Bestler, Alexander Aizman
  • Patent number: 9507812
    Abstract: The present disclosure provides an advantageous systems and related methods for scalable object storage. One embodiment relates to a system that includes at least a manifest tracking subsystem and a chunk payload subsystem. The manifest tracking subsystem stores version manifests and encodes forward-references from the version manifests to chunks. The chunk payload subsystem stores the chunks and encodes back-references to version manifests that reference the chunk. Other embodiments, aspects and features are also disclosed.
    Type: Grant
    Filed: April 22, 2014
    Date of Patent: November 29, 2016
    Assignee: Nexenta Systems, Inc.
    Inventors: Caitlin Bestler, Alexander Aizman
  • Patent number: 9479587
    Abstract: Embodiments disclosed herein provide a scalable multicast transport. The multicast transport protocol provides effectively reliable multicast delivery while avoiding the overhead associated with point-to-point protocols. Additional embodiments disclosed herein relate to a scalable object storage system that uses a multicast transport. The object storage system assigns responsibility for providing storage services for a chunk to a negotiating group of storage servers in the cluster using a shared and distributed hash allocation table. The object storage system dynamically determines a rendezvous group of storage servers in the cluster to store the chunk using the multicast transport. Other embodiments, aspects and features are also disclosed.
    Type: Grant
    Filed: June 11, 2014
    Date of Patent: October 25, 2016
    Assignee: Nexenta Systems, Inc.
    Inventors: Caitlin Bestler, Robert E. Novak, Alexander Aizman
  • Publication number: 20160224638
    Abstract: The present disclosure relates to distributed object storage systems and provides a parallel and transparent technique for retrieving restructured objects using original chunk references. The content retrieval technique disclosed herein may be implemented with parallel operations by multiple storage servers in the system. The retrieval is transparent in that an original reference, referred to as a CHIT, may still be used to retrieve the original content, such that a client requesting the original content need not be aware that the original content has been restructured. Other embodiments, aspects and features are also disclosed.
    Type: Application
    Filed: April 11, 2016
    Publication date: August 4, 2016
    Applicant: Nexenta Systems, Inc.
    Inventors: Caitlin BESTLER, Alexander AIZMAN, Robert E. NOVAK
  • Publication number: 20160205190
    Abstract: The present disclosure provides an innovative technique for parallel transparent restructuring of immutable content in a distributed object storage system. The content restructuring technique disclosed herein may be implemented with parallel operations by multiple storage servers in a live system. The restructuring is transparent in that the original CHIT may still be used to retrieve and validate the original content, such that a client requesting the original content need not be aware that the original content has been restructured. Furthermore, the restructuring is performed while maintaining support for pre-existing immutable metadata. Other embodiments, aspects and features are also disclosed. The content remains immutable from the perspective of the end user, but still may be advantageously restructured to optimize storage efficiency.
    Type: Application
    Filed: December 24, 2015
    Publication date: July 14, 2016
    Applicant: Nexenta Systems, Inc.
    Inventors: Caitlin Bestler, Alexander Aizman, Robert E. Novak
  • Patent number: 9385875
    Abstract: Embodiments disclosed herein provide advantageous methods and systems that use multicast communications via unreliable datagrams sent on a protected traffic class. These methods and systems provide effectively reliable multicast delivery while avoiding the overhead associated with point-to-point protocols. Rather than an exponential scaling of point-to-point connections (with expensive setup and teardown of the connections), the traffic from one server is bounded by linear scaling of multicast groups. In addition, the multicast rendezvous disclosed herein creates an edge-managed flow control that accounts for the dynamic state of the storage servers in the cluster, without needing centralized control, management or maintenance of state. This traffic shaping avoids the loss of data due to congestion during sustained oversubscription. Other embodiments, aspects and features are also disclosed.
    Type: Grant
    Filed: December 3, 2013
    Date of Patent: July 5, 2016
    Assignee: Nexenta Systems, Inc.
    Inventors: Caitlin Bestler, Robert E. Novak, Alexander Aizman
  • Patent number: 9385874
    Abstract: Embodiments disclosed herein provide advantageous methods and systems that use multicast communications via unreliable datagrams sent on a protected traffic class. These methods and systems provide effectively reliable multicast delivery while avoiding the overhead associated with point-to-point protocols. Rather than an exponential scaling of point-to-point connections (with expensive setup and teardown of the connections), the traffic from one server is bounded by linear scaling of multicast groups. In addition, the multicast rendezvous disclosed herein creates an edge-managed flow control that accounts for the dynamic state of the storage servers in the cluster, without needing centralized control, management or maintenance of state. This traffic shaping avoids the loss of data due to congestion during sustained oversubscription. Other embodiments, aspects and features are also disclosed.
    Type: Grant
    Filed: December 3, 2013
    Date of Patent: July 5, 2016
    Assignee: Nexenta Systems, Inc.
    Inventors: Caitlin Bestler, Robert E. Novak, Alexander Aizman
  • Publication number: 20160191250
    Abstract: The present disclosure provides systems and methods for sharding objects stored in a distributed storage system. Such sharding may be advantageously utilized for an object that stores a collection of key-value records and for otherwise encoded objects. The object sharding techniques disclosed herein advantageously enable a read-modify-write process at the storage server level. One embodiment disclosed herein provides a method of creating a new chunk by modifying a payload of an existing chunk at the storage server level in a distributed object storage system. The method includes validating the new chunk at the gateway server. Other embodiments, aspects and features are also disclosed.
    Type: Application
    Filed: August 8, 2015
    Publication date: June 30, 2016
    Applicant: Nexenta Systems, Inc.
    Inventors: Caitlin BESTLER, Robert E. NOVAK, Alexander AIZMAN