Patent Grant
11422732
A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document and/or the patent disclosure as it appears in the United States Patent and Trademark Office patent file and/or records, but otherwise reserves all copyrights whatsoever.
An illustrative Internet Small Computer Systems Interface server (“ISCSI server”) provides user computing devices with “private writable snapshots” of a desired volume of data and/or further provides “private writable backup copies”, which are derived from block-level backup copies of data stored on backup media. Collectively, these are referred to herein as “private writable environments” or “private writable workspaces.” An illustrative ISCSI service, which executes on the ISCSI server, is provided without invoking snapshot limits imposed by storage arrays and further without requiring that specialized backup software and/or pseudo-disk drivers be installed on the user computing devices. Thus, the user computing devices can conveniently access the ISCSI service and need not be specially equipped and/or loaded with special-purpose software. Moreover, there is no limit on how many private writable environments each user computing device can access from a given ISCSI server. A user can have any number of co-existing private writable snapshots and private writable backup copies.
The illustrative embodiments provide for private writable environments as well as for live browsing of the source data. A user can browse block-level backup copies as well as edit personal versions of any number and/or versions of the block-level backup copies—the “private writable backup copies”. Likewise, a user can browse snapshots of desired data storage volumes and edit personal versions of any number of snapshots of one or more versions of one or more desired data volumes—the “private writable snapshots”. Each private writable environment is configured such that it operates independently of other similar private writable environment(s) on the same user computing and/or hosted by the same ISCSI server. Each private writable environment operates independently of the others, even when derived from the same data source (i.e., data volume and/or block-level backup copy).
Sparse files, extent-files, special-purpose directories, and/or media agents co-residing on the ISCSI server along with the ISCSI service are used in the illustrative embodiments. There is no limit on how many user computing devices the ISCSI server can serve under the present architecture. Likewise, there is no limit on how many distinct private writable snapshots and/or private writable backup copies can be configured and serviced for any given user computing device.
In regard to live browsing block-level data sources, such as block-level backup copies and/or snapshots of data storage volumes, advantages include:
Advantages of the illustrative private writable environments include:
Detailed descriptions and examples of systems and methods according to one or more illustrative embodiments of the present invention may be found in the section entitled BLOCK-LEVEL LIVE BROWSING, PRIVATE WRITABLE SNAPSHOTS, AND PRIVATE WRITABLE BACKUP COPIES USING AN ISCSI SERVER WITHOUT PSEUDO-DISK DRIVERS AT THE USER COMPUTING DEVICES, as well as in the section entitled Example Embodiments, and also in
Various embodiments described herein are intimately tied to, enabled by, and would not exist except for, computer technology. For example, communicating via the ISCSI protocol, taking snapshots of data storage volumes, restoring portions of backed up data, conditionally searching for and obtaining/restoring relevant data as described herein in reference to various embodiments cannot reasonably be performed by humans alone, without the computer technology upon which they are implemented.
Information Management System Overview
With the increasing importance of protecting and leveraging data, organizations simply cannot risk losing critical data. Moreover, runaway data growth and other modern realities make protecting and managing data increasingly difficult. There is therefore a need for efficient, powerful, and user-friendly solutions for protecting and managing data and for smart and efficient management of data storage. Depending on the size of the organization, there may be many data production sources which are under the purview of tens, hundreds, or even thousands of individuals. In the past, individuals were sometimes responsible for managing and protecting their own data, and a patchwork of hardware and software point solutions may have been used in any given organization. These solutions were often provided by different vendors and had limited or no interoperability. Certain embodiments described herein address these and other shortcomings of prior approaches by implementing scalable, unified, organization-wide information management, including data storage 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/publications and patent applications assigned to Commvault Systems, Inc., each of which is hereby incorporated by reference in its entirety herein:
System 100 includes computing devices and computing technologies. For instance, system 100 can include one or more client computing devices 102 and secondary storage computing devices 106, as well as storage manager 140 or a host computing device for it. 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, servers, 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. Servers can include mail servers, file servers, database servers, virtual machine servers, and web servers. Any given computing device comprises one or more processors (e.g., CPU and/or single-core or multi-core processors), as well as corresponding non-transitory computer memory (e.g., random-access memory (RAM)) for storing computer programs which are to be executed by the one or more processors. Other computer memory for mass storage of data may be packaged/configured with the computing device (e.g., an internal hard disk) and/or may be external and accessible by the computing device (e.g., network-attached storage, a storage array, etc.). In some cases, a computing device includes cloud computing resources, which may be implemented as virtual machines. For instance, one or more virtual machines may be provided to the organization by a third-party cloud service vendor.
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 (“VM”) is a software implementation of a computer that does not physically exist and is instead instantiated in an operating system of a physical computer (or host machine) to enable applications to execute within the VM's environment, i.e., a VM emulates a physical computer. A VM includes an operating system and associated virtual resources, such as computer memory and processor(s). A hypervisor operates between the VM and the hardware of the physical host machine and is generally responsible for creating and running the VMs. Hypervisors are also known in the art as virtual machine monitors or a virtual machine managers or “VMMs”, and may be implemented in software, firmware, and/or specialized hardware installed on the host machine. Examples of hypervisors include ESX Server, by VMware, Inc. of Palo Alto, Calif.; Microsoft Virtual Server and Microsoft Windows Server Hyper-V, both by Microsoft Corporation of Redmond, Wash.; Sun xVM by Oracle America Inc. of Santa Clara, Calif.; and Xen by Citrix Systems, Santa Clara, Calif. The hypervisor provides resources to each virtual operating system such as a virtual processor, virtual memory, a virtual network device, and a virtual disk. Each virtual machine has one or more associated 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 (“VMDK” in VMware lingo) or virtual hard disk image files (in Microsoft lingo). 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 way that a physical machine reads data from and writes data to a physical disk. Examples of techniques for implementing information management in a cloud computing environment are described in U.S. Pat. No. 8,285,681. Examples of techniques for implementing information management in a virtualized computing environment are described in U.S. Pat. No. 8,307,177.
Information management system 100 can also include electronic data storage devices, generally used for mass storage of data, including, e.g., primary storage devices 104 and secondary storage devices 108. Storage devices can generally be of any suitable type including, without limitation, disk drives, storage arrays (e.g., storage-area network (SAN) and/or network-attached storage (NAS) technology), 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, etc. In some embodiments, storage devices form part of a distributed file system. In some cases, storage devices are provided in a cloud storage environment (e.g., a private cloud or one operated by a third-party vendor), whether for primary data or secondary copies or both.
Depending on context, the term “information management system” can refer to generally all of the illustrated hardware and software components in
One or more client computing devices 102 may be part of system 100, each client computing device 102 having an operating system and at least one application 110 and one or more accompanying data agents executing thereon; and associated with one or more primary storage devices 104 storing primary data 112. Client computing device(s) 102 and primary storage devices 104 may generally be referred to in some cases as primary storage subsystem 117.
Client Computing Devices, Clients, and Subclients
Typically, a variety of sources in an organization 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 system 100, data generation sources include one or more client computing devices 102. A computing device that has a data agent 142 installed and operating on it is generally referred to as a “client computing device” 102, and may include any type of computing device, without limitation. A client computing device 102 may be associated with one or more users and/or user accounts.
A “client” is a logical component of information management system 100, which may represent a logical grouping of one or more data agents installed on a client computing device 102. Storage manager 140 recognizes a client as a component of system 100, and in some embodiments, may automatically create a client component the first time a data agent 142 is installed on a client computing device 102. Because data generated by executable component(s) 110 is tracked by the associated data agent 142 so that it may be properly protected in system 100, a client may be said to generate data and to store the generated data to primary storage, such as primary storage device 104. However, the terms “client” and “client computing device” as used herein do not imply that a client computing device 102 is necessarily configured in the client/server sense relative to another computing device such as a mail server, or that a client computing device 102 cannot be a server in its own right. As just a few examples, a client computing device 102 can be and/or include mail servers, file servers, database servers, virtual machine servers, and/or web servers.
Each client computing device 102 may have application(s) 110 executing thereon which generate and manipulate the data that is to be protected from loss and managed in system 100. Applications 110 generally facilitate the operations of an organization, and can include, without limitation, mail server applications (e.g., Microsoft Exchange Server), file system applications, mail client applications (e.g., Microsoft Exchange Client), database applications or database management systems (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. Each application 110 may be accompanied by an application-specific data agent 142, though not all data agents 142 are application-specific or associated with only application. A file manager application, e.g., Microsoft Windows Explorer, may be considered an application 110 and may be accompanied by its own data agent 142. 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. In some embodiments, a virtual machine that executes on a host client computing device 102 may be considered an application 110 and may be accompanied by a specific data agent 142 (e.g., virtual server data agent).
Client computing devices 102 and other components in system 100 can be connected to one another via one or more electronic communication pathways 114. For example, a first communication pathway 114 may communicatively couple client computing device 102 and secondary storage computing device 106; a second communication pathway 114 may communicatively couple storage manager 140 and client computing device 102; and a third communication pathway 114 may communicatively couple storage manager 140 and secondary storage computing device 106, etc. (see, e.g.,
A “subclient” is a logical grouping of all or part of a client's primary data 112. In general, a subclient may be defined according to how the subclient data is to be protected as a unit in system 100. For example, a subclient may be associated with a certain storage policy. A given client may thus comprise several subclients, each subclient associated with a different storage policy. For example, some files may form a first subclient that requires compression and deduplication and is associated with a first storage policy. Other files of the client may form a second subclient that requires a different retention schedule as well as encryption, and may be associated with a different, second storage policy. As a result, though the primary data may be generated by the same application 110 and may belong to one given client, portions of the data may be assigned to different subclients for distinct treatment by system 100. More detail on subclients is given in regard to storage policies below.
Primary Data and Exemplary Primary Storage Devices
Primary data 112 is generally production data or “live” data generated by the operating system and/or applications 110 executing on client computing device 102. Primary data 112 is generally stored on primary storage device(s) 104 and is organized via a file system operating on the client computing device 102. Thus, client computing device(s) 102 and corresponding applications 110 may create, access, modify, write, delete, and otherwise use primary data 112. Primary data 112 is generally in the native format of the source application 110. Primary data 112 is an initial or first stored body 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 application 110. It can be useful in performing certain tasks to organize 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 (i) 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/or to (ii) a subset of such a file (e.g., a data block, an extent, etc.). Primary data 112 may include structured data (e.g., database files), unstructured data (e.g., documents), and/or semi-structured data. See, e.g.,
It can also be useful in performing certain functions of system 100 to access and modify metadata within primary data 112. Metadata generally includes information about data objects and/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 metadata generally 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 applications 110 and/or other components of system 100 maintain indices of metadata for data objects, e.g., metadata associated with individual email messages. The use of metadata to perform classification and other functions is described in greater detail below.
Primary storage devices 104 storing primary data 112 may be relatively fast and/or expensive technology (e.g., flash storage, a disk drive, a hard-disk storage array, solid state memory, etc.), typically to support high-performance live production environments. 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, client computing device 102 can access primary data 112 stored in primary storage device 104 by making conventional file system calls via the operating system. Each client computing device 102 is generally associated with and/or in communication with one or more primary storage devices 104 storing corresponding primary data 112. A client computing device 102 is said to be associated with or in communication with a particular 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 primary storage device 104, coordinating the routing and/or storing of data to the primary storage device 104, retrieving data from the primary storage device 104, coordinating the retrieval of data from the primary storage device 104, and modifying and/or deleting data in the primary storage device 104. Thus, a client computing device 102 may be said to access data stored in an associated storage device 104.
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, e.g., a local disk drive. In other cases, one or more primary storage devices 104 can be shared by multiple client computing devices 102, e.g., via a local network, in a cloud storage implementation, etc. As one example, primary storage device 104 can be a storage array shared by a group of client computing devices 102, such as EMC Clariion, EMC Symmetrix, EMC Celerra, Dell EqualLogic, IBM XIV, NetApp FAS, HP EVA, and HP 3PAR.
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 system 100. For instance, the hosted services may be provided by online service providers. Such service providers can provide social networking services, hosted email services, or hosted productivity applications or other hosted applications such as 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 services users, each hosted service may generate additional data and metadata, which may be managed by 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.
Secondary Copies and Exemplary Secondary Storage Devices
Primary data 112 stored on primary storage devices 104 may be compromised in some cases, such as when an employee deliberately or accidentally deletes or overwrites primary data 112. Or primary storage devices 104 can be damaged, lost, or otherwise corrupted. For recovery and/or regulatory compliance purposes, it is therefore useful to generate and maintain copies of primary data 112. Accordingly, 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 primary data 112 including its associated metadata. The secondary storage computing devices 106 and the secondary storage devices 108 may be referred to as secondary storage subsystem 118.
Secondary copies 116 can help in search and analysis efforts and meet other information management goals as well, such as: restoring data and/or metadata if an original version 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 in the production system and/or in secondary storage; facilitating organization and search of data; improving user access to data files across multiple computing devices and/or hosted services; and implementing data retention and pruning policies.
A secondary copy 116 can comprise a separate stored copy of data that is derived from one or more earlier-created stored copies (e.g., derived from primary data 112 or from another secondary copy 116). Secondary copies 116 can include point-in-time data, and may be intended for relatively long-term retention before some or all of the data is moved to other storage or discarded. In some cases, a secondary copy 116 may be in a different storage device than other previously stored copies; and/or may be remote from other previously stored copies. Secondary copies 116 can be stored in the same storage device as primary data 112. For example, 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 lower 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 from the native source application format or other format of primary data 112.
Secondary storage computing devices 106 may index secondary copies 116 (e.g., using a media agent 144), enabling users to browse and restore at a later time and further enabling the lifecycle management of the indexed data. After creation of a secondary copy 116 that represents 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 of a particular 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 application 110 (or hosted service or the operating system), system 100 may create and manage multiple secondary copies 116 of a particular data object or metadata, each copy 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 primary storage device 104 and the file system, 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 virtual machines, the operating system and other applications 110 of 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. 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 are distinguishable from corresponding primary data 112. First, secondary copies 116 can be stored in a different format from primary data 112 (e.g., backup, archive, or other non-native format). For this or other reasons, secondary copies 116 may not be directly usable by applications 110 or client computing device 102 (e.g., via standard system calls or otherwise) without modification, processing, or other intervention by system 100 which may be referred to as “restore” operations. Secondary copies 116 may have been processed by data agent 142 and/or media agent 144 in the course of being created (e.g., compression, deduplication, encryption, integrity markers, indexing, formatting, application-aware metadata, etc.), and thus secondary copy 116 may represent source primary data 112 without necessarily being exactly identical to the source.
Second, secondary copies 116 may be stored on a secondary storage device 108 that is inaccessible to application 110 running on client computing device 102 and/or hosted service. 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 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 system 100 can access only with some human intervention (e.g., tapes located at an offsite storage site).
Using Intermediate Devices for Creating Secondary Copies—Secondary Storage Computing Devices
Creating secondary copies can be challenging when hundreds or thousands of client computing devices 102 continually generate large volumes of primary data 112 to be protected. Also, there can be significant overhead involved in the creation of secondary copies 116. Moreover, specialized programmed intelligence and/or hardware capability is generally needed for accessing and interacting with secondary storage devices 108. Client computing devices 102 may interact directly with a secondary storage device 108 to create secondary copies 116, but in view of the factors described above, this approach can negatively impact the ability of client computing device 102 to serve/service application 110 and produce primary data 112. Further, any given client computing device 102 may not be optimized for interaction with certain secondary storage devices 108.
Thus, system 100 may include one or more software and/or hardware components which generally act as intermediaries between client computing devices 102 (that generate primary data 112) and secondary storage devices 108 (that store secondary copies 116). In addition to off-loading certain responsibilities from client computing devices 102, these intermediate components provide other benefits. For instance, as discussed further below with respect to
Secondary storage computing device(s) 106 can comprise any of the computing devices described above, without limitation. In some cases, secondary storage computing device(s) 106 also include specialized hardware componentry and/or software intelligence (e.g., specialized interfaces) for interacting with certain secondary storage device(s) 108 with which they may be specially associated.
To create a secondary copy 116 involving the copying of data from primary storage subsystem 117 to secondary storage subsystem 118, client computing device 102 may communicate the primary data 112 to be copied (or a processed version thereof generated by a data agent 142) to the designated secondary storage computing device 106, via a communication pathway 114. Secondary storage computing device 106 in turn may further process and convey the data or a processed version thereof to secondary storage device 108. One or more secondary copies 116 may be created from existing secondary copies 116, such as in the case of an auxiliary copy operation, described further below.
Exemplary Primary Data and an Exemplary Secondary Copy
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 corresponding metadata Meta11, Meta3, and Meta8, respectively). Moreover, as indicated by the prime mark (′), secondary storage computing devices 106 or other components in secondary storage subsystem 118 may process the data received from primary storage subsystem 117 and store a secondary copy including a transformed and/or supplemented representation of a primary data object and/or metadata that is different from the original format, e.g., in a compressed, encrypted, deduplicated, or other modified format. For instance, secondary storage computing devices 106 can generate new metadata or other information based on said processing, and store the newly generated information along with the secondary copies. Secondary copy data object 1346 represents primary data objects 120, 1336, and 119A as 120′, 1336′, and 119A′, respectively, accompanied by corresponding metadata Meta2, Meta10, and Meta1, respectively. Also, secondary copy data object 134C represents primary data objects 133A, 1196, and 129A as 133A′, 1196′, and 129A′, respectively, accompanied by corresponding metadata Meta9, Meta5, and Meta6, respectively.
Exemplary Information Management System Architecture
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 system 100. Such design choices can impact how system 100 performs and adapts to data growth and other changing circumstances.
Storage Manager
Storage manager 140 is a centralized storage and/or information manager that is configured to perform certain control functions and also to store certain critical information about system 100—hence storage manager 140 is said to manage system 100. As noted, the number of components in system 100 and the amount of data under management can be large. Managing the components and data is therefore a significant task, which can grow unpredictably as the number of components and data scale to meet the needs of the organization. For these and other reasons, according to certain embodiments, responsibility for controlling system 100, or at least a significant portion of that responsibility, is allocated to storage manager 140. Storage manager 140 can be adapted independently according to changing circumstances, without having to replace or re-design the remainder of the system. Moreover, a computing device for hosting and/or operating as storage manager 140 can be selected to best suit the functions and networking needs of storage manager 140. These and other advantages are described in further detail below and with respect to
Storage manager 140 may be a software module or other application hosted by a suitable computing device. In some embodiments, storage manager 140 is itself a computing device that performs the functions described herein. Storage manager 140 comprises or operates in conjunction with one or more associated data structures such as a dedicated database (e.g., management database 146), depending on the configuration. The storage manager 140 generally initiates, performs, coordinates, and/or controls storage and other information management operations performed by system 100, e.g., to protect and control primary data 112 and secondary copies 116. In general, storage manager 140 is said to manage system 100, which includes communicating with, instructing, and controlling in some circumstances components such as data agents 142 and media agents 144, etc.
As shown by the dashed arrowed lines 114 in
According to certain embodiments, storage manager 140 provides one or more of the following functions:
Storage manager 140 may maintain an associated database 146 (or “storage manager database 146” or “management database 146”) of management-related data and information management policies 148. Database 146 is stored in computer memory accessible by storage manager 140. Database 146 may include a management index 150 (or “index 150”) or other data structure(s) that may store: logical associations between components of the system; user preferences and/or profiles (e.g., preferences regarding encryption, compression, or deduplication of primary data or secondary copies; preferences regarding the scheduling, type, or other aspects of 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; other useful data; and/or any combination thereof. For example, storage manager 140 may use index 150 to track logical associations between media agents 144 and secondary storage devices 108 and/or movement of data to/from secondary storage devices 108. For instance, 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.
Administrators and others may configure and initiate certain information management operations on an individual basis. But while this may be acceptable for some recovery operations or other infrequent tasks, it is often not workable for implementing on-going organization-wide data protection and management. Thus, system 100 may utilize information management policies 148 for specifying and executing information management operations on an automated basis. Generally, an information management policy 148 can include a stored data structure or other information source that specifies parameters (e.g., criteria and rules) associated with storage management or other information management operations. Storage manager 140 can process an information management policy 148 and/or index 150 and, based on the results, identify an information management operation to perform, identify the appropriate components in system 100 to be involved in the operation (e.g., client computing devices 102 and corresponding data agents 142, secondary storage computing devices 106 and corresponding media agents 144, etc.), establish connections to those components and/or between those components, and/or instruct and control those components to carry out the operation. In this manner, system 100 can translate stored information into coordinated activity among the various computing devices in system 100.
Management database 146 may maintain information management policies 148 and associated data, although information management policies 148 can be stored in computer memory at any appropriate location outside management database 146. 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 or other information management operations, depending on the embodiment. Information management policies 148 are described further below. According to certain embodiments, management 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 subclient data were protected and where the secondary copies are stored and which media agent 144 performed the storage operation(s)). This and other metadata may additionally be stored in other locations, such as at secondary storage computing device 106 or on the secondary storage device 108, allowing data recovery without the use of storage manager 140 in some cases. Thus, management database 146 may comprise data needed to kick off secondary copy operations (e.g., storage policies, schedule policies, etc.), status and reporting information about completed jobs (e.g., status and error reports on yesterday's backup jobs), and additional information sufficient to enable restore and disaster recovery operations (e.g., media agent associations, location indexing, content indexing, etc.).
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. These are described further below.
Jobs agent 156 in some embodiments initiates, controls, and/or monitors the status of some or all information management operations previously performed, currently being performed, or scheduled to be performed by system 100. A job is a logical grouping of information management operations such as daily storage operations scheduled for a certain set of subclients (e.g., generating incremental block-level backup copies 116 at a certain time every day for database files in a certain geographical location). Thus, jobs agent 156 may access information management policies 148 (e.g., in management database 146) to determine when, where, and how to initiate/control jobs in system 100.
Storage Manager User Interfaces
User interface 158 may include information processing and display software, such as a graphical user interface (GUI), an application program interface (API), and/or other interactive interface(s) through which users and system processes can retrieve information about the status of information management operations or issue instructions to storage manager 140 and other components. Via user interface 158, users may issue instructions to the components in system 100 regarding performance of secondary copy 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 secondary copy jobs or to monitor the status of certain components in system 100 (e.g., the amount of capacity left in a storage device). Storage manager 140 may 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 by interacting with user interface 158.
Various embodiments of information management system 100 may be configured and/or designed to generate user interface data usable for rendering the various interactive user interfaces described. The user interface data may be used by system 100 and/or by another system, device, and/or software program (for example, a browser program), to render the interactive user interfaces. The interactive user interfaces may be displayed on, for example, electronic displays (including, for example, touch-enabled displays), consoles, etc., whether direct-connected to storage manager 140 or communicatively coupled remotely, e.g., via an internet connection. The present disclosure describes various embodiments of interactive and dynamic user interfaces, some of which may be generated by user interface agent 158, and which are the result of significant technological development. The user interfaces described herein may provide improved human-computer interactions, allowing for significant cognitive and ergonomic efficiencies and advantages over previous systems, including reduced mental workloads, improved decision-making, and the like. User interface 158 may operate in a single integrated view or console (not shown). The console may support a reporting capability for generating a variety of reports, which may be tailored to a particular aspect of information management.
User interfaces are not exclusive to storage manager 140 and in some embodiments a user may access information locally from a computing device component of system 100. For example, some information pertaining to installed data agents 142 and associated data streams may be available from client computing device 102. Likewise, some information pertaining to media agents 144 and associated data streams may be available from secondary storage computing device 106.
Storage Manager Management Agent
Management agent 154 can provide storage manager 140 with the ability to communicate with other components within system 100 and/or with other information management cells 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, without limitation. Management agent 154 also allows multiple information management cells to communicate with one another. For example, system 100 in some cases may be one information management cell in a network of multiple cells adjacent to one another or otherwise logically related, e.g., in a WAN or LAN. With this arrangement, the cells may communicate with one another through respective management agents 154. Inter-cell communications and hierarchy is described in greater detail in e.g., U.S. Pat. No. 7,343,453.
Information Management Cell
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 data agent 142 (executing on a client computing device 102) and at least one media agent 144 (executing on a secondary storage computing device 106). For instance, the components shown in
Multiple cells may be organized hierarchically, so that cells may inherit properties from hierarchically superior cells or be controlled by other cells in the hierarchy (automatically or otherwise). Alternatively, in some embodiments, cells may inherit or otherwise be associated with information management policies, preferences, information management operational parameters, or other properties or characteristics according to their relative position in a hierarchy of cells. Cells may also be organized hierarchically according to function, geography, architectural considerations, or other factors useful or desirable in performing information management operations. For example, a first cell may represent a geographic segment of an enterprise, such as a Chicago office, and a second cell may represent a different geographic segment, such as a New York City office. Other cells may represent departments within a particular office, e.g., human resources, finance, engineering, etc. Where delineated by function, a first cell may perform one or more first types of information management operations (e.g., one or more first types of secondary copies at a certain frequency), and a second cell may perform one or more second types of information management operations (e.g., one or more second types of secondary copies at a different frequency and under different retention rules). In general, the hierarchical information is maintained by one or more storage managers 140 that manage the respective cells (e.g., in corresponding management database(s) 146).
Data Agents
A variety of different applications 110 can operate on a given client computing device 102, including operating systems, file 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 device 102 may be tasked with processing and preparing the primary data 112 generated by these various applications 110. Moreover, the nature of the processing/preparation can differ across application types, e.g., due to inherent structural, state, and formatting differences among applications 110 and/or the operating system of client computing device 102. Each data agent 142 is 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.
Data agent 142 is a component of information system 100 and is generally directed by storage manager 140 to participate in creating or restoring secondary copies 116. Data agent 142 may be a software program (e.g., in the form of a set of executable binary files) that executes on the same client computing device 102 as the associated application 110 that data agent 142 is configured to protect. Data agent 142 is generally responsible for managing, initiating, or otherwise assisting in the performance of information management operations in reference to its associated application(s) 110 and corresponding primary data 112 which is generated/accessed by the particular application(s) 110. For instance, data agent 142 may take part in copying, archiving, migrating, and/or replicating of certain primary data 112 stored in the primary storage device(s) 104. Data agent 142 may receive control information from storage manager 140, such as commands to transfer copies of data objects and/or metadata to one or more media agents 144. Data agent 142 also may compress, deduplicate, and encrypt certain primary data 112, as well as capture application-related metadata before transmitting the processed data to media agent 144. Data agent 142 also may receive instructions from storage manager 140 to restore (or assist in restoring) a secondary copy 116 from secondary storage device 108 to primary storage 104, such that the restored data may be properly accessed by application 110 in a suitable format as though it were primary data 112.
Each data agent 142 may be specialized for a particular 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 112, a specialized data agent 142 may be used for each data type. For example, to backup, migrate, and/or restore all of the data on a Microsoft Exchange server, the client computing device 102 may use: (1) a Microsoft Exchange Mailbox data agent 142 to back up the Exchange mailboxes; (2) a Microsoft Exchange Database data agent 142 to back up the Exchange databases; (3) a Microsoft Exchange Public Folder data agent 142 to back up the Exchange Public Folders; and (4) a Microsoft Windows File System data agent 142 to back up the file system of client computing device 102. In this example, these specialized data agents 142 are treated as four separate data agents 142 even though they operate on the same client computing device 102. Other examples may include archive management data agents such as a migration archiver or a compliance archiver, Quick Recovery® agents, and continuous data replication agents. Application-specific data agents 142 can provide improved performance as compared to generic agents. For instance, because application-specific data agents 142 may only handle data for a single software application, the design, operation, and performance of the data agent 142 can be streamlined. The data agent 142 may therefore execute faster and consume less persistent storage and/or operating memory than data agents designed to generically accommodate multiple different software applications 110.
Each data agent 142 may be configured to access data and/or metadata stored in the primary storage device(s) 104 associated with data agent 142 and its host client computing device 102, and process the data appropriately. For example, during a secondary copy operation, 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. In some embodiments, a data agent 142 may be distributed between 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 media agent 144. 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.
Media Agents
As noted, off-loading certain responsibilities from client computing devices 102 to intermediate components such as secondary storage computing device(s) 106 and corresponding media agent(s) 144 can provide a number of benefits including improved performance of client computing device 102, faster and more reliable information management operations, and enhanced scalability. In one example which will be discussed further below, media agent 144 can act as a local cache of recently-copied data and/or metadata stored to secondary storage device(s) 108, thus improving restore capabilities and performance for the cached data.
Media agent 144 is a component of system 100 and is generally directed by storage manager 140 in creating and restoring secondary copies 116. Whereas storage manager 140 generally manages system 100 as a whole, media agent 144 provides a portal to certain secondary storage devices 108, such as by having specialized features for communicating with and accessing certain associated secondary storage device 108. Media agent 144 may be a software program (e.g., in the form of a set of executable binary files) that executes on a secondary storage computing device 106. Media agent 144 generally manages, coordinates, and facilitates the transmission of data between a data agent 142 (executing on client computing device 102) and secondary storage device(s) 108 associated with media agent 144. For instance, other components in the system may interact with media agent 144 to gain access to data stored on associated secondary storage device(s) 108, (e.g., to browse, read, write, modify, delete, or restore data). Moreover, 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—generally referred to as indexing of the stored secondary copies 116. Each media agent 144 may operate on a dedicated secondary storage computing device 106, while in other embodiments a plurality of media agents 144 may operate on the same secondary storage computing device 106.
A media agent 144 may 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 the particular secondary storage device 108; and modifying and/or deleting data retrieved from the particular secondary storage device 108. Media agent 144 in certain embodiments is physically separate from the associated secondary storage device 108. For instance, a media agent 144 may operate on a secondary storage computing device 106 in a distinct housing, package, and/or location from the associated secondary storage device 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.
A media agent 144 associated with a particular secondary storage device 108 may instruct secondary storage device 108 to perform an information management task. 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 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 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 secondary copy operation. Media agent 144 may communicate with a secondary storage device 108 via a suitable communications link, such as a SCSI or Fibre Channel link.
Each media agent 144 may maintain an associated media agent database 152. Media agent database 152 may be stored to a disk or other storage device (not shown) that is local to the secondary storage computing device 106 on which media agent 144 executes. In other cases, media agent database 152 is stored separately from the host secondary storage computing device 106. Media agent database 152 can include, among other things, a media agent index 153 (see, e.g.,
Media agent index 153 (or “index 153”) may be a data structure associated with the particular media agent 144 that includes information about the stored data associated with the particular media agent and which may be generated in the course of performing a secondary copy operation or a restore. Index 153 provides a fast and efficient mechanism for locating/browsing secondary copies 116 or other data stored in secondary storage devices 108 without having to access secondary storage device 108 to retrieve the information from there. For instance, for each secondary copy 116, index 153 may include metadata such as a list of the data objects (e.g., files/subdirectories, database objects, mailbox objects, etc.), a logical path to the secondary copy 116 on the corresponding secondary storage device 108, location information (e.g., offsets) indicating where the data objects are stored in the secondary storage device 108, when the data objects were created or modified, etc. Thus, index 153 includes metadata associated with the secondary copies 116 that is readily available for use from media agent 144. In some embodiments, some or all of the information in index 153 may instead or additionally be stored along with secondary copies 116 in secondary storage device 108. In some embodiments, a secondary storage device 108 can include sufficient information to enable a “bare metal restore,” where the operating system and/or software applications of a failed client computing device 102 or another target may be automatically restored without manually reinstalling individual software packages (including operating systems).
Because index 153 may operate as a cache, it can also be referred to as an “index cache.” In such cases, information stored in index cache 153 typically comprises data that reflects certain particulars about relatively recent secondary copy operations. After some triggering event, such as after some time elapses or index cache 153 reaches a particular size, certain portions of index cache 153 may be copied or migrated to secondary storage device 108, e.g., on a least-recently-used basis. This information may be retrieved and uploaded back into index cache 153 or otherwise restored to 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 storage device(s) 108.
In some alternative embodiments media agent 144 generally acts as a coordinator or facilitator of secondary copy operations between client computing devices 102 and secondary storage devices 108, but does not actually write the data to secondary storage device 108. For instance, storage manager 140 (or 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, client computing device 102 transmits data directly or via one or more intermediary components to secondary storage device 108 according to the received instructions, and vice versa. Media agent 144 may still receive, process, and/or maintain metadata related to the secondary copy operations, i.e., may continue to build and maintain index 153. In these embodiments, payload data can flow through media agent 144 for the purposes of populating index 153, but not for writing to secondary storage device 108. Media agent 144 and/or other components such as 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 system 100 can be distributed amongst various physical and/or logical components. For instance, one or more of 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 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, client computing device(s) 102 can be selected to effectively service applications 110 in order to efficiently produce and store primary data 112.
Moreover, in some cases, one or more of the individual components of 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 management database 146 is relatively large, database 146 may be migrated to or may otherwise reside on a specialized database server (e.g., an SQL server) separate from a server that implements the other functions of storage manager 140. This distributed configuration can provide added protection because database 146 can be protected with standard database utilities (e.g., SQL log shipping or database replication) independent from other functions of storage manager 140. 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 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 computing device can no longer service the needs of a growing system 100.
The distributed architecture also provides scalability and efficient component utilization.
Where system 100 includes multiple media agents 144 (see, e.g.,
While distributing functionality amongst multiple computing devices can have certain advantages, in other contexts it can be beneficial to consolidate functionality on the same computing device. In alternative configurations, certain components may reside and execute on the same computing device. As such, in other embodiments, one or more of the components shown in
Exemplary Types of Information Management Operations, Including Storage Operations
In order to protect and leverage stored data, system 100 can be configured to perform a variety of information management operations, which may also be referred to in some cases as storage management operations or storage operations. These operations can generally include (i) data movement operations, (ii) processing and data manipulation operations, and (iii) analysis, reporting, and management operations.
Data Movement Operations, Including Secondary Copy Operations
Data movement operations are generally storage operations that involve the copying or migration of data between different locations in system 100. 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, or in some cases within the same primary storage device 104 such as within a storage array.
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), snapshot operations, deduplication or single-instancing operations, auxiliary copy operations, disaster-recovery copy operations, and the like. As will be discussed, some of these operations do not necessarily create distinct copies. Nonetheless, some or all of these operations are generally referred to as “secondary copy operations” for simplicity, because they involve secondary copies. Data movement also comprises restoring secondary copies.
Backup Operations
A backup operation creates a copy of a version of primary data 112 at a particular point in time (e.g., one or more files or other data units). Each subsequent backup copy 116 (which is a form of secondary copy 116) may be maintained independently of the first. A backup generally involves maintaining a version of the copied primary data 112 as well as backup copies 116. Further, a backup copy in some embodiments is generally stored in a form that is different from the native format, e.g., a backup format. This contrasts to the version in primary data 112 which may instead be stored in a format native to 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 native application format. For example, a backup copy may be stored in a compressed backup format that facilitates efficient long-term storage. Backup copies 116 can have relatively long retention periods as compared to primary data 112, which is generally highly changeable. Backup copies 116 may be stored on media with slower retrieval times than primary storage device 104. Some backup copies may have shorter retention periods than some other types of secondary copies 116, such as archive copies (described below). Backups may 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 afterwards.
A differential backup operation (or cumulative incremental backup operation) tracks and stores changes that occurred since the last full backup. Differential backups can grow quickly in size, but can restore relatively efficiently 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, restoring can be lengthy compared 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, however, a synthetic full backup does not actually transfer data from primary storage 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 (e.g., bitmaps), one for each subclient. The new backup images consolidate the index and user data stored in the related incremental, differential, and previous full backups into a synthetic backup file that fully represents the subclient (e.g., via pointers) but does not comprise all its constituent data.
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 copying of a data volume (e.g., a logical disk or partition) as a whole. In a file-level backup, information management system 100 generally tracks changes to individual files and includes copies of files in the backup copy. For block-level backups, files are broken into constituent blocks, and changes are tracked at the block level. Upon restore, system 100 reassembles the blocks into files in a transparent fashion. Far less data may actually be transferred and copied to secondary storage devices 108 during a file-level copy than a volume-level copy. Likewise, a block-level copy may transfer less data than a file-level copy, resulting in faster execution. 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 and retrieving constituent blocks can sometimes take longer than restoring file-level backups.
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 system 100.
Archive Operations
Because backup operations generally involve maintaining a version of the copied primary data 112 and also maintaining backup copies in secondary storage device(s) 108, they can consume significant storage capacity. To reduce storage consumption, an archive operation according to certain embodiments creates an archive 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. In certain embodiments, archive copies may be made and kept for extended periods in order to meet compliance regulations.
Archiving can also serve the purpose of freeing up space in 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 archive copy can therefore serve the purpose of freeing up space in the source secondary storage device(s) 108. Examples of data archiving operations are provided in U.S. Pat. No. 7,107,298.
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 primary data 112 at a given point in time, and may include state and/or status information relative to an application 110 that creates/manages 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 occurs 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 perform snapshot operations generally without intervention or oversight from any of the other components of the system 100, e.g., a storage array may generate an “array-created” hardware snapshot and may also manage its storage, integrity, versioning, etc. In this manner, hardware snapshots can off-load other components of system 100 from snapshot processing. An array may receive a request from another component to take a snapshot and then proceed to execute the “hardware snapshot” operations autonomously, preferably reporting success to the requesting component.
A “software snapshot” (or “software-based snapshot”) operation, on the other hand, occurs where a component in system 100 (e.g., client computing device 102, etc.) implements 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. One example of a software snapshot product is Microsoft Volume Snapshot Service (VSS), which is part of the Microsoft Windows operating system.
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 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 the 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 change later on. Furthermore, when files change, typically only the pointers which map to blocks are copied, not the blocks themselves. For example for “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. 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
Replication is another type of secondary copy operation. Some types of secondary copies 116 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 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, secondary copy 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, back up, or otherwise manipulate the replication copies as if they 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, system 100 can replicate sections of application data that represent a recoverable state rather than rote copying of blocks of data. Examples of replication operations (e.g., continuous data replication) are provided in U.S. Pat. No. 7,617,262.
Deduplication/Single-Instancing Operations
Deduplication or single-instance storage is useful to reduce the amount of non-primary data. For instance, some or all of the above-described secondary copy operations can involve deduplication in some fashion. New data is read, broken down into data portions of a selected granularity (e.g., sub-file level blocks, files, etc.), compared with corresponding portions that are already in secondary storage, and only new/changed portions are stored. Portions that already exist are represented as pointers to the already-stored data. Thus, a deduplicated secondary copy 116 may comprise actual data portions copied from primary data 112 and may further comprise pointers to already-stored data, which is generally more storage-efficient than a full copy.
In order to streamline the comparison process, system 100 may calculate and/or store signatures (e.g., hashes or cryptographically unique IDs) corresponding to the individual source data portions and compare the signatures to already-stored data signatures, instead of comparing entire data portions. In some cases, only a single instance of each data portion is stored, and deduplication operations may therefore be referred to interchangeably as “single-instancing” operations. Depending on the implementation, however, deduplication operations can store more than one instance of certain data portions, yet still significantly reduce stored-data redundancy. Depending on the embodiment, deduplication portions such as data blocks can be of fixed or variable length. Using variable length blocks can enhance deduplication by responding to changes in the data stream, but can involve more complex processing. In some cases, system 100 utilizes a technique for dynamically aligning deduplication blocks based on changing content in the data stream, as described in U.S. Pat. No. 8,364,652.
System 100 can deduplicate in a variety of manners at a variety of locations. For instance, in some embodiments, system 100 implements “target-side” deduplication by deduplicating data at the media agent 144 after being received from data agent 142. In some such cases, 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., data block signatures). Examples of such a configuration are provided in U.S. Pat. No. 9,020,900. Instead of or in combination with “target-side” deduplication, “source-side” (or “client-side”) deduplication can also be performed, e.g., to reduce the amount of data to be transmitted by data agent 142 to media agent 144. Storage manager 140 may communicate with other components within system 100 via network protocols and cloud service provider APIs to facilitate cloud-based deduplication/single instancing, as exemplified in U.S. Pat. No. 8,954,446. Some other deduplication/single instancing techniques are described in U.S. Pat. Pub. No. 2006/0224846 and in U.S. Pat. No. 9,098,495.
Information Lifecycle Management and Hierarchical Storage Management
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, which generally automatically moves data between classes of storage devices, such as from high-cost to 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 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 archiving 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 primary data 112 or a secondary copy 116 that exceeds a given size threshold or a given age threshold. 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 (another) secondary storage device 108.
For 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 HSM data that has been removed or migrated, 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 include 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., compressed, encrypted, deduplicated, and/or otherwise modified). 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.
Auxiliary Copy Operations
An auxiliary copy is generally a copy of an existing secondary copy 116. For instance, an initial secondary copy 116 may be derived from primary data 112 or from data residing in secondary storage subsystem 118, whereas an auxiliary copy is generated from the initial secondary copy 116. Auxiliary copies provide 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 auxiliary copy techniques are described in further detail in U.S. Pat. No. 8,230,195.
Disaster-Recovery Copy Operations
System 100 may also make and retain disaster recovery copies, often as secondary, high-availability disk copies. System 100 may create secondary copies and store them 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 Manipulation, Including Encryption and Compression
Data manipulation and processing may include encryption and compression as well as integrity marking and checking, formatting for transmission, formatting for storage, etc. Data may be manipulated “client-side” by data agent 142 as well as “target-side” by media agent 144 in the course of creating secondary copy 116, or conversely in the course of restoring data from secondary to primary.
Encryption Operations
System 100 in some cases is configured to process data (e.g., files or other data objects, primary data 112, 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. System 100 in some cases encrypts the data at the client level, such that client computing devices 102 (e.g., data agents 142) encrypt the data prior to transferring it to other components, e.g., before sending the data to media agents 144 during a secondary copy operation. In such cases, 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 media agent 144 creates auxiliary copies or archive copies. Encryption may be applied in creating a secondary copy 116 of a previously unencrypted secondary copy 116, without limitation. In further embodiments, secondary storage devices 108 can implement built-in, high performance hardware-based encryption.
Compression Operations
Similar to encryption, system 100 may also or alternatively compress data in the course of generating a secondary copy 116. Compression encodes information such that fewer bits are needed to represent the information as compared to the original representation. Compression techniques are well known in the art. Compression operations may apply one or more data compression algorithms. Compression may be applied in creating a secondary copy 116 of a previously uncompressed secondary copy, e.g., when making archive copies or disaster recovery copies. The use of compression may result in metadata that specifies the nature of the compression, so that data may be uncompressed on restore if appropriate.
Data Analysis, Reporting, and Management Operations
Data analysis, reporting, and management operations can differ from data movement operations in that they do not necessarily involve copying, migration or other transfer of data 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 data under management to enhance search and other features.
Classification Operations/Content Indexing
In some embodiments, information management system 100 analyzes and indexes characteristics, content, and metadata associated with primary data 112 (“online content indexing”) and/or secondary copies 116 (“off-line content indexing”). Content indexing can identify files or other data objects based on 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.). Content indexes may be searched and search results may be restored.
System 100 generally organizes and catalogues the results into a content index, which may be stored within media agent database 152, for example. The content index can also include the storage locations of or pointer references to indexed data in primary data 112 and/or secondary copies 116. Results may also be stored elsewhere in system 100 (e.g., in primary storage device 104 or in secondary storage device 108). Such content index data provides storage manager 140 or other components with an efficient mechanism for locating primary data 112 and/or secondary copies 116 of data objects that match particular criteria, thus greatly increasing the search speed capability of system 100. For instance, search criteria can be specified by a user through user interface 158 of storage manager 140. Moreover, when system 100 analyzes data and/or metadata in secondary copies 116 to create an “off-line content index,” this operation has no significant impact on the performance of client computing devices 102 and thus does not take a toll on the production environment. Examples of content indexing techniques are provided in U.S. Pat. No. 8,170,995.
One or more components, such as a content index engine, 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 data classification databases may be associated with different subsystems or tiers within system 100. As an example, there may be a first metabase associated with primary storage subsystem 117 and a second metabase associated with secondary storage subsystem 118. In other cases, metabase(s) may be associated with individual components, e.g., client computing devices 102 and/or media agents 144. In some embodiments, a data classification database may reside as one or more data structures within management database 146, may be otherwise associated with storage manager 140, and/or may reside as a separate component. In some cases, 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(s) do not significantly impact performance on other components of system 100. In other cases, 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.) 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. For instance, a metabase can dramatically improve the speed with which system 100 can search through and identify data as compared to other approaches that involve scanning an entire file system. Examples of metabases and data classification operations are provided in U.S. Pat. Nos. 7,734,669 and 7,747,579.
Management and Reporting Operations
Certain embodiments leverage the integrated ubiquitous nature of system 100 to provide useful system-wide management and reporting. Operations management can generally include monitoring and managing the health and performance of 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, storage manager 140 or another component in system 100 may analyze traffic patterns and suggest and/or automatically route data 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.
In some configurations having a hierarchy of storage operation cells, a master storage manager 140 may track the status of subordinate cells, 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 also track status 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 management database 146 and/or index 150 (or in another location). The master storage manager 140 or other component may also determine whether certain storage-related or other criteria are satisfied, and may 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, 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) a mitigation action to 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 up space on 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.
In some embodiments, system 100 may also determine whether a metric or other indication satisfies particular storage criteria sufficient to perform an action. For example, 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. In some embodiments, risk factors may be quantified into certain measurable service or risk levels. For example, certain applications and associated data may be considered to be more important relative to 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 secondary copy 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.
System 100 may additionally calculate data costing and data availability associated with information management operation cells. For instance, data received from a 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. 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 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.
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 user interface 158 in a single integrated view or console (not shown). 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. User interface 158 can include an option to graphically depict the various components in the system using appropriate icons. As one example, user interface 158 may provide a graphical depiction of primary storage devices 104, secondary storage devices 108, data agents 142 and/or media agents 144, and their relationship to one another in system 100.
In general, the operations management functionality of system 100 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 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 secondary copy operations for 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 are provided in U.S. Pat. No. 7,343,453.
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 secondary storage devices 108 (e.g., backups, archives, or other secondary copies 116). For example, system 100 may construct and maintain a virtual repository for data stored in 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
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: (1) what data will be associated with the storage policy, e.g., subclient; (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 secondary copy operation to be performed; and (5) retention information specifying how long the data will be retained at the destination (see, e.g.,
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 subclients 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 subclients 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 subclient 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 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 secondary copy 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 and destination. A storage policy can also specify the type(s) of associated operations, such as backup, archive, snapshot, auxiliary copy, or the like. Furthermore, retention parameters can specify how long the resulting secondary copies 116 will be kept (e.g., a number of days, months, years, etc.), perhaps depending on organizational needs and/or compliance criteria.
When adding a new client computing device 102, administrators can manually configure information management policies 148 and/or other settings, e.g., via 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, 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 a client computing device 102, the installation script may register the client computing device 102 with 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.
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 are to take place. Scheduling policies in some cases are associated with particular components, such as a subclient, client computing device 102, and the like.
Another type of information management policy 148 is an “audit policy” (or “security policy”), which comprises preferences, rules and/or criteria that protect sensitive data in system 100. For example, an audit policy may define “sensitive objects” which are files or data 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,” which can include 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). Storage manager 140 or other components may enforce the provisioning policy. For instance, 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) may be adjusted accordingly or an alert may trigger.
While the above types of information management policies 148 are 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 that information management policies 148 may specify:
Information management policies 148 can additionally specify or depend on 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:
Exemplary Storage Policy and Secondary Copy Operations
As indicated by the dashed box, the second media agent 144B and tape library 108B are “off-site,” and may be remotely located from the other components in system 100 (e.g., in a different city, office building, etc.). Indeed, “off-site” may refer to a magnetic tape located in remote 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 at the main site(s) where data is stored.
The file system subclient 112A in certain embodiments generally comprises information generated by the file system and/or operating system of 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 subclient 112B can include data generated by an e-mail application operating on client computing device 102, e.g., mailbox information, folder information, emails, attachments, associated database information, and the like. As described above, the subclients can be logical containers, and the data included in the corresponding primary data 112A and 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 or rule set 162, and compliance copy preferences or rule set 164. Backup copy rule set 160 specifies that it is associated with file system subclient 166 and email subclient 168. Each of subclients 166 and 168 are associated with the particular client computing device 102. Backup copy rule set 160 further specifies that the backup operation will be written to disk library 108A and designates a particular media agent 144A to convey the data to disk library 108A. Finally, backup copy rule set 160 specifies that backup copies created according to rule set 160 are scheduled to be generated hourly and are to be retained for 30 days. In some other embodiments, scheduling information is not included in storage policy 148A and is instead specified by a separate scheduling policy.
Disaster recovery copy rule set 162 is associated with the same two subclients 166 and 168. However, disaster recovery copy rule set 162 is associated with tape library 108B, unlike backup copy rule set 160. Moreover, disaster recovery copy rule set 162 specifies that a different media agent, namely 144B, will convey data to tape library 108B. Disaster recovery copies created according to rule set 162 will be retained for 60 days and will be generated daily. Disaster recovery copies generated according to 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 disk library 108A.
Compliance copy rule set 164 is only associated with the email subclient 168, and not the file system subclient 166. Compliance copies generated according to compliance copy rule set 164 will therefore not include primary data 112A from the file system subclient 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 file system data. Compliance copy rule set 164 is associated with the same tape library 108B and media agent 1448 as disaster recovery copy rule set 162, although a different storage device or media agent could be used in other embodiments. Finally, compliance copy rule set 164 specifies that the copies it governs will be generated quarterly and retained for 10 years.
Secondary Copy Jobs
A logical grouping of secondary copy operations governed by a rule set and being initiated at a point in time may be referred to as a “secondary copy job” (and sometimes may be called a “backup job,” even though it is not necessarily limited to creating only backup copies). Secondary copy jobs may be initiated on demand as well. Steps 1-9 below illustrate three secondary copy jobs based on storage policy 148A.
Referring to
At step 2, file system data agent 142A and email data agent 142B on client computing device 102 respond to instructions from storage manager 140 by accessing and processing the respective subclient primary data 112A and 112B involved in the backup copy operation, which can be found in primary storage device 104. Because the secondary copy 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 suitable for a backup copy.
At step 3, client computing device 102 communicates the processed file system data (e.g., using file system data agent 142A) and the processed email data (e.g., using email data agent 142B) to the first media agent 144A according to backup copy rule set 160, as directed by storage manager 140. Storage manager 140 may further keep a record in management database 146 of the association between media agent 144A and one or more of: client computing device 102, file system subclient 112A, file system data agent 142A, email subclient 112B, email data agent 142B, and/or backup copy 116A.
The target media agent 144A receives the data-agent-processed data from client computing device 102, and at step 4 generates and conveys backup copy 116A to disk library 108A to be stored as backup copy 116A, again at the direction of storage manager 140 and according to backup copy rule set 160. Media agent 144A can also update its index 153 to include data and/or metadata related to backup copy 116A, such as information indicating where the backup copy 116A resides on disk library 108A, where the email copy resides, where the file system copy resides, data and metadata for cache retrieval, etc. Storage manager 140 may similarly update its index 150 to include information relating to the secondary copy operation, such as information relating to the type of operation, a physical location associated with one or more copies created by the operation, the time the operation was performed, status information relating to the operation, the components involved in the operation, and the like. In some cases, storage manager 140 may update its index 150 to include some or all of the information stored in index 153 of media agent 144A. At this point, the backup job may be considered complete. After the 30-day retention period expires, storage manager 140 instructs media agent 144A to delete backup copy 116A from disk library 108A and indexes 150 and/or 153 are updated accordingly.
At step 5, storage manager 140 initiates another backup job for a disaster recovery copy according to the disaster recovery rule set 162. Illustratively this includes steps 5-7 occurring daily for creating disaster recovery copy 1168. Illustratively, and by way of illustrating the scalable aspects and off-loading principles embedded in system 100, disaster recovery copy 1168 is based on backup copy 116A and not on primary data 112A and 112B.
At step 6, illustratively based on instructions received from storage manager 140 at step 5, the specified media agent 1448 retrieves the most recent backup copy 116A from disk library 108A.
At step 7, again at the direction of storage manager 140 and as specified in disaster recovery copy rule set 162, media agent 1448 uses the retrieved data to create a disaster recovery copy 1168 and store it to tape library 1088. In some cases, disaster recovery copy 1168 is a direct, mirror copy of backup copy 116A, and remains in the backup format. In other embodiments, disaster recovery copy 1168 may be further compressed or encrypted, or may be generated in some other manner, such as by using primary data 112A and 1128 from primary storage device 104 as sources. The disaster recovery copy operation is initiated once a day and disaster recovery copies 1168 are deleted after 60 days; indexes 153 and/or 150 are updated accordingly when/after each information management operation is executed and/or completed. The present backup job may be considered completed.
At step 8, storage manager 140 initiates another backup job according to compliance rule set 164, which performs steps 8-9 quarterly to create compliance copy 116C. For instance, storage manager 140 instructs media agent 144B to create compliance copy 116C on tape library 1088, as specified in the compliance copy rule set 164.
At step 9 in the example, compliance copy 116C is generated using disaster recovery copy 1168 as the source. This is efficient, because disaster recovery copy resides on the same secondary storage device and thus no network resources are required to move the data. In other embodiments, compliance copy 116C is instead generated using primary data 1128 corresponding to the email subclient or using backup copy 116A from 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 153 and/or 150 are kept up-to-date accordingly.
Exemplary Applications of Storage Policies—Information Governance Policies and Classification
Again referring to
Information governance policies allow administrators to obtain different perspectives on 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 an index that reflects the contents of a distributed data set that spans numerous clients and storage devices, including both primary data 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 view and manipulate the 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 information management system.
An information governance policy may comprise a classification policy, which 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. Accordingly, all these documents or data objects will be classified as “privileged.”
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. 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.
Restore Operations from Secondary Copies
While not shown in
As one example, a user may manually initiate a restore of backup copy 116A, e.g., by interacting with user interface 158 of storage manager 140 or with a web-based console with access to system 100. Storage manager 140 may accesses data in its index 150 and/or management database 146 (and/or the respective storage policy 148A) associated with the selected backup copy 116A to identify the appropriate media agent 144A and/or secondary storage device 108A where the secondary copy resides. The user may be presented with a representation (e.g., stub, thumbnail, listing, etc.) and metadata about the selected secondary copy, in order to determine whether this is the appropriate copy to be restored, e.g., date that the original primary data was created. Storage manager 140 will then instruct media agent 144A and an appropriate data agent 142 on the target client computing device 102 to restore secondary copy 116A to primary storage device 104. 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, e.g., 144A, retrieves secondary copy 116A from disk library 108A. For instance, media agent 144A may access its index 153 to identify a location of backup copy 116A on disk library 108A, or may access location information residing on disk library 108A itself.
In some cases a backup copy 116A that was recently created or accessed, may be cached to speed up the restore operation. In such a case, media agent 144A accesses a cached version of backup copy 116A residing in index 153, without having to access disk library 108A for some or all of the data. Once it has retrieved backup copy 116A, the media agent 144A communicates the data to the requesting client computing device 102. Upon receipt, file system data agent 142A and email data agent 142B may unpack (e.g., restore from a backup format to the native application format) the data in backup copy 116A and restore the unpackaged data to primary storage device 104. In general, secondary copies 116 may be restored to the same volume or folder in primary storage device 104 from which the secondary copy was derived; to another storage location or client computing device 102; to shared storage, etc. In some cases, the data may be restored so that it may be used by an application 110 of a different version/vintage from the application that created the original primary data 112.
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 one or more 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, media agent 144, storage manager 140, or other component may divide files into chunks and generate headers for each chunk by processing the files. Headers can include a variety of information such as file and/or volume identifier(s), offset(s), and/or other information associated with the payload data items, a chunk sequence number, etc. Importantly, in addition to being stored with secondary copy 116 on secondary storage device 108, chunk headers can also be stored to index 153 of the associated media agent(s) 144 and/or to index 150 associated with storage manager 140. This can be useful for providing faster processing of secondary copies 116 during browsing, 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 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 media agent 144) according to the information in the chunk header to reassemble the files.
Data can also be communicated within system 100 in data channels that connect client computing devices 102 to 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 other advantages. Example data formatting techniques including techniques involving data streaming, chunking, and the use of other data structures in creating secondary copies are described in U.S. Pat. Nos. 7,315,923, 8,156,086, and 8,578,120.
Referring to
As an example, data structures 180 illustrated in
If the operating system of the secondary storage computing device 106 on which media agent 144 operates supports sparse files, then when media agent 144 creates container files 190/191/193, it can create them as sparse files. A sparse file is a 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 container files 190/191/193 be sparse files allows media agent 144 to free up space in container files 190/191/193 when blocks of data in container files 190/191/193 no longer need to be stored on the storage devices. In some examples, 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, 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 approx. 100 to approx. 1000 blocks or when its size exceeds approximately 50 MB to 1 GB). In some cases, a file on which a secondary copy 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.
Using Backup Data for Replication and Disaster Recovery (“Live Synchronization”)
There is an increased demand to off-load resource intensive information management tasks (e.g., data replication tasks) away from production devices (e.g., physical or virtual client computing devices) in order to maximize production efficiency. At the same time, enterprises expect access to readily-available up-to-date recovery copies in the event of failure, with little or no production downtime.
The synchronization can be achieved by generally applying an ongoing stream of incremental backups from the source subsystem 201 to the destination subsystem 203, such as according to what can be referred to as an “incremental forever” approach.
As shown, the data can be copied from source to destination in an incremental fashion, such that only changed blocks are transmitted, and in some cases multiple incremental backups are consolidated at the source so that only the most current changed blocks are transmitted to and applied at the destination. An example of live synchronization of virtual machines using the “incremental forever” approach is found in U.S. Patent Application No. 62/265,339 entitled “Live Synchronization and Management of Virtual Machines across Computing and Virtualization Platforms and Using Live Synchronization to Support Disaster Recovery.” Moreover, a deduplicated copy can be employed to further reduce network traffic from source to destination. For instance, the system can utilize the deduplicated copy techniques described in U.S. Pat. No. 9,239,687, entitled “Systems and Methods for Retaining and Using Data Block Signatures in Data Protection Operations.”
At step 4, destination media agent(s) 244b write the received backup/secondary copy data to the destination secondary storage device(s) 208b. At step 5, the synchronization is completed when the destination media agent(s) and destination data agent(s) 242b restore the backup/secondary copy data to the destination client computing device(s) 202b. The destination client computing device(s) 202b may be kept “warm” awaiting activation in case failure is detected at the source. This synchronization/replication process can incorporate the techniques described in U.S. patent application Ser. No. 14/721,971, entitled “Replication Using Deduplicated Secondary Copy Data.”
Where the incremental backups are applied on a frequent, on-going basis, the synchronized copies can be viewed as mirror or replication copies. Moreover, by applying the incremental backups to the destination site 203 using backup or other secondary copy data, the production site 201 is not burdened with the synchronization operations. Because the destination site 203 can be maintained in a synchronized “warm” state, the downtime for switching over from the production site 201 to the destination site 203 is substantially less than with a typical restore from secondary storage. Thus, the production site 201 may flexibly and efficiently fail over, with minimal downtime and with relatively up-to-date data, to a destination site 203, such as a cloud-based failover site. The destination site 203 can later be reverse synchronized back to the production site 201, such as after repairs have been implemented or after the failure has passed.
Integrating with the Cloud Using File System Protocols
Given the ubiquity of cloud computing, it can be increasingly useful to provide data protection and other information management services in a scalable, transparent, and highly plug-able fashion.
Where NFS is used, for example, secondary storage subsystem 218 allocates an NFS network path to the client computing device 202 or to one or more target applications 210 running on client computing device 202. During a backup or other secondary copy operation, the client computing device 202 mounts the designated NFS path and writes data to that NFS path. The NFS path may be obtained from NFS path data 215 stored locally at the client computing device 202, and which may be a copy of or otherwise derived from NFS path data 219 stored in the secondary storage subsystem 218.
Write requests issued by client computing device(s) 202 are received by data agent 242 in secondary storage subsystem 218, which translates the requests and works in conjunction with media agent 244 to process and write data to a secondary storage device(s) 208, thereby creating a backup or other secondary copy. Storage manager 240 can include a pseudo-client manager 217, which coordinates the process by, among other things, communicating information relating to client computing device 202 and application 210 (e.g., application type, client computing device identifier, etc.) to data agent 242, obtaining appropriate NFS path data from the data agent 242 (e.g., NFS path information), and delivering such data to client computing device 202.
Conversely, during a restore or recovery operation client computing device 202 reads from the designated NFS network path, and the read request is translated by data agent 242. The data agent 242 then works with media agent 244 to retrieve, re-process (e.g., re-hydrate, decompress, decrypt), and forward the requested data to client computing device 202 using NFS.
By moving specialized software associated with system 200 such as data agent 242 off the client computing devices 202, the illustrative architecture effectively decouples the client computing devices 202 from the installed components of system 200, improving both scalability and plug-ability of system 200. Indeed, the secondary storage subsystem 218 in such environments can be treated simply as a read/write NFS target for primary storage subsystem 217, without the need for information management software to be installed on client computing devices 202. As one example, an enterprise implementing a cloud production computing environment can add VM client computing devices 202 without installing and configuring specialized information management software on these VMs. Rather, backups and restores are achieved transparently, where the new VMs simply write to and read from the designated NFS path. An example of integrating with the cloud using file system protocols or so-called “infinite backup” using NFS share is found in U.S. Patent Application No. 62/294,920, entitled “Data Protection Operations Based on Network Path Information.” Examples of improved data restoration scenarios based on network-path information, including using stored backups effectively as primary data sources, may be found in U.S. Patent Application No. 62/297,057, entitled “Data Restoration Operations Based on Network Path Information.”
Highly Scalable Managed Data Pool Architecture
Enterprises are seeing explosive data growth in recent years, often from various applications running in geographically distributed locations.
The illustrated system 200 includes a grid 245 of media agents 244 logically organized into a control tier 231 and a secondary or storage tier 233. Media agents assigned to the storage tier 233 can be configured to manage a secondary storage pool 208 as a deduplication store, and be configured to receive client write and read requests from the primary storage subsystem 217, and direct those requests to the secondary tier 233 for servicing. For instance, media agents CMA1-CMA3 in the control tier 231 maintain and consult one or more deduplication databases 247, which can include deduplication information (e.g., data block hashes, data block links, file containers for deduplicated files, etc.) sufficient to read deduplicated files from secondary storage pool 208 and write deduplicated files to secondary storage pool 208. For instance, system 200 can incorporate any of the deduplication systems and methods shown and described in U.S. Pat. No. 9,020,900, entitled “Distributed Deduplicated Storage System,” and U.S. Pat. Pub. No. 2014/0201170, entitled “High Availability Distributed Deduplicated Storage System.”
Media agents SMA1-SMA6 assigned to the secondary tier 233 receive write and read requests from media agents CMA1-CMA3 in control tier 231, and access secondary storage pool 208 to service those requests. Media agents CMA1-CMA3 in control tier 231 can also communicate with secondary storage pool 208, and may execute read and write requests themselves (e.g., in response to requests from other control media agents CMA1-CMA3) in addition to issuing requests to media agents in secondary tier 233. Moreover, while shown as separate from the secondary storage pool 208, deduplication database(s) 247 can in some cases reside in storage devices in secondary storage pool 208.
As shown, each of the media agents 244 (e.g., CMA1-CMA3, SMA1-SMA6, etc.) in grid 245 can be allocated a corresponding dedicated partition 251A-251I, respectively, in secondary storage pool 208. Each partition 251 can include a first portion 253 containing data associated with (e.g., stored by) media agent 244 corresponding to the respective partition 251. System 200 can also implement a desired level of replication, thereby providing redundancy in the event of a failure of a media agent 244 in grid 245. Along these lines, each partition 251 can further include a second portion 255 storing one or more replication copies of the data associated with one or more other media agents 244 in the grid.
System 200 can also be configured to allow for seamless addition of media agents 244 to grid 245 via automatic configuration. As one illustrative example, a storage manager (not shown) or other appropriate component may determine that it is appropriate to add an additional node to control tier 231, and perform some or all of the following: (i) assess the capabilities of a newly added or otherwise available computing device as satisfying a minimum criteria to be configured as or hosting a media agent in control tier 231; (ii) confirm that a sufficient amount of the appropriate type of storage exists to support an additional node in control tier 231 (e.g., enough disk drive capacity exists in storage pool 208 to support an additional deduplication database 247); (iii) install appropriate media agent software on the computing device and configure the computing device according to a pre-determined template; (iv) establish a partition 251 in the storage pool 208 dedicated to the newly established media agent 244; and (v) build any appropriate data structures (e.g., an instance of deduplication database 247). An example of highly scalable managed data pool architecture or so-called web-scale architecture for storage and data management is found in U.S. Patent Application No. 62/273,286 entitled “Redundant and Robust Distributed Deduplication Data Storage System.”
The embodiments and components thereof disclosed in
Block-Level Live Browsing, Private Writable Snapshots, and Private Writable Backup Copies Using an ISCSI Server without Pseudo-Disk Drivers at the User Computing Devices
An illustrative ISCSI server 301 provides user computing devices 302 with “private writable snapshots” 430 of a desired volume of data 420 (configured as block-level storage) and/or further provides “private writable backup copies” 560, which are derived from a block-level backup copy of data 116 stored in backup media 108. The illustrative ISCSI service 401, which executes on ISCSI server 301, is provided without invoking snapshot limits imposed by storage arrays and further without using specialized backup software and/or pseudo-disk drivers installed on user computing devices 302. The illustrative functionality primarily resides in the ISCSI server and is agnostic of the ISCSI server's operating system and user computing devices' 302 respective operating systems. A user can browse as well as edit personal versions of any number and/or versions of block-level backup copies—the “private writable backup copies” 560. Likewise, a user can browse and edit personal versions of any number of snapshots of one or more versions of one or more desired data volumes—the “private writable snapshots” 430. Accordingly, the illustrative embodiments provide for private writable environments (e.g., 430, 560) as well as for live browsing of existing data (e.g., 420, 116, respectively).
Sparse files (e.g., 426, 430), snapshots (e.g., 422), extent-files (e.g., 517, 570, 580), special-purpose directories (e.g., 550, 560), and/or media agents 544 co-residing on the ISCSI server 301 along with ISCI service module 401 are used in the illustrative embodiments. There is no limit on how many user computing devices 302 an ISCSI server 301 can service under the present architecture. Likewise, there is no limit on how many distinct private writable snapshots 430 and/or private writable backup copies 560 can be configured and serviced on ISCSI server 301 for any given user computing device 302. Each private writable snapshot 430 and private writable backup copy 560 operates independently of other private writable workspaces accessible to a given user computing device 302.
Backup media 108 (used interchangeably herein with “data storage device 108”) is a data storage device or devices that is configured for storing data, and illustratively for storing secondary copies of data, such as backup copies, which are relevant to the illustrative embodiment. Data storage device 108, which is described in more detail elsewhere herein, is any storage device and storage technology suitable for storing secondary copies 116, without limitation.
ISCSI server computing device 301 (or “ISCSI server301”) is a computing device comprising one or more processors and computer memory. ISCSI server 301 is responsible, e.g., by executing ISCSI service module 401, for many of the features of the illustrative embodiment, as explained in more detail in subsequent figures.
As shown by the dashed line connecting backup media 108 and ISCSI server 301, ISCSI server 301 is in communication with backup media 108 in certain configurations, but not in others—hence the dashed line. For example, no backup media 108 is required in the illustrative embodiment depicted in
Each user computing device 302 (e.g., 302-1, 302-2 . . . 302-M) is a computing device comprising one or more processors and computer memory. Illustratively, each user computing device 302 communicates with ISCSI server 301 via ISCSI protocol, and thus the connection therebetween uses a public and/or private Internet Protocol (IP)-based network. ISCSI protocol is well known in the art. There is no limit on how many user computer devices 302 can be served by ISCSI server 301. As explained in more detail in
The physical infrastructure needed to support the connectivity shown in this and other figures herein is well known in the art and comprises any suitable electronic data communications facilities, components, and protocols sufficient to enable the functionality described herein.
ISCSI service module 401 (or “ISCSI service 401”) is a functional component of ISCSI server 301, illustratively implemented as executable software that executes on ISCSI server computing device 301, thus providing ISCSI server 301 with many of the features described herein, e.g., communicating via ISCSI protocol with user computing devices 302; instructing ISCSI server 301 to take snapshot 422; creating master sparse file(s) 426 and associated respective bitmap(s) 428; creating private sparse file(s) 430 and associated respective bitmap(s) 432; copying data blocks to master sparse files 426 and private sparse files 430 and updating associated respective bitmaps 428 and 432 accordingly; checking bitmaps 426 and 432; receiving and analyzing read and write requests from user computing devices 302 and serving responses thereto; providing a user interface 1010 to user computing devices 302 for requesting and accessing private writable snapshots; etc. Additionally, features described in regard to
Because ISCSI service 401 executes on ISCSI server 301, ISCSI server 301 is said to provide ISCSI service to user computing devices 302 according to one or more illustrative embodiments. In alternative embodiments, ISCSI service 401 is implemented as executable firmware and/or a combination of software and firmware, without limitation. ISCSI service 401 is shown herein as a distinct component to ease understanding of the present disclosure, however, alternative embodiments are also possible within the scope of the present invention. For example, ISCSI service 401 may be combined with or layered within media agent 544 code; in such a configuration media agent 544 provides the functionality depicted here as ISCSI service 401. See also
Original data volume 420 (or “volume 420”) is a data volume configured as block-level data storage comprising any data that is of interest to user computing devices 302. For example, volume 420 may comprise data created for a research project, a software development code base, creative content, or any content whatsoever without limitation. According to the illustrative embodiment, system 300 configured as shown here isolates the content of volume 420 from the “private writable” changes implemented by user computing devices 302 while also providing user computing devices 302 with the ability to live browse the content of volume 420 and further to implement their own private writable workspaces derived from volume 420.
Snapshot 422 is a snapshot data structure illustratively taken and generated by ISCSI server 301 using native utilities, such as operating system features that are well known in the art and which take a so-called “software snapshot” (described in more detail elsewhere herein). Snapshot 422 represents a point-in-time copy of volume 420 and thus comprises all the content of volume 420 at the time that the snapshot is taken, as indicated by the one-way arrow from volume 420 to snapshot 422. Any number of successive snapshots 422 can be taken at various points-in-time to capture what is stored in volume 420. For example, in a constantly changing research or development environment, snapshot 422 is taken every time a new version of data is stored to volume 420. Snapshot 422 becomes a source of data for the operations described herein and therefore multiple snapshots 422 can each serve as a unique and distinct source of data.
Master sparse file 426 is a sparse file data structure that is generated by ISCSI server 301 to correspond in size to snapshot 422. Sparse files are well known in the art. A “sparse file is a type of computer file that attempts to use file system space more efficiently when the file itself is partially empty . . . by writing brief information (metadata) representing the empty blocks to disk instead of the actual ‘empty’ space which makes up the block, using less disk space. The full block size is written to disk as the actual size only when the block contains ‘real’ (non-empty) data . . . . The advantage of sparse files is that storage is only allocated when actually needed[ ].” (https://en.wikipedia.orq/wiki/Sparse file, accessed on 24 Apr. 2018). Thus, master sparse file 426 is empty when first created, but over time becomes populated with data blocks copied from snapshot 422, as represented by the one-way arrow from snapshot 422 to master sparse file 426. According to the illustrative embodiment, master sparse file 426 is first created on a first-time request for a private writable snapshot based on volume 420. Subsequent such requests are served from the same master sparse file 426. See also
Master bitmap 428 is a data structure that is closely associated with master sparse file 426. Master bitmap 428 is created and maintained by ISCSI server 301 (e.g., using ISCSI service 401). Master bitmap 428 comprises bits of information each of which tracks a corresponding data block in master sparse file 426. Each bit indicates whether the corresponding data block it is tracking is actually present in master sparse file 426. Initially, all bits in bitmap 428 indicate that the respective data block is not present in master sparse file 426. When a given data block is copied from snapshot 422 to master sparse file 426, ISCSI service 401 updates the corresponding bit in bitmap 428 to so indicate. In the future, when ISCSI service 401 needs to retrieve a data block, it checks master bitmap 428 to determine whether the sought-after data block is present in master sparse file 426, and if not, ISCSI service 401 retrieves the sought-after data block from snapshot 422, copies the sought-after data block to master sparse file 426, and updates master bitmap 428 accordingly. See also
Private sparse files 430 (e.g., U1430-1, U2430-2) are the private environments or workspaces that are directly accessible to user computing devices 302. Thus, a user's private writable snapshot according to the illustrative embodiment is actually implemented as a private sparse file 430 as described herein. Like master sparse file 426, private sparse file 430 is also a sparse file data structure. Illustratively, private sparse file U1430-1 is configured for and accessible to user computing device “U1” 302-1; and private sparse file U2430-2 is configured for and accessible to user computing device “U2” 302-2. A logical view from the user's perspective is shown in
According to the illustrative embodiment, a private sparse file 430 is created on demand, when ISCSI service 401 receives a request for a private writable snapshot accompanied by and/or comprising a unique identifier (ID) for the private writable snapshot. In response, ISCSI service 401 creates private sparse file 430, giving it the unique ID and associating it with master sparse file 426, which in turn is associated with snapshot 422, which represents a certain point-in-time version of volume 420. This chain of associations is evident from the one-way arrows from original volume 420 to snapshot 422 to master sparse file 426 to private sparse files 430-1 and 430-2. Thus, both private sparse files 430-1 and 430-2 are associated with master sparse file 426, and therefore derive from the same version of volume 420 as captured in snapshot 422. Another version of volume 420 would have its own distinct snapshot 422 and corresponding master sparse file 426, which in turn would be associated with other distinct private sparse files 430 derived from the other version of volume 420.
Private bitmap 432 (e.g., private U1 bitmap 432-1, private U2 bitmap 432-2) is closely associated with a private sparse file 430, e.g., 430-1, and 430-2, respectively. Private bitmap 432 is created and maintained by ISCSI server 301 (e.g., using ISCSI service 401). Private bitmap 432 comprises bits of information each of which tracks a corresponding data block in its associated private sparse file 430. Each bit indicates whether the data block it is tracking is actually present in private sparse file 430. Initially, all bits in bitmap 432 indicate that the corresponding data block is not present in private sparse file 430. When a given data block is copied from master sparse file 426 to private sparse file 430, ISCSI service 401 updates the corresponding bit in bitmap 432 to so indicate. In the future, when ISCSI service 401 needs to retrieve a data block, it checks private bitmap 432 to determine whether the sought-after data block is present in the associated private sparse file 430, and if not, ISCSI service 401 retrieves the sought-after data block from master sparse file 426. See also
Block-level backup copy 116 is a secondary copy made from a source of data (not shown) and stored to backup media in a block-level backup format as described in more detail elsewhere herein. Data from block-level backup copy 116 is restored in groups of data blocks called “extents.” This is depicted by the one-way arrow from block-level backup copy 166 to media agent 544 accompanied by the “EXT” label. Illustratively, extents are sized at 4 MB, though the invention is not so limited. According to the illustrative embodiment, system 300 configured as shown here isolates backup copy 116 from changes implemented by user computing devices 302 while also providing user computing devices 302 with the ability to live browse the content of backup copy 116 and further to implement their own private versions (private writable backup copy) derived therefrom.
ISCSI service module 401 is a functional component that was described in part in
Media agent 544 is analogous to media agent 144 and further comprises additional functionality for operating in system 300, such as having a communicative coupling with ISCSI service 401, receiving instructions on restoring individual extents of a certain size and storing restored extents as individual extent-files to archive store directory 550, etc. In some alternative embodiments media agent 544 comprises ISCSI service module 401 and is said to provide the ISCSI Service described herein.
Archive store directory 550 is a directory (or folder or equivalent) data structure created on ISCSI server 301 by ISCSI service 401. Directories and folders and equivalent data structures are well known in the art. Archive store directory 550 is first created on a first-time request for a private writable backup copy derived from block-level backup copy 116 when a request is first received from a user computing device 302. If no archive store directory 550 was previously created in reference to the given block-level backup copy 116, ISCSI service 401 creates one here. Its contents are extent-files received from media agent 544 as depicted by the one-way arrow from media agent 544 to archive store directory 550 accompanied by the “EXT” label.
Extent-files 517 (e.g., 517-1 . . . 517-7 . . . 517-N) are ordinary data files. Each extent-file 517 comprises the data of one unique extent restored by media agent 544 from block-level backup copy 116. Thus, each extent-file 517 uniquely defines and is uniquely associated with the particular extent of data that it comprises. The one-to-one relationship between extent and extent-file 517 enables ISCSI service 401 to determine whether a certain extent is present in archive store directory 550 by checking whether the sought-after extent's corresponding extent-file 517 is present in the archive store directory 550.
Private store directories 560 (e.g., U1560-1, U2560-2) are the private environments or workspaces that are directly accessible to user computing devices 302. Thus, a user's private writable backup copy according to the illustrative embodiment is actually implemented as a private store directory 560 as described herein. Like archive store directory 550, private store directory 560 is also a directory (or folder or equivalent) data structure that comprises extent-files (e.g., 570, 580). Illustratively, private store directory U1560-1 is accessible to user computing device “U1” 302-1; and private store directory U2560-2 is accessible to user computing device “U2” 302-2. A logical view from the user's perspective is shown in
According to the illustrative embodiment, a private store directory 560 is created on demand, when ISCSI service 401 receives a request for a private writable backup copy accompanied by and/or comprising a unique identifier (ID) for the private writable backup copy. In response, ISCSI service 401 creates private store directory 560, giving it the unique ID and associating it with archive stored directory 550, which in turn is associated with backup copy 116. This chain of associations is evident from the one-way arrows from backup copy 116 to media agent 544 to archive store directory 550 to private store directories 560-1 and 560-2. Thus, both private store directories 560 are associated with archive store directory 550, and thus derive from the same block-level backup copy 116. Another block-level backup copy 116 would have its own corresponding archive store directory 550, which in turn would be associated with other private store directories 560.
Extent-files 570 (e.g., 570-2, 570-7) are analogous to extent-files 517, but are distinguishable in that the content of an extent-file 570 is created by user computing device 302 (e.g., 302-1). Thus, extent-files 570 represent the private writable aspect of the private writable backup copy here.
Extent-files 580 (e.g., 580-1, 580-2, 580-7) are analogous to extent-files 517, but are distinguishable in that the content of an extent-file 580 is created by user computing device 302 (e.g., 302-2). Thus, extent-files 580 represent the private writable aspect of the private writable backup copy here.
At block 602, accessing ISCSI server's user interface (e.g., 1010) and providing a unique ID to ISCSI server 301, user computing device 302 requests from ISCSI server 301 a private writable snapshot of a data volume, e.g., original volume 420. Thus, user computing device 302 submits a request for a private writable snapshot derived from original volume 420. User computing device 302 provides a unique ID for this private writable snapshot, which ISCSI server 301 (e.g., using ISCSI service 401) will ultimately assign to a private sparse file 430 created on demand in response to this request.
At block 604, which is a decision point, ISCSI server 301 determines whether the request received at block 602 is the first request for a private writable snapshot derived from this version of volume 420. If this is not a first-time request, certain steps are skipped and control passes to block 610. If this is a first-time request, control passes to block 606. Accordingly, ISCSI server 301 tracks versions of data volume 420, to help it determine when a request for a private writable snapshot is “first-time” with respect to that version.
At block 606, ISCSI server 301 generates a snapshot 422 of the desired volume 420. As noted, snapshot 422 is a software snapshot created by ISCSI server 301, e.g., using operating system utilities. Software snapshots are well known in the art. Snapshot 422 is stored on ISCSI server 301. Snapshot 422 is associated with whatever version of data volume 420 it snapshots here.
At block 608, ISCSI server 301 generates a sparse file designated master sparse file 426, which is sized to correspond to and is associated with snapshot 422. ISCSI server 301 also creates a data structure designated master bitmap 428 for tracking block-level activity in master sparse file 426, i.e., for tracking the presence or absence of individual data blocks therein. Master sparse file 426 and master bitmap 428 are both stored on ISCSI server 301.
At block 610, ISCSI server 301 generates a sparse file designated private sparse file 430 (e.g., 430-1) which is identified based on the unique ID received from user computing device 302; private sparse file 430 is associated with master sparse file 426. ISCSI server 301 also creates an associated data structure designated private bitmap 432 (e.g., 432-1) for tracking block-level activity in private sparse file 430, i.e., for tracking the presence or absence of individual data blocks therein. Private sparse file 430 and private bitmap 432 are both stored on ISCSI server 301. Thus, at this point, ISCSI server 301 has created a number of associated data structures.
At block 612, ISCSI server 301 presents private sparse file 430 as a logical unit number (“LUN”) to user computing device 302 in response to the request received at block 602.
At block 614, the requesting user computing device 302 mounts private sparse file 430 as a LUN. Mounting a LUN and equivalent techniques are well known in the art.
At block 616, ISCSI server 301 provides a “private writable snapshot” to user computing device 302 in response to the request received at block 602. The private writable snapshot is uniquely identified, such as by the unique ID received at block 602. As noted, the user's private writable snapshot according to the illustrative embodiment is actually implemented as a private sparse file 430. The private writable snapshot is based on private sparse file 430, master sparse file 426, and snapshot 422 as described herein. The private writable snapshot is made accessible to user computing device via ISCSI protocol, which is intercepted and processed by ISCSI service 401. The private writable snapshot is serviced by ISCSI server 301 as described in more detail in
At block 702, ISCSI server 301 receives from user computing device 302 a read request for a given data block (e.g., data block B) in the “writable private snapshot.” At this point, user computing device 302 “sees” a private writable snapshot as provided by ISCSI server 301; the private writable snapshot is actually implemented as a private sparse file 430 in association with master sparse file 426 and snapshot 422. Therefore, these latter terms will be used in discussing the operations in the present figure. The read request is intercepted, interpreted, and analyzed by ISCSI server 301, e.g., using ISCSI service 401.
At block 704, ISCSI server 301 checks private bitmap 432 associated with private sparse file 430 to determine whether private bitmap 432 indicates that data block B is present in private sparse file 430. Specifically, a certain bit that tracks data block B is checked here. If the bit indicates that data block B is present in private sparse file 430, control passes to block 712. As shown later, such data blocks are present in private sparse file 430 because at an earlier point in time they were written thereto by user computing device 302. If the bit indicates that private sparse file 430 lacks the sought-after data block B, control passes to block 706.
At block 706, ISCSI server 301 checks master bitmap 428 (associated with master sparse file 426, which is associated with private sparse file 430) to determine whether master bitmap 428 indicates that data block B is present in master sparse file 426. Specifically, a certain bit that tracks data block B is checked here. If the bit indicates that data block B is present in master sparse file 426, control passes to block 710; otherwise control passes to block 708.
At block 708, ISCSI server 301 recalls data block B from snapshot 422 and stores the recalled data block B to master sparse file 426, and updates master bitmap 428 to so indicate. Now master sparse file 426 comprises data block B and master bitmap 428 indicates that data block B is present in master sparse file 426.
At block 710, ISCSI server 301 serves data block B from master sparse file 426 to user computing device 302 in response to the read request received at block 702. In general, data blocks that are unchanged relative to snapshot 422 are served from master sparse file 426 according to the illustrative embodiment. After this read request is served, control passes to another read request at block 702 or to a write request at block 714.
At block 712, ISCSI server 301 serves data block B from private sparse file 430 to user computing device 302 in response to the read request received at block 702. In general, data blocks that are changed by user computing device 302 relative to snapshot 422 are served from private sparse file 430 according to the illustrative embodiment. After this read request is served, control passes to another read request at block 702 or to a write request at block 714.
At block 714, ISCSI server 301 receives a request to write data block B to the “private writable snapshot.” This is a submission of new/changed data generated by user computing device 302. The write request is intercepted, interpreted, and analyzed by ISCSI server 301, e.g., using ISCSI service 401.
At block 716, ISCSI server 301 checks private bitmap 432 to determine whether data block B is present in private sparse file 430. Since a data block that is to be written was previously read, the logic in blocks 706 and 708 applies, meaning that the data block was recalled to master sparse file 426 at an earlier point in time. If private bitmap 432 indicates that data block B is not present in private sparse file 430, ISCSI server 301 copies data block B from master sparse file 426 to private sparse file 430 and updates the associated private bitmap 432 to so indicate. Now private sparse file 430 comprises data block B and private bitmap 432 indicates that data block B is present in private sparse file 430.
At block 718, ISCSI server 301 writes data block B to private sparse file 430 by overwriting the corresponding data block copied from master sparse file 426 in the preceding operation. ISCSI server 301 also updates private bitmap 432 to indicate that data block B is present in the private sparse file 430, if not already so updated. As seen in the logic of operations 702-712, future read requests will first check for a sought-after data block in private sparse file 430, since that is where a changed data block might have been written and is thus newer and presumably more relevant than the original data block found in snapshot 422 or master sparse file 426. After this write request is served/effectuated, control passes to another read request at block 702 or to a write request at block 714.
At block 720, ISCSI server 301 also services deletion requests from user computing device 302. When a private sparse file 430 is deleted on a request from user computing device 302, its associated private bitmap 432 also is deleted. However, no changes are implemented to snapshot 422 or master sparse file 426. As a result, any number of other private sparse files 430, associated with one or more user computing devices 302, can continue being serviced by ISCSI server 301 independently of the deleted private sparse file 430. A given user computing device 302 can have any number of private sparse files 430 based on a given master sparse file 426 and snapshot 422. As a result, each “private writable snapshot” is said to operate independently of all the other private writable snapshots as well as independently of any private writable backup copies at ISCSI server 301. This is illustrated in part in
At block 802, accessing ISCSI server's user interface (e.g., 1010) and providing a unique ID to ISCSI server 301, user computing device 302 requests from ISCSI server 301 a private writable backup copy of a block-level backup copy 116, which is illustratively stored on backup media 108. This user computing devoice 302 submits a request for a private writable backup copy derived from backup copy 116. User computing device 302 provides a unique ID for this private writable backup copy, which ISCSI server 301 will ultimately assign to a private store directory 560 created on demand in response to this request.
At block 804, which is a decision point, ISCSI server 301 determines whether the request received at block 802 is the first request for a private writable backup copy derived from this particular backup copy 116. If this is not the first such request, certain steps are skipped and control passes to block 808. This is a first-time request, control passes to block 806.
At block 806, ISCSI server 301 creates a directory (or folder or equivalent) which it designates archive store directory 550 and which corresponds to and is associated with block level backup copy 116. Archive store directory 550 will store extent-files 517 restored from backup copy 116 by media agent 544.
At block 808, ISCSI server 301 creates a directory (or folder or equivalent) which it designates a private store directory 560 and which is identified based on the unique ID received from user computing device 302; private store directory 560 is associated with archive store directory 550. Private store directory 560 will store extent-files (e.g., 570, 580) that are written thereto by user computing device 302. Thus, at this point, ISCSI server 301 has created a number of associated directories.
At block 810, ISCSI server 301 presents private store directory 560 as a logical unit number (“LUN”) to the user computing device 302 in response to the request received at block 802.
At block 812, the requesting user computing device 302 mounts private store directory 560 as a LUN. Mounting a LUN and equivalent techniques are well known in the art.
At block 814, ISCSI server 301 provides a “private writable backup copy” to user computing device 302 in response to the request received at block 802. The private writable backup copy is uniquely identified, such as by the unique ID received at block 802. As noted, a user's private writable backup copy according to the illustrative embodiment is actually implemented as a private store directory 560. The private writable backup copy is based on private store directory 560, archive store directory 550, and block-level backup copy 116, as described herein. The private writable backup copy is made accessible to user computing device 302 via ISCSI protocol, which is intercepted and processed by ISCSI service 401 illustratively. The private writable backup copy is serviced by ISCSI server 301 as described in more detail in
At block 902, ISCSI server 301 receives from user computing device 302 a read request for a given extent (e.g., extent E) in the “private writable backup copy.” At this point, user computing device 302 “sees” a private writable backup copy as provided by ISCSI server 301; as explained earlier, the private writable backup copy is actually implemented as a private store directory 560 in association with archive store directory 550 and block-level backup copy 116. Therefore, these latter terms will be used in describing the operations in the present figure. The read request is intercepted, interpreted, and analyzed by ISCSI server 301, e.g., using ISCSI logic 401.
At block 904, which is a decision point, ISCSI server 301 determines whether private store directory 560 comprises an extent-file 570 (or 580, as appropriate in another directory 560) for extent E. This is accomplished by checking whether an extent-file corresponding to extent E is present in private store directory 560, and if so, control passes to block 912; otherwise control passes to block 906. As shown later, data blocks 570 (or 580) are present in private store directory 560 because at an earlier time they were written thereto by user computing device 302.
At block 906, which is a decision point, ISCSI server 301 determines whether archive store directory 550 comprises an extent-file 517 for extent E. This is accomplished by checking whether an extent-file corresponding to extent E is present in archive store directory 550, and if so, control passes to block 910; otherwise control passes to block 908.
At block 908, ISCSI server 301 instructs media agent 544 to restore extent E from block-level backup copy 116 on backup media 108 and to store the restored extent to an extent-file 517 (e.g., designated extent-file E corresponding to extent E) in archive store directory 550. Media agent 544 executes the restore operation as instructed, restoring the extent from a backup format in backup copy 116 to a native block format suitable for browsing by user computing device 302, and stores extent-file E to archive store directory 550 as instructed.
At block 910, ISCSI server 301 serves extent E from extent-file E in archive store directory 550 to user computing device 302 in response to the read request received at block 902. In general, extents that are unchanged relative to the block-level backup copy 116 are served from archive store directory 550 according to the illustrative embodiment. After this read request is served, control passes to another read request at block 902 or to a write request at block 914.
At block 912, ISCSI server 301 serves extent E from extent-file E in private store directory 560 to user computing device 302 in response to the read request received at block 902. In general, extents that are changed by user computing device 302 relative to block-level backup copy 116 are served from private store directory 560 according to the illustrative embodiment. After this read request is served, control passes to another read request at block 902 or to a write request at block 914.
At block 914, ISCSI server 301 receives a request to write extent E to the “private writable backup copy.” This is a submission of new/changed data generated by user computing device 302. The write request is intercepted, interpreted, and analyzed by ISCSI server 301, e.g., using ISCSI service 401.
At block 916, ISCSI server 301 determines whether extent-file E is present in private store directory 560. Since an extent that is to be written was previously read, the logic in operations 906-908 applies, meaning that the extent was restored to archive store directory 550 at an earlier time. If private store directory 560 does not comprise an extent-file E, ISCSI server 301 copies extent-file E from archive store directory 550 to private store directory 560.
At block 918, ISCSI server 301 writes extent E as received from user computing device 302 to extent-file E in private store directory 560 by overwriting the corresponding extent-file E copied from archive store directory 550 in the preceding operation. As seen in the logic of operations 902-912, future read requests will first check for a sought-after extent in private store directory 560, since that is where a changed extent might have been written and is thus newer and presumably more relevant than the original extent found in backup copy 116 or restored to archive store directory 550. After this write request is served/effectuated, control passes to a read request at block 902 or to another write request at block 914.
At block 920, ISCSI server 301 also services deletion requests from user computing device 302. When a “private writable backup copy” is deleted, the private store directory 560 is deleted at ISCSI server 301. However, no changes are implemented at archive store directory 550 or block-level backup copy 116. Any number of other private store directories 560, associated with one or more user computing devices 302, including possibly associated with the present user computing device 302, continue to be serviced by ISCSI server 301 independently of the deleted private store directory 560. A given user computing device 302 can have any number of private store directories 560 based on a given archive store directory 550 and block-level backup copy 116. As a result, each “private writable backup copy” is said to operate independently of all other private writable backup copies as well as independently of any private writable snapshots at ISCSI server 301. This is illustrated in part in
The user of a given user computing device 302 interacts with ISCSI server 301 via an illustrative user interface 1010 (solid two-way arrows labeled “UI”), which is illustratively part of ISCSI service 401 executing on ISCSI server 301. Accordingly, via user interface 1010, a user views sources available for private writable workspaces, such as one or more original volume 420 and/or one or more block-level backup copy 116, and requests a corresponding private writable workspace based on the source, e.g., one or more private writable snapshots 430, one or more private writable backup copies 560. Moreover, via user interface 1010 ISCSI service 401 also provides the user the ability to live browse source data without having to actually write new/changed data to the corresponding private writable workspace, as explained in more detail in preceding figures herein. See also blocks 702-710 in
In alternative embodiments, user interface 1010 further shows the user a plurality of snapshots 422 as distinct point-in-time copies of original source volume 420 (see, e.g.,
User interface 1010 further gives the user a choice of choosing from any number of block-level backup copies 116 stored on one or more distinct backup media. Furthermore, user interface 1010 further gives the user a choice of choosing the same block-level copy 116 multiple times for distinct respective private writable backup copies 560, each of which will operate independently of the others, even though they are all based on or derived from the same block-level backup copy 116.
In regard to the figures described herein, other embodiments are possible within the scope of the present invention, such that the above-recited components, steps, blocks, operations, messages, requests, queries, and/or instructions are differently arranged sequenced, sub-divided, organized, and/or combined. In some embodiments, a different component may initiate or execute a given operation. For example, in some embodiments, a storage manager comprises the functionality of ISCSI server 301 described herein.
Some example enumerated embodiments of the present invention are recited in this section in the form of methods, systems, and non-transitory computer-readable media, without limitation.
According to an embodiment of the present invention, a system for providing private writable snapshots to user computing devices, the system comprising: a first computing device comprising an Internet Small Computer Systems Interface (ISCSI) service; a second computing device in communication with the first computing device via ISCSI protocol; and wherein the first computing device using the ISCSI service is configured to: receive from the second computing device a first unique ID and a first request for a first private writable snapshot of a first volume, if the first request is the first time system-wide that a private writable snapshot has been requested for the first volume, generate a first snapshot of the first volume, from the first snapshot, generate a sparse file designated a master sparse file which corresponds to the snapshot, generate a master bitmap associated with the master sparse file, wherein the master bitmap tracks block-level activity in the master sparse file, from the master sparse file, generate a private sparse file having the first unique ID, generate a private bitmap associated with the private sparse file, wherein the private bitmap tracks block-level activity in the private sparse file, present the private sparse file as a logical unit number (LUN) to the second computing device; and wherein the second computing device is configured to mount the LUN, thereby acquiring access to the private sparse file, which is based on the first snapshot and the master sparse file, and incorporates changes generated by the second computing device that are written to the private sparse file without changing the first snapshot, thereby operating as the first private writable snapshot requested by the second computing device.
The above-recited system wherein the first computing device is further configured to store the first snapshot, the master sparse file, and the private sparse file. The above-recited system wherein the second computing device has access to the private writable snapshot as provided by the ISCSI service on the first computing device, without a pseudo-disk driver installed on the second computing device. The above-recited system wherein the master bitmap tracks which data blocks are present in the master sparse file, including data blocks copied therein from the first snapshot; and wherein the private bitmap tracks which data blocks are present in the private sparse file, including data blocks copied therein from the master sparse file and data blocks written therein by the second computing device. The above-recited system wherein the first computing device is further configured to: receive from the second computing device a first read request for a first data block in the LUN, check the private bitmap to determine whether the first data block is in the private sparse file, and if the private bitmap so indicates, serve the first data block from the private sparse file to the second computing device in response to the first read request, if the private bitmap indicates that the first data block is not in the private sparse file, check the master bitmap to determine whether the first data block is in the master sparse file, and if the master bitmap so indicates, serve the first data block from the master sparse file to the second computing device in response to the first read request. The above-recited system further comprising: if the private bitmap indicates that the first data block is not in the private sparse file and the master bitmap indicates that the first data block is not in the master sparse file, copy the first data block from the first snapshot to the master sparse file and update the master bitmap to indicate that the first data block is in the master sparse file. The above-recited system wherein the first computing device is further configured to: receive from the second computing device a first write request to write a first data block to the LUN, check the private bitmap to determine whether the private sparse file comprises a corresponding data block, and if the private bitmap so indicates, write the first data block as received from the second computing device to the private sparse file, thereby overwriting the corresponding data block. The above-recited system further comprising: if the private bitmap indicates that the private sparse file lacks the corresponding data block, check the master bitmap to determine whether the master sparse file comprises the corresponding data block, and if the private bitmap so indicates, copy the corresponding data block from the master sparse file to the private sparse file and update the private bitmap to indicate that the private sparse file comprises the corresponding data block. The above-recited system wherein the first computing device is further configured to: receive from the second computing device a request to delete the private sparse file, and delete the private sparse file and the private bitmap associated therewith without changing or deleting the master sparse file, the master bitmap, or the first snapshot. The above-recited system wherein the private sparse file operates as a private writable snapshot for the second computing device without changing the first snapshot. The above-recited system wherein the second computing device is configured to, by mounting the LUN, access the private sparse file for browsing data blocks obtained from the first volume and further for implementing changes to the data blocks obtained from the first volume without changing the first snapshot. The above-recited system further comprising: a third computing device in communication with the first computing device via ISCSI protocol; and wherein the first computing device using the ISCSI service is further configured to: receive from the third computing device a second unique ID and a second request for a second private writable snapshot of the first volume, from the master sparse file, generate a second private sparse file having the second unique ID, generate a second private bitmap associated with the second private sparse file, wherein the second private bitmap tracks block-level activity in the second private sparse file, present the second private sparse file as a second logical unit number (LUN) to the third computing device; and wherein the third computing device is configured to mount the second LUN, thereby acquiring access to the second private sparse file, which is based on the first snapshot and the master sparse file, and incorporates changes generated by the third computing device that are written to the second private sparse file without changing the first snapshot or the first private writable snapshot, and thereby operating as the second private writable snapshot, which is independent of the first private writable snapshot. The above-recited system wherein any number of second private writable snapshots are created with respect to any number of third computing devices and operate independently of each other and independently of the first private writable snapshot. The above-recited system wherein the first computing device using the ISCSI service is further configured to: receive from the second computing device a second unique ID and a second request for a second private writable snapshot of the first volume, from the master sparse file, generate a second private sparse file having the second unique ID, generate a second private bitmap associated with the second private sparse file, wherein the second private bitmap tracks block-level activity in the second private sparse file, present the second private sparse file as a second logical unit number (LUN) to the second computing device; and wherein the second computing device is configured to mount the second LUN, thereby acquiring access to the second private sparse file, which is based on the first snapshot and the master sparse file, and incorporates changes generated by the second computing device that are written to the second private sparse file without changing the first snapshot or the first private writable snapshot, and thereby operating as the second private writable snapshot, which is independent of the first private writable snapshot. The above-recited system wherein any number of second private writable snapshots are created and operate independently of each other and independently of the first private writable snapshot.
According to another embodiment, a system for providing private writable snapshots to user computing devices, the system comprising: a first computing device comprising an Internet Small Computer Systems Interface (ISCSI) service; a second computing device in communication with the first computing device via ISCSI protocol; and wherein the first computing device using the ISCSI service is configured to: receive from the second computing device a first unique ID and a first request for a first private writable snapshot of a first volume, if a first snapshot of the first volume was not previously created, generate a first snapshot of the first volume, from the first snapshot, generate a sparse file designated a master sparse file which corresponds to the snapshot, from the master sparse file, generate a private sparse file having the first unique ID, present the private sparse file as a logical unit number (LUN) to the second computing device; and wherein the second computing device is configured to, by mounting the LUN, access the private sparse file for browsing data blocks obtained from the first volume and further for implementing changes to the data blocks obtained from the first volume without changing the first snapshot.
The above-recited system wherein the first computing device is further configured to: generate a master bitmap associated with the master sparse file, wherein the master bitmap tracks which data blocks are present in the master sparse file, and generate a private bitmap associated with the private sparse file, wherein the private bitmap tracks which data blocks are present in the private sparse file. The above-recited system wherein the first computing device is further configured to: generate a master bitmap associated with the master sparse file, wherein the master bitmap tracks which data blocks are present in the master sparse file, including data blocks copied therein from the first snapshot, and generate a private bitmap associated with the private sparse file, wherein the private bitmap tracks which data blocks are present in the private sparse file, including data blocks copied therein from the master sparse file and data blocks written therein by the second computing device. The above-recited system wherein the first computing device is further configured to store the first snapshot, the master sparse file, and the private sparse file. The above-recited system wherein the first computing device is further configured to: receive from the second computing device a first read request for a first data block in the LUN, check a private bitmap associated with the private sparse file to determine whether the first data block is present in the private sparse file, and if the private bitmap so indicates, serve the first data block from the private sparse file to the second computing device in response to the first read request, if the private bitmap indicates that the first data block is not present in the private sparse file, check a master bitmap associated with the master sparse file to determine whether the first data block is present in the master sparse file, and if the master bitmap so indicates, serve the first data block from the master sparse file to the second computing device in response to the first read request. The above-recited system further comprising: if the private bitmap indicates that the first data block is not present in the private sparse file and the master bitmap indicates that the first data block is not present in the master sparse file, copy the first data block from the first snapshot to the master sparse file and update the master bitmap to indicate that the first data block is present in the master sparse file. The above-recited system wherein the first computing device is further configured to: receive from the second computing device a first write request to write a first data block to the LUN, check a private bitmap associated with the private sparse file to determine whether the private sparse file comprises a corresponding data block, and if the private bitmap so indicates, write the first data block as received from the second computing device to the private sparse file, thereby overwriting the corresponding data block, and if the private bitmap indicates that the private sparse file lacks the corresponding data block, check a master bitmap associated with the master sparse file to determine whether the master sparse file comprises the corresponding data block, and if the private bitmap so indicates, copy the corresponding data block from the master sparse file to the private sparse file and update the private bitmap to indicate that the private sparse file comprises the corresponding data block. The above-recited system wherein the private sparse file is based on the first snapshot and the master sparse file, and incorporates changes generated by the second computing device that are written to the private sparse file without changing the first snapshot, thereby becoming a private writable snapshot.
According to yet another illustrative embodiment, a method for providing private writable snapshots to user computing devices, the method comprising: receiving, by a first computing device that executes an Internet Small Computer Systems Interface (ISCSI) service, from a second computing device in communication with the first computing device via ISCSI protocol, a first unique ID and a first request for a first private writable snapshot of a first volume; if a first snapshot of the first volume was not previously created, generating by the first computing device a first snapshot of the first volume; from the first snapshot, generating by the first computing device a sparse file designated a master sparse file which corresponds to the first snapshot; from the master sparse file, generating by the first computing device a private sparse file having the first unique ID received from the second computing device; presenting by the first computing device the private sparse file as a logical unit number (LUN) to the second computing device; and mounting the LUN by the second computing device, thereby acquiring access to the private sparse file for browsing data blocks obtained from the first volume and further for implementing changes to the data blocks obtained from the first volume without changing the first snapshot, and wherein the private sparse file is based on the first snapshot and the master sparse file, and incorporates changes generated by the second computing device that are written to the private sparse file, thereby becoming a private writable snapshot.
The above-recited method further comprising: generating by the first computing device a master bitmap associated with the master sparse file, wherein the master bitmap tracks which data blocks are present in the master sparse file, and generating by the first computing device a private bitmap associated with the private sparse file, wherein the private bitmap tracks which data blocks are present in the private sparse file. The above-recited method further comprising: generating by the first computing device a master bitmap associated with the master sparse file, wherein the master bitmap tracks which data blocks are present in the master sparse file, including data blocks copied therein from the first snapshot, and generating by the first computing device a private bitmap associated with the private sparse file, wherein the private bitmap tracks which data blocks are present in the private sparse file, including data blocks copied therein from the master sparse file and data blocks written therein by the second computing device. The above-recited method wherein the first computing device stores the first snapshot, the master sparse file, and the private sparse file. The above-recited method further comprising: receiving by the first computing device from the second computing device a first read request for a first data block in the LUN, checking by the first computing device a private bitmap associated with the private sparse file to determine whether the first data block is present in the private sparse file, and if the private bitmap so indicates, serving the first data block from the private sparse file to the second computing device in response to the first read request, if the private bitmap indicates that the first data block is not present in the private sparse file, checking by the first computing device a master bitmap associated with the master sparse file to determine whether the first data block is present in the master sparse file, and if the master bitmap so indicates, serving the first data block from the master sparse file to the second computing device in response to the first read request. The above-recited method further comprising: if the private bitmap indicates that the first data block is not present in the private sparse file and the master bitmap indicates that the first data block is not present in the master sparse file, copying by the first computing device the first data block from the first snapshot to the master sparse file and update the master bitmap to indicate that the first data block is present in the master sparse file. The above-recited method further comprising: receiving by the first computing device from the second computing device a first write request to write a first data block to the LUN; checking by the first computing device a private bitmap associated with the private sparse file to determine whether the private sparse file comprises a corresponding data block, and if the private bitmap so indicates, writing the first data block as received from the second computing device to the private sparse file, thereby overwriting the corresponding data block, and if the private bitmap indicates that the private sparse file lacks the corresponding data block, checking a master bitmap associated with the master sparse file to determine whether the master sparse file comprises the corresponding data block, and if the private bitmap so indicates, copying the corresponding data block from the master sparse file to the private sparse file and updating the private bitmap to indicate that the private sparse file comprises the corresponding data block.
According to one more illustrative embodiment, a computer-readable medium, excluding transitory propagating signals, storing instructions that, when executed by at least one computing device comprising one or more processors and computer memory, cause the computing device to perform operations comprising: receiving from a second computing device via ISCSI protocol, a first unique ID and a first request for a first private writable snapshot of a first volume; if a first snapshot of the first volume was not previously created, generating a first snapshot of the first volume; from the first snapshot, generating a sparse file designated a master sparse file which corresponds to the first snapshot; from the master sparse file, generating a private sparse file having the first unique ID received from the second computing device; presenting by the first computing device the private sparse file as a logical unit number (LUN) to the second computing device, to be mounted thereby as a LUN, thereby granting the first computing access to the private sparse file as the first private writable snapshot. The above-recited computer-readable medium wherein the operations further comprise: receiving from the second computing device a first read request for a first data block in the LUN; checking a private bitmap associated with the private sparse file to determine whether the first data block is present in the private sparse file, and if the private bitmap so indicates, serving the first data block from the private sparse file to the second computing device in response to the first read request; if the private bitmap indicates that the first data block is not present in the private sparse file, checking a master bitmap associated with the master sparse file to determine whether the first data block is present in the master sparse file, and if the master bitmap so indicates, serving the first data block from the master sparse file to the second computing device in response to the first read request. The above-recited computer-readable medium wherein if the private bitmap indicates that the first data block is not present in the private sparse file and the master bitmap indicates that the first data block is not present in the master sparse file, copying the first data block from the first snapshot to the master sparse file and updating the master bitmap to indicate that the first data block is present in the master sparse file. The above-recited computer-readable medium wherein the operations further comprise: receiving from the second computing device a first write request to write a first data block to the LUN; checking a private bitmap associated with the private sparse file to determine whether the private sparse file comprises a corresponding data block, and if the private bitmap so indicates, writing the first data block as received from the second computing device to the private sparse file, thereby overwriting the corresponding data block, and if the private bitmap indicates that the private sparse file lacks the corresponding data block, checking a master bitmap associated with the master sparse file to determine whether the master sparse file comprises the corresponding data block, and if the private bitmap so indicates, copying the corresponding data block from the master sparse file to the private sparse file and updating the private bitmap to indicate that the private sparse file comprises the corresponding data block.
According to an example embodiment of the present invention a system for providing private writable backup copies to user computing devices, the system comprising: a first computing device comprising an Internet Small Computer Systems Interface (ISCSI) service; a data storage device in communication with the first computing device and comprising a block-level backup copy of data; a second computing device in communication with the first computing device via ISCSI protocol; and wherein the first computing device using the ISCSI service is configured to: receive from the second computing device a first unique ID and a first request for a first private writable backup copy of the block-level backup copy of data, if the first request is the first time system-wide that a private writable backup copy has been requested for the block-level backup copy of data, generate a first directory designated an archive store which corresponds to the block-level backup copy of data, generate a second directory designated a private store having the first unique ID, present the private store directory as a logical unit number (LUN) to the second computing device; and wherein the second computing device is configured to mount the LUN, thereby acquiring access to the private store, which is based on the archive store and the block-level backup copy of data, and incorporates changes generated by the second computing device that are written to the private store without changing the block-level backup copy of data, thereby operating as the first private writable backup copy requested by the second computing device.
The above-recited system wherein the first computing device is further configured to store the archive store and the private store and to serve data therefrom to the second computing device. The above-recited system wherein the first computing device is further configured to: receive from the second computing device a first read request for a first data extent in the LUN, check the private store to determine whether the first data extent is represented by a first extent-file in the private store, and if so, serve the first data extent from the first extent-file in the private store to the second computing device in response to the first read request, if the private store lacks the first extent-file, check to determine whether the first extent-file is present in the archive store, and if so, serve the first data extent from the first extent-file in the archive store to the second computing device in response to the first read request. The above-recited system further comprising: if the private store lacks the first extent-file and the archive store also lacks the first extent-file, restoring the first data extent from the block-level backup copy of data in the storage device to a corresponding extent-file stored to the archive store, wherein the restoring is performed by a media agent that also executes on the first computing device. The above-recited system wherein the first computing device is further configured to: receive from the second computing device a first write request to write a first data extent to the LUN, check whether the private store comprises a corresponding extent-file for the first data extent, and if so, write the first data extent as received from the second computing device to the private store, thereby overwriting the corresponding extent-file, and if the private store lacks the corresponding extent-file for the first data extent, check whether the archive store comprises the corresponding extent-file, and if so, copy the corresponding extent-file from the archive store to the private store. The above-recited system wherein the first computing device is further configured to: receive from the second computing device a request to delete the private writable backup copy, and in response, delete the private store without changing or deleting the archive store, and further without changing the block-level backup copy of data. The above-recited system wherein the second computing device is configured to, by mounting the LUN, access the private store for browsing data extents obtained from the block-level backup copy of data and further for implementing changes to the data extents obtained from the block-level backup copy of data without changing the block-level backup copy of data. The above-recited system further comprising: a third computing device in communication with the first computing device via ISCSI protocol; and wherein the first computing device using the ISCSI service is further configured to: receive from the third computing device a second unique ID and a second request for a second private writable backup copy of the block-level backup copy of data, generate a second private store having the second unique ID, present the second private store as a second logical unit number (LUN) to the third computing device; and wherein the third computing device is configured to mount the second LUN, thereby acquiring access to the second private store, which is based on the archive store and the block-level backup copy of data, and incorporates changes generated by the third computing device that are written to the second private store without changing the block-level backup copy of data, thereby operating as the second private writable backup copy requested by the third computing device. The above-recited system wherein any number of second private writable backup copies are created with respect to any number of third computing devices and operate independently of each other and independently of the first private writable backup copy. The above-recited system wherein the first computing device using the ISCSI service is further configured to: receive from the second computing device a second unique ID and a second request for a second private writable backup copy of the block-level backup copy of data, generate a second private store having the second unique ID, present the second private store as a second logical unit number (LUN) to the second computing device; and wherein the second computing device is configured to mount the LUN, thereby acquiring access to the second private store, which is based on the archive store and the block-level backup copy of data, and incorporates changes generated by the second computing device that are written to the second private store without changing the block-level backup copy of data, thereby operating as the second private writable backup copy requested by the second computing device, and independent of the first private writable backup copy of data also accessed by the second computing device. The above-recited system wherein any number of second private writable backup copies are created and operate independently of each other and independently of the first private writable backup copy.
According to another example embodiment a system for providing private writable backup copies to user computing devices, the system comprising: a first computing device comprising an Internet Small Computer Systems Interface (ISCSI) service; a second computing device in communication with the first computing device via ISCSI protocol; and wherein the first computing device using the ISCSI service is configured to: receive from the second computing device a first unique ID and a first request for a first private writable backup copy of a block-level backup copy of data, which is stored on a data storage device in communication with the first computing device, if an archive store directory corresponding to the block-level backup copy of data was not previously created at the first computing device, generate the archive store directory corresponding to the block-level backup copy of data, generate a private store directory having the first unique ID, present the private store directory as a logical unit number (LUN) to the second computing device; and wherein the second computing device is configured to, by mounting the LUN, access the private store directory as the request first private writable backup copy for browsing data extents restored from the block-level backup copy of data and further for implementing changes to the data extents restored from the block-level backup copy of data without changing the block-level backup copy of data. The above-recited system wherein the archive store directory stored extent-files that represent corresponding data extents restored from the block-level backup copy by a media agent that also executes on the first computing device. The above-recited system wherein the archive store directory stored extent-files that represent corresponding data extents restored from the block-level backup copy by a media agent that also executes on the first computing device; and wherein the private store receives extent-files from the archive store when the second computing device submits a write request for a data extent that lacks a corresponding extent-file in the private store directory. The above-recited system wherein the first computing device is further configured to store the archive store directory and the private store directory. The above-recited system wherein the first computing device is further configured to: receive from the second computing device a first read request for a first data extent in the LUN, check the private store to determine whether the first data extent is represented by a first extent-file in the private store, and if so, serve the first data extent from the first extent-file in the private store to the second computing device in response to the first read request, if the private store lacks the first extent-file, check to determine whether the first extent-file is present in the archive store, and if so, serve the first data extent from the first extent-file in the archive store to the second computing device in response to the first read request. The above-recited system further comprising: if the private store lacks the first extent-file and the archive store also lacks the first extent-file, restoring the first data extent from the block-level backup copy of data in the storage device to a corresponding extent-file stored to the archive store, wherein the restoring is performed by a media agent that also executes on the first computing device. The above-recited system wherein the first computing device is further configured to: receive from the second computing device a first write request to write a first data extent to the LUN, check whether the private store comprises a corresponding extent-file for the first data extent, and if so, write the first data extent as received from the second computing device to the private store, thereby overwriting the corresponding extent-file, and if the private store lacks the corresponding extent-file for the first data extent, check whether the archive store comprises the corresponding extent-file, and if so, copy the corresponding extent-file from the archive store to the private store. The above-recited system wherein the first computing device is further configured to: receive from the second computing device a request to delete the private writable backup copy, and in response, delete the private store without changing or deleting the archive store, and further without changing the block-level backup copy of data. The above-recited system wherein the second computing device is configured to, by mounting the LUN, access the private store for browsing data extents obtained from the block-level backup copy of data and further for implementing changes to the data extents obtained from the block-level backup copy of data without changing the block-level backup copy of data. The above-recited system further comprising: a third computing device in communication with the first computing device via ISCSI protocol; and wherein the first computing device using the ISCSI service is further configured to: receive from the third computing device a second unique ID and a second request for a second private writable backup copy of the block-level backup copy of data, generate a second private store having the second unique ID, present the second private store as a second logical unit number (LUN) to the third computing device; and wherein the third computing device is configured to mount the second LUN, thereby acquiring access to the second private store, which is based on the archive store and the block-level backup copy of data, and incorporates changes generated by the third computing device that are written to the second private store without changing the block-level backup copy of data, thereby operating as the second private writable backup copy requested by the third computing device. The above-recited system wherein any number of second private writable backup copies are created with respect to any number of third computing devices and operate independently of each other and independently of the first private writable backup copy. The above-recited system further comprising: wherein the first computing device using the ISCSI service is further configured to: receive from the second computing device a second unique ID and a second request for a second private writable backup copy of the block-level backup copy of data, generate a second private store having the second unique ID, present the second private store as a second logical unit number (LUN) to the second computing device; and wherein the second computing device is configured to mount the LUN, thereby acquiring access to the second private store, which is based on the archive store and the block-level backup copy of data, and incorporates changes generated by the second computing device that are written to the second private store without changing the block-level backup copy of data, thereby operating as the second private writable backup copy requested by the second computing device, and independent of the first private writable backup copy of data also accessed by the second computing device. The above-recited system wherein any number of second private writable backup copies are created and operate independently of each other and independently of the first private writable backup copy.
According to yet another example embodiment, a method for providing private writable backup copies to user computing devices, the method comprising: receiving, by a first computing device that executes an Internet Small Computer Systems Interface (ISCSI) service and a media agent in communication with a data storage device, from a second computing device in communication with the first computing device via ISCSI protocol, a first unique ID and a first request for a first private writable backup copy of a block-level backup copy of data in the data storage device; if an archive store directory corresponding to the block-level backup copy of data was not previously created, generating by the first computing device the archive store directory corresponding to the block-level backup copy of data; generating by the first computing device a private store directory having the first unique ID received from the second computing device; presenting by the first computing device the private sparse file as a logical unit number (LUN) to the second computing device; and mounting the LUN by the second computing device, thereby acquiring access to the private store directory operating as the requested private writable backup copy for browsing data extents obtained from the block-level backup copy of data and further for implementing changes to the data extents obtained from the block-level backup copy of data without changing the block-level backup copy of data, and wherein the private store directory is based on the archive store directory, and incorporates changes generated by the second computing device.
The above-recited method wherein the first computing device stores the archive store directory and the private store directory. The above-recited method further comprising: receiving by the first computing device from the second computing device a first read request for a first data extent in the LUN, checking by the first computing device whether the first data extent is represented by a first extent-file in the private store directory, and if so, serving the first data extent from the first extent-file in the private store directory to the second computing device in response to the first read request, if the private bitmap indicates that the first extent-file is not present in the private store directory, checking by the first computing device whether the first extent-file is present in the archive store directory, and if so, serving the first data extent from the first extent-file in the archive store directory to the second computing device in response to the first read request. The above-recited method further comprising: if the first extent-file is not present in the private store directory and is also not present in the archive store directory, restoring by the media agent executing on the first computing device the first data extent from the first snapshot to the first extent-file stored to the archive store directory. The above-recited method further comprising: receiving by the first computing device from the second computing device a first write request to write a first data extent to the LUN; checking by the first computing device whether the private store comprises a corresponding extent-file for the first data extent, and if so, write the first data extent as received from the second computing device to the private store, thereby overwriting the corresponding extent-file, and if the private store lacks the corresponding extent-file for the first data extent, check whether the archive store comprises the corresponding extent-file, and if so, copy the corresponding extent-file from the archive store to the private store.
According to one more example embodiment, a computer-readable medium, excluding transitory propagating signals, storing instructions that, when executed by at least one computing device comprising one or more processors and computer memory, cause the computing device to perform operations comprising: Executing an Internet Small Computer Systems Interface (ISCSI) service and a media agent in communication with a data storage device, Receiving from a second computing device in communication with the first computing device via ISCSI protocol, a first unique ID and a first request for a first private writable backup copy of a block-level backup copy of data stored in a data storage device in communication with the media agent; if an archive store directory corresponding to the block-level backup copy of data was not previously created, generating the archive store directory corresponding to the block-level backup copy of data; generating a private store directory having the first unique ID received from the second computing device; presenting the private sparse file as a logical unit number (LUN) to the second computing device, thereby granting the second computing device access to the private store directory operating as the requested private writable backup copy for browsing data extents obtained from the block-level backup copy of data and further for implementing changes to the data extents obtained from the block-level backup copy of data without changing the block-level backup copy of data, and wherein the private store directory is based on the archive store directory, and incorporates changes generated by the second computing device. The above-recited computer-readable wherein the first computing device stores the archive store directory and the private store directory. The above-recited computer-readable media wherein the operations further comprise: receiving from the second computing device a first read request for a first data extent in the LUN, checking whether the first data extent is represented by a first extent-file in the private store directory, and if so, serving the first data extent from the first extent-file in the private store directory to the second computing device in response to the first read request, if the private bitmap indicates that the first extent-file is not present in the private store directory, checking whether the first extent-file is present in the archive store directory, and if so, serving the first data extent from the first extent-file in the archive store directory to the second computing device in response to the first read request. The above-recited computer-readable media further comprising: if the first extent-file is not present in the private store directory and is also not present in the archive store directory, restoring by the media agent executing on the first computing device the first data extent from the first snapshot to the first extent-file stored to the archive store directory. The above-recited computer-readable media wherein the operations further comprise: receiving from the second computing device a first write request to write a first data extent to the LUN; checking whether the private store comprises a corresponding extent-file for the first data extent, and if so, write the first data extent as received from the second computing device to the private store, thereby overwriting the corresponding extent-file, and if the private store lacks the corresponding extent-file for the first data extent, checking whether the archive store comprises the corresponding extent-file, and if so, copying the corresponding extent-file from the archive store to the private store, thereby causing the requested private writable backup copy to differ from the block-level backup copy of data upon which the private writable backup copy is based.
In other embodiments, a system or systems may operate according to one or more of the methods and/or computer-readable media recited in the preceding paragraphs. In yet other embodiments, a method or methods may operate according to one or more of the systems and/or computer-readable media recited in the preceding paragraphs. In yet more embodiments, a computer-readable medium or media, excluding transitory propagating signals, may cause one or more computing devices having one or more processors and non-transitory computer-readable memory to operate according to one or more of the systems and/or methods recited in the preceding paragraphs.
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, i.e., 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 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.
In some embodiments, 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). 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. 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 computer 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, processing of the various components of the illustrated systems can be distributed across multiple machines, networks, and other computing resources. 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, e.g., 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 to a computing device or other programmable data processing apparatus to cause 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 computing device 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 other 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. 15/981,770 filed on May 16, 2018 with the title of “BLOCK-LEVEL LIVE BROWSING AND PRIVATE WRITABLE SNAPSHOTS USING AN ISCSI SERVER”, which claims priority to U.S. Provisional Patent Application Ser. No. 62/630,698 filed on Feb. 14, 2018 with the title of “Block-Level Live Browse Using ISCSI without a Pseudo-Disk Driver,” where are hereby incorporated by reference herein in their entireties. Any and all applications for which a foreign or domestic priority claim is identified in the Application Data Sheet of the present application are hereby incorporated by reference in their entireties under 37 CFR 1.57.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4296465 | Lemak | Oct 1981 | A |
| 4686620 | Ng | Aug 1987 | 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 |
| 5263154 | Eastridge et al. | Nov 1993 | A |
| 5265159 | Kung | Nov 1993 | A |
| 5276860 | Fortier et al. | Jan 1994 | A |
| 5276867 | Kenley et al. | Jan 1994 | A |
| 5287500 | Stoppani, Jr. | Feb 1994 | A |
| 5301351 | Jippo | Apr 1994 | A |
| 5311509 | Heddes et al. | May 1994 | A |
| 5317731 | Dias et al. | May 1994 | A |
| 5321816 | Rogan et al. | Jun 1994 | A |
| 5333315 | Saether et al. | Jul 1994 | A |
| 5347653 | Flynn et al. | Sep 1994 | A |
| 5369757 | Spiro et al. | Nov 1994 | A |
| 5403639 | Belsan et al. | Apr 1995 | A |
| 5410700 | Fecteau et al. | Apr 1995 | A |
| 5448724 | Hayashi et al. | Sep 1995 | A |
| 5455926 | Keele et al. | Oct 1995 | A |
| 5487072 | Kant | Jan 1996 | A |
| 5491810 | Allen | Feb 1996 | A |
| 5495607 | Pisello et al. | Feb 1996 | A |
| 5504873 | Martin et al. | Apr 1996 | A |
| 5544345 | Carpenter et al. | Aug 1996 | A |
| 5544347 | Yanai et al. | Aug 1996 | A |
| 5546536 | Davis et al. | Aug 1996 | A |
| 5555404 | Torbjornsen et al. | Sep 1996 | A |
| 5559957 | Balk | Sep 1996 | A |
| 5559991 | Kanfi | Sep 1996 | A |
| 5604862 | Midgely et al. | Feb 1997 | A |
| 5615392 | Harrison et al. | Mar 1997 | A |
| 5619644 | Crockett et al. | Apr 1997 | A |
| 5638509 | Dunphy et al. | Jun 1997 | A |
| 5642496 | Kanfi | Jun 1997 | A |
| 5673381 | Huai et al. | Sep 1997 | A |
| 5677900 | Nishida et al. | Oct 1997 | A |
| 5682513 | Candelaria et al. | Oct 1997 | A |
| 5687343 | Fecteau et al. | Nov 1997 | A |
| 5689706 | Rao et al. | Nov 1997 | A |
| 5699361 | Ding et al. | Dec 1997 | A |
| 5719786 | Nelson et al. | Feb 1998 | A |
| 5720026 | Uemura et al. | Feb 1998 | A |
| 5729743 | Squibb | Mar 1998 | A |
| 5737747 | Vishlitsky et al. | Apr 1998 | A |
| 5742792 | Yanai et al. | Apr 1998 | A |
| 5751997 | Kullick et al. | May 1998 | A |
| 5758359 | Saxon | May 1998 | A |
| 5761677 | Senator et al. | Jun 1998 | A |
| 5761734 | Pfeffer 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 |
| 5790114 | Geaghan et al. | Aug 1998 | A |
| 5790828 | Jost | Aug 1998 | A |
| 5805920 | Sprenkle et al. | Sep 1998 | A |
| 5812398 | Nielsen | Sep 1998 | A |
| 5813009 | Johnson et al. | Sep 1998 | A |
| 5813017 | Morris | Sep 1998 | A |
| 5819292 | Hitz et al. | Oct 1998 | A |
| 5829046 | Tzelnic et al. | Oct 1998 | A |
| 5835953 | Ohran | Nov 1998 | A |
| 5875478 | Blumenau | Feb 1999 | A |
| 5875481 | Ashton et al. | Feb 1999 | A |
| 5878408 | Van Huben et al. | Mar 1999 | A |
| 5887134 | Ebrahim | Mar 1999 | A |
| 5901327 | Ofek | May 1999 | A |
| 5907621 | Bachman et al. | May 1999 | A |
| 5907672 | Matze et al. | May 1999 | A |
| 5924102 | Perks | Jul 1999 | A |
| 5926836 | Blumenau | Jul 1999 | A |
| 5933104 | Kimura | Aug 1999 | A |
| 5933601 | Fanshier et al. | Aug 1999 | A |
| 5938135 | Sasaki et al. | Aug 1999 | A |
| 5950205 | Aviani, Jr. | Sep 1999 | A |
| 5956519 | Wise et al. | Sep 1999 | A |
| 5958005 | Thorne et al. | Sep 1999 | A |
| 5970233 | Liu et al. | Oct 1999 | A |
| 5970255 | Tran et al. | Oct 1999 | A |
| 5974563 | Beeler, Jr. | Oct 1999 | A |
| 5987478 | See et al. | Nov 1999 | A |
| 5991779 | Bejar | Nov 1999 | A |
| 5995091 | Near et al. | Nov 1999 | A |
| 6003089 | Shaffer et al. | Dec 1999 | A |
| 6009274 | Fletcher et al. | Dec 1999 | A |
| 6012090 | Chung et al. | Jan 2000 | A |
| 6021415 | Cannon et al. | Feb 2000 | A |
| 6021475 | Nguyen et al. | Feb 2000 | A |
| 6023710 | Steiner et al. | Feb 2000 | A |
| 6026414 | Anglin | Feb 2000 | A |
| 6049889 | Steely, Jr. et al. | Apr 2000 | A |
| 6052735 | Ulrich et al. | Apr 2000 | A |
| 6061692 | Thomas et al. | May 2000 | A |
| 6072490 | Bates et al. | Jun 2000 | A |
| 6076148 | Kedem et al. | Jun 2000 | A |
| 6094416 | Ying | Jul 2000 | A |
| 6105129 | Meier et al. | Aug 2000 | A |
| 6112239 | Kenner et al. | Aug 2000 | A |
| 6122668 | Teng et al. | Sep 2000 | A |
| 6131095 | Low et al. | Oct 2000 | A |
| 6131148 | West et al. | Oct 2000 | A |
| 6131190 | Sidwell | Oct 2000 | A |
| 6137864 | Yaker | Oct 2000 | A |
| 6148377 | Carter et al. | Nov 2000 | A |
| 6148412 | Cannon et al. | Nov 2000 | A |
| 6154787 | Urevig et al. | Nov 2000 | A |
| 6154852 | Amundson et al. | Nov 2000 | A |
| 6158044 | Tibbetts | Dec 2000 | A |
| 6161111 | Mutalik et al. | Dec 2000 | A |
| 6163856 | Dion et al. | Dec 2000 | A |
| 6167402 | Yeager | Dec 2000 | A |
| 6175829 | Li et al. | Jan 2001 | B1 |
| 6195695 | Cheston et al. | Feb 2001 | B1 |
| 6205450 | Kanome et al. | Mar 2001 | B1 |
| 6212512 | Barney et al. | Apr 2001 | B1 |
| 6212521 | Minami et al. | Apr 2001 | B1 |
| 6230164 | Rikieta et al. | May 2001 | B1 |
| 6260069 | Anglin | Jul 2001 | B1 |
| 6269431 | Dunham | Jul 2001 | B1 |
| 6275953 | Vahalia et al. | Aug 2001 | B1 |
| 6279078 | Sicola et al. | Aug 2001 | B1 |
| 6292783 | Rohler | Sep 2001 | B1 |
| 6301592 | Aoyama et al. | Oct 2001 | B1 |
| 6304880 | Kishi | Oct 2001 | B1 |
| 6311193 | Sekido 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 |
| 6350199 | Williams et al. | Feb 2002 | B1 |
| RE37601 | Eastridge et al. | Mar 2002 | E |
| 6353878 | Dunham | Mar 2002 | B1 |
| 6356801 | Goodman et al. | Mar 2002 | B1 |
| 6363464 | Mangione | Mar 2002 | B1 |
| 6366986 | St. Pierre et al. | Apr 2002 | B1 |
| 6366988 | Skiba et al. | Apr 2002 | B1 |
| 6374336 | Peters et al. | Apr 2002 | B1 |
| 6374363 | Wu et al. | Apr 2002 | B1 |
| 6389432 | Pothapragada et al. | May 2002 | B1 |
| 6397308 | Ofek et al. | May 2002 | B1 |
| 6418478 | Ignatius et al. | Jul 2002 | B1 |
| 6421711 | Blumenau et al. | Jul 2002 | B1 |
| 6434681 | Amangau | Aug 2002 | B1 |
| 6473775 | Kusters et al. | Oct 2002 | B1 |
| 6487561 | Ofek et al. | Nov 2002 | B1 |
| 6487644 | Huebsch et al. | Nov 2002 | B1 |
| 6487645 | Clark et al. | Nov 2002 | B1 |
| 6502205 | Yanai et al. | Dec 2002 | B1 |
| 6519679 | Devireddy et al. | Feb 2003 | B2 |
| 6538669 | Lagueux, Jr. et al. | Mar 2003 | B1 |
| 6539462 | Mikkelsen et al. | Mar 2003 | B1 |
| 6542909 | Tamer et al. | Apr 2003 | B1 |
| 6542972 | Ignatius et al. | Apr 2003 | B2 |
| 6557089 | Reed et al. | Apr 2003 | B1 |
| 6564228 | O'Connor | May 2003 | B1 |
| 6581143 | Gagne et al. | Jun 2003 | B2 |
| 6594744 | Humlicek et al. | Jul 2003 | B1 |
| 6604118 | Kleinman et al. | Aug 2003 | B2 |
| 6604149 | Deo et al. | Aug 2003 | B1 |
| 6606690 | Padovano | Aug 2003 | B2 |
| 6615223 | Shih et al. | Sep 2003 | B1 |
| 6631477 | LeCrone et al. | Oct 2003 | B1 |
| 6631493 | Ottesen et al. | Oct 2003 | B2 |
| 6643671 | Milillo et al. | Nov 2003 | B2 |
| 6647396 | Parnell et al. | Nov 2003 | B2 |
| 6647473 | Golds et al. | Nov 2003 | B1 |
| 6651075 | Kusters et al. | Nov 2003 | B1 |
| 6654825 | Clapp et al. | Nov 2003 | B2 |
| 6658436 | Oshinsky et al. | Dec 2003 | B2 |
| 6658526 | Nguyen et al. | Dec 2003 | B2 |
| 6662198 | Satyanarayanan et al. | Dec 2003 | B2 |
| 6665815 | Goldstein et al. | Dec 2003 | B1 |
| 6681230 | Blott et al. | Jan 2004 | B1 |
| 6721767 | De Meno et al. | Apr 2004 | B2 |
| 6728733 | Tokui | Apr 2004 | B2 |
| 6728736 | Hostetter et al. | Apr 2004 | B2 |
| 6732124 | Koseki et al. | May 2004 | B1 |
| 6732125 | Autrey et al. | May 2004 | B1 |
| 6742092 | Huebsch et al. | May 2004 | B1 |
| 6748504 | Sawdon et al. | Jun 2004 | B2 |
| 6751635 | Chen et al. | Jun 2004 | B1 |
| 6757794 | Cabrera et al. | Jun 2004 | B2 |
| 6760723 | Oshinsky et al. | Jul 2004 | B2 |
| 6763351 | Subramaniam et al. | Jul 2004 | B1 |
| 6789161 | Blendermann et al. | Sep 2004 | B1 |
| 6792518 | Armangau et al. | Sep 2004 | B2 |
| 6799258 | Linde | Sep 2004 | B1 |
| 6836779 | Poulin | Dec 2004 | B2 |
| 6871163 | Hiller et al. | Mar 2005 | B2 |
| 6871271 | Ohran et al. | Mar 2005 | B2 |
| 6877016 | Hart et al. | Apr 2005 | B1 |
| 6880051 | Timpanaro-Perrotta | Apr 2005 | B2 |
| 6886020 | Zahavi et al. | Apr 2005 | B1 |
| 6892211 | Hitz et al. | May 2005 | B2 |
| 6898688 | Martin et al. | May 2005 | B2 |
| 6912482 | Kaiser | Jun 2005 | B2 |
| 6920537 | Ofek et al. | Jul 2005 | B2 |
| 6925512 | Louzoun et al. | Aug 2005 | B2 |
| 6938135 | Kekre et al. | Aug 2005 | B1 |
| 6938180 | Dysert et al. | Aug 2005 | B1 |
| 6941393 | Secatch | Sep 2005 | B2 |
| 6944796 | Joshi et al. | Sep 2005 | B2 |
| 6948038 | Berkowitz et al. | Sep 2005 | B2 |
| 6948089 | Fujibayashi | Sep 2005 | B2 |
| 6952705 | Knoblock et al. | Oct 2005 | B2 |
| 6952758 | Chron et al. | Oct 2005 | B2 |
| 6954834 | Slater et al. | Oct 2005 | B2 |
| 6957362 | Armangau | Oct 2005 | B2 |
| 6968351 | Butterworth | Nov 2005 | B2 |
| 6973553 | Archibald, Jr. et al. | Dec 2005 | B1 |
| 6978265 | Schumacher | Dec 2005 | B2 |
| 6981114 | Wu et al. | Dec 2005 | B1 |
| 6981177 | Beattie | Dec 2005 | B2 |
| 6983351 | Gibble et al. | Jan 2006 | B2 |
| 6993539 | Federwisch et al. | Jan 2006 | B2 |
| 7003519 | Biettron et al. | Feb 2006 | B1 |
| 7003641 | Prahlad et al. | Feb 2006 | B2 |
| 7032131 | Lubbers et al. | Apr 2006 | B2 |
| 7035880 | Crescenti et al. | Apr 2006 | B1 |
| 7039661 | Ranade | May 2006 | B1 |
| 7051050 | Chen et al. | May 2006 | B2 |
| 7062761 | Slavin et al. | Jun 2006 | B2 |
| 7065538 | Aronoff et al. | Jun 2006 | B2 |
| 7072915 | Kaczmarski et al. | Jul 2006 | B2 |
| 7082441 | Zahavi et al. | Jul 2006 | B1 |
| 7085787 | Beier et al. | Aug 2006 | B2 |
| 7085904 | Mizuno et al. | Aug 2006 | B2 |
| 7086787 | Beier et al. | Aug 2006 | B2 |
| 7096315 | Takeda et al. | Aug 2006 | B2 |
| 7100089 | Phelps | Aug 2006 | B1 |
| 7103731 | Gibble et al. | Sep 2006 | B2 |
| 7103740 | Colgrove et al. | Sep 2006 | B1 |
| 7107298 | Prahlad et al. | Sep 2006 | B2 |
| 7107395 | Ofek et al. | Sep 2006 | B1 |
| 7111026 | Sato | Sep 2006 | B2 |
| 7120757 | Tsuge | Oct 2006 | B2 |
| 7130860 | Pachet | Oct 2006 | B2 |
| 7130970 | Devassy et al. | Oct 2006 | B2 |
| 7139887 | Colgrove et al. | Nov 2006 | B2 |
| 7139932 | Watanabe | Nov 2006 | B2 |
| 7155465 | Lee et al. | Dec 2006 | B2 |
| 7155633 | Tuma et al. | Dec 2006 | B2 |
| 7165079 | Chen et al. | Jan 2007 | B1 |
| 7174352 | Kleinman et al. | Feb 2007 | B2 |
| 7181477 | Saika et al. | Feb 2007 | B2 |
| 7188292 | Cordina et al. | Mar 2007 | B2 |
| 7191198 | Asano et al. | Mar 2007 | B2 |
| 7194454 | Hansen et al. | Mar 2007 | B2 |
| 7197665 | Goldstein et al. | Mar 2007 | B2 |
| 7203807 | Urabe et al. | Apr 2007 | B2 |
| 7209972 | Ignatius et al. | Apr 2007 | B1 |
| 7225204 | Manley et al. | May 2007 | B2 |
| 7225208 | Midgley et al. | May 2007 | B2 |
| 7225210 | Guthrie, II | May 2007 | B2 |
| 7228456 | Lecrone et al. | Jun 2007 | B2 |
| 7231544 | Tan et al. | Jun 2007 | B2 |
| 7234115 | Sprauve et al. | Jun 2007 | B1 |
| 7237075 | Welsh et al. | Jun 2007 | B2 |
| 7246140 | Therrien et al. | Jul 2007 | B2 |
| 7246207 | Kottomtharayil et al. | Jul 2007 | B2 |
| 7251713 | Zhang | Jul 2007 | B1 |
| 7257689 | Baird | Aug 2007 | B1 |
| 7202606 | Borthakur et al. | Sep 2007 | B2 |
| 7269612 | Devarakonda et al. | Sep 2007 | B2 |
| 7269641 | Powers et al. | Sep 2007 | B2 |
| 7272606 | Borthakur et al. | Sep 2007 | B2 |
| 7275138 | Saika | Sep 2007 | B2 |
| 7275177 | Amangau et al. | Sep 2007 | B2 |
| 7275277 | Moskovich et al. | Oct 2007 | B2 |
| 7278142 | Bandhole et al. | Oct 2007 | B2 |
| 7284104 | Wu et al. | Oct 2007 | B1 |
| 7287047 | Kavuri | Oct 2007 | B2 |
| 7293133 | Colgrove et al. | Nov 2007 | B1 |
| 7296125 | Ohran | Nov 2007 | B2 |
| 7315923 | Retnamma et al. | Jan 2008 | B2 |
| 7330997 | Odom | Feb 2008 | B1 |
| 7343356 | Prahlad et al. | Mar 2008 | B2 |
| 7343365 | Farnham et al. | Mar 2008 | B2 |
| 7343453 | Prahlad et al. | Mar 2008 | B2 |
| 7343459 | Prahlad et al. | Mar 2008 | B2 |
| 7346623 | Prahlad et al. | Mar 2008 | B2 |
| 7346751 | Prahlad et al. | Mar 2008 | B2 |
| 7356657 | Mikami | Apr 2008 | B2 |
| 7359917 | Winter et al. | Apr 2008 | B2 |
| 7370232 | Safford | May 2008 | B2 |
| 7373364 | Chapman | May 2008 | B1 |
| 7380072 | Kottomtharayil et al. | May 2008 | B2 |
| 7383538 | Bates et al. | Jun 2008 | B2 |
| 7389311 | Crescenti et al. | Jun 2008 | B1 |
| 7392360 | Aharoni et al. | Jun 2008 | B1 |
| 7395282 | Crescenti et al. | Jul 2008 | B1 |
| 7395387 | Berkowitz et al. | Jul 2008 | B2 |
| 7409509 | Devassy et al. | Aug 2008 | B2 |
| 7412583 | Burton et al. | Aug 2008 | B2 |
| 7415488 | Muth et al. | Aug 2008 | B1 |
| 7421554 | Colgrove et al. | Sep 2008 | B2 |
| 7430587 | Malone et al. | Sep 2008 | B2 |
| 7433301 | Akahane et al. | Oct 2008 | B2 |
| 7440982 | Lu et al. | Oct 2008 | B2 |
| 7454569 | Kavuri et al. | Nov 2008 | B2 |
| 7457982 | Rajan et al. | Nov 2008 | B2 |
| 7467167 | Patterson | Dec 2008 | B2 |
| 7467267 | Mayock | Dec 2008 | B1 |
| 7472238 | Gokhale | Dec 2008 | B1 |
| 7475284 | Koike | Jan 2009 | B2 |
| 7484054 | Kottomtharayil et al. | Jan 2009 | B2 |
| 7490207 | Amarendran | Feb 2009 | B2 |
| 7496589 | Jain et al. | Feb 2009 | B1 |
| 7496690 | Beverly et al. | Feb 2009 | B2 |
| 7500053 | Kavuri et al. | Mar 2009 | B1 |
| 7500150 | Sharma et al. | Mar 2009 | B2 |
| 7509316 | Greenblatt et al. | Mar 2009 | B2 |
| 7512601 | Cucerzan et al. | Mar 2009 | B2 |
| 7516088 | Johnson et al. | Apr 2009 | B2 |
| 7519726 | Palliyll et al. | Apr 2009 | B2 |
| 7523276 | Shankar | Apr 2009 | B1 |
| 7523483 | Dogan | Apr 2009 | B2 |
| 7529748 | Wen et al. | May 2009 | B2 |
| 7529782 | Prahlad et al. | May 2009 | B2 |
| 7529898 | Nguyen et al. | May 2009 | B2 |
| 7532340 | Koppich et al. | May 2009 | B2 |
| 7536291 | Vijayan Retnamma et al. | May 2009 | B1 |
| 7539707 | Prahlad et al. | May 2009 | B2 |
| 7539835 | Kaiser | May 2009 | B2 |
| 7543125 | Gokhale | Jun 2009 | B2 |
| 7546324 | Prahlad et al. | Jun 2009 | B2 |
| 7565572 | Yamasaki | Jul 2009 | B2 |
| 7567991 | Armangau et al. | Jul 2009 | B2 |
| 7568080 | Prahlad et al. | Jul 2009 | B2 |
| 7577806 | Rowan | Aug 2009 | B2 |
| 7581077 | Ignatius et al. | Aug 2009 | B2 |
| 7587563 | Teterin et al. | Sep 2009 | B1 |
| 7596586 | Gokhale et al. | Sep 2009 | B2 |
| 7606841 | Ranade | Oct 2009 | B1 |
| 7606844 | Kottomtharayil | Oct 2009 | B2 |
| 7606868 | Le et al. | Oct 2009 | B1 |
| 7610387 | Liskov et al. | Oct 2009 | B1 |
| 7613748 | Brockway et al. | Nov 2009 | B2 |
| 7613750 | Valiyaparambil et al. | Nov 2009 | B2 |
| 7617253 | Prahlad et al. | Nov 2009 | B2 |
| 7617262 | Prahlad et al. | Nov 2009 | B2 |
| 7617541 | Plotkin et al. | Nov 2009 | B2 |
| 7620666 | Root et al. | Nov 2009 | B1 |
| 7627598 | Burke | Dec 2009 | B1 |
| 7627617 | Kavuri et al. | Dec 2009 | B2 |
| 7636743 | Erofeev | Dec 2009 | B2 |
| 7651593 | Prahlad et al. | Jan 2010 | B2 |
| 7661028 | Erofeev | Feb 2010 | B2 |
| 7664771 | Kusters et al. | Feb 2010 | B2 |
| 7668798 | Scanlon et al. | Feb 2010 | B2 |
| 7669029 | Mishra et al. | Feb 2010 | B1 |
| 7672979 | Appellof et al. | Mar 2010 | B1 |
| 7685126 | Patel et al. | Mar 2010 | B2 |
| 7689467 | Belanger et al. | Mar 2010 | B1 |
| 7702533 | Barnard et al. | Apr 2010 | B2 |
| 7707184 | Zhang et al. | Apr 2010 | B1 |
| 7716171 | Kryger | May 2010 | B2 |
| 7734578 | Prahlad et al. | Jun 2010 | B2 |
| 7734669 | Kottomtharayil et al. | Jun 2010 | B2 |
| 7734715 | Hyakutake et al. | Jun 2010 | B2 |
| 7739235 | Rousseau et al. | Jun 2010 | B2 |
| 7747579 | Prahlad et al. | Jun 2010 | B2 |
| 7747660 | Rajan | Jun 2010 | B1 |
| 7810067 | Kaelicke et al. | Oct 2010 | B2 |
| 7831553 | Prahlad et al. | Nov 2010 | B2 |
| 7831622 | Prahlad et al. | Nov 2010 | B2 |
| 7840533 | Prahlad et al. | Nov 2010 | B2 |
| 7840537 | Gokhale et al. | Nov 2010 | B2 |
| 7844577 | Becker et al. | Nov 2010 | B2 |
| 7870355 | Erofeev | Jan 2011 | B2 |
| 7870356 | Veeraswamy | Jan 2011 | B1 |
| 7873806 | Prahlad et al. | Jan 2011 | B2 |
| 7930274 | Hwang et al. | Apr 2011 | B2 |
| 7930476 | Castelli et al. | Apr 2011 | B1 |
| 7962455 | Erofeev | Jun 2011 | B2 |
| 7962709 | Agrawal | Jun 2011 | B2 |
| 8024292 | Thompson et al. | Sep 2011 | B2 |
| 8024294 | Kottomtharayil | Sep 2011 | B2 |
| 8046334 | Hwang et al. | Oct 2011 | B2 |
| 8055625 | Prahlad et al. | Nov 2011 | B2 |
| 8060695 | Lee et al. | Nov 2011 | B1 |
| 8121983 | Prahlad et al. | Feb 2012 | B2 |
| 8156086 | Lu et al. | Apr 2012 | B2 |
| 8166263 | Prahlad | Apr 2012 | B2 |
| 8170995 | Prahlad et al. | May 2012 | B2 |
| 8190565 | Prahlad et al. | May 2012 | B2 |
| 8204859 | Ngo | Jun 2012 | B2 |
| 8205049 | Armangau et al. | Jun 2012 | B1 |
| 8219524 | Gokhale | Jul 2012 | B2 |
| 8229954 | Kottomtharayil et al. | Jul 2012 | B2 |
| 8230195 | Amarendran et al. | Jul 2012 | B2 |
| 8245128 | Ahad et al. | Aug 2012 | B1 |
| 8271830 | Erofeev | Sep 2012 | B2 |
| 8285681 | Prahlad et al. | Oct 2012 | B2 |
| 8307177 | Prahlad et al. | Nov 2012 | B2 |
| 8326803 | Stringham | Dec 2012 | B1 |
| 8346727 | Chester et al. | Jan 2013 | B1 |
| 8352422 | Prahlad et al. | Jan 2013 | B2 |
| 8356013 | Fachan et al. | Jan 2013 | B2 |
| 8364652 | Vijayan et al. | Jan 2013 | B2 |
| 8463751 | Kottomtharayil | Jun 2013 | B2 |
| 8489656 | Erofeev | Jul 2013 | B2 |
| 8490088 | Tang | Jul 2013 | B2 |
| 8510271 | Tsaur et al. | Aug 2013 | B1 |
| 8521694 | Natanzon | Aug 2013 | B1 |
| 8578120 | Attarde et al. | Nov 2013 | B2 |
| 8645320 | Prahlad et al. | Feb 2014 | B2 |
| 8656123 | Lee | Feb 2014 | B2 |
| 8719226 | Jiang et al. | May 2014 | B1 |
| 8725694 | Kottomtharayil | May 2014 | B2 |
| 8789208 | Sundaram et al. | Jul 2014 | B1 |
| 8856079 | Subramanian et al. | Oct 2014 | B1 |
| 8868494 | Agrawal | Oct 2014 | B2 |
| 8886595 | Prahlad et al. | Nov 2014 | B2 |
| 8930497 | Holmes et al. | Jan 2015 | B1 |
| 8954446 | Vijayan Retnamma et al. | Feb 2015 | B2 |
| 9002785 | Prahlad et al. | Apr 2015 | B2 |
| 9015121 | Salamon et al. | Apr 2015 | B1 |
| 9020900 | Vijayan Retnamma et al. | Apr 2015 | B2 |
| 9098495 | Gokhale | Aug 2015 | B2 |
| 9128901 | Nickurak et al. | Sep 2015 | B1 |
| 9208160 | Prahlad et al. | Dec 2015 | B2 |
| 9218252 | Revur et al. | Dec 2015 | B1 |
| 9239687 | Vijayan et al. | Jan 2016 | B2 |
| 9239840 | Acharya | Jan 2016 | B1 |
| 9251198 | Mutalik et al. | Feb 2016 | B2 |
| 9298715 | Kumarasamy et al. | Mar 2016 | B2 |
| 9342537 | Kumarasamy et al. | May 2016 | B2 |
| 9405631 | Prahlad et al. | Aug 2016 | B2 |
| 9448731 | Nallathambi et al. | Sep 2016 | B2 |
| 9471578 | Nallathambi et al. | Oct 2016 | B2 |
| 9495251 | Kottomtharayil et al. | Nov 2016 | B2 |
| 9535907 | Stringham | Jan 2017 | B1 |
| 9619172 | Natanzon et al. | Apr 2017 | B1 |
| 9619341 | Prahlad et al. | Apr 2017 | B2 |
| 9632874 | Pawar et al. | Apr 2017 | B2 |
| 9639426 | Pawar et al. | May 2017 | B2 |
| 9648105 | Nallathambi et al. | May 2017 | B2 |
| 9753812 | Pawar et al. | Sep 2017 | B2 |
| 9774672 | Nallathambi et al. | Sep 2017 | B2 |
| 9852026 | Mitkar et al. | Dec 2017 | B2 |
| 9886346 | Kumarasamy et al. | Feb 2018 | B2 |
| 9892123 | Kottomtharayil et al. | Feb 2018 | B2 |
| 9898371 | Kumarasamy et al. | Feb 2018 | B2 |
| 9921920 | Nallathambi et al. | Mar 2018 | B2 |
| 9928002 | Kumarasamy et al. | Mar 2018 | B2 |
| 9928146 | Nallathambi et al. | Mar 2018 | B2 |
| 9965306 | Natanzon et al. | May 2018 | B1 |
| 9996428 | Nallathambi et al. | Jun 2018 | B2 |
| 10042716 | Nallathambi et al. | Aug 2018 | B2 |
| 10044803 | Nallathambi et al. | Aug 2018 | B2 |
| 10223365 | Kottomtharayil et al. | Mar 2019 | B2 |
| 10228962 | Dornemann et al. | Mar 2019 | B2 |
| 10250679 | Natanzon et al. | Apr 2019 | B1 |
| 10419536 | Nallathambi et al. | Sep 2019 | B2 |
| 10503753 | Mitkar et al. | Dec 2019 | B2 |
| 10521308 | Nallathambi et al. | Dec 2019 | B2 |
| 10572444 | Kottomtharayil et al. | Feb 2020 | B2 |
| 10628266 | Nallathambi et al. | Apr 2020 | B2 |
| 10671484 | Pawar et al. | Jun 2020 | B2 |
| 10698632 | Kumarasamy et al. | Jun 2020 | B2 |
| 10732885 | Gutta et al. | Aug 2020 | B2 |
| 10740022 | Gutta et al. | Aug 2020 | B2 |
| 10798166 | Nallathambi et al. | Oct 2020 | B2 |
| 10853176 | Kumarasamy et al. | Dec 2020 | B2 |
| 10942894 | Kottomtharayil et al. | Mar 2021 | B2 |
| 11238064 | Mitkar et al. | Feb 2022 | B2 |
| 11269543 | Kumarasamy et al. | Mar 2022 | B2 |
| 20010027457 | Yee | Oct 2001 | A1 |
| 20010029512 | Oshinsky et al. | Oct 2001 | A1 |
| 20010029517 | De Meno et al. | Oct 2001 | A1 |
| 20010032172 | Moulinet et al. | Oct 2001 | A1 |
| 20010042222 | Kedem et al. | Nov 2001 | A1 |
| 20010044807 | Kleiman et al. | Nov 2001 | A1 |
| 20010044834 | Bradshaw et al. | Nov 2001 | A1 |
| 20020002557 | Straube et al. | Jan 2002 | A1 |
| 20020004883 | Nguyen et al. | Jan 2002 | A1 |
| 20020023051 | Kunzle et al. | Feb 2002 | A1 |
| 20020040376 | Yamanaka et al. | Apr 2002 | A1 |
| 20020042869 | Tate et al. | Apr 2002 | A1 |
| 20020049626 | Mathias et al. | Apr 2002 | A1 |
| 20020049718 | Kleiman et al. | Apr 2002 | A1 |
| 20020049738 | Epstein | Apr 2002 | A1 |
| 20020049778 | Bell et al. | Apr 2002 | A1 |
| 20020062230 | Morag et al. | May 2002 | A1 |
| 20020069324 | Gerasimov et al. | Jun 2002 | A1 |
| 20020073070 | Morita et al. | Jun 2002 | A1 |
| 20020083055 | Pachet et al. | Jun 2002 | A1 |
| 20020103848 | Giacomini et al. | Aug 2002 | A1 |
| 20020107877 | Whiting et al. | Aug 2002 | A1 |
| 20020112134 | Ohran et al. | Aug 2002 | A1 |
| 20020133511 | Hostetter | Sep 2002 | A1 |
| 20020133512 | Milillo et al. | Sep 2002 | A1 |
| 20020143903 | Uratani et al. | Oct 2002 | A1 |
| 20020152381 | Kuriya et al. | Oct 2002 | A1 |
| 20020161753 | Inaba et al. | Oct 2002 | A1 |
| 20020174107 | Poulin | Nov 2002 | A1 |
| 20020174416 | Bates et al. | Nov 2002 | A1 |
| 20030009431 | Souder et al. | Jan 2003 | A1 |
| 20030018657 | Monday | Jan 2003 | A1 |
| 20030028736 | Berkowitz et al. | Feb 2003 | A1 |
| 20030046270 | Leung et al. | Mar 2003 | A1 |
| 20030061456 | Ofek et al. | Mar 2003 | A1 |
| 20030061491 | Jaskiewicz et al. | Mar 2003 | A1 |
| 20030097296 | Putt | May 2003 | A1 |
| 20030131278 | Fujibayashi | Jul 2003 | A1 |
| 20030135783 | Martin et al. | Jul 2003 | A1 |
| 20030140070 | Kaczmarski et al. | Jul 2003 | A1 |
| 20030158834 | Sawdon et al. | Aug 2003 | A1 |
| 20030167380 | Green et al. | Sep 2003 | A1 |
| 20030177149 | Coombs | Sep 2003 | A1 |
| 20030177321 | Watanabe | Sep 2003 | A1 |
| 20030182313 | Federwisch et al. | Sep 2003 | A1 |
| 20030187847 | Lubbers et al. | Oct 2003 | A1 |
| 20030225800 | Kavuri | Dec 2003 | A1 |
| 20040002934 | Taulbee et al. | Jan 2004 | A1 |
| 20040010487 | Prahlad et al. | Jan 2004 | A1 |
| 20040015468 | Beier et al. | Jan 2004 | A1 |
| 20040039679 | Norton et al. | Feb 2004 | A1 |
| 20040098425 | Wiss et al. | May 2004 | A1 |
| 20040107199 | Dalrymple, III et al. | Jun 2004 | A1 |
| 20040117572 | Welsh et al. | Jun 2004 | A1 |
| 20040139128 | Becker et al. | Jul 2004 | A1 |
| 20040143642 | Beckmann et al. | Jul 2004 | A1 |
| 20040148376 | Rangan et al. | Jul 2004 | A1 |
| 20040167972 | Demmon | Aug 2004 | A1 |
| 20040193953 | Callahan et al. | Sep 2004 | A1 |
| 20040205206 | Naik et al. | Oct 2004 | A1 |
| 20040230829 | Dogan et al. | Nov 2004 | A1 |
| 20040236958 | Teicher et al. | Nov 2004 | A1 |
| 20040249883 | Srinivasan et al. | Dec 2004 | A1 |
| 20040250033 | Prahlad et al. | Dec 2004 | A1 |
| 20040254919 | Giuseppini | Dec 2004 | A1 |
| 20040260678 | Verbowski et al. | Dec 2004 | A1 |
| 20040267835 | Zwilling et al. | Dec 2004 | A1 |
| 20040267836 | Amangau et al. | Dec 2004 | A1 |
| 20050005070 | Lam | Jan 2005 | A1 |
| 20050027748 | Kisley | Feb 2005 | A1 |
| 20050027892 | McCabe et al. | Feb 2005 | A1 |
| 20050033800 | Kavuri et al. | Feb 2005 | A1 |
| 20050033878 | Pangal et al. | Feb 2005 | A1 |
| 20050060598 | Klotz et al. | Mar 2005 | A1 |
| 20050066118 | Perry et al. | Mar 2005 | A1 |
| 20050066222 | Rowan et al. | Mar 2005 | A1 |
| 20050066225 | Rowan et al. | Mar 2005 | A1 |
| 20050080928 | Beverly et al. | Apr 2005 | A1 |
| 20050086241 | Ram et al. | Apr 2005 | A1 |
| 20050108292 | Burton et al. | May 2005 | A1 |
| 20050138306 | Panchbudhe et al. | Jun 2005 | A1 |
| 20050144202 | Chen | Jun 2005 | A1 |
| 20050187982 | Sato | Aug 2005 | A1 |
| 20050187992 | Prahlad et al. | Aug 2005 | A1 |
| 20050188254 | Urabe et al. | Aug 2005 | A1 |
| 20050193026 | Prahlad et al. | Sep 2005 | A1 |
| 20050198083 | Saika et al. | Sep 2005 | A1 |
| 20050246376 | Lu et al. | Nov 2005 | A1 |
| 20050246397 | Edwards | Nov 2005 | A1 |
| 20050246510 | Retnamma et al. | Nov 2005 | A1 |
| 20060005048 | Osaki et al. | Jan 2006 | A1 |
| 20060010154 | Prahlad et al. | Jan 2006 | A1 |
| 20060010227 | Atluri | Jan 2006 | A1 |
| 20060020616 | Hardy et al. | Jan 2006 | A1 |
| 20060034454 | Damgaard et al. | Feb 2006 | A1 |
| 20060047805 | Byrd et al. | Mar 2006 | A1 |
| 20060120401 | Harada et al. | Jun 2006 | A1 |
| 20060129537 | Torii et al. | Jun 2006 | A1 |
| 20060136685 | Griv et al. | Jun 2006 | A1 |
| 20060136771 | Watanabe | Jun 2006 | A1 |
| 20060179261 | Rajan | Aug 2006 | A1 |
| 20060212671 | Todd | Sep 2006 | A1 |
| 20060224846 | Amarendran et al. | Oct 2006 | A1 |
| 20060242371 | Shono et al. | Oct 2006 | A1 |
| 20060242489 | Brockway et al. | Oct 2006 | A1 |
| 20070005915 | Thompson et al. | Jan 2007 | A1 |
| 20070006018 | Thompson et al. | Jan 2007 | A1 |
| 20070043956 | El Far et al. | Feb 2007 | A1 |
| 20070067263 | Husain et al. | Mar 2007 | A1 |
| 20070094467 | Yamasaki | Apr 2007 | A1 |
| 20070100867 | Celik et al. | May 2007 | A1 |
| 20070112897 | Asano et al. | May 2007 | A1 |
| 20070113006 | Elliott et al. | May 2007 | A1 |
| 20070115738 | Emaru | May 2007 | A1 |
| 20070124347 | Vivian et al. | May 2007 | A1 |
| 20070124348 | Claborn et al. | May 2007 | A1 |
| 20070143371 | Kottomtharayil | Jun 2007 | A1 |
| 20070143756 | Gokhale | Jun 2007 | A1 |
| 20070174569 | Schnapp et al. | Jul 2007 | A1 |
| 20070179990 | Zimran et al. | Aug 2007 | A1 |
| 20070183224 | Erofeev | Aug 2007 | A1 |
| 20070185937 | Prahlad et al. | Aug 2007 | A1 |
| 20070185938 | Prahlad et al. | Aug 2007 | A1 |
| 20070185939 | Prahlad et al. | Aug 2007 | A1 |
| 20070185940 | Prahlad et al. | Aug 2007 | A1 |
| 20070186068 | Agrawal | Aug 2007 | A1 |
| 20070198602 | Ngo et al. | Aug 2007 | A1 |
| 20070226438 | Erofeev | Sep 2007 | A1 |
| 20070244571 | Wilson et al. | Oct 2007 | A1 |
| 20070283111 | Berkowitz et al. | Dec 2007 | A1 |
| 20070288536 | Sen et al. | Dec 2007 | A1 |
| 20070288711 | Chen et al. | Dec 2007 | A1 |
| 20080016293 | Saika | Jan 2008 | A1 |
| 20080028009 | Ngo | Jan 2008 | A1 |
| 20080059515 | Fulton | Mar 2008 | A1 |
| 20080103916 | Camarador et al. | May 2008 | A1 |
| 20080183775 | Prahlad et al. | Jul 2008 | A1 |
| 20080209146 | Imazu et al. | Aug 2008 | A1 |
| 20080229037 | Bunte et al. | Sep 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 |
| 20080244177 | Crescent et al. | Oct 2008 | A1 |
| 20080244205 | Amano et al. | Oct 2008 | A1 |
| 20080306954 | Hornqvist | Dec 2008 | A1 |
| 20090044046 | Yamasaki | Feb 2009 | A1 |
| 20090070330 | Hwang et al. | Mar 2009 | A1 |
| 20090150462 | McClanahan et al. | Jun 2009 | A1 |
| 20090182963 | Prahlad et al. | Jul 2009 | A1 |
| 20090187944 | White et al. | Jul 2009 | A1 |
| 20090216816 | Basler et al. | Aug 2009 | A1 |
| 20090319534 | Gokhale | Dec 2009 | A1 |
| 20090319582 | Simek et al. | Dec 2009 | A1 |
| 20090319585 | Gokhale | Dec 2009 | A1 |
| 20100005259 | Prahlad | Jan 2010 | A1 |
| 20100011178 | Feathergill et al. | Jan 2010 | A1 |
| 20100023717 | Jinno | Jan 2010 | A1 |
| 20100036931 | Certain et al. | Feb 2010 | A1 |
| 20100049753 | Prahlad et al. | Feb 2010 | A1 |
| 20100070726 | Ngo et al. | Mar 2010 | A1 |
| 20100077160 | Liu | Mar 2010 | A1 |
| 20100094808 | Erofeev | Apr 2010 | A1 |
| 20100100529 | Erofeev | Apr 2010 | A1 |
| 20100122053 | Prahlad et al. | May 2010 | A1 |
| 20100131461 | Prahlad et al. | May 2010 | A1 |
| 20100145909 | Ngo | Jun 2010 | A1 |
| 20100153338 | Ngo et al. | Jun 2010 | A1 |
| 20100179941 | Agrawal et al. | Jul 2010 | A1 |
| 20100205150 | Prahlad et al. | Aug 2010 | A1 |
| 20100228919 | Stabrawa et al. | Sep 2010 | A1 |
| 20100250735 | Andersen | Sep 2010 | A1 |
| 20100257142 | Murphy et al. | Oct 2010 | A1 |
| 20100287141 | Prahlad et al. | Nov 2010 | A1 |
| 20100332990 | Prahlad et al. | Dec 2010 | A1 |
| 20110047195 | Le et al. | Feb 2011 | A1 |
| 20110047340 | Olson et al. | Feb 2011 | A1 |
| 20110066599 | Prahlad et al. | Mar 2011 | A1 |
| 20110161299 | Prahlad et al. | Jun 2011 | A1 |
| 20110161300 | Hwang et al. | Jun 2011 | A1 |
| 20110196957 | Ayachitula et al. | Aug 2011 | A1 |
| 20110246416 | Prahlad et al. | Oct 2011 | A1 |
| 20110246429 | Prahlad et al. | Oct 2011 | A1 |
| 20110276594 | Chong et al. | Nov 2011 | A1 |
| 20110282842 | Popovski et al. | Nov 2011 | A1 |
| 20110295804 | Erofeev | Dec 2011 | A1 |
| 20110295806 | Erofeev | Dec 2011 | A1 |
| 20120079221 | Sivasubramanian et al. | Mar 2012 | A1 |
| 20120084523 | Littlefield et al. | Apr 2012 | A1 |
| 20120124012 | Provenzano et al. | May 2012 | A1 |
| 20120131684 | Lynch | May 2012 | A1 |
| 20120150818 | Vijayan Retnamma et al. | Jun 2012 | A1 |
| 20120150826 | Vijayan Retnamma et al. | Jun 2012 | A1 |
| 20120179886 | Prahlad et al. | Jul 2012 | A1 |
| 20120317074 | Ngo | Dec 2012 | A1 |
| 20130006926 | Erofeev | Jan 2013 | A1 |
| 20130006938 | Prahlad et al. | Jan 2013 | A1 |
| 20130007183 | Sorenson et al. | Jan 2013 | A1 |
| 20130054910 | Vaghani et al. | Feb 2013 | A1 |
| 20130103650 | Natanzon et al. | Apr 2013 | A1 |
| 20130144881 | Sitsky et al. | Jun 2013 | A1 |
| 20130198311 | Tamir et al. | Aug 2013 | A1 |
| 20130218840 | Smith et al. | Aug 2013 | A1 |
| 20130262800 | Goodman et al. | Oct 2013 | A1 |
| 20130282953 | Orme et al. | Oct 2013 | A1 |
| 20140201170 | Vijayan et al. | Jul 2014 | A1 |
| 20140281317 | Garman et al. | Sep 2014 | A1 |
| 20150067231 | Sundarrajan | Mar 2015 | A1 |
| 20150212894 | Pawar et al. | Jul 2015 | A1 |
| 20150339317 | Choudhary | Nov 2015 | A1 |
| 20160077920 | Regni | Mar 2016 | A1 |
| 20160350391 | Vijayan et al. | Dec 2016 | A1 |
| 20170168903 | Dornemann et al. | Jun 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 |
| 20170192867 | Vijayan et al. | Jul 2017 | A1 |
| 20170192868 | Vijayan et al. | Jul 2017 | A1 |
| 20170193003 | Vijayan et al. | Jul 2017 | A1 |
| 20170206142 | Pawar et al. | Jul 2017 | A1 |
| 20170235647 | Kilaru et al. | Aug 2017 | A1 |
| 20170242871 | Kilaru et al. | Aug 2017 | A1 |
| 20180232278 | Kumarasamy et al. | Aug 2018 | A1 |
| 20180275880 | Kumarasamy et al. | Sep 2018 | A1 |
| 20180373602 | Nallathambi et al. | Dec 2018 | A1 |
| 20190250826 | Gutta | Aug 2019 | A1 |
| 20190250827 | Gutta | Aug 2019 | A1 |
| 20200021651 | Nallathambi et al. | Jan 2020 | A1 |
| 20200192912 | Mitkar et al. | Jun 2020 | A1 |
| 20200272543 | Nallathambi et al. | Aug 2020 | A1 |
| 20200356443 | Pawar et al. | Nov 2020 | A1 |
| 20200379648 | Kumarasamy et al. | Dec 2020 | A1 |
| 20210011805 | Kumarasamy et al. | Jan 2021 | A1 |
| 20210209060 | Kottomtharayil et al. | Jul 2021 | A1 |
| 20210334003 | Agrawal et al. | Oct 2021 | A1 |
| Number | Date | Country |
|---|---|---|
| 2006331932 | Dec 2006 | AU |
| 2632935 | Dec 2006 | CA |
| 0259912 | Mar 1988 | EP |
| 0405926 | Jan 1991 | EP |
| 0467546 | Jan 1992 | EP |
| 0774715 | May 1997 | EP |
| 0809184 | Nov 1997 | EP |
| 0862304 | Sep 1998 | EP |
| 0899662 | Mar 1999 | EP |
| 0981090 | Feb 2000 | EP |
| 1174795 | Jan 2002 | EP |
| 1349089 | Jan 2003 | EP |
| 1349088 | Oct 2003 | EP |
| 1579331 | Sep 2005 | EP |
| 1974296 | Oct 2008 | EP |
| 2256952 | Dec 1992 | GB |
| 2411030 | Aug 2005 | GB |
| 05189281 | Jul 1993 | JP |
| 06274605 | Sep 1994 | JP |
| 09016463 | Jan 1997 | JP |
| 11259348 | Sep 1999 | JP |
| 2000-347811 | Dec 2000 | JP |
| WO 1993003549 | Feb 1993 | WO |
| WO 1995013580 | May 1995 | WO |
| WO 199839707 | Sep 1998 | WO |
| WO 1999012098 | Mar 1999 | WO |
| WO 1999014692 | Mar 1999 | WO |
| WO 2002095632 | Nov 2002 | WO |
| WO 2003028183 | Apr 2003 | WO |
| WO 2004034197 | Apr 2004 | WO |
| WO 2005055093 | Jun 2005 | WO |
| WO 2005086032 | Sep 2005 | WO |
| WO 2007053314 | May 2007 | WO |
| WO 2007075587 | Jul 2007 | WO |
| Entry |
|---|
| U.S. Appl. No. 15/981,712, filed May 16, 2018, Gutta et al. |
| Armstead et al., “Implementation of a Campus-Wide Distributed Mass Storage Service: The Dream vs. Reality,” IEEE, 1995, pp. 190-199. |
| Arneson, “Development of Omniserver; Mass Storage Systems,” Control Data Corporation, 1990, pp. 88-93. |
| Arneson, “Mass Storage Archiving in Network Environments” IEEE, 1998, pp. 45-50. |
| 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. |
| 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, 9 pages, San Francisco, CA. |
| “Easy snapshot backup and recovery is here.” Copyright date listed 2014. 6 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). |
| Gray (#1 of 2, pp. 646-655), Jim; Reuter, Andreas, Transaction Processing: Concepts and Techniques, Morgan Kaufmann Publisher, USA 1994, 1994,11 pages. |
| Gray (#2 of 2, pp. 604-609), Jim; Reuter Andreas, Transaction Processing Concepts and Techniques, Morgan Kaufmann Publisher, USA 1994, pp. 604-609. |
| Harrington, Lisa H., “The RFP Process: How to Hire a Third Party”, Transportation & Distribution, Sep. 1988, vol. 39, Issue 9, in 5 pages. |
| http://en.wikipedia.org/wiki/Naive_Bayes_classifier, printed on Jun. 1, 2010, in 7 pages. |
| IntelliSnap—Advanced Snapshots—NAS iDataAgent. <http://documentation.commvault.com/commvault/v10/article?p=products/nas ndmp/snap . . . > Retrieved Oct. 24, 2014. 14 pages. |
| Jander, “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4(Mar. 21, 1998), pp. 64-72. |
| Kashyap, et al., “Professional Services Automation: A knowledge Management approach using LSI and Domain specific Ontologies”, FLAIRS-01 Proceedings, 2001, pp. 300-302. |
| Li et al., “iROW: An Efficient Live Snapshot System for Virtual Machine Disk”, ICPADS 2012, Singapore, Dec. 17-19, 2012, pp. 376-383. |
| Lyon J., Design considerations in replicated database systems for disaster protection, COMPCON 1988, Feb. 29, 1988, pp. 428-430. |
| Microsoft Corporation, “Microsoft Exchange Server: Best Practices for Exchange Database Management,” 1998, 26 pages. |
| Microsoft, “How Volume Shadow Copy Service Works”, date listed Mar. 28, 2003. |
| Oltean, “VSS writers and inconsistent shadow copies”, date listed Sep. 1, 2005, http://blogs.msdn.com/b/adioltean/archive/2005/ 08/31/ 458907.aspx., 2 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-14 (May 1991). |
| Simpana Intellisnap Snapshot Management Technology: Exponentially Accelerate Data Protection and Recovery. Copyright date listed 1999-2013. 2 pages. |
| Simpana Intellisnap Technology—Making Snaps Work. Copyright date listed 2014. 2 pages. |
| The Oracle8 Replication Manual, Part No. A58245-01; Chapters 1-2; Dec. 1, 1997; obtained from website: http://download-west.oracle.com/docs/cd/A64702_01/doc/server.805/a58245/toc.htm on May 20, 2009, 58 pages. |
| Veritas Software Corporation, “Veritas Volume Manager 3.2, Administrator's Guide,” Aug. 2001, 360 pages. |
| Waldspurger, Carl, et al., I/O Virtualization, Communications of the ACM, vol. 55, No. 1, Jan. 2012, pp. 66-72. |
| Wiesmann M, Database replication techniques: a three parameter classification, Oct. 16, 2000, pp. 206-215. |
| Examiner's Report for Australian Application No. 2003279847, dated Dec. 9, 2008, 4 pages. |
| European Examination Report; Application No. 06848901.2, dated Apr. 1, 2009, pp. 7. |
| Second Examination Report in EU Appl. No. 06 848 901.2-2201 dated Dec. 3, 2010. |
| Examiner's First Report; Application No. 2006331932 dated May 11, 2011 in 2 pages. |
| Canadian Office Action dated Dec. 10, 2009, Application No. CA2544063, 3 pages. |
| Canadian Office Action dated Dec. 29, 2010, Application No. CA2546304, 4 pages. |
| First Office Action in Indian Application No. 3359/DELNP/2006 dated Feb. 11, 2013, 2 pages. |
| Final Office Action for Japanese Application No. 2003531581, dated Mar. 24, 2009, 6 pages. |
| First Office Action for Japanese Application No. 2003531581, dated Jul. 8, 2008, 8 pages. |
| International Preliminary Report on Patentability, PCT Application No. PCT/US2009/066880, dated Jun. 23, 2011, in 9 pages. |
| International Search Report and Written Opinion dated Nov. 13, 2009, PCT/US2007/081681m, 8 pages. |
| International Search Report and Written Opinion issued in PCT Application No. PCT/US2011/030396, dated Jul. 18, 2011, in 20 pages. |
| International Search Report and Written Opinion issued in PCT Application No. PCT/US2011/38436, dated Sep. 21, 2011, in 18 pages. |
| International Search Report from International Application No. PCT/US2006/048273, dated May 15, 2007, 13 pages. |
| Case No. No. 6:21-CV-00634-ADA, Answer WDTX-6-21-cv-00634-19, filed Aug. 27, 2021, in 23 pages. |
| Case No. 1:21-cv-00537, Complaint WDTX-1-21-cv-00537-1_WDTX-6-21-cv-00634-1, filed Jun. 18, 2021, in 44 pages. |
| Case No. 6:21-cv-00634-ADA, Order Dismissing with Prejudice WDTX-6-21-cv-00634-22, filed Sep. 1, 2021, in 1 page. |
| Case No. 1:20-cv-00525-MN, Amended Complaint DDE-1-20-CV-00525-15, filed on Jul. 27, 2020 in 30 pages. |
| Case No. 1:20-cv-00525-MN, First Amended Answer DDE-1-20-cv-00525-95, filed Jul. 23, 2021, in 38 pages. |
| Case No. 1:20-cv-00525-MN, Oral Order DDE-1-20-cv-00524-86_DDE-1-20-cv-00525-87, filed Jun. 29, 2021, in 1 page. |
| Case No. 1:20-cv-00525-MN, Oral Order DDE-1-20-cv-00524-78_DDE-1-20-cv-00525-77, filed May 24, 2021 in 1 page. |
| Case No. 1:20-cv-00525-MN, Order DDE-1-20-cv-00525-38_DDE-1-20-cv-00524-42, filed Feb. 10, 2021, in 4 pages. |
| Case No. 1:20-cv-00525-MN, Complaint DDE-1-20-cv-00525-1, filed Apr. 21, 2020, in 28 pages. |
| Case No. 1:20-cv-00525-MN, Joint Claim Construction Brief DDE-1-20-cv-00525-107, filed Oct. 1, 2021, in 79 pages. |
| Case No. 1:20-cv-00525-MN, Joint Claim Construction Brief Exhibits DDE-1-20-cv-00525-107-1, filed Oct. 1, 2021, in 488 pages. |
| Case No. No. 20-525-MN-CJB, Joint Claim Construction Statement DDE-1-20-cv-00525-119, filed Oct. 29, 2021, in 12 pages. |
| Case No. No. 20-525-MN-CJB, Farnan Letter DDE-1-20-cv-00525-111, filed Oct. 6, 2021, in 2 pages. |
| Case No. No. 20-525-MN-CJB, Farnan Letter Exibit A DDE-1-20-cv-00525-111-1, filed Oct. 6, 2021, in 7 pages. |
| Case No. 1:20-cv-00525-CFC-CJB, Joint Appendix of Exhibits 1-6, filed Jan. 13, 2022, in 2 pages. |
| Case No. 1:20-cv-00525-CFC-CJB, Joint Appendix of Exhibits 1-6, filed Jan. 13, 2022, in 224 pages. |
| Case No. 1:20-cv-00525-CFC-CJB, Joint Claim Construction Brief on Remaining Disputed Terms, filed Jan. 13, 2022, in 54 pages. |
| Case No. 120-CV-00525-MN—Stipulation of Dismissal, filed Jan. 27, 2022, in 2 pages. |
| Excerpts from Microsoft Computer Dictionary, Microsoft Press, 5th ed., 2002. 5 pages. |
| Freeley, et al., “Integrating Coherency and Recoverability in Distributed Systems”, Department of Computer Science and Engineering, FR-35, University of Washington, Nov. 1994, 13 pages. |
| Veritas NetBackup™, System Administrator's Guide, Window NT Server, Release 3.2, May 1999, 580 pages. |
| Veritas Volume Manager™ 3.1 for Windows 2000, Aug. 2002, 486 pages. |
| Case No. 1:20-cv-00524-MN,Order Dismissing with Prejudice DDE-1-20-cv-00524-101, filed Aug. 31, 2021, in 1 page. |
| Case No. 1:20-cv-00524-MN,First_Amended_Answer_DDE-1-20-cv-00524-96, filed Jul. 23, 2021, in 41 pages. |
| Case No. 1:20-cv-00524-MN,Stipulation_DDE-1-20-cv-00524-93, filed Jul. 14, 2021, in 3 pages. |
| Case No. 1:20-cv-00524-MN,Oral Order DDE-1-20-cv-00524-86_DDE-1-20-cv-00525-87, filed Jun. 29, 2021, in 1 page. |
| Case No. 1:20-cv-00524-MN,Answer_DDE-1-20-cv-00524-45, filed Feb. 16, 2021, in 25 pages. |
| Case No. 1:20-cv-00524-MN,Order_DDE-1-20-cv-00525-38_DDE-1-20-cv-00524-42, filed Feb. 10, 2021, in 4 pages. |
| Case No. 1:20-cv-00524-MN,Amended_Complaint_DDE-1-20-cv-00524-13, filed on Jul. 27, 2020 in 30 pages. |
| Case No. 1:20-cv-00524-MN,Complaint_DDE-1-20-cv-00524-1, filed on Apr. 21, 2020 in 29 pages. |
| PTAB-IPR2021-00590—('533) POPR Final, filed Jun. 16, 2021, in 59 pages. |
| PTAB-IPR2021-00590—Feb. 26, 2021 533 Patent IPR, filed Feb. 26, 2021, in 89 pages. |
| PTAB-IPR2021-00590—Exhibit 1001—U.S. Pat. No. 7,840,533, Issue Date Nov. 23, 2010, in 16 pages. |
| PTAB-IPR2021-00590—Exhibit 1002—Chase Declaration (533 Patent IPR), dated Feb. 26, 2021, in 183 pages. |
| PTAB-IPR2021-00590—Exhibit 1004—U.S. Pat. No. 6,981,114 (Wu), Issue Date Dec. 27, 2005, in 16 pages. |
| PTAB-IPR2021-00590—Exhibit 1005—US20030061456A1 (Ofek), Issue Date Mar. 27, 2003, in 60 pages. |
| PTAB-IPR2021-00590—Exhibit 1006—U.S. Pat. No. 5,835,953 (Ohran), Issue Date Nov. 10, 1998, in 33 pages. |
| PTAB-IPR2021-00590—Exhibit 1007—US20030046270A1 (Leung), Publication Date Mar. 6, 2003, in 27 pages. |
| PTAB-IPR2021-00590—Exhibit 1008—U.S. Pat. No. 6,473,775 (Kusters), Oct. 29, 2002, in 15 pages. |
| PTAB-IPR2021-00590—Exhibit 1010—U.S. Pat. No. 7,284,104B1, Issue Date Oct. 16, 2007, in 15 pages. |
| PTAB-IPR2021-00590—Exhibit 1013—U.S. Pat. No. 7,873,806, Issue Date Jan. 18, 2011, in 27 pages. |
| PTAB-IPR2021-00590—Exhibit 1014—U.S. Pat. No. 6,920,537B2, Issue Date Jul. 19, 2005, in 57 pages. |
| PTAB-IPR2021-00590—Exhibit 1015—Assignment to EMC—Ohran, Date Recorded Nov. 24, 2003, in 6 pages. |
| PTAB-IPR2021-00590—Exhibit 1016—Assignment Docket—Ohran, Earliest Recordation Date Nov. 8, 1996, in 2 pages. |
| PTAB-IPR2021-00590—Exhibit 1017—CommVault v. Rubrik Complaint, filed on Apr. 21, 2020, in 29 pages. |
| PTAB-IPR2021-00590—Exhibit 1018—Feb. 17, 2021 (0046) Scheduling Order, filed Feb. 17, 2021, in 15 pages. |
| PTAB-IPR2021-00590—Exhibit 2001—Jones Declaration, dated Jun. 16, 2021, in 53 pages. |
| PTAB-IPR2021-00590—Exhibit 2009—590 Declaration, dated Jul. 7, 2021, in 8 pages. |
| PTAB-IPR2021-00590—Exhibit 3001, dated Aug. 30, 2021, in 2 pages. |
| PTAB-IPR2021-00590—Joint Motion to Terminate, filed Aug. 31, 2021, in 7 pages. |
| PTAB-IPR2021-00590—Joint Request to Seal Settlement Agreement, filed Aug. 31, 2021, in 4 pages. |
| PTAB-IPR2021-00590—Termination Order, filed Sep. 1, 2021, in 4 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20200341644 A1 | Oct 2020 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62630698 | Feb 2018 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15981770 | May 2018 | US |
| Child | 16912184 | US |
