Netapp, Inc.

Bycast Inc.

Oliver Erik Seiler

Vladimir Radu Avram

David Slik

Dheeraj Raghavender Sangamkar

Emalayan Vairavanathan

Ajay Bakre

Viswanath Chandrasekara Bharathi

Alvin Lam

Vishnu Vardhan Chandra Kumaran

Carmen Lum

Mike Montour

Robin Mahony

Tym Altman

Markus Lampert

Blake Edwards

Gregory Kent

Chong Zhao

Pey Silvester

Guy Sirton

Michael Montour

Mohammad Kermani

Keith Ma

Walter Proseilo

A distributed storage system may synchronously apply an Information Lifecycle Management (ILM) policy to objects at ingest. In one embodiment of synchronous ILM, three options are available for a user: balanced, strict, and dual commit. Dual commit refers to the behavior where one will always create two replicated copies in the same site and then apply ILM asynchronously. Strict refers to the behavior where the storage system attempts to apply the ILM policy synchronously on ingest, and if the storage system cannot the ingest of the object will fail. This ensures that the storage system can guarantee that ILM has been applied to recently ingested objects. Balanced refers to the behavior where the storage system attempts to apply ILM synchronously, but if the storage system cannot the storage system may fall-back to dual-commit.

Synchronous object placement for information lifecycle management

A storage management computing device obtains an information lifecycle management (ILM) policy. A data protection scheme to be applied at a storage node computing device level is determined and a plurality of storage node computing devices are identified based on an application of the ILM policy to metadata received from one of the storage node computing devices and associated with an object ingested by the one of the storage node computing devices. The one of the storage node computing devices is instructed to generate one or more copies of the object or fragments of the object according to the data protection scheme and to distribute the object copies or one of the object fragments to one or more other of the storage node computing devices to be stored by at least the one or more other storage node computing devices on one or more disk storage devices.

Policy-based hierarchical data protection in distributed storage

To effectively implement ILM policies and account for unreliability in a geographically distributed large-scale storage system, 'scanners' and 'ILM rules appliers' can be deployed on nodes throughout the storage system for large scale ILM implementation. Each scanner is programmed to deterministically self-assign a region of object namespace and scan that region of object namespace. To &#x201c;scan&#x201d; a region, a scanner accesses metadata of each object that has an identifier within the scanner's region and inserts the object metadata into one of a set of queues for ILM evaluation. An ILM rules applier dequeues object metadata for evaluation against ILM rules and determines whether an ILM task is to be performed for ILM rule compliance.

Iterative object scanning for information lifecycle management

A storage management computing device obtains an information lifecycle management (ILM) policy based on a query from a storage node ingesting an object into a distributed storage system. A hierarchical data protection plan comprising protection schemes at different layers of the distributed storage system is determined. A data protection scheme to be applied at a storage node computing device level is determined and a plurality of storage node computing devices are identified based on the hierarchical data protection plan. The storage management computing device instructs the ingesting storage node to store the object into the distributed storage system according to the hierarchical data protection plan.

A method, non-transitory computer readable medium, and storage management computing device that obtains an information lifecycle management (ILM) policy. A data protection scheme to be applied at a storage node computing device level is determined and a plurality of storage node computing devices are identified based on an application of the ILM policy to metadata received from one of the storage node computing devices and associated with an object ingested by the one of the storage node computing devices. The one of the storage node computing devices is instructed to generate one or more copies of the object or fragments of the object according to the data protection scheme and to distribute the object copies or one of the object fragments to one or more other of the storage node computing devices to be stored by at least the one or more other storage node computing devices on one or more disk storage devices.

Policy based hierarchical data protection

A system and method for specifying the placement of and managing the placement of objects on a distributed networked grid. Some embodiments of the invention comprise a user interface for specifying rules for the placement of objects on the grid and an execution module that places objects on the grid based on the rules specified. Rules may comprise a matching criteria specification, which determines whether a rule applies to a particular object, and a placement specification, which directs the locations at which an object will be placed under the rule.

Modifying information lifecycle management rules in a distributed system

A system and method is described for managing data objects in a fixed-content storage system. Metadata is provided for each variable size packet and may include offset information, packet size data, reference content blocks, and the like. Using this information, intelligently decomposed objects, consolidated objects, differenced objects, and composite objects may be stored in the storage system. The data structure provided by these objects allows for the reduction of necessary storage resources and the total number of stored objects.

Relational objects for the optimized management of fixed-content storage systems

System for decentralized storage and rapid retrieval of medical data among geographically separate locations, connected by data paths of limited bandwidth, which optimizes transmission therebetween. Medical data is separated into bulk content and metadata. Metadata is transmitted to all locations. Bulk content is copied to selected locations based on desired duplication, available storage, distance, transmission cost, data path bandwidth or utilization, likelihood of retrieval calculated from the metadata, requests to use or prior usage of content or information from a system that manages the content. Transmission rate is limited and bulk content is queued for transmission based on priority calculated from metadata, from requests to use content or information from a system that manages the content. Optimal locations for bulk content are recalculated based on requests to use content, new patient appointments, data path or equipment failures. Copies are made or deleted. Distributed lists of locations for content are updated.

Method and apparatus for transmission and storage of digital medical data

This disclosure describes identification of fixed content objects in a distributed fixed content storage system. Unique object identifiers are assigned in a distributed object storage system which consists of a plurality of storage media interconnected over networks subject to disruptions. The object identifier assignment prevents object identifier collisions in a distributed non-connected system regardless of the numbers of objects being stored and ensures continued operation of the object storage system in the presence of network disruptions without requiring unique identifiers for entities performing allocations. Embodiments may be used within any system where there is a need for globally unique identifiers, and the allocation of the globally unique identifiers needs to occur in the absence of network connectivity. The globally unique identifiers may be transformed for security purposes.

Identification of fixed content objects in a distributed fixed content storage system

A method and apparatus for the management of the placement of immutable fixed-content objects in a distributed, multi-site, multi-tier non-volatile storage hierarchy consisting of a plurality of storage media connected together over networks of varying bandwidth where the computing, storage, and network resources are subject to failure. The disclosure provides for scalability, performance, and robustness by distributing the object placement management tasks amongst a plurality of computing resources and eliminating the need for global synchronization or locking amongst said computing resources.

Growing community of inventors

New Westminster, Canada

Oliver Erik Seiler