Nexenta Systems, Inc. Patent applications |
Patent application number | Title | Published |
20160057226 | MULTICAST COLLABORATIVE ERASURE ENCODING AND DISTRIBUTED PARITY PROTECTION - 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. | 02-25-2016 |
20150227757 | SYSTEM AND METHOD FOR DISTRIBUTED DEDUPLICATIONOF ENCRYPTED CHUNKS - 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. | 08-13-2015 |
20140304513 | STORAGE DRIVE PROCESSING MULTIPLE COMMANDS FROM MULTIPLE SERVERS - One embodiment of the invention relates to a key/value storage device. The key/value storage device includes a storage medium for storing data, a network interface for receiving commands sent by multiple servers, and a controller. The controller processes a put command from a server to store a binary data object on the storage medium. The put command passes a key associated with the binary data object, and returns a unique digest of the binary data object to the server via the network interface. Another embodiment relates to a storage drive. The storage drive includes a network interface for receiving, and a controller for processing, multiple commands from multiple servers. Other embodiments, aspects and features are also disclosed. | 10-09-2014 |
20140304357 | SCALABLE OBJECT STORAGE USING MULTICAST TRANSPORT - 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. | 10-09-2014 |
20140207850 | SCALABLE TRANSPORT WITH CLUSTER-CONSENSUS RENDEZVOUS - 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. | 07-24-2014 |
20140207849 | SCALABLE TRANSPORT WITH CLIENT-CONSENSUS RENDEZVOUS - 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. | 07-24-2014 |
20140204941 | SCALABLE TRANSPORT SYSTEM FOR MULTICAST REPLICATION - 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. | 07-24-2014 |
20140204940 | SCALABLE TRANSPORT METHOD FOR MULTICAST REPLICATION - 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. | 07-24-2014 |
20130185258 | UNIFIED LOCAL STORAGE SUPPORTING FILE AND CLOUD OBJECT ACCESS - A method and system for providing unified local storage support for file and cloud access is disclosed. The method comprises writing a chunk on a storage server, and replicating the chunk to other selected storage servers when necessary. The method and system further comprise writing a version manifest on the storage server; replicating the version manifest to other selected storage servers when necessary. Object puts or appends are implemented by first chunking the object, determining if the chunks are new, transferring the chunks if required, followed by creation of a new version manifest referencing the chunks. Finally, the method and system include providing concurrent file-oriented read and write access consistent with the stored version manifests and chunks. | 07-18-2013 |
20130024857 | METHOD AND SYSTEM FOR FLEXIBLE RESOURCE MAPPING FOR VIRTUAL STORAGE APPLIANCES - Virtual storage methods and systems allow storage software to be used with a variety of systems and resources without the need to write storage software specific to each particular system. The methods and systems described herein render virtual storage flexibly adaptable to hardware platforms. Through use of a dynamic resource mapper and a start-up loader in booting storage systems, the use of virtual storage appliances is simplified in an integrated and transparent fashion. For ease of system configurations, the mapper and start-up loader are available in a different ways and from a variety of media. | 01-24-2013 |
20130024856 | METHOD AND APPARATUS FOR FLEXIBLE BOOTING VIRTUAL STORAGE APPLIANCES - Virtual storage methods and systems allow storage software to be used with a variety of systems and resources without the need to write storage software specific to each particular system. The methods and systems described herein render virtual storage flexibly adaptable to hardware platforms. Through use of a dynamic resource mapper and a start-up loader in booting storage systems, the use of virtual storage appliances is simplified in an integrated and transparent fashion. For ease of system configurations, the mapper and start-up loader are available in a different ways and from a variety of media. | 01-24-2013 |
20120290630 | SCALABLE STORAGE FOR VIRTUAL MACHINES - A method and system is disclosed for providing storage services to Virtual Machines (VMs) and the Hypervisor Platforms that host them. NAS referrals are used to control selection of NAS proxy servers that are optimized for the support of VMs and the Hypervisor Platforms accessing directories that are exclusively used in conjunction of a single VM. Referrals are dynamically controlled in a manner specific to the target environment to provide an optimal combination of local and network storage in support of VMs. A method of using named attributes allows referrals to subsets of a directory. The overhead of using a NAS proxy is tailored to the smallest set of accesses required to gain beneficial result from the use of local storage, and using direct access to shared network storage when local storage is not allocated. Most of the new suggested techniques are transparent to the existing NAS clients; some techniques may require modification of the NAS client software. | 11-15-2012 |
20120017043 | METHOD AND SYSTEM FOR HETEROGENEOUS DATA VOLUME - A method and system is disclosed for providing a heterogeneous data storage comprising a plurality of storage devices of different types with respect to device vendor, model, capacity, performance and/or function. The present invention employs data access mechanisms specific to the type of underlying storage and the type of data to be stored or retrieved, and provides for integrated remote mirroring, disaster recovery and hierarchical storage management (HSM), as well as improved I/O performance and life expectancy of storage disks. A method of writing to and reading from heterogeneous data volume is also disclosed. | 01-19-2012 |
20120011337 | HETEROGENEOUS REDUNDANT STORAGE ARRAY - A method and system is disclosed for providing fault tolerant data storage with built-in backup capabilities, improved I/O performance, and improved utilization of storage devices. A method for writing data includes receiving request to write a logical block of data to a heterogeneous data volume comprising plurality of storage devices (disks), determining number of copies of the logical block to store and associated classes of disks within the data volume to be used with each copy, processing each copy of the logical block in accordance with properties associated with the corresponding classes of disks within the data volume, determining replication schemes used in the data volume and associated with the specified classes of disks, segmenting the logical block into data blocks and generating additional parity blocks in accordance with the replication schemes, selecting data writing mechanisms in accordance with the classes of disks and using those mechanisms to write the data and parity blocks to the data volume. | 01-12-2012 |
20120011176 | LOCATION INDEPENDENT SCALABLE FILE AND BLOCK STORAGE - A method and system is disclosed for resolving a single server bottleneck. Logically associated data is typically collocated within a single filesystem or a single block device accessible via a single storage server. A single storage server can provide a limited I/O bandwidth, which creates a problem known as “single I/O node” bottleneck. The method and system provides techniques for spreading I/O workload over multiple I/O domains, both local and remote, while at the same time increasing operational mobility and data redundancy. Both file and block level I/O access are addressed. | 01-12-2012 |