Patent Grant
11301420
Businesses worldwide recognize the commercial value of their data and seek reliable, cost-effective ways to protect the information stored on their computer networks while minimizing impact on productivity. Protecting information is often part of a routine process that is performed within an organization. A company might back up critical computing systems such as databases, file servers, web servers, and so on as part of a daily, weekly, or monthly maintenance schedule. The company may similarly protect computing systems used by each of its employees, such as those used by an accounting department, marketing department, engineering department, and so forth.
Given the rapidly expanding volume of data under management, companies also continue to seek innovative techniques for managing data growth, in addition to protecting data. For instance, companies often implement migration techniques for moving data to lower cost storage over time and data reduction techniques for reducing redundant data, pruning lower priority data, etc. Enterprises also increasingly view their stored data as a valuable asset. Along these lines, customers are looking for solutions that not only protect and manage, but also leverage their data. For instance, solutions providing data analysis capabilities, information management, improved data presentation and access features, and the like, are in increasing demand.
In response to these challenges, one technique developed by storage system providers is data deduplication. Deduplication typically involves eliminating or reducing the amount of redundant data stored and communicated within a storage system, improving storage utilization. For example, data can be divided into units of a chosen granularity (e.g., files or data blocks). As new data enters the system, the data units can be checked to see if they already exist in the storage system. If the data unit already exists, instead of storing and/or communicating a duplicate copy, the storage system stores and/or communicates a reference to the existing data unit.
Deduplication can improve storage utilization, system traffic (e.g., over a networked storage system), or both. Deduplication techniques designed to reduce the demands on storage systems during storage operations such as backup and/or replication operations can be found in the following U.S. patent applications, each of which is incorporated by reference in its entirety. One or more embodiments of the present disclosure may be used with systems and methods disclosed therein:
Storage systems may include one or more deduplication databases that are used to implement the deduplication techniques. For example, when a new data unit enters the storage system, the storage system may generate a signature (e.g., a hash) of the data unit and store the signature in the deduplication database. As subsequent data units enter the storage system (e.g., after a backup request), the storage system may generate a signature of the respective data unit and check the deduplication database to determine if the signature is already present. If the signature is already present, the storage system may replace the respective data unit with a reference to the original data unit. A reference may point to a location in secondary storage in which an encrypted version of the original data unit is stored. Encryption keys used to encrypt the data units may be stored in a database associated with the storage system.
Occasionally, the database associated with the storage system may go down for a brief period of time. For example, a disk may fail or various components of the storage system may lose power. The storage system database may have been backed up at various points in time, and a backup may be used to restore the storage system database to a previous point in time. Because the storage system database is restored to a previous point in time, any encryption keys created between the previous point in time and a time that the database went down may be lost. Thus, any data units encrypted using these lost encryption keys may not be decryptable. Furthermore, if any of these data units that cannot be decrypted are referenced in the deduplication database, then future backups requested by the client device may be corrupted. For example, in a future backup, instead of encrypting a data unit using an encryption key stored in the storage system database and storing the encrypted data unit in the secondary storage, the storage system may determine that the data unit is already encrypted and stored in the secondary storage based on a lookup of the deduplication database and may replace the data unit in the backup with a pointer to the encrypted data unit that cannot be decrypted. If this backup is then used to restore the client device, data corresponding to the data unit may not be retrievable because the encrypted data unit cannot be decrypted.
In order to address such challenges, a deduplicated storage system is provided according to certain embodiments that determines when a database associated with the deduplicated storage system is restored, identifies a backup job used to perform the restore and a backup job identifier associated with the backup job that corresponds with a time that the backup job occurred. The system instructs the deduplication database to prune entries that are associated with data units that may have been encrypted using encryption keys that were created at a time after the time that the backup job occurred. For example, the deduplication database may include a primary table and a secondary table. The primary table may include entries for each unique signature and a reference count identifying a number of times the data unit associated with the respective signature is duplicated. The secondary table may identify a list of backup job identifiers and signatures associated with each backup job identifier. The deduplicated storage system may provide the deduplication database with the backup job identifier associated with a time that the backup job occurred. The deduplication database may use the backup job identifier to identify backup job identifiers listed in the secondary table that are associated with a backup job that occurred after the backup job associated with the provided backup job identifier. The deduplication database may then identify the signatures associated with the identified backup job identifiers and decrement the reference count associated with each signature in the primary table.
Storage systems may include one or more deduplication databases that are used to implement the deduplication techniques. For example, when a new data unit (e.g., data block) enters the storage system, the storage system may generate a signature (e.g., a hash) of the data unit and store the signature in the deduplication database. As subsequent data units enter the storage system (e.g., after a backup request), the storage system may generate a signature of the respective data unit and check the deduplication database to determine if the signature is already present. If the signature is already present, the storage system may replace the respective data unit with a reference to the original data unit. A reference may point to a location in secondary storage in which an encrypted version of the original data unit is stored. Encryption keys used to encrypt the data units may be stored in a database associated with the storage system.
Occasionally, the database associated with the storage system may go down for a brief period of time. For example, a disk may fail, various components of the storage system may lose power, and/or the like. The storage system database may have been backed up at various points in time, and a backup may be used to restore the storage system database to a previous point in time. Because the storage system database is restored to a previous point in time, any encryption keys created between the previous point in time and a time that the database went down may be lost. Thus, any data units encrypted using these lost encryption keys may not be decryptable. Furthermore, if any of these data units that cannot be decrypted are referenced in the deduplication database, then future backups requested by the client device may be corrupted. For example, in a future backup, instead of encrypting a data unit using an encryption key stored in the storage system database and storing the encrypted data unit in the secondary storage, the storage system may determine that the data unit is already encrypted and stored in the secondary storage based on a lookup of the deduplication database and may replace the data unit in the backup with a pointer to the encrypted data unit that cannot be decrypted. If this backup is then used to restore the client device, data corresponding to the data unit may not be retrievable because the encrypted data unit cannot be decrypted.
Before, the issues described above were resolved by generating a new deduplication database each time the storage system database was restored. However, generating a new deduplication database can be expensive. The old deduplication databases are not deleted from memory, and thus the new deduplication database may need additional dedicated memory resources. In some cases, the size of the deduplication databases can be large (e.g., in the gigabytes, terabytes, etc.), and thus the administrator of the storage system may need to purchase and integrate new hardware. Integrating and implementing new hardware when restores occur can be cumbersome and costly. In addition, future backups may initially occupy a larger portion of the secondary storage as the new deduplication database initially has no information on duplicate data units and may gradually identify duplicate data units over time.
Accordingly, systems and methods are disclosed for determining when a database associated with the deduplicated storage system is restored, identifying a backup job used to perform the restore and a backup job identifier associated with the backup job that corresponds with a time that the backup job occurred, and instructs the deduplication database to prune entries that are associated with data units that may have been encrypted using encryption keys that were created at a time after the time that the backup job occurred. Such systems and methods disclosed herein may reduce the likelihood of or prevent corruption in future backup jobs while not increasing the costs of maintaining the deduplicated storage system. Examples of such systems and methods are described in further detail herein, in reference to
For example, a database associated with the deduplicated storage system may be restored using a backup job that occurred at a first time. The deduplicated storage system may provide the deduplication database with a backup job identifier that is associated with the backup job. The deduplication database may then use the backup job identifier to identify data units that are associated with backup jobs that occurred at times after the first time. In some embodiments, the deduplication database includes a primary table and a secondary table. The primary table may include entries associated with data units and a reference count identifying a number of times a respective data unit is duplicated. The secondary table may identify a list of backup job identifiers and data units (or representations of data units, such as signatures) associated with each backup job identifier. Thus, the deduplication database may use the backup job identifier provided by the deduplicated storage system to identify backup job identifiers listed in the secondary table that are associated with a time after the first time. The deduplication database may then identify entries associated with the data units that are associated with the identified backup job identifiers and decrement the appropriate reference count.
Information Management System Overview
With the increasing importance of protecting and leveraging data, organizations simply cannot afford to take the risk of losing critical data. Moreover, runaway data growth and other modern realities make protecting and managing data an increasingly difficult task. There is therefore a need for efficient, powerful, and user-friendly solutions for protecting and managing data.
Depending on the size of the organization, there are typically many data production sources which are under the purview of tens, hundreds, or even thousands of employees or other individuals. In the past, individual employees were sometimes responsible for managing and protecting their data. A patchwork of hardware and software point solutions has been applied in other cases. These solutions were often provided by different vendors and had limited or no interoperability.
Certain embodiments described herein provide systems and methods capable of addressing these and other shortcomings of prior approaches by implementing unified, organization-wide information management.
Generally, the systems and associated components described herein may be compatible with and/or provide some or all of the functionality of the systems and corresponding components described in one or more of the following U.S. patents and patent application publications assigned to CommVault Systems, Inc., each of which is hereby incorporated in its entirety by reference herein:
The information management system 100 can include a variety of different computing devices. For instance, as will be described in greater detail herein, the information management system 100 can include one or more client computing devices 102 and secondary storage computing devices 106.
Computing devices can include, without limitation, one or more: workstations, personal computers, desktop computers, or other types of generally fixed computing systems such as mainframe computers and minicomputers. Other computing devices can include mobile or portable computing devices, such as one or more laptops, tablet computers, personal data assistants, mobile phones (such as smartphones), and other mobile or portable computing devices such as embedded computers, set top boxes, vehicle-mounted devices, wearable computers, etc. Computing devices can include servers, such as mail servers, file servers, database servers, and web servers.
In some cases, a computing device includes virtualized and/or cloud computing resources. For instance, one or more virtual machines may be provided to the organization by a third-party cloud service vendor. Or, in some embodiments, computing devices can include one or more virtual machine(s) running on a physical host computing device (or “host machine”) operated by the organization. As one example, the organization may use one virtual machine as a database server and another virtual machine as a mail server, both virtual machines operating on the same host machine.
A virtual machine includes an operating system and associated virtual resources, and is hosted simultaneously with another operating system on a physical host computer (or host machine). A hypervisor (typically software, and also known in the art as a virtual machine monitor or a virtual machine manager or “VMM”) sits between the virtual machine and the hardware of the physical host machine. One example of hypervisor as virtualization software is ESX Server, by VMware, Inc. of Palo Alto, Calif.; other examples include Microsoft Virtual Server and Microsoft Windows Server Hyper-V, both by Microsoft Corporation of Redmond, Wash., and Sun xVM by Oracle America Inc. of Santa Clara, Calif. In some embodiments, the hypervisor may be firmware or hardware or a combination of software and/or firmware and/or hardware.
The hypervisor provides to each virtual operating system virtual resources, such as a virtual processor, virtual memory, a virtual network device, and a virtual disk. Each virtual machine has one or more virtual disks. The hypervisor typically stores the data of virtual disks in files on the file system of the physical host machine, called virtual machine disk files (in the case of VMware virtual servers) or virtual hard disk image files (in the case of Microsoft virtual servers). For example, VMware's ESX Server provides the Virtual Machine File System (VMFS) for the storage of virtual machine disk files. A virtual machine reads data from and writes data to its virtual disk much the same way that an actual physical machine reads data from and writes data to an actual disk.
Examples of techniques for implementing information management techniques in a cloud computing environment are described in U.S. Pat. No. 8,285,681, which is incorporated by reference herein. Examples of techniques for implementing information management techniques in a virtualized computing environment are described in U.S. Pat. No. 8,307,177, also incorporated by reference herein.
The information management system 100 can also include a variety of storage devices, including primary storage devices 104 and secondary storage devices 108, for example. Storage devices can generally be of any suitable type including, without limitation, disk drives, hard-disk arrays, semiconductor memory (e.g., solid state storage devices), network attached storage (NAS) devices, tape libraries or other magnetic, non-tape storage devices, optical media storage devices, DNA/RNA-based memory technology, combinations of the same, and the like. In some embodiments, storage devices can form part of a distributed file system. In some cases, storage devices are provided in a cloud (e.g., a private cloud or one operated by a third-party vendor). A storage device in some cases comprises a disk array or portion thereof.
The illustrated information management system 100 includes one or more client computing device 102 having at least one application 110 executing thereon, and one or more primary storage devices 104 storing primary data 112. The client computing device(s) 102 and the primary storage devices 104 may generally be referred to in some cases as a primary storage subsystem 117. A computing device in an information management system 100 that has a data agent 142 installed and operating on it is generally referred to as a client computing device 102 (or, in the context of a component of the information management system 100 simply as a “client”).
Depending on the context, the term “information management system” can refer to generally all of the illustrated hardware and software components. Or, in other instances, the term may refer to only a subset of the illustrated components.
For instance, in some cases, the information management system 100 generally refers to a combination of specialized components used to protect, move, manage, manipulate, analyze, and/or process data and metadata generated by the client computing devices 102. However, the information management system 100 in some cases does not include the underlying components that generate and/or store the primary data 112, such as the client computing devices 102 themselves, the applications 110 and operating system operating on the client computing devices 102, and the primary storage devices 104. As an example, “information management system” may sometimes refer to one or more of the following components and corresponding data structures: storage managers, data agents, and media agents. These components will be described in further detail below.
Client Computing Devices
There are typically a variety of sources in an organization that produce data to be protected and managed. As just one illustrative example, in a corporate environment such data sources can be employee workstations and company servers such as a mail server, a web server, a database server, a transaction server, or the like. In the information management system 100, the data generation sources include the one or more client computing devices 102.
The client computing devices 102 may include any of the types of computing devices described above, without limitation, and in some cases the client computing devices 102 are associated with one or more users and/or corresponding user accounts, of employees or other individuals.
The information management system 100 generally addresses and handles the data management and protection needs for the data generated by the client computing devices 102. However, the use of this term does not imply that the client computing devices 102 cannot be “servers” in other respects. For instance, a particular client computing device 102 may act as a server with respect to other devices, such as other client computing devices 102. As just a few examples, the client computing devices 102 can include mail servers, file servers, database servers, and web servers.
Each client computing device 102 may have one or more applications 110 (e.g., software applications) executing thereon which generate and manipulate the data that is to be protected from loss and managed. The applications 110 generally facilitate the operations of an organization (or multiple affiliated organizations), and can include, without limitation, mail server applications (e.g., Microsoft Exchange Server), file server applications, mail client applications (e.g., Microsoft Exchange Client), database applications (e.g., SQL, Oracle, SAP, Lotus Notes Database), word processing applications (e.g., Microsoft Word), spreadsheet applications, financial applications, presentation applications, graphics and/or video applications, browser applications, mobile applications, entertainment applications, and so on.
The client computing devices 102 can have at least one operating system (e.g., Microsoft Windows, Mac OS X, iOS, IBM z/OS, Linux, other Unix-based operating systems, etc.) installed thereon, which may support or host one or more file systems and other applications 110.
The client computing devices 102 and other components in information management system 100 can be connected to one another via one or more communication pathways 114. For example, a first communication pathway 114 may connect (or communicatively couple) client computing device 102 and secondary storage computing device 106; a second communication pathway 114 may connect storage manager 140 and client computing device 102; and a third communication pathway 114 may connect storage manager 140 and secondary storage computing device 106, etc. (see, e.g.,
Primary Data and Exemplary Primary Storage Devices
Primary data 112 according to some embodiments is production data or other “live” data generated by the operating system and/or applications 110 operating on a client computing device 102. The primary data 112 is generally stored on the primary storage device(s) 104 and is organized via a file system supported by the client computing device 102. For instance, the client computing device(s) 102 and corresponding applications 110 may create, access, modify, write, delete, and otherwise use primary data 112. In some cases, some or all of the primary data 112 can be stored in cloud storage resources (e.g., primary storage device 104 may be a cloud-based resource).
Primary data 112 is generally in the native format of the source application 110. According to certain aspects, primary data 112 is an initial or first (e.g., created before any other copies or before at least one other copy) stored copy of data generated by the source application 110. Primary data 112 in some cases is created substantially directly from data generated by the corresponding source applications 110.
The primary storage devices 104 storing the primary data 112 may be relatively fast and/or expensive technology (e.g., a disk drive, a hard-disk array, solid state memory, etc.). In addition, primary data 112 may be highly changeable and/or may be intended for relatively short term retention (e.g., hours, days, or weeks).
According to some embodiments, the client computing device 102 can access primary data 112 from the primary storage device 104 by making conventional file system calls via the operating system. Primary data 112 may include structured data (e.g., database files), unstructured data (e.g., documents), and/or semi-structured data. Some specific examples are described below with respect to
It can be useful in performing certain tasks to organize the primary data 112 into units of different granularities. In general, primary data 112 can include files, directories, file system volumes, data blocks, extents, or any other hierarchies or organizations of data objects. As used herein, a “data object” can refer to both (1) any file that is currently addressable by a file system or that was previously addressable by the file system (e.g., an archive file) and (2) a subset of such a file (e.g., a data block).
As will be described in further detail, it can also be useful in performing certain functions of the information management system 100 to access and modify metadata within the primary data 112. Metadata generally includes information about data objects or characteristics associated with the data objects. For simplicity herein, it is to be understood that, unless expressly stated otherwise, any reference to primary data 112 generally also includes its associated metadata, but references to the metadata do not include the primary data.
Metadata can include, without limitation, one or more of the following: the data owner (e.g., the client or user that generates the data), the last modified time (e.g., the time of the most recent modification of the data object), a data object name (e.g., a file name), a data object size (e.g., a number of bytes of data), information about the content (e.g., an indication as to the existence of a particular search term), user-supplied tags, to/from information for email (e.g., an email sender, recipient, etc.), creation date, file type (e.g., format or application type), last accessed time, application type (e.g., type of application that generated the data object), location/network (e.g., a current, past or future location of the data object and network pathways to/from the data object), geographic location (e.g., GPS coordinates), frequency of change (e.g., a period in which the data object is modified), business unit (e.g., a group or department that generates, manages or is otherwise associated with the data object), aging information (e.g., a schedule, such as a time period, in which the data object is migrated to secondary or long term storage), boot sectors, partition layouts, file location within a file folder directory structure, user permissions, owners, groups, access control lists [ACLs]), system metadata (e.g., registry information), combinations of the same or other similar information related to the data object.
In addition to metadata generated by or related to file systems and operating systems, some of the applications 110 and/or other components of the information management system 100 maintain indices of metadata for data objects, e.g., metadata associated with individual email messages. Thus, each data object may be associated with corresponding metadata. The use of metadata to perform classification and other functions is described in greater detail below.
Each of the client computing devices 102 are generally associated with and/or in communication with one or more of the primary storage devices 104 storing corresponding primary data 112. A client computing device 102 may be considered to be “associated with” or “in communication with” a primary storage device 104 if it is capable of one or more of: routing and/or storing data (e.g., primary data 112) to the particular primary storage device 104, coordinating the routing and/or storing of data to the particular primary storage device 104, retrieving data from the particular primary storage device 104, coordinating the retrieval of data from the particular primary storage device 104, and modifying and/or deleting data retrieved from the particular primary storage device 104.
The primary storage devices 104 can include any of the different types of storage devices described above, or some other kind of suitable storage device. The primary storage devices 104 may have relatively fast I/O times and/or are relatively expensive in comparison to the secondary storage devices 108. For example, the information management system 100 may generally regularly access data and metadata stored on primary storage devices 104, whereas data and metadata stored on the secondary storage devices 108 is accessed relatively less frequently.
Primary storage device 104 may be dedicated or shared. In some cases, each primary storage device 104 is dedicated to an associated client computing device 102. For instance, a primary storage device 104 in one embodiment is a local disk drive of a corresponding client computing device 102. In other cases, one or more primary storage devices 104 can be shared by multiple client computing devices 102, e.g., via a network such as in a cloud storage implementation. As one example, a primary storage device 104 can be a disk array shared by a group of client computing devices 102, such as one of the following types of disk arrays: EMC Clariion, EMC Symmetrix, EMC Celerra, Dell EqualLogic, IBM XIV, NetApp FAS, HP EVA, and HP 3PAR.
The information management system 100 may also include hosted services (not shown), which may be hosted in some cases by an entity other than the organization that employs the other components of the information management system 100. For instance, the hosted services may be provided by various online service providers to the organization. Such service providers can provide services including social networking services, hosted email services, or hosted productivity applications or other hosted applications). Hosted services may include software-as-a-service (SaaS), platform-as-a-service (PaaS), application service providers (ASPs), cloud services, or other mechanisms for delivering functionality via a network. As it provides services to users, each hosted service may generate additional data and metadata under management of the information management system 100, e.g., as primary data 112. In some cases, the hosted services may be accessed using one of the applications 110. As an example, a hosted mail service may be accessed via browser running on a client computing device 102. The hosted services may be implemented in a variety of computing environments. In some cases, they are implemented in an environment having a similar arrangement to the information management system 100, where various physical and logical components are distributed over a network.
Secondary Copies and Exemplary Secondary Storage Devices
The primary data 112 stored on the primary storage devices 104 may be compromised in some cases, such as when an employee deliberately or accidentally deletes or overwrites primary data 112 during their normal course of work. Or the primary storage devices 104 can be damaged, lost, or otherwise corrupted. For recovery and/or regulatory compliance purposes, it is therefore useful to generate copies of the primary data 112. Accordingly, the information management system 100 includes one or more secondary storage computing devices 106 and one or more secondary storage devices 108 configured to create and store one or more secondary copies 116 of the primary data 112 and associated metadata. The secondary storage computing devices 106 and the secondary storage devices 108 may sometimes be referred to as a secondary storage subsystem 118.
Creation of secondary copies 116 can help in search and analysis efforts and meet other information management goals, such as: restoring data and/or metadata if an original version (e.g., of primary data 112) is lost (e.g., by deletion, corruption, or disaster); allowing point-in-time recovery; complying with regulatory data retention and electronic discovery (e-discovery) requirements; reducing utilized storage capacity; facilitating organization and search of data; improving user access to data files across multiple computing devices and/or hosted services; and implementing data retention policies.
The client computing devices 102 access or receive primary data 112 and communicate the data, e.g., over one or more communication pathways 114, for storage in the secondary storage device(s) 108.
A secondary copy 116 can comprise a separate stored copy of application data that is derived from one or more earlier-created, stored copies (e.g., derived from primary data 112 or another secondary copy 116). Secondary copies 116 can include point-in-time data, and may be intended for relatively long-term retention (e.g., weeks, months or years), before some or all of the data is moved to other storage or is discarded.
In some cases, a secondary copy 116 is a copy of application data created and stored subsequent to at least one other stored instance (e.g., subsequent to corresponding primary data 112 or to another secondary copy 116), in a different storage device than at least one previous stored copy, and/or remotely from at least one previous stored copy. In some other cases, secondary copies can be stored in the same storage device as primary data 112 and/or other previously stored copies. For example, in one embodiment a disk array capable of performing hardware snapshots stores primary data 112 and creates and stores hardware snapshots of the primary data 112 as secondary copies 116. Secondary copies 116 may be stored in relatively slow and/or low cost storage (e.g., magnetic tape). A secondary copy 116 may be stored in a backup or archive format, or in some other format different than the native source application format or other primary data format.
In some cases, secondary copies 116 are indexed so users can browse and restore at another point in time. After creation of a secondary copy 116 representative of certain primary data 112, a pointer or other location indicia (e.g., a stub) may be placed in primary data 112, or be otherwise associated with primary data 112 to indicate the current location on the secondary storage device(s) 108 of secondary copy 116.
Since an instance of a data object or metadata in primary data 112 may change over time as it is modified by an application 110 (or hosted service or the operating system), the information management system 100 may create and manage multiple secondary copies 116 of a particular data object or metadata, each representing the state of the data object in primary data 112 at a particular point in time. Moreover, since an instance of a data object in primary data 112 may eventually be deleted from the primary storage device 104 and the file system, the information management system 100 may continue to manage point-in-time representations of that data object, even though the instance in primary data 112 no longer exists.
For virtualized computing devices the operating system and other applications 110 of the client computing device(s) 102 may execute within or under the management of virtualization software (e.g., a VMM), and the primary storage device(s) 104 may comprise a virtual disk created on a physical storage device. The information management system 100 may create secondary copies 116 of the files or other data objects in a virtual disk file and/or secondary copies 116 of the entire virtual disk file itself (e.g., of an entire .vmdk file).
Secondary copies 116 may be distinguished from corresponding primary data 112 in a variety of ways, some of which will now be described. First, as discussed, secondary copies 116 can be stored in a different format (e.g., backup, archive, or other non-native format) than primary data 112. For this or other reasons, secondary copies 116 may not be directly useable by the applications 110 of the client computing device 102, e.g., via standard system calls or otherwise without modification, processing, or other intervention by the information management system 100.
Secondary copies 116 are also in some embodiments stored on a secondary storage device 108 that is inaccessible to the applications 110 running on the client computing devices 102 (and/or hosted services). Some secondary copies 116 may be “offline copies,” in that they are not readily available (e.g., not mounted to tape or disk). Offline copies can include copies of data that the information management system 100 can access without human intervention (e.g., tapes within an automated tape library, but not yet mounted in a drive), and copies that the information management system 100 can access only with at least some human intervention (e.g., tapes located at an offsite storage site).
The Use of Intermediate Devices for Creating Secondary Copies
Creating secondary copies can be a challenging task. For instance, there can be hundreds or thousands of client computing devices 102 continually generating large volumes of primary data 112 to be protected. Also, there can be significant overhead involved in the creation of secondary copies 116. Moreover, secondary storage devices 108 may be special purpose components, and interacting with them can require specialized intelligence.
In some cases, the client computing devices 102 interact directly with the secondary storage device 108 to create the secondary copies 116. However, in view of the factors described above, this approach can negatively impact the ability of the client computing devices 102 to serve the applications 110 and produce primary data 112. Further, the client computing devices 102 may not be optimized for interaction with the secondary storage devices 108.
Thus, in some embodiments, the information management system 100 includes one or more software and/or hardware components which generally act as intermediaries between the client computing devices 102 and the secondary storage devices 108. In addition to off-loading certain responsibilities from the client computing devices 102, these intermediate components can provide other benefits. For instance, as discussed further below with respect to
The intermediate components can include one or more secondary storage computing devices 106 as shown in
The secondary storage computing device(s) 106 can comprise any of the computing devices described above, without limitation. In some cases, the secondary storage computing device(s) 106 include specialized hardware and/or software componentry for interacting with the secondary storage devices 108.
To create a secondary copy 116 involving the copying of data from the primary storage subsystem 117 to the secondary storage subsystem 118, the client computing device 102 in some embodiments communicates the primary data 112 to be copied (or a processed version thereof) to the designated secondary storage computing device 106, via the communication pathway 114. The secondary storage computing device 106 in turn conveys the received data (or a processed version thereof) to the secondary storage device 108. In some such configurations, the communication pathway 114 between the client computing device 102 and the secondary storage computing device 106 comprises a portion of a LAN, WAN or SAN. In other cases, at least some client computing devices 102 communicate directly with the secondary storage devices 108 (e.g., via Fibre Channel or SCSI connections). In some other cases, one or more secondary copies 116 are created from existing secondary copies, such as in the case of an auxiliary copy operation, described in greater detail below.
Exemplary Primary Data and an Exemplary Secondary Copy
Some or all primary data objects are associated with corresponding metadata (e.g., “Meta1-11”), which may include file system metadata and/or application specific metadata. Stored on the secondary storage device(s) 108 are secondary copy data objects 134A-C which may include copies of or otherwise represent corresponding primary data objects and metadata.
As shown, the secondary copy data objects 134A-C can individually represent more than one primary data object. For example, secondary copy data object 134A represents three separate primary data objects 133C, 122, and 129C (represented as 133C′, 122′, and 129C′, respectively, and accompanied by the corresponding metadata Meta11, Meta3, and Meta8, respectively). Moreover, as indicated by the prime mark (′), a secondary copy object may store a representation of a primary data object and/or metadata differently than the original format, e.g., in a compressed, encrypted, deduplicated, or other modified format. Likewise, secondary data object 134B represents primary data objects 120, 133B, and 119A as 120′, 133B′, and 119A′, respectively and accompanied by corresponding metadata Meta2, Meta10, and Meta1, respectively. Also, secondary data object 134C represents primary data objects 133A, 119B, and 129A as 133A′, 119B′, and 129A′, respectively, accompanied by corresponding metadata Meta9, Meta5, and Meta6, respectively.
Exemplary Information Management System Architecture
The information management system 100 can incorporate a variety of different hardware and software components, which can in turn be organized with respect to one another in many different configurations, depending on the embodiment. There are critical design choices involved in specifying the functional responsibilities of the components and the role of each component in the information management system 100. For instance, as will be discussed, such design choices can impact performance as well as the adaptability of the information management system 100 to data growth or other changing circumstances.
Storage Manager
As noted, the number of components in the information management system 100 and the amount of data under management can be quite large. Managing the components and data is therefore a significant task, and a task that can grow in an often unpredictable fashion as the quantity of components and data scale to meet the needs of the organization. For these and other reasons, according to certain embodiments, responsibility for controlling the information management system 100, or at least a significant portion of that responsibility, is allocated to the storage manager 140. By distributing control functionality in this manner, the storage manager 140 can be adapted independently according to changing circumstances. Moreover, a computing device for hosting the storage manager 140 can be selected to best suit the functions of the storage manager 140. These and other advantages are described in further detail below with respect to
The storage manager 140 may be a software module or other application, which, in some embodiments operates in conjunction with one or more associated data structures, e.g., a dedicated database (e.g., management database 146). In some embodiments, storage manager 140 is a computing device comprising circuitry for executing computer instructions and performs the functions described herein. The storage manager generally initiates, performs, coordinates and/or controls storage and other information management operations performed by the information management system 100, e.g., to protect and control the primary data 112 and secondary copies 116 of data and metadata. In general, storage manager 100 may be said to manage information management system 100, which includes managing the constituent components, e.g., data agents and media agents, etc.
As shown by the dashed arrowed lines 114 in
In other embodiments, some information management operations are controlled by other components in the information management system 100 (e.g., the media agent(s) 144 or data agent(s) 142), instead of or in combination with the storage manager 140.
According to certain embodiments, the storage manager 140 provides one or more of the following functions:
The storage manager 140 may maintain a database 146 (or “storage manager database 146” or “management database 146”) of management-related data and information management policies 148. The database 146 may include a management index 150 (or “index 150”) or other data structure that stores logical associations between components of the system, user preferences and/or profiles (e.g., preferences regarding encryption, compression, or deduplication of primary or secondary copy data, preferences regarding the scheduling, type, or other aspects of primary or secondary copy or other operations, mappings of particular information management users or user accounts to certain computing devices or other components, etc.), management tasks, media containerization, or other useful data. For example, the storage manager 140 may use the index 150 to track logical associations between media agents 144 and secondary storage devices 108 and/or movement of data from primary storage devices 104 to secondary storage devices 108. For instance, the index 150 may store data associating a client computing device 102 with a particular media agent 144 and/or secondary storage device 108, as specified in an information management policy 148 (e.g., a storage policy, which is defined in more detail below).
Administrators and other people may be able to configure and initiate certain information management operations on an individual basis. But while this may be acceptable for some recovery operations or other relatively less frequent tasks, it is often not workable for implementing on-going organization-wide data protection and management. Thus, the information management system 100 may utilize information management policies 148 for specifying and executing information management operations (e.g., on an automated basis). Generally, an information management policy 148 can include a data structure or other information source that specifies a set of parameters (e.g., criteria and rules) associated with storage or other information management operations.
The storage manager database 146 may maintain the information management policies 148 and associated data, although the information management policies 148 can be stored in any appropriate location. For instance, an information management policy 148 such as a storage policy may be stored as metadata in a media agent database 152 or in a secondary storage device 108 (e.g., as an archive copy) for use in restore operations or other information management operations, depending on the embodiment. Information management policies 148 are described further below.
According to certain embodiments, the storage manager database 146 comprises a relational database (e.g., an SQL database) for tracking metadata, such as metadata associated with secondary copy operations (e.g., what client computing devices 102 and corresponding data were protected). This and other metadata may additionally be stored in other locations, such as at the secondary storage computing devices 106 or on the secondary storage devices 108, allowing data recovery without the use of the storage manager 140 in some cases.
As shown, the storage manager 140 may include a jobs agent 156, a user interface 158, and a management agent 154, all of which may be implemented as interconnected software modules or application programs.
The jobs agent 156 in some embodiments initiates, controls, and/or monitors the status of some or all storage or other information management operations previously performed, currently being performed, or scheduled to be performed by the information management system 100. For instance, the jobs agent 156 may access information management policies 148 to determine when and how to initiate and control secondary copy and other information management operations, as will be discussed further.
The user interface 158 may include information processing and display software, such as a graphical user interface (“GUI”), an application program interface (“API”), or other interactive interface(s) through which users and system processes can retrieve information about the status of information management operations (e.g., storage operations) or issue instructions to the information management system 100 and its constituent components. Via the user interface 158, users may optionally issue instructions to the components in the information management system 100 regarding performance of storage and recovery operations. For example, a user may modify a schedule concerning the number of pending secondary copy operations. As another example, a user may employ the GUI to view the status of pending storage operations or to monitor the status of certain components in the information management system 100 (e.g., the amount of capacity left in a storage device).
An “information management cell” (or “storage operation cell” or “cell”) may generally include a logical and/or physical grouping of a combination of hardware and software components associated with performing information management operations on electronic data, typically one storage manager 140 and at least one client computing device 102 (comprising data agent(s) 142) and at least one media agent 144. For instance, the components shown in
The storage manager 140 may also track information that permits it to select, designate, or otherwise identify content indices, deduplication databases, or similar databases or resources or data sets within its information management cell (or another cell) to be searched in response to certain queries. Such queries may be entered by the user via interaction with the user interface 158. In general, the management agent 154 allows multiple information management cells to communicate with one another. For example, the information management system 100 in some cases may be one information management cell of a network of multiple cells adjacent to one another or otherwise logically related in a WAN or LAN. With this arrangement, the cells may be connected to one another through respective management agents 154.
For instance, the management agent 154 can provide the storage manager 140 with the ability to communicate with other components within the information management system 100 (and/or other cells within a larger information management system) via network protocols and application programming interfaces (“APIs”) including, e.g., HTTP, HTTPS, FTP, REST, virtualization software APIs, cloud service provider APIs, and hosted service provider APIs. Inter-cell communication and hierarchy is described in greater detail in e.g., U.S. Pat. Nos. 7,747,579 and 7,343,453, which are incorporated by reference herein.
Data Agents
As discussed, a variety of different types of applications 110 can operate on a given client computing device 102, including operating systems, database applications, e-mail applications, and virtual machines, just to name a few. And, as part of the process of creating and restoring secondary copies 116, the client computing devices 102 may be tasked with processing and preparing the primary data 112 from these various different applications 110. Moreover, the nature of the processing/preparation can differ across clients and application types, e.g., due to inherent structural and formatting differences among applications 110.
The one or more data agent(s) 142 are therefore advantageously configured in some embodiments to assist in the performance of information management operations based on the type of data that is being protected, at a client-specific and/or application-specific level.
The data agent 142 may be a software module or component that is generally responsible for managing, initiating, or otherwise assisting in the performance of information management operations in information management system 100, generally as directed by storage manager 140. For instance, the data agent 142 may take part in performing data storage operations such as the copying, archiving, migrating, and/or replicating of primary data 112 stored in the primary storage device(s) 104. The data agent 142 may receive control information from the storage manager 140, such as commands to transfer copies of data objects, metadata, and other payload data to the media agents 144.
In some embodiments, a data agent 142 may be distributed between the client computing device 102 and storage manager 140 (and any other intermediate components) or may be deployed from a remote location or its functions approximated by a remote process that performs some or all of the functions of data agent 142. In addition, a data agent 142 may perform some functions provided by a media agent 144, or may perform other functions such as encryption and deduplication.
As indicated, each data agent 142 may be specialized for a particular application 110, and the system can employ multiple application-specific data agents 142, each of which may perform information management operations (e.g., perform backup, migration, and data recovery) associated with a different application 110. For instance, different individual data agents 142 may be designed to handle Microsoft Exchange data, Lotus Notes data, Microsoft Windows file system data, Microsoft Active Directory Objects data, SQL Server data, SharePoint data, Oracle database data, SAP database data, virtual machines and/or associated data, and other types of data.
A file system data agent, for example, may handle data files and/or other file system information. If a client computing device 102 has two or more types of data, a specialized data agent 142 may be used for each data type to copy, archive, migrate, and restore the client computing device 102 data. For example, to backup, migrate, and/or restore all of the data on a Microsoft Exchange server, the client computing device 102 may use a Microsoft Exchange Mailbox data agent 142 to back up the Exchange mailboxes, a Microsoft Exchange Database data agent 142 to back up the Exchange databases, a Microsoft Exchange Public Folder data agent 142 to back up the Exchange Public Folders, and a Microsoft Windows File System data agent 142 to back up the file system of the client computing device 102. In such embodiments, these specialized data agents 142 may be treated as four separate data agents 142 even though they operate on the same client computing device 102.
Other embodiments may employ one or more generic data agents 142 that can handle and process data from two or more different applications 110, or that can handle and process multiple data types, instead of or in addition to using specialized data agents 142. For example, one generic data agent 142 may be used to back up, migrate and restore Microsoft Exchange Mailbox data and Microsoft Exchange Database data while another generic data agent may handle Microsoft Exchange Public Folder data and Microsoft Windows File System data.
Each data agent 142 may be configured to access data and/or metadata stored in the primary storage device(s) 104 associated with the data agent 142 and process the data as appropriate. For example, during a secondary copy operation, the data agent 142 may arrange or assemble the data and metadata into one or more files having a certain format (e.g., a particular backup or archive format) before transferring the file(s) to a media agent 144 or other component. The file(s) may include a list of files or other metadata. Each data agent 142 can also assist in restoring data or metadata to primary storage devices 104 from a secondary copy 116. For instance, the data agent 142 may operate in conjunction with the storage manager 140 and one or more of the media agents 144 to restore data from secondary storage device(s) 108.
Media Agents
As indicated above with respect to
Generally speaking, a media agent 144 may be implemented as a software module that manages, coordinates, and facilitates the transmission of data, as directed by the storage manager 140, between a client computing device 102 and one or more secondary storage devices 108. Whereas the storage manager 140 controls the operation of the information management system 100, the media agent 144 generally provides a portal to secondary storage devices 108. For instance, other components in the system interact with the media agents 144 to gain access to data stored on the secondary storage devices 108, whether it be for the purposes of reading, writing, modifying, or deleting data. Moreover, as will be described further, media agents 144 can generate and store information relating to characteristics of the stored data and/or metadata, or can generate and store other types of information that generally provides insight into the contents of the secondary storage devices 108.
Media agents 144 can comprise separate nodes in the information management system 100 (e.g., nodes that are separate from the client computing devices 102, storage manager 140, and/or secondary storage devices 108). In general, a node within the information management system 100 can be a logically and/or physically separate component, and in some cases is a component that is individually addressable or otherwise identifiable. In addition, each media agent 144 may operate on a dedicated secondary storage computing device 106 in some cases, while in other embodiments a plurality of media agents 144 operate on the same secondary storage computing device 106.
A media agent 144 (and corresponding media agent database 152) may be considered to be “associated with” a particular secondary storage device 108 if that media agent 144 is capable of one or more of: routing and/or storing data to the particular secondary storage device 108, coordinating the routing and/or storing of data to the particular secondary storage device 108, retrieving data from the particular secondary storage device 108, coordinating the retrieval of data from a particular secondary storage device 108, and modifying and/or deleting data retrieved from the particular secondary storage device 108.
While media agent(s) 144 are generally associated with one or more secondary storage devices 108, one or more media agents 144 in certain embodiments are physically separate from the secondary storage devices 108. For instance, the media agents 144 may operate on secondary storage computing devices 106 having different housings or packages than the secondary storage devices 108. In one example, a media agent 144 operates on a first server computer and is in communication with a secondary storage device(s) 108 operating in a separate, rack-mounted RAID-based system.
Where the information management system 100 includes multiple media agents 144 (see, e.g.,
In operation, a media agent 144 associated with a particular secondary storage device 108 may instruct the secondary storage device 108 to perform an information management operation. For instance, a media agent 144 may instruct a tape library to use a robotic arm or other retrieval means to load or eject a certain storage media, and to subsequently archive, migrate, or retrieve data to or from that media, e.g., for the purpose of restoring the data to a client computing device 102. As another example, a secondary storage device 108 may include an array of hard disk drives or solid state drives organized in a RAID configuration, and the media agent 144 may forward a logical unit number (LUN) and other appropriate information to the array, which uses the received information to execute the desired storage operation. The media agent 144 may communicate with a secondary storage device 108 via a suitable communications link, such as a SCSI or Fiber Channel link.
As shown, each media agent 144 may maintain an associated media agent database 152. The media agent database 152 may be stored in a disk or other storage device (not shown) that is local to the secondary storage computing device 106 on which the media agent 144 operates. In other cases, the media agent database 152 is stored remotely from the secondary storage computing device 106.
The media agent database 152 can include, among other things, an index 153 (see, e.g.,
A media agent index 153 or other data structure associated with the particular media agent 144 may include information about the stored data. For instance, for each secondary copy 116, the index 153 may include metadata such as a list of the data objects (e.g., files/subdirectories, database objects, mailbox objects, etc.), a path to the secondary copy 116 on the corresponding secondary storage device 108, location information indicating where the data objects are stored in the secondary storage device 108, when the data objects were created or modified, etc. Thus, the index 153 includes metadata associated with the secondary copies 116 that is readily available for use without having to be first retrieved from the secondary storage device 108. In yet further embodiments, some or all of the information in index 153 may instead or additionally be stored along with the secondary copies of data in a secondary storage device 108. In some embodiments, the secondary storage devices 108 can include sufficient information to perform a “bare metal restore”, where the operating system of a failed client computing device 102 or other restore target is automatically rebuilt as part of a restore operation.
Because the index 153 maintained in the media agent database 152 may operate as a cache, it can also be referred to as “an index cache.” In such cases, information stored in the index cache 153 typically comprises data that reflects certain particulars about storage operations that have occurred relatively recently. After some triggering event, such as after a certain period of time elapses, or the index cache 153 reaches a particular size, the index cache 153 may be copied or migrated to a secondary storage device(s) 108. This information may need to be retrieved and uploaded back into the index cache 153 or otherwise restored to a media agent 144 to facilitate retrieval of data from the secondary storage device(s) 108. In some embodiments, the cached information may include format or containerization information related to archives or other files stored on the storage device(s) 108. In this manner, the index cache 153 allows for accelerated restores.
In some alternative embodiments the media agent 144 generally acts as a coordinator or facilitator of storage operations between client computing devices 102 and corresponding secondary storage devices 108, but does not actually write the data to the secondary storage device 108. For instance, the storage manager 140 (or the media agent 144) may instruct a client computing device 102 and secondary storage device 108 to communicate with one another directly. In such a case the client computing device 102 transmits the data directly or via one or more intermediary components to the secondary storage device 108 according to the received instructions, and vice versa. In some such cases, the media agent 144 may still receive, process, and/or maintain metadata related to the storage operations. Moreover, in these embodiments, the payload data can flow through the media agent 144 for the purposes of populating the index cache 153 maintained in the media agent database 152, but not for writing to the secondary storage device 108.
The media agent 144 and/or other components such as the storage manager 140 may in some cases incorporate additional functionality, such as data classification, content indexing, deduplication, encryption, compression, and the like. Further details regarding these and other functions are described below.
Distributed, Scalable Architecture
As described, certain functions of the information management system 100 can be distributed amongst various physical and/or logical components in the system. For instance, one or more of the storage manager 140, data agents 142, and media agents 144 may operate on computing devices that are physically separate from one another. This architecture can provide a number of benefits.
For instance, hardware and software design choices for each distributed component can be targeted to suit its particular function. The secondary computing devices 106 on which the media agents 144 operate can be tailored for interaction with associated secondary storage devices 108 and provide fast index cache operation, among other specific tasks. Similarly, the client computing device(s) 102 can be selected to effectively service the applications 110 thereon, in order to efficiently produce and store primary data 112.
Moreover, in some cases, one or more of the individual components in the information management system 100 can be distributed to multiple, separate computing devices. As one example, for large file systems where the amount of data stored in the management database 146 is relatively large, the database 146 may be migrated to or otherwise reside on a specialized database server (e.g., an SQL server) separate from a server that implements the other functions of the storage manager 140. This distributed configuration can provide added protection because the database 146 can be protected with standard database utilities (e.g., SQL log shipping or database replication) independent from other functions of the storage manager 140. The database 146 can be efficiently replicated to a remote site for use in the event of a disaster or other data loss at the primary site. Or the database 146 can be replicated to another computing device within the same site, such as to a higher performance machine in the event that a storage manager host device can no longer service the needs of a growing information management system 100.
The distributed architecture also provides both scalability and efficient component utilization.
Additional components can be added or subtracted based on the evolving needs of the information management system 100. For instance, depending on where bottlenecks are identified, administrators can add additional client computing devices 102, secondary storage computing devices 106 (and corresponding media agents 144), and/or secondary storage devices 108. Moreover, where multiple fungible components are available, load balancing can be implemented to dynamically address identified bottlenecks. As an example, the storage manager 140 may dynamically select which media agents 144 and/or secondary storage devices 108 to use for storage operations based on a processing load analysis of the media agents 144 and/or secondary storage devices 108, respectively.
Moreover, each client computing device 102 in some embodiments can communicate with, among other components, any of the media agents 144, e.g., as directed by the storage manager 140. And each media agent 144 may be able to communicate with, among other components, any of the secondary storage devices 108, e.g., as directed by the storage manager 140. Thus, operations can be routed to the secondary storage devices 108 in a dynamic and highly flexible manner, to provide load balancing, failover, and the like. Further examples of scalable systems capable of dynamic storage operations, and of systems capable of performing load balancing and fail over are provided in U.S. Pat. No. 7,246,207, which is incorporated by reference herein.
In alternative configurations, certain components are not distributed and may instead reside and execute on the same computing device. For example, in some embodiments, one or more data agents 142 and the storage manager 140 operate on the same client computing device 102. In another embodiment, one or more data agents 142 and one or more media agents 144 operate on a single computing device.
Exemplary Types of Information Management Operations
In order to protect and leverage stored data, the information management system 100 can be configured to perform a variety of information management operations. As will be described, these operations can generally include secondary copy and other data movement operations, processing and data manipulation operations, analysis, reporting, and management operations. The operations described herein may be performed on any type of computing device, e.g., between two computers connected via a LAN, to a mobile client telecommunications device connected to a server via a WLAN, to any manner of client computing device coupled to a cloud storage target, etc., without limitation.
Data Movement Operations
Data movement operations according to certain embodiments are generally operations that involve the copying or migration of data (e.g., payload data) between different locations in the information management system 100 in an original/native and/or one or more different formats. For example, data movement operations can include operations in which stored data is copied, migrated, or otherwise transferred from one or more first storage devices to one or more second storage devices, such as from primary storage device(s) 104 to secondary storage device(s) 108, from secondary storage device(s) 108 to different secondary storage device(s) 108, from secondary storage devices 108 to primary storage devices 104, or from primary storage device(s) 104 to different primary storage device(s) 104.
Data movement operations can include by way of example, backup operations, archive operations, information lifecycle management operations such as hierarchical storage management operations, replication operations (e.g., continuous data replication operations), snapshot operations, deduplication or single-instancing operations, auxiliary copy operations, and the like. As will be discussed, some of these operations involve the copying, migration or other movement of data, without actually creating multiple, distinct copies. Nonetheless, some or all of these operations are referred to as “copy” operations for simplicity.
Backup Operations
A backup operation creates a copy of a version of data (e.g., one or more files or other data units) in primary data 112 at a particular point in time. Each subsequent backup copy may be maintained independently of the first. Further, a backup copy in some embodiments is generally stored in a form that is different than the native format, e.g., a backup format. This can be in contrast to the version in primary data 112 from which the backup copy is derived, and which may instead be stored in a native format of the source application(s) 110. In various cases, backup copies can be stored in a format in which the data is compressed, encrypted, deduplicated, and/or otherwise modified from the original application format. For example, a backup copy may be stored in a backup format that facilitates compression and/or efficient long-term storage.
Backup copies can have relatively long retention periods as compared to primary data 112, and may be stored on media with slower retrieval times than primary data 112 and certain other types of secondary copies 116. On the other hand, backups may have relatively shorter retention periods than some other types of secondary copies 116, such as archive copies (described below). Backups may sometimes be stored at an offsite location.
Backup operations can include full backups, differential backups, incremental backups, “synthetic full” backups, and/or creating a “reference copy.” A full backup (or “standard full backup”) in some embodiments is generally a complete image of the data to be protected. However, because full backup copies can consume a relatively large amount of storage, it can be useful to use a full backup copy as a baseline and only store changes relative to the full backup copy for subsequent backup copies.
For instance, a differential backup operation (or cumulative incremental backup operation) tracks and stores changes that have occurred since the last full backup. Differential backups can grow quickly in size, but can provide relatively efficient restore times because a restore can be completed in some cases using only the full backup copy and the latest differential copy.
An incremental backup operation generally tracks and stores changes since the most recent backup copy of any type, which can greatly reduce storage utilization. In some cases, however, restore times can be relatively long in comparison to full or differential backups because completing a restore operation may involve accessing a full backup in addition to multiple incremental backups.
Synthetic full backups generally consolidate data without directly backing up data from the client computing device. A synthetic full backup is created from the most recent full backup (i.e., standard or synthetic) and subsequent incremental and/or differential backups. The resulting synthetic full backup is identical to what would have been created had the last backup for the subclient been a standard full backup. Unlike standard full, incremental, and differential backups, a synthetic full backup does not actually transfer data from a client computer to the backup media, because it operates as a backup consolidator. A synthetic full backup extracts the index data of each participating subclient. Using this index data and the previously backed up user data images, it builds new full backup images, one for each subclient. The new backup images consolidate the index and user data stored in the related incremental, differential, and previous full backups, in some embodiments creating an archive file at the subclient level.
Any of the above types of backup operations can be at the volume-level, file-level, or block-level. Volume level backup operations generally involve the copying of a data volume (e.g., a logical disk or partition) as a whole. In a file-level backup, the information management system 100 may generally track changes to individual files, and includes copies of files in the backup copy. In the case of a block-level backup, files are broken into constituent blocks, and changes are tracked at the block-level. Upon restore, the information management system 100 reassembles the blocks into files in a transparent fashion.
Far less data may actually be transferred and copied to the secondary storage devices 108 during a file-level copy than a volume-level copy. Likewise, a block-level copy may involve the transfer of less data than a file-level copy, resulting in faster execution times. However, restoring a relatively higher-granularity copy can result in longer restore times. For instance, when restoring a block-level copy, the process of locating constituent blocks can sometimes result in longer restore times as compared to file-level backups. Similar to backup operations, the other types of secondary copy operations described herein can also be implemented at either the volume-level, file-level, or block-level.
For example, in some embodiments, a reference copy may comprise copy(ies) of selected objects from backed up data, typically to help organize data by keeping contextual information from multiple sources together, and/or help retain specific data for a longer period of time, such as for legal hold needs. A reference copy generally maintains data integrity, and when the data is restored, it may be viewed in the same format as the source data. In some embodiments, a reference copy is based on a specialized client, individual subclient and associated information management policies (e.g., storage policy, retention policy, etc.) that are administered within information management system 100.
Archive Operations
Because backup operations generally involve maintaining a version of the copied data in primary data 112 and also maintaining backup copies in secondary storage device(s) 108, they can consume significant storage capacity. To help reduce storage consumption, an archive operation according to certain embodiments creates a secondary copy 116 by both copying and removing source data. Or, seen another way, archive operations can involve moving some or all of the source data to the archive destination. Thus, data satisfying criteria for removal (e.g., data of a threshold age or size) may be removed from source storage. The source data may be primary data 112 or a secondary copy 116, depending on the situation. As with backup copies, archive copies can be stored in a format in which the data is compressed, encrypted, deduplicated, and/or otherwise modified from the format of the original application or source copy. In addition, archive copies may be retained for relatively long periods of time (e.g., years) and, in some cases, are never deleted. Archive copies are generally retained for longer periods of time than backup copies, for example. In certain embodiments, archive copies may be made and kept for extended periods in order to meet compliance regulations.
Moreover, when primary data 112 is archived, in some cases the corresponding primary data 112 or a portion thereof is deleted when creating the archive copy. Thus, archiving can serve the purpose of freeing up space in the primary storage device(s) 104 and easing the demand on computational resources on client computing device 102. Similarly, when a secondary copy 116 is archived, the secondary copy 116 may be deleted, and an archive copy can therefore serve the purpose of freeing up space in secondary storage device(s) 108. In contrast, source copies often remain intact when creating backup copies. Examples of compatible data archiving operations are provided in U.S. Pat. No. 7,107,298, which is incorporated by reference herein.
Snapshot Operations
Snapshot operations can provide a relatively lightweight, efficient mechanism for protecting data. From an end-user viewpoint, a snapshot may be thought of as an “instant” image of the primary data 112 at a given point in time, and may include state and/or status information relative to an application that creates/manages the primary data 112. In one embodiment, a snapshot may generally capture the directory structure of an object in primary data 112 such as a file or volume or other data set at a particular moment in time and may also preserve file attributes and contents. A snapshot in some cases is created relatively quickly, e.g., substantially instantly, using a minimum amount of file space, but may still function as a conventional file system backup.
A “hardware snapshot” (or “hardware-based snapshot”) operation can be a snapshot operation where a target storage device (e.g., a primary storage device 104 or a secondary storage device 108) performs the snapshot operation in a self-contained fashion, substantially independently, using hardware, firmware and/or software operating on the storage device itself. For instance, the storage device may be capable of performing snapshot operations upon request, generally without intervention or oversight from any of the other components in the information management system 100. In this manner, hardware snapshots can off-load other components of information management system 100 from processing involved in snapshot creation and management.
A “software snapshot” (or “software-based snapshot”) operation, on the other hand, can be a snapshot operation in which one or more other components in information management system 100 (e.g., client computing devices 102, data agents 142, etc.) implement a software layer that manages the snapshot operation via interaction with the target storage device. For instance, the component executing the snapshot management software layer may derive a set of pointers and/or data that represents the snapshot. The snapshot management software layer may then transmit the same to the target storage device, along with appropriate instructions for writing the snapshot.
Some types of snapshots do not actually create another physical copy of all the data as it existed at the particular point in time, but may simply create pointers that are able to map files and directories to specific memory locations (e.g., to specific disk blocks) where the data resides, as it existed at the particular point in time. For example, a snapshot copy may include a set of pointers derived from the file system or from an application. In some other cases, the snapshot may be created at the block-level, such that creation of the snapshot occurs without awareness of the file system. Each pointer points to a respective stored data block, so that collectively, the set of pointers reflect the storage location and state of the data object (e.g., file(s) or volume(s) or data set(s)) at a particular point in time when the snapshot copy was created.
An initial snapshot may use only a small amount of disk space needed to record a mapping or other data structure representing or otherwise tracking the blocks that correspond to the current state of the file system. Additional disk space is usually required only when files and directories are modified later on. Furthermore, when files are modified, typically only the pointers which map to blocks are copied, not the blocks themselves. In some embodiments, for example in the case of “copy-on-write” snapshots, when a block changes in primary storage, the block is copied to secondary storage or cached in primary storage before the block is overwritten in primary storage, and the pointer to that block is changed to reflect the new location of that block. The snapshot mapping of file system data may also be updated to reflect the changed block(s) at that particular point in time. In some other cases, a snapshot includes a full physical copy of all or substantially all of the data represented by the snapshot. Further examples of snapshot operations are provided in U.S. Pat. No. 7,529,782, which is incorporated by reference herein.
A snapshot copy in many cases can be made quickly and without significantly impacting primary computing resources because large amounts of data need not be copied or moved. In some embodiments, a snapshot may exist as a virtual file system, parallel to the actual file system. Users in some cases gain read-only access to the record of files and directories of the snapshot. By electing to restore primary data 112 from a snapshot taken at a given point in time, users may also return the current file system to the state of the file system that existed when the snapshot was taken.
Replication Operations
Another type of secondary copy operation is a replication operation. Some types of secondary copies 116 are used to periodically capture images of primary data 112 at particular points in time (e.g., backups, archives, and snapshots). However, it can also be useful for recovery purposes to protect primary data 112 in a more continuous fashion, by replicating the primary data 112 substantially as changes occur. In some cases a replication copy can be a mirror copy, for instance, where changes made to primary data 112 are mirrored or substantially immediately copied to another location (e.g., to secondary storage device(s) 108). By copying each write operation to the replication copy, two storage systems are kept synchronized or substantially synchronized so that they are virtually identical at approximately the same time. Where entire disk volumes are mirrored, however, mirroring can require significant amount of storage space and utilizes a large amount of processing resources.
According to some embodiments storage operations are performed on replicated data that represents a recoverable state, or “known good state” of a particular application running on the source system. For instance, in certain embodiments, known good replication copies may be viewed as copies of primary data 112. This feature allows the system to directly access, copy, restore, backup or otherwise manipulate the replication copies as if the data were the “live” primary data 112. This can reduce access time, storage utilization, and impact on source applications 110, among other benefits. Based on known good state information, the information management system 100 can replicate sections of application data that represent a recoverable state rather than rote copying of blocks of data. Examples of compatible replication operations (e.g., continuous data replication) are provided in U.S. Pat. No. 7,617,262, which is incorporated by reference herein.
Deduplication/Single-Instancing Operations
Another type of data movement operation is deduplication or single-instance storage, which is useful to reduce the amount of non-primary data. For instance, some or all of the above-described secondary storage operations can involve deduplication in some fashion. New data is read, broken down into portions (e.g., sub-file level blocks, files, etc.) of a selected granularity, compared with blocks that are already in secondary storage, and only the new blocks are stored. Blocks that already exist are represented as pointers to the already stored data.
In order to streamline the comparison process, the information management system 100 may calculate and/or store signatures (e.g., hashes or cryptographically unique IDs) corresponding to the individual data blocks in a database and compare the signatures instead of comparing entire data blocks. In some cases, only a single instance of each element is stored, and deduplication operations may therefore be referred to interchangeably as “single-instancing” operations. Depending on the implementation, however, deduplication or single-instancing operations can store more than one instance of certain data blocks, but nonetheless significantly reduce data redundancy. Depending on the embodiment, deduplication blocks can be of fixed or variable length. Using variable length blocks can provide enhanced deduplication by responding to changes in the data stream, but can involve complex processing. In some cases, the information management system 100 utilizes a technique for dynamically aligning deduplication blocks (e.g., fixed-length blocks) based on changing content in the data stream, as described in U.S. Pat. No. 8,364,652, which is incorporated by reference herein.
The information management system 100 can perform deduplication in a variety of manners at a variety of locations in the information management system 100. For instance, in some embodiments, the information management system 100 implements “target-side” deduplication by deduplicating data (e.g., secondary copies 116) stored in the secondary storage devices 108. In some such cases, the media agents 144 are generally configured to manage the deduplication process. For instance, one or more of the media agents 144 maintain a corresponding deduplication database that stores deduplication information (e.g., datablock signatures). Examples of such a configuration are provided in U.S. Pat. Pub. No. 2012/0150826, which is incorporated by reference herein. Instead of or in combination with “target-side” deduplication, deduplication can also be performed on the “source-side” (or “client-side”), e.g., to reduce the amount of traffic between the media agents 144 and the client computing device(s) 102 and/or reduce redundant data stored in the primary storage devices 104. According to various implementations, one or more of the storage devices of the target-side and/or source-side of an operation can be cloud-based storage devices. Thus, the target-side and/or source-side deduplication can be cloud-based deduplication. In particular, as discussed previously, the storage manager 140 may communicate with other components within the information management system 100 via network protocols and cloud service provider APIs to facilitate cloud-based deduplication/single instancing. Examples of such deduplication techniques are provided in U.S. Pat. Pub. No. 2012/0150818, which is incorporated by reference herein. Some other compatible deduplication/single instancing techniques are described in U.S. Pat. Pub. Nos. 2006/0224846 and 2009/0319534, which are incorporated by reference herein.
Information Lifecycle Management and Hierarchical Storage Management Operations
In some embodiments, files and other data over their lifetime move from more expensive, quick access storage to less expensive, slower access storage. Operations associated with moving data through various tiers of storage are sometimes referred to as information lifecycle management (ILM) operations.
One type of ILM operation is a hierarchical storage management (HSM) operation. A HSM operation is generally an operation for automatically moving data between classes of storage devices, such as between high-cost and low-cost storage devices. For instance, an HSM operation may involve movement of data from primary storage devices 104 to secondary storage devices 108, or between tiers of secondary storage devices 108. With each tier, the storage devices may be progressively relatively cheaper, have relatively slower access/restore times, etc. For example, movement of data between tiers may occur as data becomes less important over time.
In some embodiments, an HSM operation is similar to an archive operation in that creating an HSM copy may (though not always) involve deleting some of the source data, e.g., according to one or more criteria related to the source data. For example, an HSM copy may include data from primary data 112 or a secondary copy 116 that is larger than a given size threshold or older than a given age threshold and that is stored in a backup format.
Often, and unlike some types of archive copies, HSM data that is removed or aged from the source is replaced by a logical reference pointer or stub. The reference pointer or stub can be stored in the primary storage device 104 (or other source storage device, such as a secondary storage device 108) to replace the deleted source data and to point to or otherwise indicate the new location in a secondary storage device 108.
According to one example, files are generally moved between higher and lower cost storage depending on how often the files are accessed. When a user requests access to the HSM data that has been removed or migrated, the information management system 100 uses the stub to locate the data and may make recovery of the data appear transparent, even though the HSM data may be stored at a location different from other source data. In this manner, the data appears to the user (e.g., in file system browsing windows and the like) as if it still resides in the source location (e.g., in a primary storage device 104). The stub may also include some metadata associated with the corresponding data, so that a file system and/or application can provide some information about the data object and/or a limited-functionality version (e.g., a preview) of the data object.
An HSM copy may be stored in a format other than the native application format (e.g., where the data is compressed, encrypted, deduplicated, and/or otherwise modified from the original native application format). In some cases, copies which involve the removal of data from source storage and the maintenance of stub or other logical reference information on source storage may be referred to generally as “on-line archive copies”. On the other hand, copies which involve the removal of data from source storage without the maintenance of stub or other logical reference information on source storage may be referred to as “off-line archive copies”. Examples of HSM and ILM techniques are provided in U.S. Pat. No. 7,343,453, which is incorporated by reference herein.
Auxiliary Copy and Disaster Recovery Operations
An auxiliary copy is generally a copy operation in which a copy is created of an existing secondary copy 116. For instance, an initial secondary copy 116 may be generated using or otherwise be derived from primary data 112 (or other data residing in the secondary storage subsystem 118), whereas an auxiliary copy is generated from the initial secondary copy 116. Auxiliary copies can be used to create additional standby copies of data and may reside on different secondary storage devices 108 than the initial secondary copies 116. Thus, auxiliary copies can be used for recovery purposes if initial secondary copies 116 become unavailable. Exemplary compatible auxiliary copy techniques are described in further detail in U.S. Pat. No. 8,230,195, which is incorporated by reference herein.
The information management system 100 may also perform disaster recovery operations that make or retain disaster recovery copies, often as secondary, high-availability disk copies. The information management system 100 may create secondary disk copies and store the copies at disaster recovery locations using auxiliary copy or replication operations, such as continuous data replication technologies. Depending on the particular data protection goals, disaster recovery locations can be remote from the client computing devices 102 and primary storage devices 104, remote from some or all of the secondary storage devices 108, or both.
Data Analysis, Reporting, and Management Operations
Data analysis, reporting, and management operations can be different than data movement operations in that they do not necessarily involve the copying, migration or other transfer of data (e.g., primary data 112 or secondary copies 116) between different locations in the system. For instance, data analysis operations may involve processing (e.g., offline processing) or modification of already stored primary data 112 and/or secondary copies 116. However, in some embodiments data analysis operations are performed in conjunction with data movement operations. Some data analysis operations include content indexing operations and classification operations which can be useful in leveraging the data under management to provide enhanced search and other features. Other data analysis operations such as compression and encryption can provide data reduction and security benefits, respectively.
Classification Operations/Content Indexing
In some embodiments, the information management system 100 analyzes and indexes characteristics, content, and metadata associated with the primary data 112 and/or secondary copies 116. The content indexing can be used to identify files or other data objects having pre-defined content (e.g., user-defined keywords or phrases, other keywords/phrases that are not defined by a user, etc.), and/or metadata (e.g., email metadata such as “to”, “from”, “cc”, “bcc”, attachment name, received time, etc.).
The information management system 100 generally organizes and catalogues the results in a content index, which may be stored within the media agent database 152, for example. The content index can also include the storage locations of (or pointer references to) the indexed data in the primary data 112 or secondary copies 116, as appropriate. The results may also be stored, in the form of a content index database or otherwise, elsewhere in the information management system 100 (e.g., in the primary storage devices 104, or in the secondary storage device 108). Such index data provides the storage manager 140 or another component with an efficient mechanism for locating primary data 112 and/or secondary copies 116 of data objects that match particular criteria.
For instance, search criteria can be specified by a user through user interface 158 of the storage manager 140. In some cases, the information management system 100 analyzes data and/or metadata in secondary copies 116 to create an “off-line” content index, without significantly impacting the performance of the client computing devices 102. Depending on the embodiment, the system can also implement “on-line” content indexing, e.g., of primary data 112. Examples of compatible content indexing techniques are provided in U.S. Pat. No. 8,170,995, which is incorporated by reference herein.
One or more components can be configured to scan data and/or associated metadata for classification purposes to populate a database (or other data structure) of information, which can be referred to as a “data classification database” or a “metabase”. Depending on the embodiment, the data classification database(s) can be organized in a variety of different ways, including centralization, logical sub-divisions, and/or physical sub-divisions. For instance, one or more centralized data classification databases may be associated with different subsystems or tiers within the information management system 100. As an example, there may be a first centralized metabase associated with the primary storage subsystem 117 and a second centralized metabase associated with the secondary storage subsystem 118. In other cases, there may be one or more metabases associated with individual components, e.g., client computing devices 102 and/or media agents 144. In some embodiments, a data classification database (metabase) may reside as one or more data structures within management database 146, or may be otherwise associated with storage manager 140.
In some cases, the metabase(s) may be included in separate database(s) and/or on separate storage device(s) from primary data 112 and/or secondary copies 116, such that operations related to the metabase do not significantly impact performance on other components in the information management system 100. In other cases, the metabase(s) may be stored along with primary data 112 and/or secondary copies 116. Files or other data objects can be associated with identifiers (e.g., tag entries, etc.) in the media agent 144 (or other indices) to facilitate searches of stored data objects. Among a number of other benefits, the metabase can also allow efficient, automatic identification of files or other data objects to associate with secondary copy or other information management operations (e.g., in lieu of scanning an entire file system). Examples of compatible metabases and data classification operations are provided in U.S. Pat. Nos. 8,229,954 and 7,747,579, which are incorporated by reference herein.
Encryption Operations
The information management system 100 in some cases is configured to process data (e.g., files or other data objects, secondary copies 116, etc.), according to an appropriate encryption algorithm (e.g., Blowfish, Advanced Encryption Standard [AES], Triple Data Encryption Standard [3-DES], etc.) to limit access and provide data security in the information management system 100. The information management system 100 in some cases encrypts the data at the client level, such that the client computing devices 102 (e.g., the data agents 142) encrypt the data prior to forwarding the data to other components, e.g., before sending the data to media agents 144 during a secondary copy operation. In such cases, the client computing device 102 may maintain or have access to an encryption key or passphrase for decrypting the data upon restore. Encryption can also occur when creating copies of secondary copies, e.g., when creating auxiliary copies or archive copies. In yet further embodiments, the secondary storage devices 108 can implement built-in, high performance hardware encryption.
Management and Reporting Operations
Certain embodiments leverage the integrated, ubiquitous nature of the information management system 100 to provide useful system-wide management and reporting functions. Examples of some compatible management and reporting techniques are provided in U.S. Pat. No. 7,343,453, which is incorporated by reference herein.
Operations management can generally include monitoring and managing the health and performance of information management system 100 by, without limitation, performing error tracking, generating granular storage/performance metrics (e.g., job success/failure information, deduplication efficiency, etc.), generating storage modeling and costing information, and the like. As an example, a storage manager 140 or other component in the information management system 100 may analyze traffic patterns and suggest and/or automatically route data via a particular route to minimize congestion. In some embodiments, the system can generate predictions relating to storage operations or storage operation information. Such predictions, which may be based on a trending analysis, may predict various network operations or resource usage, such as network traffic levels, storage media use, use of bandwidth of communication links, use of media agent components, etc. Further examples of traffic analysis, trend analysis, prediction generation, and the like are described in U.S. Pat. No. 7,343,453, which is incorporated by reference herein.
In some configurations, a master storage manager 140 may track the status of storage operation cells in a hierarchy, such as the status of jobs, system components, system resources, and other items, by communicating with storage managers 140 (or other components) in the respective storage operation cells. Moreover, the master storage manager 140 may track the status of its associated storage operation cells and information management operations by receiving periodic status updates from the storage managers 140 (or other components) in the respective cells regarding jobs, system components, system resources, and other items. In some embodiments, a master storage manager 140 may store status information and other information regarding its associated storage operation cells and other system information in its index 150 (or other location).
The master storage manager 140 or other component may also determine whether certain storage-related criteria or other criteria are satisfied, and perform an action or trigger event (e.g., data migration) in response to the criteria being satisfied, such as where a storage threshold is met for a particular volume, or where inadequate protection exists for certain data. For instance, in some embodiments, data from one or more storage operation cells is used to dynamically and automatically mitigate recognized risks, and/or to advise users of risks or suggest actions to mitigate these risks. For example, an information management policy may specify certain requirements (e.g., that a storage device should maintain a certain amount of free space, that secondary copies should occur at a particular interval, that data should be aged and migrated to other storage after a particular period, that data on a secondary volume should always have a certain level of availability and be restorable within a given time period, that data on a secondary volume may be mirrored or otherwise migrated to a specified number of other volumes, etc.). If a risk condition or other criterion is triggered, the system may notify the user of these conditions and may suggest (or automatically implement) an action to mitigate or otherwise address the risk. For example, the system may indicate that data from a primary copy 112 should be migrated to a secondary storage device 108 to free space on the primary storage device 104. Examples of the use of risk factors and other triggering criteria are described in U.S. Pat. No. 7,343,453, which is incorporated by reference herein.
In some embodiments, the system 100 may also determine whether a metric or other indication satisfies particular storage criteria and, if so, perform an action. For example, as previously described, a storage policy or other definition might indicate that a storage manager 140 should initiate a particular action if a storage metric or other indication drops below or otherwise fails to satisfy specified criteria such as a threshold of data protection. Examples of such metrics are described in U.S. Pat. No. 7,343,453, which is incorporated by reference herein.
In some embodiments, risk factors may be quantified into certain measurable service or risk levels for ease of comprehension. For example, certain applications and associated data may be considered to be more important by an enterprise than other data and services. Financial compliance data, for example, may be of greater importance than marketing materials, etc. Network administrators may assign priority values or “weights” to certain data and/or applications, corresponding to the relative importance. The level of compliance of storage operations specified for these applications may also be assigned a certain value. Thus, the health, impact, and overall importance of a service may be determined, such as by measuring the compliance value and calculating the product of the priority value and the compliance value to determine the “service level” and comparing it to certain operational thresholds to determine whether it is acceptable. Further examples of the service level determination are provided in U.S. Pat. No. 7,343,453, which is incorporated by reference herein.
The system 100 may additionally calculate data costing and data availability associated with information management operation cells according to an embodiment of the invention. For instance, data received from the cell may be used in conjunction with hardware-related information and other information about system elements to determine the cost of storage and/or the availability of particular data in the system. Exemplary information generated could include how fast a particular department is using up available storage space, how long data would take to recover over a particular system pathway from a particular secondary storage device, costs over time, etc. Moreover, in some embodiments, such information may be used to determine or predict the overall cost associated with the storage of certain information. The cost associated with hosting a certain application may be based, at least in part, on the type of media on which the data resides, for example. Storage devices may be assigned to a particular cost categories, for example. Further examples of costing techniques are described in U.S. Pat. No. 7,343,453, which is incorporated by reference herein.
Any of the above types of information (e.g., information related to trending, predictions, job, cell or component status, risk, service level, costing, etc.) can generally be provided to users via the user interface 158 in a single, integrated view or console (not shown). The console may support a reporting capability that allows for the generation of a variety of reports, which may be tailored to a particular aspect of information management. Report types may include: scheduling, event management, media management and data aging. Available reports may also include backup history, data aging history, auxiliary copy history, job history, library and drive, media in library, restore history, and storage policy, etc., without limitation. Such reports may be specified and created at a certain point in time as a system analysis, forecasting, or provisioning tool. Integrated reports may also be generated that illustrate storage and performance metrics, risks and storage costing information. Moreover, users may create their own reports based on specific needs.
The integrated user interface 158 can include an option to show a “virtual view” of the system that graphically depicts the various components in the system using appropriate icons. As one example, the user interface 158 may provide a graphical depiction of one or more primary storage devices 104, the secondary storage devices 108, data agents 142 and/or media agents 144, and their relationship to one another in the information management system 100. The operations management functionality can facilitate planning and decision-making. For example, in some embodiments, a user may view the status of some or all jobs as well as the status of each component of the information management system 100. Users may then plan and make decisions based on this data. For instance, a user may view high-level information regarding storage operations for the information management system 100, such as job status, component status, resource status (e.g., communication pathways, etc.), and other information. The user may also drill down or use other means to obtain more detailed information regarding a particular component, job, or the like. Further examples of some reporting techniques and associated interfaces providing an integrated view of an information management system are provided in U.S. Pat. No. 7,343,453, which is incorporated by reference herein.
The information management system 100 can also be configured to perform system-wide e-discovery operations in some embodiments. In general, e-discovery operations provide a unified collection and search capability for data in the system, such as data stored in the secondary storage devices 108 (e.g., backups, archives, or other secondary copies 116). For example, the information management system 100 may construct and maintain a virtual repository for data stored in the information management system 100 that is integrated across source applications 110, different storage device types, etc. According to some embodiments, e-discovery utilizes other techniques described herein, such as data classification and/or content indexing.
Information Management Policies
As indicated previously, an information management policy 148 can include a data structure or other information source that specifies a set of parameters (e.g., criteria and rules) associated with secondary copy and/or other information management operations.
One type of information management policy 148 is a storage policy. According to certain embodiments, a storage policy generally comprises a data structure or other information source that defines (or includes information sufficient to determine) a set of preferences or other criteria for performing information management operations. Storage policies can include one or more of the following items: (1) what data will be associated with the storage policy; (2) a destination to which the data will be stored; (3) datapath information specifying how the data will be communicated to the destination; (4) the type of storage operation to be performed; and (5) retention information specifying how long the data will be retained at the destination (see, e.g.,
As an illustrative example, data associated with a storage policy can be logically organized into groups. In some cases, these logical groupings can be referred to as “sub-clients”. A sub-client may represent static or dynamic associations of portions of a data volume. Sub-clients may represent mutually exclusive portions. Thus, in certain embodiments, a portion of data may be given a label and the association is stored as a static entity in an index, database or other storage location. Sub-clients may also be used as an effective administrative scheme of organizing data according to data type, department within the enterprise, storage preferences, or the like. Depending on the configuration, sub-clients can correspond to files, folders, virtual machines, databases, etc. In one exemplary scenario, an administrator may find it preferable to separate e-mail data from financial data using two different sub-clients.
A storage policy can define where data is stored by specifying a target or destination storage device (or group of storage devices). For instance, where the secondary storage device 108 includes a group of disk libraries, the storage policy may specify a particular disk library for storing the sub-clients associated with the policy. As another example, where the secondary storage devices 108 include one or more tape libraries, the storage policy may specify a particular tape library for storing the sub-clients associated with the storage policy, and may also specify a drive pool and a tape pool defining a group of tape drives and a group of tapes, respectively, for use in storing the sub-client data. While information in the storage policy can be statically assigned in some cases, some or all of the information in the storage policy can also be dynamically determined based on criteria, which can be set forth in the storage policy. For instance, based on such criteria, a particular destination storage device(s) (or other parameter of the storage policy) may be determined based on characteristics associated with the data involved in a particular storage operation, device availability (e.g., availability of a secondary storage device 108 or a media agent 144), network status and conditions (e.g., identified bottlenecks), user credentials, and the like).
Datapath information can also be included in the storage policy. For instance, the storage policy may specify network pathways and components to utilize when moving the data to the destination storage device(s). In some embodiments, the storage policy specifies one or more media agents 144 for conveying data associated with the storage policy between the source (e.g., one or more host client computing devices 102) and destination (e.g., a particular target secondary storage device 108).
A storage policy can also specify the type(s) of operations associated with the storage policy, such as a backup, archive, snapshot, auxiliary copy, or the like. Retention information can specify how long the data will be kept, depending on organizational needs (e.g., a number of days, months, years, etc.)
Another type of information management policy 148 is a scheduling policy, which specifies when and how often to perform operations. Scheduling parameters may specify with what frequency (e.g., hourly, weekly, daily, event-based, etc.) or under what triggering conditions secondary copy or other information management operations will take place. Scheduling policies in some cases are associated with particular components, such as particular logical groupings of data associated with a storage policy (e.g., a sub-client), client computing device 102, and the like. In one configuration, a separate scheduling policy is maintained for particular logical groupings of data on a client computing device 102. The scheduling policy specifies that those logical groupings are to be moved to secondary storage devices 108 every hour according to storage policies associated with the respective sub-clients.
When adding a new client computing device 102, administrators can manually configure information management policies 148 and/or other settings, e.g., via the user interface 158. However, this can be an involved process resulting in delays, and it may be desirable to begin data protection operations quickly, without awaiting human intervention. Thus, in some embodiments, the information management system 100 automatically applies a default configuration to client computing device 102. As one example, when one or more data agent(s) 142 are installed on one or more client computing devices 102, the installation script may register the client computing device 102 with the storage manager 140, which in turn applies the default configuration to the new client computing device 102. In this manner, data protection operations can begin substantially immediately. The default configuration can include a default storage policy, for example, and can specify any appropriate information sufficient to begin data protection operations. This can include a type of data protection operation, scheduling information, a target secondary storage device 108, data path information (e.g., a particular media agent 144), and the like.
Other types of information management policies 148 are possible, including one or more audit (or security) policies. An audit policy is a set of preferences, rules and/or criteria that protect sensitive data in the information management system 100. For example, an audit policy may define “sensitive objects” as files or objects that contain particular keywords (e.g., “confidential,” or “privileged”) and/or are associated with particular keywords (e.g., in metadata) or particular flags (e.g., in metadata identifying a document or email as personal, confidential, etc.). An audit policy may further specify rules for handling sensitive objects. As an example, an audit policy may require that a reviewer approve the transfer of any sensitive objects to a cloud storage site, and that if approval is denied for a particular sensitive object, the sensitive object should be transferred to a local primary storage device 104 instead. To facilitate this approval, the audit policy may further specify how a secondary storage computing device 106 or other system component should notify a reviewer that a sensitive object is slated for transfer.
Another type of information management policy 148 is a provisioning policy. A provisioning policy can include a set of preferences, priorities, rules, and/or criteria that specify how client computing devices 102 (or groups thereof) may utilize system resources, such as available storage on cloud storage and/or network bandwidth. A provisioning policy specifies, for example, data quotas for particular client computing devices 102 (e.g., a number of gigabytes that can be stored monthly, quarterly or annually). The storage manager 140 or other components may enforce the provisioning policy. For instance, the media agents 144 may enforce the policy when transferring data to secondary storage devices 108. If a client computing device 102 exceeds a quota, a budget for the client computing device 102 (or associated department) is adjusted accordingly or an alert may trigger.
While the above types of information management policies 148 have been described as separate policies, one or more of these can be generally combined into a single information management policy 148. For instance, a storage policy may also include or otherwise be associated with one or more scheduling, audit, or provisioning policies or operational parameters thereof. Moreover, while storage policies are typically associated with moving and storing data, other policies may be associated with other types of information management operations. The following is a non-exhaustive list of items the information management policies 148 may specify:
Policies can additionally specify or depend on a variety of historical or current criteria that may be used to determine which rules to apply to a particular data object, system component, or information management operation, such as:
As indicated by the dashed box, the second media agent 144B and the tape library 108B are “off-site”, and may therefore be remotely located from the other components in the information management system 100 (e.g., in a different city, office building, etc.). Indeed, “off-site” may refer to a magnetic tape located in storage, which must be manually retrieved and loaded into a tape drive to be read. In this manner, information stored on the tape library 108B may provide protection in the event of a disaster or other failure.
The file system sub-client and its associated primary data 112A in certain embodiments generally comprise information generated by the file system and/or operating system of the client computing device 102, and can include, for example, file system data (e.g., regular files, file tables, mount points, etc.), operating system data (e.g., registries, event logs, etc.), and the like. The e-mail sub-client, on the other hand, and its associated primary data 112B, include data generated by an e-mail application operating on the client computing device 102, and can include mailbox information, folder information, emails, attachments, associated database information, and the like. As described above, the sub-clients can be logical containers, and the data included in the corresponding primary data 112A, 112B may or may not be stored contiguously.
The exemplary storage policy 148A includes backup copy preferences (or rule set) 160, disaster recovery copy preferences rule set 162, and compliance copy preferences or rule set 164. The backup copy rule set 160 specifies that it is associated with a file system sub-client 166 and an email sub-client 168. Each of these sub-clients 166, 168 are associated with the particular client computing device 102. The backup copy rule set 160 further specifies that the backup operation will be written to the disk library 108A, and designates a particular media agent 144A to convey the data to the disk library 108A. Finally, the backup copy rule set 160 specifies that backup copies created according to the rule set 160 are scheduled to be generated on an hourly basis and to be retained for 30 days. In some other embodiments, scheduling information is not included in the storage policy 148A, and is instead specified by a separate scheduling policy.
The disaster recovery copy rule set 162 is associated with the same two sub-clients 166, 168. However, the disaster recovery copy rule set 162 is associated with the tape library 108B, unlike the backup copy rule set 160. Moreover, the disaster recovery copy rule set 162 specifies that a different media agent, namely 144B, will be used to convey the data to the tape library 108B. As indicated, disaster recovery copies created according to the rule set 162 will be retained for 60 days, and will be generated on a daily basis. Disaster recovery copies generated according to the disaster recovery copy rule set 162 can provide protection in the event of a disaster or other catastrophic data loss that would affect the backup copy 116A maintained on the disk library 108A.
The compliance copy rule set 164 is only associated with the email sub-client 168, and not the file system sub-client 166. Compliance copies generated according to the compliance copy rule set 164 will therefore not include primary data 112A from the file system sub-client 166. For instance, the organization may be under an obligation to store and maintain copies of email data for a particular period of time (e.g., 10 years) to comply with state or federal regulations, while similar regulations do not apply to the file system data. The compliance copy rule set 164 is associated with the same tape library 108B and media agent 144B as the disaster recovery copy rule set 162, although a different storage device or media agent could be used in other embodiments. Finally, the compliance copy rule set 164 specifies that copies generated under the compliance copy rule set 164 will be retained for 10 years, and will be generated on a quarterly basis.
At step 1, the storage manager 140 initiates a backup operation according to the backup copy rule set 160. For instance, a scheduling service running on the storage manager 140 accesses scheduling information from the backup copy rule set 160 or a separate scheduling policy associated with the client computing device 102, and initiates a backup copy operation on an hourly basis. Thus, at the scheduled time slot the storage manager 140 sends instructions to the client computing device 102 (i.e., to both data agent 142A and data agent 142B) to begin the backup operation.
At step 2, the file system data agent 142A and the email data agent 142B operating on the client computing device 102 respond to the instructions received from the storage manager 140 by accessing and processing the primary data 112A, 112B involved in the copy operation, which can be found in primary storage device 104. Because the operation is a backup copy operation, the data agent(s) 142A, 142B may format the data into a backup format or otherwise process the data.
At step 3, the client computing device 102 communicates the retrieved, processed data to the first media agent 144A, as directed by the storage manager 140, according to the backup copy rule set 160. In some other embodiments, the information management system 100 may implement a load-balancing, availability-based, or other appropriate algorithm to select from the available set of media agents 144A, 144B. Regardless of the manner the media agent 144A is selected, the storage manager 140 may further keep a record in the storage manager database 146 of the association between the selected media agent 144A and the client computing device 102 and/or between the selected media agent 144A and the backup copy 116A.
The target media agent 144A receives the data from the client computing device 102, and at step 4 conveys the data to the disk library 108A to create the backup copy 116A, again at the direction of the storage manager 140 and according to the backup copy rule set 160. The secondary storage device 108A can be selected in other ways. For instance, the media agent 144A may have a dedicated association with a particular secondary storage device(s), or the storage manager 140 or media agent 144A may select from a plurality of secondary storage devices, e.g., according to availability, using one of the techniques described in U.S. Pat. No. 7,246,207, which is incorporated by reference herein.
The media agent 144A can also update its index 153 to include data and/or metadata related to the backup copy 116A, such as information indicating where the backup copy 116A resides on the disk library 108A, data and metadata for cache retrieval, etc. The storage manager 140 may similarly update its index 150 to include information relating to the storage operation, such as information relating to the type of storage operation, a physical location associated with one or more copies created by the storage operation, the time the storage operation was performed, status information relating to the storage operation, the components involved in the storage operation, and the like. In some cases, the storage manager 140 may update its index 150 to include some or all of the information stored in the index 153 of the media agent 144A. After the 30 day retention period expires, the storage manager 140 instructs the media agent 144A to delete the backup copy 116A from the disk library 108A. Indexes 150 and/or 153 are updated accordingly.
At step 5, the storage manager 140 initiates the creation of a disaster recovery copy 1166 according to the disaster recovery copy rule set 162.
At step 6, illustratively based on the instructions received from the storage manager 140 at step 5, the specified media agent 144B retrieves the most recent backup copy 116A from the disk library 108A.
At step 7, again at the direction of the storage manager 140 and as specified in the disaster recovery copy rule set 162, the media agent 144B uses the retrieved data to create a disaster recovery copy 116B on the tape library 108B. In some cases, the disaster recovery copy 1166 is a direct, mirror copy of the backup copy 116A, and remains in the backup format. In other embodiments, the disaster recovery copy 1166 may be generated in some other manner, such as by using the primary data 112A, 112B from the primary storage device 104 as source data. The disaster recovery copy operation is initiated once a day and the disaster recovery copies 116B are deleted after 60 days; indexes are updated accordingly when/after each information management operation is executed/completed.
At step 8, the storage manager 140 initiates the creation of a compliance copy 116C, according to the compliance copy rule set 164. For instance, the storage manager 140 instructs the media agent 144B to create the compliance copy 116C on the tape library 108B at step 9, as specified in the compliance copy rule set 164. In the example, the compliance copy 116C is generated using the disaster recovery copy 116B. In other embodiments, the compliance copy 116C is instead generated using either the primary data 112B corresponding to the email sub-client or using the backup copy 116A from the disk library 108A as source data. As specified, in the illustrated example, compliance copies 116C are created quarterly, and are deleted after ten years, and indexes are kept up-to-date accordingly.
While not shown in
In other cases, a media agent may be selected for use in the restore operation based on a load balancing algorithm, an availability based algorithm, or other criteria. The selected media agent 144A retrieves the data from the disk library 108A. For instance, the media agent 144A may access its index 153 to identify a location of the backup copy 116A on the disk library 108A, or may access location information residing on the disk 108A itself.
When the backup copy 116A was recently created or accessed, the media agent 144A accesses a cached version of the backup copy 116A residing in the index 153, without having to access the disk library 108A for some or all of the data. Once it has retrieved the backup copy 116A, the media agent 144A communicates the data to the source client computing device 102. Upon receipt, the file system data agent 142A and the email data agent 142B may unpackage (e.g., restore from a backup format to the native application format) the data in the backup copy 116A and restore the unpackaged data to the primary storage device 104.
Exemplary Applications of Storage Policies
The storage manager 140 may permit a user to specify aspects of the storage policy 148A. For example, the storage policy can be modified to include information governance policies to define how data should be managed in order to comply with a certain regulation or business objective. The various policies may be stored, for example, in the management database 146. An information governance policy may comprise a classification policy, which is described herein. An information governance policy may align with one or more compliance tasks that are imposed by regulations or business requirements. Examples of information governance policies might include a Sarbanes-Oxley policy, a HIPAA policy, an electronic discovery (E-Discovery) policy, and so on.
Information governance policies allow administrators to obtain different perspectives on all of an organization's online and offline data, without the need for a dedicated data silo created solely for each different viewpoint. As described previously, the data storage systems herein build a centralized index that reflects the contents of a distributed data set that spans numerous clients and storage devices, including both primary and secondary copies, and online and offline copies. An organization may apply multiple information governance policies in a top-down manner over that unified data set and indexing schema in order to permit an organization to view and manipulate the single data set through different lenses, each of which is adapted to a particular compliance or business goal. Thus, for example, by applying an E-discovery policy and a Sarbanes-Oxley policy, two different groups of users in an organization can conduct two very different analyses of the same underlying physical set of data copies, which may be distributed throughout the organization and information management system.
A classification policy defines a taxonomy of classification terms or tags relevant to a compliance task and/or business objective. A classification policy may also associate a defined tag with a classification rule. A classification rule defines a particular combination of criteria, such as users who have created, accessed or modified a document or data object; file or application types; content or metadata keywords; clients or storage locations; dates of data creation and/or access; review status or other status within a workflow (e.g., reviewed or un-reviewed); modification times or types of modifications; and/or any other data attributes in any combination, without limitation. A classification rule may also be defined using other classification tags in the taxonomy. The various criteria used to define a classification rule may be combined in any suitable fashion, for example, via Boolean operators, to define a complex classification rule. As an example, an E-discovery classification policy might define a classification tag “privileged” that is associated with documents or data objects that (1) were created or modified by legal department staff, or (2) were sent to or received from outside counsel via email, or (3) contain one of the following keywords: “privileged” or “attorney” or “counsel”, or other like terms.
One specific type of classification tag, which may be added to an index at the time of indexing, is an entity tag. An entity tag may be, for example, any content that matches a defined data mask format. Examples of entity tags might include, e.g., social security numbers (e.g., any numerical content matching the formatting mask XXX-XX-XXXX), credit card numbers (e.g., content having a 13-16 digit string of numbers), SKU numbers, product numbers, etc.
A user may define a classification policy by indicating criteria, parameters or descriptors of the policy via a graphical user interface, such as a form or page with fields to be filled in, pull-down menus or entries allowing one or more of several options to be selected, buttons, sliders, hypertext links or other known user interface tools for receiving user input, etc. For example, a user may define certain entity tags, such as a particular product number or project ID code that is relevant in the organization. In some implementations, the classification policy can be implemented using cloud-based techniques. For example, the storage devices may be cloud storage devices, and the storage manager 140 may execute cloud service provider API over a network to classify data stored on cloud storage devices.
Exemplary Secondary Copy Formatting
The formatting and structure of secondary copies 116 can vary, depending on the embodiment. In some cases, secondary copies 116 are formatted as a series of logical data units or “chunks” (e.g., 512 MB, 1 GB, 2 GB, 4 GB, or 8 GB chunks). This can facilitate efficient communication and writing to secondary storage devices 108, e.g., according to resource availability. For example, a single secondary copy 116 may be written on a chunk-by-chunk basis to a single secondary storage device 108 or across multiple secondary storage devices 108. In some cases, users can select different chunk sizes, e.g., to improve throughput to tape storage devices.
Generally, each chunk can include a header and a payload. The payload can include files (or other data units) or subsets thereof included in the chunk, whereas the chunk header generally includes metadata relating to the chunk, some or all of which may be derived from the payload. For example, during a secondary copy operation, the media agent 144, storage manager 140, or other component may divide the associated files into chunks and generate headers for each chunk by processing the constituent files. The headers can include a variety of information such as file identifier(s), volume(s), offset(s), or other information associated with the payload data items, a chunk sequence number, etc. Importantly, in addition to being stored with the secondary copy 116 on the secondary storage device 108, the chunk headers can also be stored to the index 153 of the associated media agent(s) 144 and/or the index 150. This is useful in some cases for providing faster processing of secondary copies 116 during restores or other operations. In some cases, once a chunk is successfully transferred to a secondary storage device 108, the secondary storage device 108 returns an indication of receipt, e.g., to the media agent 144 and/or storage manager 140, which may update their respective indexes 153, 150 accordingly. During restore, chunks may be processed (e.g., by the media agent 144) according to the information in the chunk header to reassemble the files.
Data can also be communicated within the information management system 100 in data channels that connect the client computing devices 102 to the secondary storage devices 108. These data channels can be referred to as “data streams”, and multiple data streams can be employed to parallelize an information management operation, improving data transfer rate, among providing other advantages. Example data formatting techniques including techniques involving data streaming, chunking, and the use of other data structures in creating copies (e.g., secondary copies) are described in U.S. Pat. Nos. 7,315,923 and 8,156,086, and 8,578,120, each of which is incorporated by reference herein.
Referring to
As an example, the data structures 180 illustrated in
If the operating system of the secondary storage computing device 106 on which the media agent 144 operates supports sparse files, then when the media agent 144 creates container files 190/191/193, it can create them as sparse files. A sparse file is type of file that may include empty space (e.g., a sparse file may have real data within it, such as at the beginning of the file and/or at the end of the file, but may also have empty space in it that is not storing actual data, such as a contiguous range of bytes all having a value of zero). Having the container files 190/191/193 be sparse files allows the media agent 144 to free up space in the container files 190/191/193 when blocks of data in the container files 190/191/193 no longer need to be stored on the storage devices. In some examples, the media agent 144 creates a new container file 190/191/193 when a container file 190/191/193 either includes 100 blocks of data or when the size of the container file 190 exceeds 50 MB. In other examples, the media agent 144 creates a new container file 190/191/193 when a container file 190/191/193 satisfies other criteria (e.g., it contains from approximately 100 to approximately 1000 blocks or when its size exceeds approximately 50 MB to 1 GB).
In some cases, a file on which a storage operation is performed may comprise a large number of data blocks. For example, a 100 MB file may comprise 400 data blocks of size 256 KB. If such a file is to be stored, its data blocks may span more than one container file, or even more than one chunk folder. As another example, a database file of 20 GB may comprise over 40,000 data blocks of size 512 KB. If such a database file is to be stored, its data blocks will likely span multiple container files, multiple chunk folders, and potentially multiple volume folders. Restoring such files may require accessing multiple container files, chunk folders, and/or volume folders to obtain the requisite data blocks.
Example Highly Reusable Deduplication Database after Disaster Recovery
As shown in
During a backup or other secondary copy operation using deduplication techniques, the system 100 can query the DDB media agents 202, 204, 206, and/or 208 and corresponding deduplication databases 210A-210D for signatures of the data blocks to be backed up. In some embodiments, the client computing device 102 can query the DDB media agents 202, 204, 206, and/or 208 and in certain embodiments, the secondary storage computing devices 106 can query the DDB media agents 202, 204, 206, and/or 208. When a signature is found in the DDB media agents 202, 204, 206, or 208, a link to the location of a copy of the data block stored in the secondary storage devices 108 is stored as part of the backup. When a signature is not found in the DDB media agents 202, 204, 206, or 208, a copy of the data block is stored in the secondary storage devices 108, and the signature of the data block (and other deduplication information) is stored in the appropriate DDB media agent(s) 202, 204, 206, or 208.
A data block distribution policy can specify which DDB media agents 202, 204, 206, or 208 store which signatures and which DDB media agents 202, 204, 206, or 208 are therefore queried for particular data block signatures. For example, the distribution policy can indicate that data block signatures are stored in DDB media agents 202, 204, 206, or 208 based on a modulo operation of the signature of the data block, as described previously. One example of an implementation of such a policy will now be described.
According to the example, during a backup operation one of the media agents 144 is assigned, at the direction of the storage manager 140, to back up a data file for one of the client computing devices 102. For each constituent data block in the file, the media agent 144 calculates a hash or other signature for the data block, and consults the deduplication database 210 of a selected one of the DDB media agents 204.
The media agent 144 selects the appropriate DDB media agent 202, 204, 206, 208 to consult based on a pre-defined data block distribution policy. In the example embodiment, the distribution policy dictates that the deduplication information is distributed across the DDB media agents 202, 204, 206, 208 by assigning each data block to a selected DDB media agent based on the modulo of the data block hash value. In the example implementation, there are four available DDB media agents 202, 204, 206, 208, and a modulo four is therefore applied to the data block hash value, resulting in an output value within the set {0, 1, 2, 3}. Data blocks are assigned to DDB media agents as follows: modulo output=‘0’, assigned to DDBMA 202; modulo output=‘1’, assigned to DDBMA 204; modulo output=‘2’ assigned to DDBMA 206; and modulo output=‘3’ assigned to DDBMA 208.
For a first exemplary data block in the file, the media agent 144 computes the hash, takes the modulo of the hash, resulting in an output of ‘2’, and therefore sends the data block hash to the DDB media agent 206. The DDB media agent 206 references its deduplication database 210C using the hash, and finds an entry indicating that a copy of the data block already exists in the secondary storage devices 108. Thus, the DDB media agent 206 returns a link to the media agent 144 indicating the location of the copy of the data block in the secondary storage devices 108. Then, when the media agent 144 writes the backup copy of the file to the secondary storage device(s) 108, the media agent 144 includes the link within the backup copy of the file instead of including a duplicate copy of the actual data block.
For a second exemplary data block in the file, the requesting media agent 144 computes the hash, takes the modulo of the hash, resulting in an output of ‘1’, and therefore sends the hash to the DDB media agent 204. The DDB media agent 204 references its deduplication database 210B using the hash, and does not find an entry corresponding to the data block. The DDB media agent 204 returns an indication to the media agent 144 that the data block does not yet exist in the secondary storage devices 108. When the media agent 144 writes the backup copy of the file to the secondary storage device(s) 108, the media agent 144 includes an actual copy of the data block with the backup copy of the file. The DDB media agent 204 also updates its deduplication database 210B to include an entry corresponding to the hash of the data block and including a link specifying the location of the stored data block in the secondary storage devices 108. For instance, the requesting media agent 144 may be assigned to write data only to a particular secondary storage device 108 according to a pre-defined policy, and the DDB media agent 204 may therefore include a link specifying that the data block is stored in the secondary storage device 108 assigned to the requesting media agent 144. Further examples of distributed deduplication storage schemes are provided in U.S. Patent Application Publication No. 2012/0150826, which is incorporated by reference herein.
Furthermore, should one of the DDB media agents (e.g., DDB media agent 202) become unavailable, the distribution policy can specify another DDB media agent (e.g., DDB media agent 206) as a failover DDB media agent and use the failover DDB media agent for deduplication operations while the other DDB media agent (e.g., DDB media agent 202) is unavailable.
As described above, the storage manager database 146 may store logical associations between components of the system, user preferences and/or profiles, management tasks, media containerization, or other useful data. The storage manager database 146 may also store data such as catalog information, configuration settings, schedules, topology of networks, a list of backup or secondary copy operation jobs (e.g., an amount of data transferred, client devices 102 associated with each job, archive file identifiers associated with each backup or secondary copy operation job, etc.), and/or encryption keys. For example, the encryption keys may be used to encrypt data blocks, and the encrypted data blocks may be stored in secondary storage devices 108 during backup or secondary copy operations. Encryption keys may be generated periodically before, during, or after a backup or secondary copy operation job is performed.
In an embodiment, the storage manager database 146 is periodically backed up. Thus, if the storage manager 140 and/or the storage manager database 146 fails, the storage manager 140 can initiate disaster recovery by restoring the storage manager database 146 using one of the backups. In such a situation, the storage manager database 146 may be restored from a first time (e.g., t2) to a second time (e.g., t0) that occurred before the first time. Any data stored in the storage manager database 146 between the first time and the second time may be lost, including, for example, encryption keys. Accordingly, encrypted data blocks stored in the secondary storage devices 108 that were encrypted using the lost encryption keys may not be decryptable once the storage manager database 146 is restored to the second time.
During each successive backup job, the archive file identifier associated with the respective backup job may be a larger value (e.g., by 1) than the previous archive file identifier associated with the previous backup job. However, if the storage manager database 146 is restored, the archive file identifier may be incremented based on a number of seconds that have elapsed between the time associated with the backup job used to restore the storage manager database 146 (e.g., t0) and the time that the restore took place (e.g., t2) and/or a buffer value (e.g., 1000 added to the number of elapsed seconds). This may ensure that archive file identifiers are not repeated after a restore of the storage manager database 146 occurs.
Furthermore, the secondary table 252 can be used in conjunction with the primary table 250 to ensure that encrypted data blocks stored in the secondary storage devices 108 that were encrypted using the lost encryption keys are not referenced in the primary table 250. Thus, in future backup or secondary copy operations, the DDB media agents 202, 204, 206, and 208 may encrypt data blocks using encryption keys stored in the storage manager database 146 rather than including links in the backup to encrypted data blocks that were encrypted using encryption keys that are no longer stored in the storage manager database 146 after the storage manager database 146 has been restored.
Example Deduplication Database Pruning
At block 504, the routine 500 receives an archive file identifier from the storage manager 140. For example, once the storage manager database 146 is restored, the storage manager 140 may be notified or may detect that a restore occurred. The storage manager 140 may direct the DDB media agents 202, 204, 206, and/or 208 to put the deduplication databases 210 in a maintenance mode, thereby preventing any scheduled backups or secondary copy operations from being performed (e.g., preventing any writes to the secondary storage devices 108). However, in the maintenance mode, restores based on the data stored in the secondary storage devices 108, reads of data in the deduplication databases 210, and tape backups (e.g., backing up data stored in the secondary storage devices 108 to a tape drive) may still be allowed. The storage manager 140 may then identify an archive file identifier that is associated with the backup job that was used to restore the storage manager database 146. This is the archive file identifier that may be received at block 502. In alternative embodiments, the routine 500 provides a list of archive file identifiers to the storage manager 140 and the storage manager 140 provides a list of the provided archive file identifiers that are associated with a time of the backup job used to complete the restore.
At block 506, the routine 500 identifies archive file identifiers stored in a second table, such as the secondary table 252, that are associated with a time after a time associated with the archive file identifier received from the storage manager 140. For example, the DDB media agents 202, 204, 206, and/or 208 may query the secondary table 252 to identify archive file identifiers 401A-N that are associated with backup or secondary copy operation jobs that occurred after the backup or secondary copy operation job associated with the received archive file identifier.
At block 508, the routine 500 sets a variable n to be equal to the number of identified archive file identifiers in the secondary table 252.
At block 510, the routine 500 sets a variable i to be equal to 1. In an embodiment, the variable i identifies the archive file identifier that is being analyzed.
At block 512, the routine 500 sets a variable m to be equal to a number of data blocks associated with archive file identifier i. For example, the secondary table 252 may identify the PIDs of data blocks that are associated with a given archive file identifier.
At block 514, the routine 500 sets a variable j to be equal to 1. In an embodiment, the variable j identifies the data block that is being analyzed.
At block 516, the routine 500 decrements a reference count of data block j. As described above, the primary table 250 includes a field that identifies the reference count (e.g., a count representing a number of links to the respective data block in backup jobs) associated with a data block. The reference count in the primary table 250 associated with data block j may be decremented by 1. In an embodiment, if the reference count associated with a data block becomes 0, the DDB media agents 202, 204, 206, and/or 208 remove the entry associated with the data block from the primary table 250 at that time or at a later time.
At block 518, the routine 500 checks to determine whether the variable j is the same value as the variable m. If the routine 500 determines that the variables are the same value (e.g., the reference counts for all data blocks associated with archive file identifier i have been decremented by 1), then the routine 500 proceeds to block 522. If the routine 500 determines that the variables are not the same value (e.g., the reference counts for all data blocks associated with archive file identifier i have not been decremented by 1), then the routine 500 proceeds to block 520.
At block 520, the value of the variable j is incremented by 1. The routine 500 then proceeds back to block 516.
At block 522, the routine 500 checks to determine whether the variable i is the same value as the variable n. If the routine 500 determines that the variables are the same value (e.g., the reference counts for all data blocks associated with all of the identified archive file identifiers have been decremented by 1), then the routine 500 proceeds to block 526. If the routine 500 determines that the variables are not the same value (e.g., the reference counts for all data blocks associated with all of the identified archive file identifiers have not been decremented by 1), then the routine 500 proceeds to block 524.
At block 524, the value of the variable i is incremented by 1. The routine 500 then proceeds back to block 512. At block 526, the routine 500 ends.
In an embodiment, the routine 500 decrements the reference counts of all data blocks encrypted using the encryption keys that are no longer stored in the storage manager database 146 to 0 (e.g., because these data blocks are only included in backup or secondary copy operations associated with archive file identifiers that correspond with a time after a time corresponding with the received archive file identifier from the storage manager 140). The routine 500 also ensures that the reference counts are accurate after the restore of the storage manager database 146 has occurred (e.g., once the storage manager database 146 has been restored to a first time, the deduplication databases 210 should be reverted to the first time as well such that the reference counts do not include a number of times the respective data block was included in a backup or secondary copy operation that occurred after the first time).
The routine 500 may be performed by multiple DDB media agents 202, 204, 206, and/or 208 in parallel. For example, the storage manager 140 may instruct some or all of the DDB media agents 202, 204, 206, and/or 208 to place their respective deduplication databases 210 in the maintenance mode. Once a DDB media agent 202, 204, 206, or 208 has completed the routine 500, the respective DDB media agent may inform the storage manager 140. The storage manager 140 may then instruct the respective DDB media agent to resume normal operation with its deduplication database 210. By instructing multiple DDB media agents 202, 204, 206, and/or 208 in parallel, the time for pruning the deduplication databases 210 and restoring normal operations may be minimized.
DDB Pruning Process after Storage Manager Database Replication
In some embodiments, the storage manager 140 and/or the storage manager database 146 is replicated. The replicated storage manager 140, however, may not be aware of whether a restore, replication, or other such operation occurred. Thus, the DDB media agents 202, 204, 206, and/or 208 may implement a synchronization mechanism to ensure that the deduplication databases 210 are synched with the replicated storage manager database 146, as described below with respect to
At block 602, the routine 600 requests a timestamp from the storage manager 140. In an embodiment, upon receiving the request for a timestamp, the storage manager 140 determines a current time and stores a timestamp corresponding to the current time in the storage manager database 146. The timestamp may be stored in conjunction with an indication that a request for a timestamp was received from a DDB media agent 202, 204, 206, and/or 208.
At block 604, the routine 600 receives a timestamp from the storage manager 140. The received timestamp may be the timestamp stored in the storage manager database 146. The timestamp may be written to a configuration file and stored on disk. For example, the timestamp may be written to a configuration file for later determining whether the deduplication database 210 and the storage manager database 146 are in sync.
At block 606, the routine 600 determines whether a timestamp received from the storage manager 140 is in sync with a timestamp stored in a configuration file. For example, a timestamp may have been received from the storage manager 140 at a previous time and stored in a configuration file. The timestamp received from the storage manager 140 in block 604 may be compared with an expected current time that is calculated based on the timestamp stored in the configuration file. If the comparison does not yield a match, this may indicate that the storage manager database 146 was replicated or restored, and thus the storage manager database 146 is out of sync with the deduplication databases 210 (e.g., because the deduplication databases 210 have not been pruned or restored to a previous point in time).
At block 608, the routine 600 begins a deduplication database pruning process in response to a determination that the timestamp received from the storage manager 140 and the timestamp stored in the configuration file are out of sync. For example, if the timestamp received from the storage manager 140 in block 604 does not match the expected current time, then the storage manager 140 may instruct the DDB media agent 202, 204, 206, and/or 208 to place the deduplication databases 210 in the maintenance mode. The DDB media agents 202, 204, 206, and/or 208 may then begin the routine 500 described above with respect to
The routine 600 may be performed by the DDB media agents 202, 204, 206, and/or 208 each time the deduplication database 210 is brought up and each time the deduplication database 210 is closed. For example, the deduplication database 210 may be brought up when a backup or secondary copy operation job is scheduled. The deduplication database 210 may remain active for multiple backup or secondary copy operation jobs (e.g., if the jobs are scheduled within a threshold time of each other by one or more client devices 102). The deduplication database 210 may be closed when a backup or secondary copy operation job or a series of backup or secondary copy operation jobs are completed. Thus, the deduplication databases 210 may be placed in the maintenance mode upon being brought up (and thereby preventing backup or secondary copy operation jobs from being performed) or upon being closed.
One aspect of the disclosure provides a networked information management system configured to verify synchronization of deduplication information. The networked information management system comprises a data storage database comprising a plurality of first archive file identifiers at a first time. The networked information management system further comprises a data storage computer in communication with the data storage database, the data storage computer comprising computer hardware configured to receive an indication that the data storage database is being restored to a version of the database as of a second time before the first time such that the data storage database comprises a subset of the plurality of first archive file identifiers that were present in the data storage database at the second time. The networked information management system further comprises a media agent executing on one or more computer processors and configured to: receive a first instruction from the data storage computer in response to the data storage computer receiving the indication, where the first instruction instructs the media agent to stop scheduled secondary storage operations associated with a deduplication database, and where the deduplication database comprises a plurality of second archive file identifiers; determine at least one second archive file identifier in the plurality of second archive file identifiers that does not correlate with any first archive file identifier in the subset of the plurality of first archive file identifiers; and for each of the at least one second archive file identifier, instruct the deduplication database to prune an entry associated with the respective second archive file identifier.
The networked information management system of the preceding paragraph can have any sub-combination of the following features: where the deduplication database further comprises a plurality of reference counters, and where each reference counter is associated with a second archive identifier in the plurality of second archive file identifiers; where the media agent is further configured to, for each of the at least one second archive file identifier, instruct the deduplication database to decrement the reference counter associated with the respective second archive file identifier by one; where the media agent is further configured to determine at least one second archive file identifier in the plurality of second archive file identifiers that does not match any first archive file identifier in the subset of the plurality of first archive identifiers; where the networked information management system further comprises a second media agent configured to: receive a second instruction from the data storage computer in response to the data storage computer receiving the indication, where the second instruction instructs the second media agent to stop scheduled secondary storage operations associated with a second deduplication database, and where the second deduplication database comprises a plurality of third archive file identifiers, determine at least one third archive file identifier in the plurality of third archive file identifiers that does not correlate with any first archive file identifier in the subset of the plurality of first archive file identifiers, and for each of the at least one third archive file identifier, instruct the second deduplication database to prune an entry associated with the respective third archive file identifier; where the data storage computer transmits the first instruction and the second instruction at a same time; where each second archive file identifier is associated with a data block stored in secondary storage; and where each data block associated with the at least one second archive file identifier is removed from the secondary storage.
Another aspect of the disclosure provides a computer-implemented method for verifying synchronization of deduplication information. The computer-implemented method comprises receiving, in response to an indication that a data storage database is being restored to a second time before a first time such that the data storage database comprises a plurality of first archive file identifiers associated at the second time, a first instruction from a data storage computer, where the first instruction instructs a media agent to stop scheduled secondary storage operations associated with a deduplication database, and where the deduplication database comprises a plurality of second archive file identifiers; determining at least one second archive file identifier in the plurality of second archive file identifiers that does not correlate with any first archive identifier in the plurality of first archive file identifiers; and for each of the at least one second archive identifier, instructing the deduplication database to prune an entry associated with the respective second archive file identifier.
The computer-implemented method of the preceding paragraph can have any sub-combination of the following features: where the deduplication database further comprises a plurality of reference counters, and where each reference counter is associated with a second archive file identifier in the plurality of second archive file identifiers; where instructing the deduplication database further comprises, for each of the at least one second archive identifier, instructing the deduplication database to decrement the reference counter associated with the respective second archive identifier by one; where determining at least one second archive file identifier in the plurality of second archive file identifiers that does not correlate with any first archive file identifiers in the plurality of first archive file identifiers further comprises determining at least one second archive file identifier in the plurality of second archive file identifiers that does not match any first archive file identifier in the plurality of first archive file identifiers; where each second archive file identifier is associated with a data block stored in secondary storage; and where each data block associated with the at least one second archive identifier is removed from the secondary storage.
Another aspect of the disclosure provides a networked information management system configured to verify synchronization of deduplication information. The networked information management system comprises a storage manager database comprising a plurality of first archive file identifiers at a first time. The networked information management system further comprises a storage manager in communication with the storage manager database, the storage manager comprising computer hardware configured to receive an indication that the storage manager database is being restored to a second time before the first time such that the storage manager database comprises a subset of the plurality of first archive file identifiers present in the storage manager database at the second time. The networked information management system further comprises a deduplication database media agent comprising an electronically stored deduplication database and computer hardware configured to: receive a first instruction from the storage manager in response to the storage manager receiving the indication, where the first instruction instructs the media agent to stop scheduled secondary storage operations associated with the deduplication database, and where the deduplication database comprises a plurality of second archive file identifiers; determine at least one second archive file identifier in the plurality of second archive file identifiers that does not correlate with any first archive file identifier in the plurality of first archive file identifiers; and for each of the at least one second archive file identifier, instruct the deduplication database to prune an entry associated with the respective second archive file identifier.
The networked information management system of the preceding paragraph can have any sub-combination of the following features: where the deduplication database further comprises a plurality of reference counters, and where each reference counter is associated with a second archive file identifier in the plurality of second archive file identifiers; where the deduplication database media agent is further configured to, for each of the at least one second archive file identifier, instruct the deduplication database to decrement the reference counter associated with the respective second archive file identifier by one; where the deduplication database media agent is further configured to determine at least one second archive file identifier in the plurality of second archive identifiers that does not match any first archive file identifiers in the plurality of first archive file identifiers; where the networked information management system further comprises a second deduplication database media agent comprising an electronically stored second deduplication database and computer hardware configured to: receive a second instruction from the storage manager in response to the storage manager receiving the indication, where the second instruction instructs the second deduplication database media agent to stop scheduled secondary storage operations associated with a second deduplication database, and where the second deduplication database comprises a plurality of third archive file identifiers, determine at least one third archive file identifier in the plurality of third archive file identifiers that does not correlate with any first archive file identifiers in the plurality of first archive file identifiers, and for each of the at least one third archive file identifier, instruct the second deduplication database to prune an entry associated with the respective third archive file identifier; and where the storage manager transmits the first instruction and the second instruction at a same time.
Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.
Unless the context clearly requires otherwise, throughout the description and the claims, the words “comprise,” “comprising,” and the like are to be construed in an inclusive sense, as opposed to an exclusive or exhaustive sense; that is to say, in the sense of “including, but not limited to.” As used herein, the terms “connected,” “coupled,” or any variant thereof means any connection or coupling, either direct or indirect, between two or more elements; the coupling or connection between the elements can be physical, logical, or a combination thereof. Additionally, the words “herein,” “above,” “below,” and words of similar import, when used in this application, refer to this application as a whole and not to any particular portions of this application. Where the context permits, words in the above Detailed Description using the singular or plural number may also include the plural or singular number respectively. The word “or” in reference to a list of two or more items, covers all of the following interpretations of the word: any one of the items in the list, all of the items in the list, and any combination of the items in the list. Likewise the term “and/or” in reference to a list of two or more items, covers all of the following interpretations of the word: any one of the items in the list, all of the items in the list, and any combination of the items in the list.
Depending on the embodiment, certain operations, acts, events, or functions of any of the algorithms described herein can be performed in a different sequence, can be added, merged, or left out altogether (e.g., not all are necessary for the practice of the algorithms). Moreover, in certain embodiments, operations, acts, functions, or events can be performed concurrently, e.g., through multi-threaded processing, interrupt processing, or multiple processors or processor cores or on other parallel architectures, rather than sequentially.
Systems and modules described herein may comprise software, firmware, hardware, or any combination(s) of software, firmware, or hardware suitable for the purposes described herein. Software and other modules may reside and execute on servers, workstations, personal computers, computerized tablets, PDAs, and other computing devices suitable for the purposes described herein. Software and other modules may be accessible via local memory, via a network, via a browser, or via other means suitable for the purposes described herein. Data structures described herein may comprise computer files, variables, programming arrays, programming structures, or any electronic information storage schemes or methods, or any combinations thereof, suitable for the purposes described herein. User interface elements described herein may comprise elements from graphical user interfaces, interactive voice response, command line interfaces, and other suitable interfaces.
Further, the processing of the various components of the illustrated systems can be distributed across multiple machines, networks, and other computing resources. In addition, two or more components of a system can be combined into fewer components. Various components of the illustrated systems can be implemented in one or more virtual machines, rather than in dedicated computer hardware systems and/or computing devices. Likewise, the data repositories shown can represent physical and/or logical data storage, including, for example, storage area networks or other distributed storage systems. Moreover, in some embodiments the connections between the components shown represent possible paths of data flow, rather than actual connections between hardware. While some examples of possible connections are shown, any of the subset of the components shown can communicate with any other subset of components in various implementations.
Embodiments are also described above with reference to flow chart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products. Each block of the flow chart illustrations and/or block diagrams, and combinations of blocks in the flow chart illustrations and/or block diagrams, may be implemented by computer program instructions. Such instructions may be provided to a processor of a general purpose computer, special purpose computer, specially-equipped computer (e.g., comprising a high-performance database server, a graphics subsystem, etc.) or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor(s) of the computer or other programmable data processing apparatus, create means for implementing the acts specified in the flow chart and/or block diagram block or blocks.
These computer program instructions may also be stored in a non-transitory computer-readable memory that can direct a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the acts specified in the flow chart and/or block diagram block or blocks. The computer program instructions may also be loaded onto a computing device or other programmable data processing apparatus to cause a series of operations to be performed on the computing device or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the acts specified in the flow chart and/or block diagram block or blocks.
Any patents and applications and other references noted above, including any that may be listed in accompanying filing papers, are incorporated herein by reference. Aspects of the invention can be modified, if necessary, to employ the systems, functions, and concepts of the various references described above to provide yet further implementations of the invention.
These and other changes can be made to the invention in light of the above Detailed Description. While the above description describes certain examples of the invention, and describes the best mode contemplated, no matter how detailed the above appears in text, the invention can be practiced in many ways. Details of the system may vary considerably in its specific implementation, while still being encompassed by the invention disclosed herein. As noted above, particular terminology used when describing certain features or aspects of the invention should not be taken to imply that the terminology is being redefined herein to be restricted to any specific characteristics, features, or aspects of the invention with which that terminology is associated. In general, the terms used in the following claims should not be construed to limit the invention to the specific examples disclosed in the specification, unless the above Detailed Description section explicitly defines such terms. Accordingly, the actual scope of the invention encompasses not only the disclosed examples, but also all equivalent ways of practicing or implementing the invention under the claims.
To reduce the number of claims, certain aspects of the invention are presented below in certain claim forms, but the applicant contemplates the various aspects of the invention in any number of claim forms. For example, while only one aspect of the invention is recited as a means-plus-function claim under 35 U.S.C. sec. 112(f) (AIA), other aspects may likewise be embodied as a means-plus-function claim, or in other forms, such as being embodied in a computer-readable medium. Any claims intended to be treated under 35 U.S.C. § 112(f) will begin with the words “means for”, but use of the term “for” in any other context is not intended to invoke treatment under 35 U.S.C. § 112(f). Accordingly, the applicant reserves the right to pursue additional claims after filing this application, in either this application or in a continuing application.
This application is a continuation of U.S. patent application Ser. No. 14/682,988, entitled “HIGHLY REUSABLE DEDUPLICATION DATABASE AFTER DISASTER RECOVERY” and filed on Apr. 9, 2015. Any and all applications, if any, for which a foreign or domestic priority claim is identified in the Application Data Sheet of the present application are hereby incorporated by reference under 37 CFR 1.57.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4084231 | Capozzi et al. | Apr 1978 | A |
| 4267568 | Dechant et al. | May 1981 | A |
| 4283787 | Chambers | Aug 1981 | A |
| 4417321 | Chang et al. | Nov 1983 | A |
| 4641274 | Swank | Feb 1987 | A |
| 4654819 | Stiffler et al. | Mar 1987 | A |
| 4686620 | Ng | Aug 1987 | A |
| 4912637 | Sheedy et al. | Mar 1990 | A |
| 4995035 | Cole et al. | Feb 1991 | A |
| 5005122 | Griffin et al. | Apr 1991 | A |
| 5093912 | Dong et al. | Mar 1992 | A |
| 5133065 | Cheffetz et al. | Jul 1992 | A |
| 5193154 | Kitajima et al. | Mar 1993 | A |
| 5212772 | Masters | May 1993 | A |
| 5226157 | Nakano et al. | Jul 1993 | A |
| 5239647 | Anglin et al. | Aug 1993 | A |
| 5241668 | Eastridge et al. | Aug 1993 | A |
| 5241670 | Eastridge et al. | Aug 1993 | A |
| 5276860 | Fortier et al. | Jan 1994 | A |
| 5276867 | Kenley et al. | Jan 1994 | A |
| 5287500 | Stoppani, Jr. | Feb 1994 | A |
| 5301286 | Rajani | Apr 1994 | A |
| 5321816 | Rogan et al. | Jun 1994 | A |
| 5333315 | Saether et al. | Jul 1994 | A |
| 5347653 | Flynn et al. | Sep 1994 | A |
| 5403639 | Belsan | Apr 1995 | A |
| 5410700 | Fecteau et al. | Apr 1995 | A |
| 5420996 | Aoyagi | May 1995 | A |
| 5448724 | Hayashi et al. | Sep 1995 | A |
| 5454099 | Myers et al. | Sep 1995 | A |
| 5491810 | Allen | Feb 1996 | A |
| 5495607 | Pisello et al. | Feb 1996 | A |
| 5499367 | Bamford et al. | Mar 1996 | A |
| 5504873 | Martin et al. | Apr 1996 | A |
| 5544345 | Carpenter et al. | Aug 1996 | A |
| 5544347 | Yanai et al. | Aug 1996 | A |
| 5559957 | Balk | Sep 1996 | A |
| 5559991 | Kanfi | Sep 1996 | A |
| 5619644 | Crockett et al. | Apr 1997 | A |
| 5625793 | Mirza | Apr 1997 | A |
| 5638509 | Dunphy et al. | Jun 1997 | A |
| 5642496 | Kanfi | Jun 1997 | A |
| 5673381 | Huai et al. | Sep 1997 | A |
| 5699361 | Ding et al. | Dec 1997 | A |
| 5720026 | Uemura | Feb 1998 | A |
| 5729743 | Squibb | Mar 1998 | A |
| 5732240 | Caccavale | Mar 1998 | A |
| 5751997 | Kullick et al. | May 1998 | A |
| 5758359 | Saxon | May 1998 | A |
| 5761677 | Senator et al. | Jun 1998 | A |
| 5764972 | Crouse et al. | Jun 1998 | A |
| 5765173 | Cane et al. | Jun 1998 | A |
| 5778395 | Whiting et al. | Jul 1998 | A |
| 5790828 | Jost | Aug 1998 | A |
| 5812398 | Nielsen | Sep 1998 | A |
| 5813008 | Benson et al. | Sep 1998 | A |
| 5813009 | Johnson et al. | Sep 1998 | A |
| 5813017 | Morris | Sep 1998 | A |
| 5875478 | Blumenau | Feb 1999 | A |
| 5875481 | Ashton | Feb 1999 | A |
| 5878408 | Van Huben | Mar 1999 | A |
| 5887134 | Ebrahim | Mar 1999 | A |
| 5901327 | Ofek | May 1999 | A |
| 5907672 | Matze | May 1999 | A |
| 5924102 | Perks | Jul 1999 | A |
| 5930831 | Marsh et al. | Jul 1999 | A |
| 5940833 | Benson | Aug 1999 | A |
| 5950205 | Aviani, Jr. | Sep 1999 | A |
| 5956519 | Wise | Sep 1999 | A |
| 5974563 | Beeler, Jr. | Oct 1999 | A |
| 5990810 | Williams | Nov 1999 | A |
| 6021415 | Cannon et al. | Feb 2000 | A |
| 6026414 | Anglin | Feb 2000 | A |
| 6038379 | Fletcher et al. | Mar 2000 | A |
| 6044437 | Reinders | Mar 2000 | A |
| 6052735 | Ulrich et al. | Apr 2000 | A |
| 6076148 | Kedem et al. | Jun 2000 | A |
| 6094416 | Ying | Jul 2000 | A |
| 6131095 | Low et al. | Oct 2000 | A |
| 6131190 | Sidwell | Oct 2000 | A |
| 6148412 | Cannon et al. | Nov 2000 | A |
| 6154787 | Urevig et al. | Nov 2000 | A |
| 6161111 | Mutalik et al. | Dec 2000 | A |
| 6163856 | Dion | Dec 2000 | A |
| 6167402 | Yeager | Dec 2000 | A |
| 6212512 | Barney et al. | Apr 2001 | B1 |
| 6260069 | Anglin | Jul 2001 | B1 |
| 6269431 | Dunham | Jul 2001 | B1 |
| 6275953 | Vahalia et al. | Aug 2001 | B1 |
| 6286084 | Wexler et al. | Sep 2001 | B1 |
| 6289432 | Ault et al. | Sep 2001 | B1 |
| 6301592 | Aoyama et al. | Oct 2001 | B1 |
| 6324581 | Xu et al. | Nov 2001 | B1 |
| 6328766 | Long | Dec 2001 | B1 |
| 6330570 | Crighton | Dec 2001 | B1 |
| 6330642 | Carteau | Dec 2001 | B1 |
| 6343324 | Hubis et al. | Jan 2002 | B1 |
| RE37601 | Eastridge et al. | Mar 2002 | E |
| 6353878 | Dunham | Mar 2002 | B1 |
| 6356801 | Goodman et al. | Mar 2002 | B1 |
| 6366986 | St. Pierre | Apr 2002 | B1 |
| 6366988 | Skiba | Apr 2002 | B1 |
| 6374336 | Peters | Apr 2002 | B1 |
| 6389432 | Pothapragada et al. | May 2002 | B1 |
| 6389433 | Bolosky et al. | May 2002 | B1 |
| 6397308 | Ofek | May 2002 | B1 |
| 6418478 | Ignatius et al. | Jul 2002 | B1 |
| 6421711 | Blumenau et al. | Jul 2002 | B1 |
| 6425057 | Cherkasova et al. | Jul 2002 | B1 |
| 6438368 | Phillips | Aug 2002 | B1 |
| 6487561 | Ofek et al. | Nov 2002 | B1 |
| 6496850 | Bowman-Amuah | Dec 2002 | B1 |
| 6519679 | Devireddy et al. | Feb 2003 | B2 |
| 6538669 | Lagueux, Jr. et al. | Mar 2003 | B1 |
| 6542972 | Ignatius et al. | Apr 2003 | B2 |
| 6557030 | Hoang | Apr 2003 | B1 |
| 6557089 | Reed | Apr 2003 | B1 |
| 6564228 | O'Connor | May 2003 | B1 |
| 6625623 | Midgley et al. | Sep 2003 | B1 |
| 6658436 | Oshinsky et al. | Dec 2003 | B2 |
| 6658526 | Nguyen et al. | Dec 2003 | B2 |
| 6662198 | Satyanarayanan | Dec 2003 | B2 |
| 6665815 | Goldstein | Dec 2003 | B1 |
| 6704730 | Moulton et al. | Mar 2004 | B2 |
| 6721767 | De Meno et al. | Apr 2004 | B2 |
| 6732125 | Autry | May 2004 | B1 |
| 6757794 | Cabrera et al. | Jun 2004 | B2 |
| 6760723 | Oshinsky et al. | Jul 2004 | B2 |
| 6760812 | Degenaro et al. | Jul 2004 | B1 |
| 6779093 | Gupta | Aug 2004 | B1 |
| 6789161 | Blendermann | Sep 2004 | B1 |
| 6799258 | Linde | Sep 2004 | B1 |
| 6810398 | Moulton | Oct 2004 | B2 |
| 6823377 | Wu et al. | Nov 2004 | B1 |
| 6865655 | Andersen | Mar 2005 | B1 |
| 6886020 | Zahavi | Apr 2005 | B1 |
| 6912629 | West et al. | Jun 2005 | B1 |
| 6952758 | Chron et al. | Oct 2005 | B2 |
| 6983351 | Gibble | Jan 2006 | B2 |
| 7003641 | Prahlad et al. | Feb 2006 | B2 |
| 7028096 | Lee | Apr 2006 | B1 |
| 7035880 | Crescenti et al. | Apr 2006 | B1 |
| 7065619 | Zhu et al. | Jun 2006 | B1 |
| 7082441 | Zahavi | Jul 2006 | B1 |
| 7085904 | Mizuno et al. | Aug 2006 | B2 |
| 7100089 | Phelps | Aug 2006 | B1 |
| 7103617 | Phatak | Sep 2006 | B2 |
| 7107298 | Prahlad et al. | Sep 2006 | B2 |
| 7107395 | Ofek | Sep 2006 | B1 |
| 7117246 | Christenson et al. | Oct 2006 | B2 |
| 7130860 | Pachet | Oct 2006 | B2 |
| 7130970 | Devassy et al. | Oct 2006 | B2 |
| 7143091 | Charnock | Nov 2006 | B2 |
| 7155465 | Lee | Dec 2006 | B2 |
| 7155633 | Tuma | Dec 2006 | B2 |
| 7162496 | Amarendran et al. | Jan 2007 | B2 |
| 7174433 | Kottomtharayil et al. | Feb 2007 | B2 |
| 7194454 | Hansen | Mar 2007 | B2 |
| 7197665 | Goldstein | Mar 2007 | B2 |
| 7225210 | Guthrie, II | May 2007 | B2 |
| 7243163 | Friend et al. | Jul 2007 | B1 |
| 7246207 | Kottomtharayil et al. | Jul 2007 | B2 |
| 7246272 | Cabezas et al. | Jul 2007 | B2 |
| 7272606 | Borthakur et al. | Sep 2007 | B2 |
| 7284030 | Ackaouy et al. | Oct 2007 | B2 |
| 7287252 | Bussiere et al. | Oct 2007 | B2 |
| 7315923 | Retnamma et al. | Jan 2008 | B2 |
| 7343356 | Prahlad | Mar 2008 | B2 |
| 7343453 | Prahlad et al. | Mar 2008 | B2 |
| 7343459 | Prahlad | Mar 2008 | B2 |
| 7346751 | Prahlad | Mar 2008 | B2 |
| 7383462 | Osaki et al. | Jun 2008 | B2 |
| 7389311 | Crescenti et al. | Jun 2008 | B1 |
| 7395282 | Crescenti et al. | Jul 2008 | B1 |
| 7412583 | Burton | Aug 2008 | B2 |
| 7437388 | DeVos | Oct 2008 | B1 |
| 7440982 | Lu et al. | Oct 2008 | B2 |
| 7454569 | Kavuri et al. | Nov 2008 | B2 |
| 7472238 | Gokhale et al. | Dec 2008 | B1 |
| 7472242 | Deshmukh et al. | Dec 2008 | B1 |
| 7490207 | Amarendran et al. | Feb 2009 | B2 |
| 7500053 | Kavuri et al. | Mar 2009 | B1 |
| 7512595 | McBride et al. | Mar 2009 | B1 |
| 7516186 | Borghetti et al. | Apr 2009 | B1 |
| 7519726 | Palliyll et al. | Apr 2009 | B2 |
| 7529782 | Prahlad et al. | May 2009 | B2 |
| 7536291 | Vijayan et al. | May 2009 | B1 |
| 7539710 | Haustein et al. | May 2009 | B1 |
| 7543125 | Gokhale | Jun 2009 | B2 |
| 7546324 | Prahlad et al. | Jun 2009 | B2 |
| 7552358 | Asgar-Deen et al. | Jun 2009 | B1 |
| 7567188 | Anglin et al. | Jul 2009 | B1 |
| 7568080 | Prahlad et al. | Jul 2009 | B2 |
| 7574692 | Herscu | Aug 2009 | B2 |
| 7577806 | Rowan | Aug 2009 | B2 |
| 7581077 | Ignatius et al. | Aug 2009 | B2 |
| 7584338 | Bricker et al. | Sep 2009 | B1 |
| 7603386 | Amarendran et al. | Oct 2009 | B2 |
| 7606844 | Kottomtharayil | Oct 2009 | B2 |
| 7613748 | Brockway et al. | Nov 2009 | B2 |
| 7613752 | Prahlad et al. | Nov 2009 | B2 |
| 7617253 | Prahlad et al. | Nov 2009 | B2 |
| 7617262 | Prahlad et al. | Nov 2009 | B2 |
| 7620710 | Kottomtharayil et al. | Nov 2009 | B2 |
| 7631194 | Wahlert et al. | Dec 2009 | B2 |
| 7636743 | Erofeev | Dec 2009 | B2 |
| 7651593 | Prahlad et al. | Jan 2010 | B2 |
| 7657550 | Prahlad et al. | Feb 2010 | B2 |
| 7660807 | Prahlad et al. | Feb 2010 | B2 |
| 7661028 | Prahlad et al. | Feb 2010 | B2 |
| 7664771 | Kusters | Feb 2010 | B2 |
| 7685126 | Patel et al. | Mar 2010 | B2 |
| 7702782 | Pai | Apr 2010 | B1 |
| 7720841 | Gu et al. | May 2010 | B2 |
| 7730113 | Payette et al. | Jun 2010 | B1 |
| 7734669 | Kottomtharayil et al. | Jun 2010 | B2 |
| 7734820 | Ranade et al. | Jun 2010 | B1 |
| 7739235 | Rousseau | Jun 2010 | B2 |
| 7743051 | Kashyap et al. | Jun 2010 | B1 |
| 7747577 | Cannon et al. | Jun 2010 | B2 |
| 7747579 | Prahlad et al. | Jun 2010 | B2 |
| 7761425 | Erickson et al. | Jul 2010 | B1 |
| 7779032 | Garfinkel | Aug 2010 | B1 |
| 7797279 | Starling et al. | Sep 2010 | B1 |
| 7801864 | Prahlad et al. | Sep 2010 | B2 |
| 7809914 | Kottomtharayil et al. | Oct 2010 | B2 |
| 7814074 | Anglin et al. | Oct 2010 | B2 |
| 7814149 | Stringham | Oct 2010 | B1 |
| 7822939 | Veprinsky et al. | Oct 2010 | B1 |
| 7827150 | Wu et al. | Nov 2010 | B1 |
| 7831795 | Prahlad et al. | Nov 2010 | B2 |
| 7840533 | Prahlad et al. | Nov 2010 | B2 |
| 7899871 | Kumar et al. | Mar 2011 | B1 |
| 7962452 | Anglin et al. | Jun 2011 | B2 |
| 8041907 | Wu et al. | Oct 2011 | B1 |
| 8074043 | Zeis | Dec 2011 | B1 |
| 8095756 | Somavarapu | Jan 2012 | B1 |
| 8108446 | Christiaens | Jan 2012 | B1 |
| 8108638 | Kishi | Jan 2012 | B2 |
| 8131669 | Cannon et al. | Mar 2012 | B2 |
| 8136025 | Zhu et al. | Mar 2012 | B1 |
| 8145614 | Zimran et al. | Mar 2012 | B1 |
| 8156086 | Lu et al. | Apr 2012 | B2 |
| 8170995 | Prahlad et al. | May 2012 | B2 |
| 8199911 | Tsaur et al. | Jun 2012 | B1 |
| 8200638 | Zheng et al. | Jun 2012 | B1 |
| 8200923 | Healey et al. | Jun 2012 | B1 |
| 8204862 | Paulzagade et al. | Jun 2012 | B1 |
| 8209334 | Doerner | Jun 2012 | B1 |
| 8224875 | Christiaens et al. | Jul 2012 | B1 |
| 8229954 | Kottomtharayil et al. | Jul 2012 | B2 |
| 8230195 | Amarendran et al. | Jul 2012 | B2 |
| 8261240 | Hoban | Sep 2012 | B2 |
| 8280854 | Emmert | Oct 2012 | B1 |
| 8285681 | Prahlad et al. | Oct 2012 | B2 |
| 8307177 | Prahlad et al. | Nov 2012 | B2 |
| 8352422 | Prahlad et al. | Jan 2013 | B2 |
| 8364652 | Vijayan et al. | Jan 2013 | B2 |
| 8370315 | Efstathopoulos et al. | Feb 2013 | B1 |
| 8370542 | Lu et al. | Feb 2013 | B2 |
| 8375008 | Gomes | Feb 2013 | B1 |
| 8375181 | Kekre et al. | Feb 2013 | B1 |
| 8407190 | Prahlad et al. | Mar 2013 | B2 |
| 8452739 | Jain et al. | May 2013 | B2 |
| 8468320 | Stringham | Jun 2013 | B1 |
| 8479304 | Clifford | Jul 2013 | B1 |
| 8484162 | Prahlad et al. | Jul 2013 | B2 |
| 8510573 | Muller et al. | Aug 2013 | B2 |
| 8527469 | Hwang et al. | Sep 2013 | B2 |
| 8549350 | Dutch et al. | Oct 2013 | B1 |
| 8572055 | Wu et al. | Oct 2013 | B1 |
| 8572340 | Vijayan et al. | Oct 2013 | B2 |
| 8577851 | Vijayan et al. | Nov 2013 | B2 |
| 8578109 | Vijayan et al. | Nov 2013 | B2 |
| 8578120 | Attarde et al. | Nov 2013 | B2 |
| 8595191 | Prahlad et al. | Nov 2013 | B2 |
| 8621240 | Auchmoody et al. | Dec 2013 | B1 |
| 8645320 | Prahlad et al. | Feb 2014 | B2 |
| 8719264 | Varadharajan | May 2014 | B2 |
| 8725688 | Lad | May 2014 | B2 |
| 8726242 | Ngo | May 2014 | B2 |
| 8745105 | Erofeev | Jun 2014 | B2 |
| 8775823 | Gokhale et al. | Jul 2014 | B2 |
| 8825720 | Xie et al. | Sep 2014 | B1 |
| 8849762 | Kumarasamy et al. | Sep 2014 | B2 |
| 8909980 | Lewis et al. | Dec 2014 | B1 |
| 8930306 | Ngo et al. | Jan 2015 | B1 |
| 8938481 | Kumarasamy et al. | Jan 2015 | B2 |
| 8954446 | Vijayan et al. | Feb 2015 | B2 |
| 9015181 | Kottomtharayil | Apr 2015 | B2 |
| 9020900 | Vijayan et al. | Apr 2015 | B2 |
| 9092441 | Patiejunas et al. | Jul 2015 | B1 |
| 9098495 | Gokhale | Aug 2015 | B2 |
| 9104623 | Vijayan et al. | Aug 2015 | B2 |
| 9110602 | Vijayan et al. | Aug 2015 | B2 |
| 9116850 | Vijayan et al. | Aug 2015 | B2 |
| 9128901 | Nickurak | Sep 2015 | B1 |
| 9171008 | Prahlad et al. | Oct 2015 | B2 |
| 9208160 | Prahlad et al. | Dec 2015 | B2 |
| 9218374 | Muller et al. | Dec 2015 | B2 |
| 9218375 | Muller et al. | Dec 2015 | B2 |
| 9218376 | Muller et al. | Dec 2015 | B2 |
| 9239687 | Vijayan et al. | Jan 2016 | B2 |
| 9244779 | Littlefield | Jan 2016 | B2 |
| 9251186 | Muller et al. | Feb 2016 | B2 |
| 9298386 | Baldwin et al. | Mar 2016 | B2 |
| 9298715 | Kumarasamy et al. | Mar 2016 | B2 |
| 9298724 | Patil | Mar 2016 | B1 |
| 9323820 | Lauinger et al. | Apr 2016 | B1 |
| 9336076 | Baldwin et al. | May 2016 | B2 |
| 9342537 | Kumarasamy et al. | May 2016 | B2 |
| 9405631 | Prahlad et al. | Aug 2016 | B2 |
| 9405763 | Prahlad et al. | Aug 2016 | B2 |
| 9442806 | Bardale | Sep 2016 | B1 |
| 9483486 | Christiaens et al. | Nov 2016 | B1 |
| 9575673 | Mitkar et al. | Feb 2017 | B2 |
| 9619480 | Vijayan et al. | Apr 2017 | B2 |
| 9633033 | Vijayan et al. | Apr 2017 | B2 |
| 9633056 | Attarde et al. | Apr 2017 | B2 |
| 9639289 | Vijayan et al. | May 2017 | B2 |
| 9665591 | Vijayan et al. | May 2017 | B2 |
| 9678968 | Taylor | Jun 2017 | B1 |
| 9858156 | Muller et al. | Jan 2018 | B2 |
| 9898225 | Vijayan et al. | Feb 2018 | B2 |
| 9898478 | Vijayan et al. | Feb 2018 | B2 |
| 9934238 | Mitkar et al. | Apr 2018 | B2 |
| 9990253 | Rajimwale et al. | Jun 2018 | B1 |
| 10061663 | Vijayan et al. | Aug 2018 | B2 |
| 10126973 | Vijayan et al. | Nov 2018 | B2 |
| 10176053 | Muller et al. | Jan 2019 | B2 |
| 10191816 | Vijayan et al. | Jan 2019 | B2 |
| 10229133 | Vijayan et al. | Mar 2019 | B2 |
| 10255143 | Vijayan et al. | Apr 2019 | B2 |
| 10310953 | Vijayan et al. | Jun 2019 | B2 |
| 10339106 | Vijayan et al. | Jul 2019 | B2 |
| 10380072 | Attarde et al. | Aug 2019 | B2 |
| 10387269 | Muller et al. | Aug 2019 | B2 |
| 10445293 | Attarde et al. | Oct 2019 | B2 |
| 10474638 | Mitkar et al. | Nov 2019 | B2 |
| 10481824 | Vijayan et al. | Nov 2019 | B2 |
| 10481825 | Vijayan et al. | Nov 2019 | B2 |
| 10481826 | Vijayan et al. | Nov 2019 | B2 |
| 10540327 | Ngo et al. | Jan 2020 | B2 |
| 10592357 | Vijayan et al. | Mar 2020 | B2 |
| 10740295 | Vijayan et al. | Aug 2020 | B2 |
| 10877856 | Vijayan et al. | Dec 2020 | B2 |
| 10956275 | Muller et al. | Mar 2021 | B2 |
| 10956286 | Vijayan et al. | Mar 2021 | B2 |
| 11016859 | Prahlad et al. | May 2021 | B2 |
| 11113246 | Mitkar et al. | Sep 2021 | B2 |
| 20010052015 | Lin et al. | Dec 2001 | A1 |
| 20020062439 | Cotugno et al. | May 2002 | A1 |
| 20020065892 | Malik | May 2002 | A1 |
| 20020083055 | Pachet | Jun 2002 | A1 |
| 20020107877 | Whiting et al. | Aug 2002 | A1 |
| 20020133601 | Kennamer et al. | Sep 2002 | A1 |
| 20020143892 | Mogul | Oct 2002 | A1 |
| 20020144250 | Yen | Oct 2002 | A1 |
| 20020169934 | Krapp et al. | Nov 2002 | A1 |
| 20030033308 | Patel et al. | Feb 2003 | A1 |
| 20030084076 | Sekiguchi et al. | May 2003 | A1 |
| 20030105716 | Lorin, Jr. et al. | Jun 2003 | A1 |
| 20030115346 | McHenry et al. | Jun 2003 | A1 |
| 20030149750 | Franzenburg | Aug 2003 | A1 |
| 20030172130 | Fruchtman et al. | Sep 2003 | A1 |
| 20030174648 | Wang et al. | Sep 2003 | A1 |
| 20030182310 | Charnock et al. | Sep 2003 | A1 |
| 20030187917 | Cohen | Oct 2003 | A1 |
| 20030188106 | Cohen | Oct 2003 | A1 |
| 20040010562 | Itonaga | Jan 2004 | A1 |
| 20040128442 | Hinshaw et al. | Jul 2004 | A1 |
| 20040148306 | Moulton et al. | Jul 2004 | A1 |
| 20040181519 | Anwar | Sep 2004 | A1 |
| 20040215746 | McCanne et al. | Oct 2004 | A1 |
| 20040230753 | Amiri et al. | Nov 2004 | A1 |
| 20050033756 | Kottomtharayil et al. | Feb 2005 | A1 |
| 20050060643 | Glass et al. | Mar 2005 | A1 |
| 20050066118 | Perry | Mar 2005 | A1 |
| 20050066225 | Rowan | Mar 2005 | A1 |
| 20050108292 | Burton | May 2005 | A1 |
| 20050114450 | DeVos | May 2005 | A1 |
| 20050117558 | Angermann et al. | Jun 2005 | A1 |
| 20050144202 | Chen | Jun 2005 | A1 |
| 20050204108 | Ofek et al. | Sep 2005 | A1 |
| 20050216659 | Ogawa et al. | Sep 2005 | A1 |
| 20050243609 | Yang et al. | Nov 2005 | A1 |
| 20050246393 | Coates et al. | Nov 2005 | A1 |
| 20050268068 | Ignatius et al. | Dec 2005 | A1 |
| 20050273654 | Chen et al. | Dec 2005 | A1 |
| 20060004808 | Hsu et al. | Jan 2006 | A1 |
| 20060005048 | Osaki | Jan 2006 | A1 |
| 20060010227 | Atluri | Jan 2006 | A1 |
| 20060020660 | Prasad et al. | Jan 2006 | A1 |
| 20060064456 | Kalthoff et al. | Mar 2006 | A1 |
| 20060074957 | Yamamoto et al. | Apr 2006 | A1 |
| 20060089954 | Anschutz | Apr 2006 | A1 |
| 20060095527 | Malik | May 2006 | A1 |
| 20060101096 | Fuerst | May 2006 | A1 |
| 20060129537 | Torii | Jun 2006 | A1 |
| 20060136685 | Griv | Jun 2006 | A1 |
| 20060167900 | Pingte et al. | Jul 2006 | A1 |
| 20060168318 | Twiss | Jul 2006 | A1 |
| 20060179261 | Twiss | Aug 2006 | A1 |
| 20060179405 | Chao et al. | Aug 2006 | A1 |
| 20060224846 | Amarendran et al. | Oct 2006 | A1 |
| 20060277154 | Lunt et al. | Dec 2006 | A1 |
| 20070006018 | Thompson | Jan 2007 | A1 |
| 20070038714 | Sell | Feb 2007 | A1 |
| 20070043757 | Benton et al. | Feb 2007 | A1 |
| 20070050526 | Abe et al. | Mar 2007 | A1 |
| 20070067263 | Syed | Mar 2007 | A1 |
| 20070073814 | Kamat et al. | Mar 2007 | A1 |
| 20070156966 | Sundarrajan et al. | Jul 2007 | A1 |
| 20070162462 | Zhang et al. | Jul 2007 | A1 |
| 20070179990 | Zimran et al. | Aug 2007 | A1 |
| 20070179995 | Prahlad et al. | Aug 2007 | A1 |
| 20070192444 | Ackaouy et al. | Aug 2007 | A1 |
| 20070192542 | Frolund et al. | Aug 2007 | A1 |
| 20070192544 | Frolund et al. | Aug 2007 | A1 |
| 20070203937 | Prahlad et al. | Aug 2007 | A1 |
| 20070250670 | Fineberg et al. | Oct 2007 | A1 |
| 20070255758 | Zheng et al. | Nov 2007 | A1 |
| 20080005141 | Zheng et al. | Jan 2008 | A1 |
| 20080005509 | Smith et al. | Jan 2008 | A1 |
| 20080016131 | Sandorfi et al. | Jan 2008 | A1 |
| 20080028149 | Pardikar et al. | Jan 2008 | A1 |
| 20080089342 | Lansing et al. | Apr 2008 | A1 |
| 20080091655 | Gokhale et al. | Apr 2008 | A1 |
| 20080091725 | Hwang et al. | Apr 2008 | A1 |
| 20080098041 | Chidambaran et al. | Apr 2008 | A1 |
| 20080098083 | Shergill et al. | Apr 2008 | A1 |
| 20080133561 | Dubnicki et al. | Jun 2008 | A1 |
| 20080140630 | Sato et al. | Jun 2008 | A1 |
| 20080159331 | Mace et al. | Jul 2008 | A1 |
| 20080229037 | Bunte et al. | Sep 2008 | A1 |
| 20080243769 | Arbour et al. | Oct 2008 | A1 |
| 20080243879 | Gokhale et al. | Oct 2008 | A1 |
| 20080243914 | Prahlad et al. | Oct 2008 | A1 |
| 20080243953 | Wu et al. | Oct 2008 | A1 |
| 20080243957 | Prahlad et al. | Oct 2008 | A1 |
| 20080243958 | Prahlad et al. | Oct 2008 | A1 |
| 20080244172 | Kano | Oct 2008 | A1 |
| 20080244199 | Nakamura et al. | Oct 2008 | A1 |
| 20080244204 | Cremelie et al. | Oct 2008 | A1 |
| 20080244205 | Amano | Oct 2008 | A1 |
| 20080250204 | Kavuri et al. | Oct 2008 | A1 |
| 20080256326 | Patterson et al. | Oct 2008 | A1 |
| 20080256431 | Hornberger | Oct 2008 | A1 |
| 20080281908 | McCanne et al. | Nov 2008 | A1 |
| 20080294660 | Patterson et al. | Nov 2008 | A1 |
| 20080294696 | Frandzel | Nov 2008 | A1 |
| 20080313236 | Vijayakumar et al. | Dec 2008 | A1 |
| 20080320151 | McCanne et al. | Dec 2008 | A1 |
| 20090013129 | Bondurant | Jan 2009 | A1 |
| 20090013258 | Hintermeister et al. | Jan 2009 | A1 |
| 20090043767 | Joshi et al. | Feb 2009 | A1 |
| 20090055425 | Evans et al. | Feb 2009 | A1 |
| 20090055471 | Kozat et al. | Feb 2009 | A1 |
| 20090077140 | Anglin et al. | Mar 2009 | A1 |
| 20090138481 | Chatley et al. | May 2009 | A1 |
| 20090144416 | Chatley et al. | Jun 2009 | A1 |
| 20090144422 | Chatley et al. | Jun 2009 | A1 |
| 20090171888 | Anglin | Jul 2009 | A1 |
| 20090172139 | Wong et al. | Jul 2009 | A1 |
| 20090182789 | Sandorfi et al. | Jul 2009 | A1 |
| 20090183162 | Kindel et al. | Jul 2009 | A1 |
| 20090204636 | Li et al. | Aug 2009 | A1 |
| 20090204649 | Wong et al. | Aug 2009 | A1 |
| 20090210431 | Marinkovic et al. | Aug 2009 | A1 |
| 20090228599 | Anglin et al. | Sep 2009 | A1 |
| 20090243846 | Yuuki | Oct 2009 | A1 |
| 20090254507 | Hosoya et al. | Oct 2009 | A1 |
| 20090268903 | Bojinov et al. | Oct 2009 | A1 |
| 20090271454 | Anglin et al. | Oct 2009 | A1 |
| 20090276454 | Smith | Nov 2009 | A1 |
| 20090307251 | Heller et al. | Dec 2009 | A1 |
| 20090319534 | Gokhale | Dec 2009 | A1 |
| 20090319585 | Gokhale | Dec 2009 | A1 |
| 20090327625 | Jaquette et al. | Dec 2009 | A1 |
| 20100005259 | Prahlad | Jan 2010 | A1 |
| 20100011178 | Feathergill | Jan 2010 | A1 |
| 20100031086 | Leppard | Feb 2010 | A1 |
| 20100036887 | Anglin et al. | Feb 2010 | A1 |
| 20100042790 | Mondal et al. | Feb 2010 | A1 |
| 20100049926 | Fuente et al. | Feb 2010 | A1 |
| 20100049927 | Fuente et al. | Feb 2010 | A1 |
| 20100070478 | Anglin | Mar 2010 | A1 |
| 20100077161 | Stoakes et al. | Mar 2010 | A1 |
| 20100082558 | Anglin et al. | Apr 2010 | A1 |
| 20100082672 | Kottomtharayil et al. | Apr 2010 | A1 |
| 20100088296 | Periyagaram et al. | Apr 2010 | A1 |
| 20100094817 | Ben-Shaul et al. | Apr 2010 | A1 |
| 20100100529 | Erofeev | Apr 2010 | A1 |
| 20100114833 | Mu | May 2010 | A1 |
| 20100153511 | Lin et al. | Jun 2010 | A1 |
| 20100169287 | Klose | Jul 2010 | A1 |
| 20100180075 | McCloskey et al. | Jul 2010 | A1 |
| 20100198864 | Ravid et al. | Aug 2010 | A1 |
| 20100223495 | Leppard | Sep 2010 | A1 |
| 20100250501 | Mandagere et al. | Sep 2010 | A1 |
| 20100250549 | Muller et al. | Sep 2010 | A1 |
| 20100250896 | Matze | Sep 2010 | A1 |
| 20100257142 | Murphy et al. | Oct 2010 | A1 |
| 20100257346 | Sosnosky et al. | Oct 2010 | A1 |
| 20100257403 | Virk et al. | Oct 2010 | A1 |
| 20100306283 | Johnson et al. | Dec 2010 | A1 |
| 20100312752 | Zeis et al. | Dec 2010 | A1 |
| 20100318759 | Hamilton et al. | Dec 2010 | A1 |
| 20100332401 | Prahlad et al. | Dec 2010 | A1 |
| 20100332454 | Prahlad et al. | Dec 2010 | A1 |
| 20110010498 | Lay et al. | Jan 2011 | A1 |
| 20110060940 | Taylor et al. | Mar 2011 | A1 |
| 20110072291 | Murase | Mar 2011 | A1 |
| 20110113012 | Gruhl et al. | May 2011 | A1 |
| 20110113013 | Reddy et al. | May 2011 | A1 |
| 20110113016 | Gruhl et al. | May 2011 | A1 |
| 20110119741 | Kelly et al. | May 2011 | A1 |
| 20110153570 | Kim et al. | Jun 2011 | A1 |
| 20110161723 | Taleck et al. | Jun 2011 | A1 |
| 20110167221 | Pangal et al. | Jul 2011 | A1 |
| 20110258161 | Constantinescu et al. | Oct 2011 | A1 |
| 20110276543 | Matze | Nov 2011 | A1 |
| 20110289281 | Spackman | Nov 2011 | A1 |
| 20110302140 | Gokhale et al. | Dec 2011 | A1 |
| 20110314070 | Brown et al. | Dec 2011 | A1 |
| 20110314400 | Mital et al. | Dec 2011 | A1 |
| 20120011101 | Fang et al. | Jan 2012 | A1 |
| 20120016839 | Yueh | Jan 2012 | A1 |
| 20120016845 | Bates | Jan 2012 | A1 |
| 20120078881 | Crump et al. | Mar 2012 | A1 |
| 20120084272 | Garces-Erice et al. | Apr 2012 | A1 |
| 20120089574 | Doerner | Apr 2012 | A1 |
| 20120150818 | Vijayan Retnamma | Jun 2012 | A1 |
| 20120166403 | Kim et al. | Jun 2012 | A1 |
| 20120185437 | Pavlov et al. | Jul 2012 | A1 |
| 20120221817 | Yueh | Aug 2012 | A1 |
| 20120233417 | Kalach | Sep 2012 | A1 |
| 20120303622 | Dean et al. | Nov 2012 | A1 |
| 20130006943 | Chavda et al. | Jan 2013 | A1 |
| 20130219470 | Chintala et al. | Aug 2013 | A1 |
| 20130238562 | Kumarasamy et al. | Sep 2013 | A1 |
| 20130238572 | Prahlad et al. | Sep 2013 | A1 |
| 20130262396 | Kripalani et al. | Oct 2013 | A1 |
| 20130339298 | Muller et al. | Dec 2013 | A1 |
| 20130339310 | Muller et al. | Dec 2013 | A1 |
| 20140032940 | Sartirana et al. | Jan 2014 | A1 |
| 20140115287 | Schnapp et al. | Apr 2014 | A1 |
| 20140181028 | Prahlad et al. | Jun 2014 | A1 |
| 20140195749 | Colgrove et al. | Jul 2014 | A1 |
| 20140196037 | Gopalan et al. | Jul 2014 | A1 |
| 20140201142 | Varadharajan et al. | Jul 2014 | A1 |
| 20140201150 | Kumarasamy et al. | Jul 2014 | A1 |
| 20140201153 | Vijayan et al. | Jul 2014 | A1 |
| 20140201170 | Vijayan et al. | Jul 2014 | A1 |
| 20140201171 | Vijayan et al. | Jul 2014 | A1 |
| 20140229451 | Venkatesh et al. | Aug 2014 | A1 |
| 20140250076 | Lad | Sep 2014 | A1 |
| 20140258245 | Estes | Sep 2014 | A1 |
| 20140281758 | Klein et al. | Sep 2014 | A1 |
| 20140289225 | Chan et al. | Sep 2014 | A1 |
| 20140337285 | Gokhale et al. | Nov 2014 | A1 |
| 20140337664 | Gokhale et al. | Nov 2014 | A1 |
| 20150012698 | Bolla et al. | Jan 2015 | A1 |
| 20150088821 | Blea et al. | Mar 2015 | A1 |
| 20150089185 | Brandyberry et al. | Mar 2015 | A1 |
| 20150134611 | Avati et al. | May 2015 | A1 |
| 20150154220 | Ngo et al. | Jun 2015 | A1 |
| 20150161015 | Kumarasamy et al. | Jun 2015 | A1 |
| 20150212893 | Pawar et al. | Jul 2015 | A1 |
| 20150212894 | Pawar et al. | Jul 2015 | A1 |
| 20150212895 | Pawar et al. | Jul 2015 | A1 |
| 20150212896 | Pawar et al. | Jul 2015 | A1 |
| 20150212897 | Pawar et al. | Jul 2015 | A1 |
| 20150248466 | Jernigan, IV et al. | Sep 2015 | A1 |
| 20150261776 | Attarde et al. | Sep 2015 | A1 |
| 20150261792 | Attarde et al. | Sep 2015 | A1 |
| 20150269032 | Muthyala et al. | Sep 2015 | A1 |
| 20150269212 | Kramer et al. | Sep 2015 | A1 |
| 20150278104 | Moon et al. | Oct 2015 | A1 |
| 20150347306 | Gschwind | Dec 2015 | A1 |
| 20150378839 | Langouev et al. | Dec 2015 | A1 |
| 20160026405 | Dhuse | Jan 2016 | A1 |
| 20160041880 | Mitkar et al. | Feb 2016 | A1 |
| 20160042007 | Vijayan et al. | Feb 2016 | A1 |
| 20160042090 | Mitkar et al. | Feb 2016 | A1 |
| 20160062846 | Nallathambi et al. | Mar 2016 | A1 |
| 20160065671 | Nallathambi et al. | Mar 2016 | A1 |
| 20160139836 | Nallathambi et al. | May 2016 | A1 |
| 20160142483 | Nallathambi et al. | May 2016 | A1 |
| 20160154709 | Mitkar et al. | Jun 2016 | A1 |
| 20160170657 | Suehr et al. | Jun 2016 | A1 |
| 20160188416 | Muller et al. | Jun 2016 | A1 |
| 20160196070 | Vijayan et al. | Jul 2016 | A1 |
| 20160266828 | Vijayan et al. | Sep 2016 | A1 |
| 20160266980 | Muller et al. | Sep 2016 | A1 |
| 20160267159 | Muller et al. | Sep 2016 | A1 |
| 20160299818 | Vijayan et al. | Oct 2016 | A1 |
| 20160306707 | Vijayan et al. | Oct 2016 | A1 |
| 20160306708 | Prahlad et al. | Oct 2016 | A1 |
| 20160306818 | Vijayan et al. | Oct 2016 | A1 |
| 20160350391 | Vijayan et al. | Dec 2016 | A1 |
| 20170031768 | Sarab | Feb 2017 | A1 |
| 20170083558 | Vijayan et al. | Mar 2017 | A1 |
| 20170083563 | Vijayan et al. | Mar 2017 | A1 |
| 20170090773 | Vijayan et al. | Mar 2017 | A1 |
| 20170090786 | Parab et al. | Mar 2017 | A1 |
| 20170124108 | Mitkar et al. | May 2017 | A1 |
| 20170168903 | Dornemann et al. | May 2017 | A1 |
| 20170185488 | Kumarasamy et al. | Jun 2017 | A1 |
| 20170192860 | Vijayan et al. | Jul 2017 | A1 |
| 20170192861 | Vijayan et al. | Jul 2017 | A1 |
| 20170192866 | Vijayan et al. | Jul 2017 | A1 |
| 20170192868 | Vijayan et al. | Jul 2017 | A1 |
| 20170193003 | Vijayan et al. | Jul 2017 | A1 |
| 20170235647 | Kilaru et al. | Aug 2017 | A1 |
| 20170242871 | Kilaru et al. | Aug 2017 | A1 |
| 20170262217 | Pradhan et al. | Sep 2017 | A1 |
| 20170315876 | Dornquast et al. | Nov 2017 | A1 |
| 20180075055 | Ngo et al. | Mar 2018 | A1 |
| 20180189314 | Mitkar et al. | Jul 2018 | A1 |
| 20180196720 | Muller et al. | Jul 2018 | A1 |
| 20190012237 | Prahlad et al. | Jan 2019 | A1 |
| 20190012328 | Attarde et al. | Jan 2019 | A1 |
| 20190026305 | Vijayan et al. | Jan 2019 | A1 |
| 20190179805 | Prahlad et al. | Jun 2019 | A1 |
| 20190188088 | Muller et al. | Jun 2019 | A1 |
| 20190205290 | Vijayan et al. | Jul 2019 | A1 |
| 20190227879 | Vijayan et al. | Jul 2019 | A1 |
| 20190272220 | Vijayan et al. | Sep 2019 | A1 |
| 20190272221 | Vijayan et al. | Sep 2019 | A1 |
| 20190310968 | Attarde et al. | Oct 2019 | A1 |
| 20200089659 | Attarde et al. | Mar 2020 | A1 |
| 20200104052 | Vijayan et al. | Apr 2020 | A1 |
| 20200104213 | Muller et al. | Apr 2020 | A1 |
| 20200117641 | Mitkar et al. | Apr 2020 | A1 |
| 20200167091 | Haridas et al. | May 2020 | A1 |
| 20200167240 | Haridas et al. | May 2020 | A1 |
| 20200250145 | Ngo et al. | Aug 2020 | A1 |
| 20200327017 | Vijayan et al. | Oct 2020 | A1 |
| 20200334210 | Vijayan et al. | Oct 2020 | A1 |
| 20200358621 | Ngo | Nov 2020 | A1 |
| Number | Date | Country |
|---|---|---|
| 0259912 | Mar 1988 | EP |
| 0405926 | Jan 1991 | EP |
| 0467546 | Jan 1992 | EP |
| 0541281 | May 1993 | EP |
| 0774715 | May 1997 | EP |
| 0809184 | Nov 1997 | EP |
| 0899662 | Mar 1999 | EP |
| 0981090 | Feb 2000 | EP |
| WO 1995013580 | May 1995 | WO |
| WO 99009480 | Feb 1999 | WO |
| WO 1999012098 | Mar 1999 | WO |
| WO 2002005466 | Jan 2002 | WO |
| WO 2006052872 | May 2006 | WO |
| WO 2010013292 | Feb 2010 | WO |
| WO 2010140264 | Dec 2010 | WO |
| WO 2012044366 | Apr 2012 | WO |
| WO 2012044367 | Apr 2012 | WO |
| WO 2013188550 | Dec 2013 | WO |
| Entry |
|---|
| Armstead et al., “Implementation of a Campus-Wide Distributed Mass Storage Service: The Dream vs. Reality,” IEEE, 1995, pp. 190-199. |
| Arneson, “Mass Storage Archiving in Network Environments,” Digest of Papers, Ninth IEEE Symposium on Mass Storage Systems, Oct. 31, 1988-Nov. 3, 1988, pp. 45-50, Monterey, CA. |
| Bhagwat, Extreme Binning: Scalable, Parallel Deduplication for Chunk-based File Backup. IEEE 2009, 9 pages. |
| Cabrera, et al. “ADSM: A Multi-Platform, Scalable, Back-up and Archive Mass Storage System,” Digest of Papers, Compcon '95, Proceedings of the 40th IEEE Computer Society International Conference, Mar. 5, 1995-Mar. 9, 1995, pp. 420-427, San Francisco, CA. |
| Cohen, Edith, et al.,. “The Age Penalty and Its Effect on Cache Performance.” In USITS, pp. 73-84. 2001. |
| Cohen, Edith, et al.,.“Aging through cascaded caches: Performance issues in the distribution of web content.” In ACM SIGCOMM Computer Communication Review, vol. 31, No. 4, pp. 41-53. ACM, 2001. |
| Cohen, Edith, et al.,. “Refreshment policies for web content caches.” Computer Networks 38.6 (2002): 795-808. |
| CommVault Systems, Inc. “Continuous Data Replicator 7.0,” Product Data Sheet, 2007. |
| CommVault Systems, Inc., “Deduplication—How to,” http://documentation.commvault.com/commvault/release_8_0_0/books_online_1/english_US/features/single_instance/single_instance_how_to.htm, internet accessed on Jan. 26, 2009, 7 pages. |
| CommVault Systems, Inc., “Deduplication,” http://documentation.commvault.com/commvault/release_8_0_0/books_online_1/english_US/features/single_instance/single_instance.htm, internet accessed on Jan. 26, 2009, 9 pages. |
| Diligent Technologies HyperFactor, http://www.dilligent.com/products:protecTIER-1:HyperFactor-1, Internet accessed on Dec. 5, 2008, 2 pages. |
| Dubnicki, et al. “HYDRAstor: A Scalable Secondary Storage.” FAST. vol. 9.2009, 74 pages. |
| Eitel, “Backup and Storage Management in Distributed Heterogeneous Environments,” IEEE, 1994, pp. 124-126. |
| Gait, “The Optical File Cabinet: A Random-Access File system for Write-Once Optical Disks,” IEEE Computer, vol. 21, No. 6, pp. 11-22 (1988). |
| Guo et al., Building a High-performance Deduplication System, Jun. 15, 2011, retrieved from the Internet at <U RL: http://dl.acm.org/citation.cfm?id=2002206>, pp. 1-14. |
| Jander, “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4(Mar. 21, 1998), pp. 64-72. |
| Kornblum, Jesse, “Identifying Almost Identical Files Using Context Triggered Piecewise Hashing,” www.sciencedirect.com, Digital Investigation 3S (2006), pp. S91-S97. |
| Lortu Software Development, “Kondar Technology-Deduplication,” http://www.lortu.com/en/deduplication.asp, Internet accessed on Dec. 5, 2008, 3 pages. |
| Overland Storage, “Data Deduplication,” http://www.overlandstorage.com/topics/data_deduplication.html, Internet accessed on Dec. 5, 2008, 2 pages. |
| Quantum Corporation, “Data De-Duplication Background: A Technical White Paper,” May 2008, 13 pages. |
| Rosenblum et al., “The Design and Implementation of a Log-Structure File System,” Operating Systems Review SIGOPS, vol. 25, No. 5, New York, US, pp. 1-15 (May 1991). |
| Wei, et al. “MAD2: A scalable high-throughput exact deduplication approach for network backup services.” Mass Storage Systems and Technologies (MSST), 2010 IEEE 26th Symposium on. IEEE, 2010, 14 pages. |
| Wolman et al., On the scale and performance of cooperative Web proxy caching, 1999. |
| Wu, et al., Load Balancing and Hot Spot Relief for Hash Routing among a Collection of Proxy Caches, 1999. |
| International Search Report and Written Opinion, International Application No. PCT/US2009/58137, dated Dec. 23, 2009, 14 pages. |
| International Search Report and Written Opinion, International Application No. PCT/US2011/030804, dated Jun. 9, 2011. |
| International Search Report and Written Opinion, International Application No. PCT/US2011/030814, dated Jun. 9, 2011. |
| International Search Report and Written Opinion, International Application No. PCT/US2013/045443 dated Nov. 14, 2013, 16 pages. |
| International Preliminary Report on Patentability, International Application No. PCT/US2013/045443 dated Dec. 16, 2014 11 pages. |
| Ashton, et al., “Two Decades of policy-based storage management for the IBM mainframe computer”, www.research.ibm.com, 19 pages, published Apr. 10, 2003, printed Jan. 3, 2009., www.research.ibm.com, Apr. 10, 2003, pp. 19. |
| Gray (#2 of 2, pp. 604-609), Jim; Reuter Andreas, Transaction Processing Concepts and Techniques, Morgan Kaufmann Publisher, USA 1994, pp. 604-609. |
| Huff, KL, “Data Set Usage Sequence Number,” IBM Technical Disclosure Bulletin, vol. 24, No. 5, Oct. 1981 New York, US, pp. 2404-2406. |
| Kashyap, et al., “Professional Services Automation: A knowledge Management approach using LSI and Domain specific Ontologies”, FLAIRS-01 Proceedings, 2001, pp. 300-302. |
| Retnamma, et al., U.S. Appl. No. 13/324,884, now abandoned, filed Dec. 13, 2011, Client-Side Repository in a Networked Deduplicated Storage System. |
| Muller, et al., U.S. Appl. No. 13/916,385, published as 2013/0339298, now abandoned, filed Jun. 12, 2013, Collaborative Backup in a Networked Storage System. |
| Muller, et al., U.S. Appl. No. 13/916,429, published as 2013/0339310, now abandoned, filed Jun. 12, 2013, Restore Using a Client Side Signature Repository in a Networked Storage System. |
| Attarde, et al., U.S. Appl. No. 14/216,689, now U.S. Pat. No. 10,380,072, filed Mar. 17, 2014, Managing Deletions From a Deduplication Database. |
| Vijayan, et al., U.S. Appl. No. 14/682,988, now U.S. Pat. No. 10,339,106, filed Apr. 9, 2015, Highly Reusable Deduplication Database After Disaster Recovery. |
| Vijayan, et al., U.S. Appl. No. 14/721,971, published as 2016/0350391, now abandoned, filed May 26, 2015, Replication Using Deduplicated Secondary Copy Data. |
| Muller, et al., U.S. Appl. No. 14/956,185, now abandoned, filed Dec. 1, 2015, Collaborative Restore in a Networked Storage System. |
| Muller, et al., U.S. Appl. No. 14/956,213, published as 2016/0188416, now abandoned, filed Dec. 1, 2015, Dedicated Client-Side Signature Generator in a Networked Storage System. |
| Vijayan, et al., U.S. Appl. No. 14/967,097, published as 2016/0196070, now abandoned, filed Dec. 11, 2015, Systems and Methods for Retaining and Using Data Block Signatures in Data Protection Operations. |
| Vijayan, et al., U.S. Appl. No. 15/197,434, published as 2016/0306707, filed Jun. 29, 2016, Highly Reusable Deduplication Database After Disaster Recovery. |
| Vijayan, et al., U.S. Appl. No. 15/282,445, now U.S. Pat. No. 10,481,824, filed Sep. 30, 2016, Replication Using Deduplicated Secondary Copy Data. |
| Vijayan, et al., U.S. Appl. No. 15/282,553, now U.S. Pat. No. 10,481,825, filed Sep. 30, 2016, Replication Using Deduplicated Secondary Copy Data. |
| Vijayan, et al., U.S. Appl. No. 15/282,668, now U.S. Pat. No. 10,481,826, filed Sep. 30, 2016, Replication Using Deduplicated Secondary Copy Data. |
| Vijayan, et al., U.S. Appl. No. 15/299,254, now U.S. Pat. No. 10,310,953, filed Oct. 20, 2016, System for Redirecting Requests After a Secondary Storage Computing Device Failure. |
| Vijayan, et al., U.S. Appl. No. 15/299,290, now U.S. Pat. No. 10,255,143, filed Oct. 20, 2016, Deduplication Replication in a Distributed Deduplication Data Storage System. |
| Vijayan, et al., U.S. Appl. No. 15/472,737, now U.S. Pat. No. 10,126,973, filed Mar. 29, 2017, Systems and Methods for Retaining and Using Data Block Signatures in Data Protection Operations. |
| Vijayan, et al., U.S. Appl. No. 15/474,730, now U.S. Pat. No. 10,229,133, filed Mar. 30, 2017, High Availability Distributed Deduplicated Storage System. |
| Muller, et al., U.S. Appl. No. 15/820,152, now U.S. Pat. No. 10,387,269, filed Nov. 21, 2017, Dedicated Client-Side Signature Generator in a Networked Storage System. |
| Mitkar, et al., U.S. Appl. No. 15/899,699, now U.S. Pat. No. 10,474,638, filed Feb. 20, 2018, Accessing a File System Using Tiered Deduplication. |
| Attarde, et al., U.S. Appl. No. 16/020,900, now U.S. Pat. No. 10,445,293, filed Jun. 27, 2018, Managing Deletions From a Deduplication Database. |
| Muller, et al., U.S. Appl. No. 16/195,461 published as 2019/0188088, filed Nov. 19, 2018, Collaborative Restore in a Networked Storage System. |
| Haridas, et al., U.S. Appl. No. 16/201,856, filed Nov. 27, 2018, Using Interoperability Between Components of a Data Storage Management System and Appliances for Data Storage and Deduplication to Generate Secondary and Tertiary Copies. |
| Haridas, et al., U.S. Appl. No. 16/201,897, filed Nov. 27, 2018, Generating Backup Copies Through Interoperability Between Components of a Data Storage Management System and Appliances for Data Storage and Deduplication. |
| Vijayan, et al., U.S. Appl. No. 16/224,383, published as 2019/0227879, filed Dec. 18, 2018, Client-Side Repository in a Networked Deduplicated Storage System. |
| Vijayan, et al., U.S. Appl. No. 16/232,950, published as 2019/0272220, filed Dec. 26, 2018, Deduplication Replication in a Distributed Deduplication Data Storage System. |
| Vijayan, et al., U.S. Appl. No. 16/232,956, published as 2019/0272221, filed Dec. 26, 2018, System for Redirecting Requests After a Secondary Storage Computing Device Failure. |
| Vijayan, et al., U.S. Appl. No. 16/234,976, published as 2019/0205290, filed Dec. 28, 2018, High Availability Distributed Deduplicated Storage System. |
| Vijayan, et al., U.S. Appl. No. 16/380,469, filed Apr. 10, 2019, Restore Using Deduplicated Secondary Copy Data. |
| Ngo, U.S. Appl. No. 16/407,040, filed May 8, 2019, Use of Data Block Signatures for Monitoring in an Information Management System. |
| Attarde, et al., U.S. Appl. No. 16/452,309, published as 2019/0310968, filed Jun. 25, 2019, Managing Deletions From a Deduplication Database. |
| Muller, et al., U.S. Appl. No. 16/455,090, now abandoned, filed Jun. 27, 2019, Dedicated Client-Side Signature Generator in a Networked Storage System. |
| Attarde, et al., U.S. Appl. No. 16/550,094, filed Aug. 23, 2019, Managing Deletions From a Deduplication Database. |
| Muller, et al., U.S. Appl. No. 16/564,613, filed Sep. 9, 2019, Dedicated Client-Side Signature Generator in a Networked Storage System. |
| Mitkar, et al., U.S. Appl. No. 16/591,400, filed Oct. 2, 2019, Accessing a File System Using Tiered Deduplication. |
| Vijayan, et al., U.S. Appl. No. 16/596,381, filed Oct. 8, 2019, Replication Using Deduplicated Secondary Copy Data. |
| Ngo, et al., U.S. Appl. No. 16/700,938, filed Dec. 2, 2019, Synchronized Data Duplication. |
| Prahlad, et al., U.S. Appl. No. 12/724,292, now U.S. Pat. No. 8,484,162, filed Mar. 15, 2010, De-Duplication Systems and Methods for Application-Specific Data. |
| Prahlad, et al., U.S. Appl. No. 13/931,654, now U.S. Pat. No. 9,405,763, filed Jun. 28, 2013, De-Duplication Systems and Methods for Application-Specific Data. |
| Prahlad, et al., U.S. Appl. No. 15/198,269, now abandoned, filed Jun. 30, 2016, De-Duplication Systems and Methods for Application-Specific Data. |
| Prahlad, et al., U.S. Appl. No. 15/991,849, published as 2019/0012237, filed May 29, 2018, De-Duplication Systems and Methods for Application-Specific Data. |
| Vijayan, et al., U.S. Appl. No. 12/982,086, now U.S. Pat. No. 8,577,851, filed Dec. 30, 2010, Content Aligned Block-Based Deduplication. |
| Vijayan, et al., U.S. Appl. No. 12/982,071, now U.S. Pat. No. 8,364,652, filed Dec. 30, 2010, Content Aligned Block-Based Deduplication. |
| Vijayan, et al., U.S. Appl. No. 13/750,105, now U.S. Pat. No. 9,110,602, filed Jan. 25, 2013, Content Aligned Block-Based Deduplication. |
| Vijayan, et al., U.S. Appl. No. 14/821,418, now U.S. Pat. No. 9,619,480, filed Aug. 7, 2015, Content Aligned Block-Based Deduplication. |
| Vijayan, et al., U.S. Appl. No. 15/449,246, now U.S. Pat. No. 9,898,225, filed Mar. 3, 2017, Content Aligned Block-Based Deduplication. |
| Retnamma, et al., U.S. Appl. No. 13/324,884, abandoned, filed Dec. 13, 2011, Client-Side Repository in a Networked Deduplicated Storage System. |
| Retnamma, et al., U.S. Appl. No. 13/324,817, now U.S. Pat. No. 8,954,446, filed Dec. 13, 2011, Client-Side Repository in a Networked Deduplicated Storage System. |
| Retnamma, et al., U.S. Appl. No. 13/324,792, now U.S. Pat. No. 9,116,850, filed Dec. 13, 2011, Client-Side Repository in a Networked Deduplicated Storage System. |
| Vijayan, et al., U.S. Appl. No. 13/324,848, now U.S. Pat. No. 9,104,623, filed Dec. 13, 2011, Client-Side Repository in a Networked Deduplicated Storage System. |
| Vijayan, et al., U.S. Appl. No. 14/673,021, now U.S. Pat. No. 10,191,816, filed Mar. 30, 2015, Client-Side Repository in a Networked Deduplicated Storage System. |
| Vijayan, et al., U.S. Appl. No. 16/224,383, filed Dec. 18, 2018, Client-Side Repository in a Networked Deduplicated Storage System. |
| Vijayan, et al., U.S. Appl. No. 13/324,613, now U.S. Pat. No. 9,020,900, filed Dec. 13, 2011, Distributed Deduplicated Storage System. |
| Vijayan, et al., U.S. Appl. No. 14/673,586, now U.S. Pat. No. 9,898,478, filed Mar. 30, 2015, Distributed Deduplicated Storage System. |
| Vijayan, et al., U.S. Appl. No. 15/875,896, published as 2019/0026305, filed Jan. 19, 2018, Distributed Deduplicated Storage System. |
| Vijayan, et al., U.S. Appl. No. 12/982,100, now U.S. Pat. No. 8,578,109, filed Dec. 30, 2010, Systems and Methods for Retaining and Using Data Block Signatures in Data Protection Operations. |
| Vijayan, et al., U.S. Appl. No. 14/040,247, now U.S. Pat. No. 9,239,687, filed Sep. 27, 2013, Systems and Methods for Retaining and Using Data Block Signatures in Data Protection Operations. |
| Vijayan, et al., U.S. Appl. No. 14/967,097, published as 2016/0196070, abandoned, filed Dec. 11, 2015, Systems and Methods for Retaining and Using Data Block Signatures in Data Protection Operations. |
| Vijayan, et al., U.S. Appl. No. 15/074,109, now U.S. Pat. No. 9,639,289, filed Mar. 18, 2016, Systems and Methods for Retaining and Using Data Block Signatures in Data Protection Operations. |
| Vijayan, et al., U.S. Appl. No. 15/472,737, now U.S. Pat. No. 10,126,973, filed Mar. 29, 17, Systems and Methods for Retaining and Using Data Block Signatures in Data Protection Operations. |
| Vijayan, et al., U.S. Appl. No. 12/982,087, now U.S. Pat. No. 8,572,340, filed Dec. 30, 2010, Systems and Methods for Retaining and Using Data Block Signatures in Data Protection Operations. |
| Muller, et al., U.S. Appl. No. 13/916,409, now U.S. Pat. No. 9,218,374, filed Jun. 12, 2013, Collaborative Restore in a Networked Storage System. |
| Muller, et al., U.S. Appl. No. 14/956,185, abandoned, filed Dec. 1, 2015, Collaborative Restore in a Networked Storage System. |
| Muller, et al., U.S. Appl. No. 15/067,766, now U.S. Pat. No. 10,176,053, filed Mar. 11, 2016, Collaborative Restore in a Networked Storage System. |
| Muller, et al., U.S. Appl. No. 16/195,461, filed Nov. 19, 2018, Collaborative Restore in a Networked Storage System. |
| Muller, et al., U.S. Appl. No. 13/916,429, published as 2013/0339310, abandoned, filed Jun. 12, 2013, Restore Using a Client Side Signature Repository in a Networked Storage System. |
| Muller, et al., U.S. Appl. No. 13/916,385, published as 2013/0339298, abandoned, filed Jun. 12, 2013, Collaborative Backup in a Networked Storage System. |
| Muller, et al., U.S. Appl. No. 13/916,434, now U.S. Pat. No. 9,251,186, filed Jun. 12, 2013, Backup Using a Client-Side Signature Repository in a Networked Storage System. |
| Muller, et al., U.S. Appl. No. 13/916,458, now U.S. Pat. No. 9,218,375, filed Jun. 12, 2013, Dedicated Client-Side Signature Generator in a Networked Storage System. |
| Muller, et al., U.S. Appl. No. 14/956,213, published as 2016/0188416, abandoned, filed Dec. 1, 2015, Dedicated Client-Side Signature Generator in a Networked Storage System. |
| Muller, et al., U.S. Appl. No. 15/067,714, now U.S. Pat. No. 9,858,156, filed Mar. 11, 2016, Dedicated Client-Side Signature Generator in a Networked Storage System. |
| Muller, et al., U.S. Appl. No. 15/820,152, published as 2018/0196720, filed Nov. 21, 2017, Dedicated Client-Side Signature Generator in a Networked Storage System. |
| Muller, et al., U.S. Appl. No. 13/916,467, now U.S. Pat. No. 9,218,376, filed Jun. 12, 2013, Intelligent Data Sourcing in a Networked Storage System. |
| Vijayan, et al., U.S. Appl. No. 14/152,509, now U.S. Pat. No. 9,633,033, filed Jan. 10, 2014, High Availability Distributed Deduplicated Storage System. |
| Vijayan, et al., U.S. Appl. No. 15/474,730, published as 2017/0206219, filed Mar. 30, 2017, High Availability Distributed Deduplicated Storage System. |
| Vijayan, et al., U.S. Appl. No. 16/234,976, filed Dec. 28, 2018, High Availability Distributed Deduplicated Storage System. |
| Attarde, et al., U.S. Appl. No. 14/216,703, now U.S. Pat. No. 9,633,056, filed Mar. 17, 2014, Maintaining a Deduplication Database. |
| Attarde, et al., U.S. Appl. No. 14/216,689, published as 2015/0261776, filed Mar. 17, 2014, Managing Deletions From a Deduplication Database. |
| Attarde, et al., U.S. Appl. No. 16/020,900, published as 2019/0012328, filed Jun. 27, 2018, Managing Deletions From a Deduplication Database. |
| Vijayan, et al., U.S. Appl. No. 14/152,549, now U.S. Pat. No. 9,665,591, filed Jan. 10, 2014, High Availability Distributed Deduplicated Storage System. |
| Mitkar, et al., U.S. Appl. No. 14/527,678, now U.S. Pat. No. 9,575,673, filed Oct. 29, 2014, Accessing a File System Using Tiered Deduplication. |
| Mitkar, et al., U.S. Appl. No. 15/399,597, now U.S. Pat. No. 9,934,238, filed Jan. 5, 2017, Accessing a File System Using Tiered Deduplication. |
| Mitkar, et al., U.S. Appl. No. 15/899,699, published as 2018/0189314, filed Feb. 20, 2018, Accessing a File System Using Tiered Deduplication. |
| Ngo, et al., U.S. Appl. No. 12/499,717, now U.S. Pat. No. 8,930,306, filed Jul. 8, 2009, Synchronized Data Duplication. |
| Ngo, et al., U.S. Appl. No. 14/555,322, now abandoned, filed Nov. 26, 2014, Synchronized Data Duplication. |
| Ngo, et al., U.S. Appl. No. 15/684,812, published as 2018/0075055, filed Aug. 23, 2017, Synchronized Data Duplication. |
| Vijayan, et al., U.S. Appl. No. 14/721,971, published as 2016/0350391, filed May 26, 2015, Replication Using Deduplicated Secondary Copy Data. |
| Vijayan, et al., U.S. Appl. No. 15/282,445, published as 2017/0083563, filed Sep. 30, 2016, Replication Using Deduplicated Secondary Copy Data. |
| Vijayan, et al., U.S. Appl. No. 15/282,553, published as 2017/0083558, filed Sep. 30, 2016, Replication Using Deduplicated Secondary Copy Data. |
| Vijayan, et al., U.S. Appl. No. 15/282,668, published as 2017/0090773, filed Sep. 30, 2016, Replication Using Deduplicated Secondary Copy Data. |
| Vijayan, et al., U.S. Appl. No. 14/682,988, published as 2016/0299818, filed Apr. 9, 2015, Highly Reusable Deduplication Database After Disaster Recovery. |
| Vijayan, et al., U.S. Appl. No. 15/197,435, published as 2016/0306818, filed Jun. 29, 2016, Highly Reusable Deduplication Database After Disaster Recovery. |
| Vijayan, et al., U.S. Appl. No. 15/299,299, published as 2017/0193003, filed Oct. 20, 2016, Redundant and Robust Distributed Deduplication Data Storage System. |
| Vijayan, et al., U.S. Appl. No. 15/299,254, published as 2017/0192866, filed Oct. 20, 2016, System for Redirecting Requests After a Secondary Storage Computing Device Failure. |
| Vijayan, et al., U.S. Appl. No. 16/232,956, filed Dec. 26, 2018, System for Redirecting Requests After a Secondary Storage Computing Device Failure. |
| Vijayan, et al., U.S. Appl. No. 15/299,290, published as 2017/0192860, filed Oct. 20, 2016, Deduplication Replication in a Distributed Deduplication Data Storage System. |
| Vijayan, et al., U.S. Appl. No. 16/232,950, filed Dec. 26, 2018, Deduplication Replication in a Distributed Deduplication Data Storage System. |
| Vijayan, et al., U.S. Appl. No. 15/299,280, now. U.S. Pat. No. 10,061,663, filed Oct. 20, 2016, Rebuilding Deduplication Data in a Distributed Deduplication Data Storage System. |
| Vijayan, et al., U.S. Appl. No. 15/299,298, published as 2017/0192861, filed Oct. 20, 2016, Distributed File System in a Distributed Deduplication Data Storage System. |
| Vijayan, et al., U.S. Appl. No. 15/299,281, published as 2017/0192868, filed Oct. 20, 2016, User Interface for Identifying a Location of a Failed Secondary Storage Device. |
| Vijayan, U.S. Appl. No. 16/380,469, filed Apr. 10, 2019, Restore Using Deduplicated Secondary Copy Data. |
| Final Office Action for Japanese Application No. 2003531581, Examiner Kudoh, dated Mar. 24, 2009, 6 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20160306707 A1 | Oct 2016 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14682988 | Apr 2015 | US |
| Child | 15197434 | US |
