US 8,230,195 B2Grant
System and method for performing auxiliary storage operations
Issue Date:2012-07-24
•15 Claims
•7 Drawing Sheets
Abstract
Systems and methods for protecting data in a tiered storage system are provided. The storage system comprises a management server, a media management component connected to the management server, a plurality of storage media connected to the media management component, and a data source connected to the media management component. Source data is copied from a source to a buffer to produce intermediate data. The intermediate data is copied to both a first and second medium to produce a primary and auxiliary copy, respectively. An auxiliary copy may be made from another auxiliary copy. An auxiliary copy may also be made from a primary copy right before the primary copy is pruned.
Metadata
Assignee
- CommVault Systems, Inc.
Inventors
- Arun Prasad Amarendran
- Manoj Kumar Vijayan Retnamma
- Anand Prahlad
- Parag Gokhale
- Jun Lu
Application Information
Application Number:US 13/107,807
Filing Date:2011-05-13
Priority Date:2004-11-08
Art Unit:2185
Classifications
IPC:
G06F13/10
Patent Drawings (7 sheets)
Description
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application is a continuation of U.S. application Ser. No. 12/340,365, filed Dec. 19, 2008 now U.S. Pat. No. 7,962,714, entitled SYSTEM AND METHOD FOR PERFORMING AUXILIARY STORAGE OPERATIONS, which is a continuation of U.S. application Ser. No. 11/269,119, filed Nov. 8, 2005 now U.S. Pat. No. 7,490,207, entitled SYSTEM AND METHOD FOR PERFORMING AUXILIARY STORAGE OPERATIONS, which claims the benefit of U.S. Provisional Application No. 60/626,076 titled SYSTEM AND METHOD FOR PERFORMING STORAGE OPERATIONS IN A COMPUTER NETWORK, filed Nov. 8, 2004, the entireties of which are hereby incorporated herein by reference.
COPYRIGHT NOTICE
[0002] 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 or the patent disclosures, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever.
RELATED APPLICATIONS
[0003] This application is related to the following applications, each of which is incorporated herein by reference in its entirety:
[0004] U.S. patent application Ser. No. 09/354,058, titled HIERARCHICAL BACKUP AND RETRIEVAL SYSTEM, filed Jul. 15, 1999;
[0005] U.S. Pat. No. 6,418,478, titled PIPELINED HIGH SPEED DATA TRANSFER MECHANISM, filed Mar. 11, 1998;
[0006] U.S. patent application Ser. No. 10/144,683, titled PIPELINED HIGH SPEED DATA TRANSFER MECHANISM, filed May 13, 2002;
[0007] U.S. patent application Ser. No. 09/495,751 titled HIGH SPEED DATA TRANSFER MECHANISM, filed Feb. 1, 2000;
[0008] U.S. patent application Ser. No. 10/818,749, titled SYSTEM AND METHOD FOR PERFORMING STORAGE OPERATIONS IN A COMPUTER NETWORK, filed May 5, 2004;
[0009] U.S. patent application Ser. No. 10/877,831 titled HIERARCHICAL SYSTEM AND METHOD FOR PERFORMING STORAGE OPERATIONS IN A COMPUTER NETWORK, FILED Jun. 25, 2004;
[0010] U.S. patent application Ser. No. 10/803,542 titled METHOD AND SYSTEM FOR TRANSFERRING DATA IN A STORAGE OPERATION, filed Mar. 18, 2004;
[0011] U.S. patent application Ser. No. 11/269,520, titled SYSTEM AND METHOD FOR PERFORMING MULTISTREAM STORAGE OPERATIONS, filed Nov. 7, 2005;
[0012] U.S. patent application Ser. No. 11/269,512, titled SYSTEM AND METHOD TO SUPPORT SINGLE INSTANCE STORAGE OPERATIONS, filed Nov. 7, 2005;
[0013] U.S. patent application Ser. No. 11/269,514, titled METHOD AND SYSTEM OF POOLING STORAGE DEVICES, filed Nov. 7, 2005;
[0014] U.S. patent application Ser. No. 11/269,521, titled METHOD AND SYSTEM FOR SELECTIVELY DELETING STORED DATA, filed Nov. 7, 2005;
[0015] U.S. patent application Ser. No. 11/269,519, titled METHOD AND SYSTEM FOR GROUPING STORAGE SYSTEM COMPONENTS, filed Nov. 7, 2005;
[0016] U.S. patent application Ser. No. 11/269,515, titled SYSTEMS AND METHODS FOR RECOVERING ELECTRONIC INFORMATION FROM A STORAGE MEDIUM, filed Nov. 7, 2005; and
[0017] U.S. patent application Ser. No. 11/269,513, titled METHOD AND SYSTEM FOR MONITORING A STORAGE NETWORK, filed Nov. 7, 2005.
BACKGROUND OF THE INVENTION
Field of the Invention
[0018] The invention relates to data storage in a computer network and, more particularly, to a system and method for providing a user with additional storage operation options
[0019] Businesses and other organizations store a large amount of important data in electronic form on their computer networks. To protect this stored data, network administrators make copies of the stored information so that if the original data is destroyed or corrupted, a copy may be used in place of the original. There are storage systems available from several vendors, including Commvault Systems, EMC Corp., HP, Veritas, and others, which automate certain functions associated with data storage.
[0020] These and similar systems are designed to manage data storage according to a technique referred to as information lifecycle management, or ILM. In ILM, data is stored in a tiered storage pattern, in which live data in use by users of a network, sometimes referred to as operational or production data, is backed up by a storage operation to other storage devices. The first backup is sometimes referred to as the primary copy, and is used in the first instance to restore the production data in the event of a disaster or other loss or corruption of the production data. Under traditional tiered storage, the data on the primary storage device is migrated to other devices, sometimes referred to as secondary or auxiliary storage devices. This migration can occur after a certain amount of time from which the data is first stored on the primary device, or for certain types of data as selected in accordance with a user-defined policy. Usually, with tiered storage patterns, the storage devices used to store auxiliary or secondary copies of data have less availability, lower performance, and/or fewer resources than devices storing the production or primary copies. That is, primary storage devices tend be faster, higher capacity and more readily available devices, such as magnetic hard drives, than the ones used for storing auxiliary copies, such as magnetic or optical disks or other removable media storage devices.
[0021] By way of example, FIG. 1 shows a library storage system 100 that employs principles of tiered storage. Storage policies 20 in a management server 21 are used to copy production data from a production data store 24 to physical media locations 28, 30 which serve as the primary copies or devices 60. When a storage policy dictates that a storage operation is to be performed, the production data 24 is copied to media 28, 30 based on storage policy 20 using transfer stream 50. Storage operations include, but are not limited to, creation, storage, retrieval, migration, deletion, and tracking of primary or production volume data, secondary volume data, primary copies, secondary copies, auxiliary copies, snapshot copies, backup copies, incremental copies, differential copies, HSM copies, archive copies, and other types of copies and versions of electronic data.
[0022] A storage policy is generally a data structure or other information which includes a set of preferences and other storage criteria for performing a storage operation. The preferences and storage criteria may include, but are not limited to: a storage location, relationships between system components, network pathway to utilize, retention policies, data characteristics, compression or encryption requirements, preferred system components to utilize in a storage operation, and other criteria relating to a storage operation. A storage policy may be stored to a storage manager index, to archive media as metadata for use in restore operations or other storage operations, or to other locations or components of the system.
[0023] In FIG. 1 , a primary copy 60 of production data 24 is stored on media 28 and 30. Primary copy 60 might, for example, include data that is frequently accessed for a period of one to two weeks after it is stored. A storage administrator might find storing such data on a set of drives with fast access times preferable. On the other hand, such fast drives are expensive and once the data stored in a primary copy 60 is no longer accessed as frequently, the storage administrator might find it desirable to move and copy this data to an auxiliary or secondary copy data set 62 on a less expensive tape library or other device with slower access times. Once the data from primary data set 60 is moved to auxiliary data set 62, primary data 60 can be deleted thereby freeing up drive space on media or devices 28, 30 for primary copies of new production data. In FIG. 1 , auxiliary data set 62 including drives or tapes 40, and 42 as needed, are produced from drives 28, 30 of primary copy 60 using a transfer stream 50a. Thus, tiered storage performs auxiliary storage operations after a primary data set has been created.
[0024] For example, primary copy 60 may be made on a Tuesday evening at 2:00 AM and then auxiliary copy 62 will be made from primary copy 60 every Tuesday at 4:00 AM. Changes made to primary copy 60 are reflected in auxiliary copy 62 when auxiliary copy 62 is created. Similarly, multiple auxiliary copies 36, 38 may be made from primary copy 60 using respective transfer streams 50b, 50c. Thus, every time a change is made to primary copy 60, for example when data from production data store 24 is updated, that change is eventually reflected in all auxiliary copies 62, 36 and 38. Auxiliary copies 62, 36 and 38 typically include all of the primary copy data and primary copy metadata. This metadata enables the auxiliary copy 62, 36 and 38 to operate independently of the primary copy 60.
[0025] Although the tiered storage provided by ILM systems is effective in managing the storing and restoring of production data, it has several shortcomings. First, interruptions may occur during the creation of the primary copy 60, or the primary copy 60 itself may become corrupted or lost. If one or more auxiliary copies 62, 36 and 38 are not made when this happens, the interruption or loss prevents the creation of any auxiliary copies 62, 36 and 38, in which case no copy of the source data may be available to restore the production volume.
[0026] Moreover, some tiered storage systems require that auxiliary copies 62, 36 and 38 be updated or produced every time a primary copy 60 is changed. However, if the source data is not very sensitive, there may not be a need for an auxiliary copy 62, 36 and 38 to be created to keep up with every minor change to a primary copy 60. Some applications may not be significantly affected if the auxiliary copy 62, 36 and 38 is current as of, for example, a month's old version of the primary copy 60. Moreover, in order to maintain an auxiliary copy 62, 36 and 38 essentially mirroring a primary copy 60, many resources are required and the auxiliary copy 62, 36 and 38 may need to frequently feed off of the primary copy 60 making the primary copy 60 unavailable.
[0027] Therefore, it is desirable to modify the sequence of storage operations in tiered storage systems to account for and resolve these potential problems.
SUMMARY OF THE INVENTION
[0028] In one embodiment of the invention, a method for storing data in a tiered storage system is provided in which the tiered storage system includes a plurality of storage media, one or more first storage media being designated for use in storing one or more primary copies of production data and one or more second storage media being designated for use in storing one or more auxiliary copies of production data. The method includes: copying the production data from a data source to a first location to produce intermediate data; copying the intermediate data to a first storage medium to produce a primary copy of the production data; and while the primary copy is still being produced, copying the intermediate data to a second storage medium to produce an auxiliary copy of the production data. The copying of source data and intermediate data may be monitored. Monitoring of the copy operation(s) may determine that an interruption occurred in the production of the primary copy or auxiliary copy. The monitoring method may complete the production of the uninterrupted copy; and thereafter, when the interruption is resolved, complete the interrupted production of the primary or auxiliary copy.
[0029] In another embodiment of the invention, a method for storing data in a tiered storage system is provided in which the tiered storage system comprising a plurality of storage media, one or more first storage media being designated for use in storing one or more primary copies of production data and one or more second storage media being designated for use in storing one or more auxiliary copies of production data. The method includes: selecting a set of production data to be copied; beginning to create a primary copy of the production data set on a first storage medium; and while the primary copy is being created, beginning to create an auxiliary copy of the production data set from the primary copy.
[0030] In another embodiment of the invention, a method for storing data in a tiered storage system in provided in which, the tiered storage system comprising a plurality of storage media, one or more first storage media being designated for use in storing one or more primary copies of production data and one or more second storage media being designated for use in storing one or more auxiliary copies of production data. The method includes: creating a primary copy of production data on a first storage medium; copying the primary copy to one of the second storage media to produce a first auxiliary copy; and copying the first auxiliary copy to another of the second storage media to produce a second auxiliary copy.
BRIEF DESCRIPTION OF THE DRAWINGS
[0031] The invention is illustrated in the figures of the accompanying drawings which are meant to be exemplary and not limiting, in which like references are intended to refer to like or corresponding parts, and in which:
[0032] FIG. 1 is a block diagram showing a storage system in accordance with the prior art;
[0033] FIG. 2 is a block diagram showing a storage system in accordance with one embodiment of the invention;
[0034] FIG. 3 is a flow chart illustrating a process of producing primary and auxiliary copies through distinct processes, in accordance with an embodiment of the invention;
[0035] FIG. 4 is a block diagram showing a storage system in accordance with another embodiment of the invention;
[0036] FIG. 5 is a flow chart illustrating a process of producing auxiliary copies in cascaded fashion, in accordance with an embodiment of the invention;
[0037] FIG. 6 is a flow chart illustrating a process of producing an auxiliary copy in accordance with an embodiment of the invention; and
[0038] FIG. 7 is a block diagram showing a storage system in accordance with an embodiment of the invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
[0039] Embodiments of the invention are now described with reference to the drawings in the Figures. Referring to FIG. 2 , a tiered storage system 300 in accordance with an embodiment of the invention is shown which allows for the production of auxiliary copies of production data at approximately the same time as, and through an independent storage operation from, the production of primary copies. In accordance with storage polices 320 in a storage manager 321, live, production data from a data store 324 is copied to produce intermediate data 366 in a buffer 360. This intermediate data is then copied through a first storage operation 362 to a primary copy 354 stored on storage devices 328 and 330, and is also copied through a second storage operation 364 to auxiliary copy 356 on storage devices 336 and 338.
[0040] Since system 300 is a tiered storage system, the storage media 328, 330 used to store primary copies are typically faster, higher capacity, more readily available and more expensive than the storage devices 336, 338 used for auxiliary copies. For example, storage media 328, 300 may be magnetic disks, such as hard drives, while storage media 336, 338 may be removable media or other slower storage devices or media used for longer term storage.
[0041] The storage operations shown in FIG. 2 may be performed on a chunk by chunk basis, through a data pipe mechanism 350 such as the one described in commonly owned U.S. Pat. No. 6,418,478 titled PIPELINED HIGH SPEED DATA TRANSFER MECHANISM, which is hereby incorporated herein by reference, or by other copy operations known to those of skill in the art. The data pipe mechanism 350 may include one or more data agent components and one or more media management components as described in the commonly owned patent applications referenced above and as further described below with reference to FIG. 7 . The data pipe mechanism 350 moves data as quickly as possible between two points, which may be on the same or different computers within a network, while performing a variety of operations (such as compression, encryption, content analysis, etc.) on the data. The data pipe mechanism 350 includes a named set of tasks executing within one or more computers that cooperate with each other to transfer and process data in a pipelined manner. Any of the components included in the pipeline may have multiple instances, thus greatly increasing the scalability and performance of the operation.
[0042] The data pipe mechanism 350 processes data by dividing its processing into logical tasks that can be performed in parallel. It then sequences those tasks in the order in which they are to act on the data. For example, a head task may extract data from a database, a second task may encrypt it, a third may compress it, a fourth may send it out over the network, a fifth may receive it from the network, and a sixth may write it to a tape. The latter two tasks may reside on a different computer than the others, for example. All of the tasks that comprise a single data pipe mechanism 350 on a given computer have access to a segment of shared memory that is divided into a number of buffers. A small set of buffer manipulation primitives is used to allocate, free, and transfer buffers between tasks. Semaphores (or other OS specific mutual exclusion or signaling primitives) are used to coordinate access to buffers between tasks on a given computer. Special tasks, called network agents, send and receive data across network connections using standard network protocols. These agents enable the data pipe mechanism 350 to connect across multiple computer systems. Each task may be implemented as a separate thread, process, or as a procedure depending on the capabilities of the computing system on which the data pipe mechanism 350 is implemented.
[0043] When the production data is prepared for copying, it is broken into chunks of data, each of which has a chunk payload and is encapsulated with metadata describing the contents of the chunk placed in a tag header for the chunk. The tag header indicates that the source data will be virtually simultaneously streamed to two distinct media destinations. Thereafter, a first storing process 362 reads data 366 in buffer 360 and stores data 366 in physical media locations 328, 330 to produce a primary copy 354. Before the storage of data 366 is completed in media 328, 330 a second storing process 364 reads data 366 in buffer 360 and stores data 366 in physical media locations 336, 338 to produce an auxiliary copy 356.
[0044] A storage device management component, such as the media management component (not explicitly shown) in data pipe 350, adds a tag header to data 366 indicating the type of media to which the production data will be stored 328, 330, 336 and 338. The tag header may also include information relating to a time to perform one or more storage operations, a type of storage operation to perform on data 366, such as a primary copy, auxiliary copy, cascading auxiliary copy, or other copy or storage operation. For example, the tag header may indicate that a primary copy and a certain number of cascading auxiliary copies are to be created substantially simultaneously. The tag header information may be based on a storage policy associated with the client, production data, or production data store. A media management component may read the tag header information to determine the time to perform a storage operation, the type of storage operation to perform, the type of media to which to copy data 366, or other information relating to performing a storage operation. The media types may be determined by reference to the storage policy 320, or by reference to data stored on the media management component regarding the types of storage devices to which the media management component is attached.
[0045] In some embodiments, the system removes the encapsulation from each chunk prior to copying it to the primary copy 354 or auxiliary copy 356, and stores the chunk on a single instance storage device. The single instance storage device may return a signature or other identifier for items copied from the chunk payload. The metadata associated with the chunk may be maintained in separate storage and may track the association between the logical identifiers and the signatures for the individual items of the chunk payload. This process is described further in commonly owned co-pending U.S. patent application Ser. No. 11/269,512, filed Nov. 7, 2005, titled SYSTEM AND METHOD TO SUPPORT SINGLE INSTANCE STORAGE OPERATIONS, which has been incorporated herein by reference.
[0046] A monitoring module 368 monitors the transfer of data through data pipe 350, buffer 360 and storing processes 362, 364. If an interruption occurs in a first one of processes 362, 364, monitoring module 368 informs management server 321 of the interruption and ensures that data is still transferred in the second one of processes 362, 364. Once data transfer is complete in the second one of processes 362, 364, monitoring module 368 continues the first one of processes 362, 364 until completion.
[0047] By using two distinct storing processes 362, 364, primary copy 354 and auxiliary copy 356 may be stored on distinct media—such as tapes, magnetic media, optical media, etc. Moreover, if there is an interruption in either storing process 362, 364, the other process may still continue. This allows for the production of an auxiliary copy even without a primary copy, or even if the primary copy becomes lost or corrupted. Further, the creation of primary copy 354 and auxiliary copy 356 need not be synchronous and so the creation of auxiliary copy 356 may actually precede the creation of primary copy 354.
[0048] Referring now to FIG. 3 , a process according to an embodiment of the invention of storing production data starts, at step 410, when a storage management server starts the transfer of production data from a data source into a data pipe. The process may be started at the request of a user or may be scheduled to occur at regular intervals, at a time specified in a storage policy or upon the occurrence specified event. The production data is broken in data chunks each encapsulated by a tag containing metadata about the data in the respective chunk. At step 415, the copy of the production data is stored in a buffer. In steps 420 and 425, two storage processes are started, in any order and according to any desired relative timing—one, step 420, in which a first storing process is executed to transfer the production data copy stored in the buffer to a first set of storage devices to produce a primary copy, and another, step 425, in which a second storing process is executed which transfers the data in the buffer to auxiliary media to produce an auxiliary copy. During the execution of steps 410, 415, 420 and 425, at step 430, a monitoring module monitors the transfer of production data from the data source to the buffer and both the primary and auxiliary media. At step 435, if there is a problem in a first one of the storing processes, the monitoring module informs the storage management component such as the media management component, performing the operation to interrupt the process having the problem while the second one of the storing processes completes. Once the problem is resolved, the first storing process is restarted and performed to completion.
[0049] In accordance with another aspect of the present invention, it may be advantageous to create a series of auxiliary copies in cascaded fashion. Such a system 500 is shown in FIG. 4 . In accordance with storage policies 520 in a management server 521 production data from a production data store 524 is copied, chunk by chunk, to a primary medium 528. The data chunks each have a tag header containing metadata describing the contents of the chunk. The production data in production data store 524 is copied to primary medium 528 by going through a data pipe 550, such as data pipe 350 as described above. An auxiliary copy of production data in production data store 524 is then made from primary copy 554 to first auxiliary copy medium 556. An auxiliary copy of production data store 524 may be made from primary copy 528 to second auxiliary medium 558 and to third auxiliary medium 560. These copies are made by sending the data in primary copy 554 to a media management component 570 which may be a media management component used in data pipe 550. Media management component 570 removes the encapsulations around the chunks of data it receives and then encapsulates the data chunks by including a tag header indicating the type of media upon which respective first, second or third auxiliary copies 556, 558, 560 are to be stored. In this way, second auxiliary copy 558 is made from first auxiliary copy 556 or third auxiliary copy 560—assuming of course that third auxiliary medium 560 includes data available for copying. The media management component 570 reads the header to determine the type of storage medium each copy is on and performs read or write operations from or to a storage device using the formatting required for the type of device or medium. Similarly, third auxiliary copy 560 may be created from primary copy 554, first auxiliary medium 556 or second auxiliary medium 558. Clearly, all permutations among first, second and third auxiliary copies/media may be used and the invention is not limited to three pieces of media.
[0050] This process for creating cascading copies is set forth in FIG. 5 . As shown in FIG. 5 , a primary copy 554 is first made from production data retrieved from a production data store 524, step 610. Such a copy could be made using, for example, a data pipe, and the production data is broken into data chunks encapsulated in metadata headers. At step 615, a first auxiliary copy 556 is made based on the primary copy 554. At this step, the storage process reads the header to determine what type of storage device or storage media is going to be used to store the auxiliary copy, and formats the data chunks accordingly for that device or media type. At step 620, a second auxiliary copy 558 is made based on the first auxiliary copy 556, with the chunks again being reformatted as necessary to match the type of device or media upon which the second auxiliary copy is to be stored. Additional auxiliary copies may be made in the same fashion.
[0051] In this way, auxiliary copies 556, 558, 560 may be made without requiring access to the primary copy 554 or production data—because a second auxiliary copy 558 may be made by simply accessing a first auxiliary copy 556. Moreover, there may be less data stored in the auxiliary copy 556, 558, 560 because the auxiliary copy 556, 558, 560 may be made immediately before the primary copy 554 (or production data) is deleted (which could be scheduled to occur, according to a policy, for example, once every sixty days). Such a policy for auxiliary copying may be quite useful in situations in which maintaining a primary copy 554 or production data is less critical. Continuing with the example, if on day three data is changed in the primary copy 554, the changed data may not be reflected in first auxiliary copy 556 until day sixty-one. Alternatively, first auxiliary copy 556 may be made on day one using primary copy 554 and then second auxiliary copy 558 is made on day sixty-one. Further, as an auxiliary copy 556, 558, 560 is being made, distinct protocols may be used for the primary copy 554 and auxiliary copies 556, 558, 560 and a different form of media may be used.
[0052] Data may be copied from primary medium 528 to first auxiliary medium 556 some time before the data on primary medium 528 is deleted. For example if the storage policy for primary medium 528 indicates that the data in primary medium 528 is to be deleted after sixty days, data stored in primary medium 528 from a first day will be transferred from primary medium 528 to, for example, first auxiliary medium 556 on the fifty-ninth day. This process is shown in FIG. 6 , in which, at step 625, a primary copy is created from production data in a data source, following which a storage system waits until the data in the primary copy is about to be deleted, step 630, right before which it makes an auxiliary copy, step 635.
[0053] In some embodiments, the single instance copying process described above is used for making the auxiliary copies. That is, a single instance copy is made of the data chunks, and different headers for the chunks are configured for the different formats of the different types of storage devices or media on which the various auxiliary copies are stored. These headers are then stored on the respective auxiliary storage devices in connection with a hash or fingerprint of the chunk with which the header is associated.
[0054] The methods and functions described herein may be present in any tiered storage system. A specific example of one such system is shown in FIG. 7 . Storage system 700 includes a storage manager 720 and one or more of the following: a client 785, a production data store 790, a data agent 795, a jobs agent 740, a plurality of media management components 705, a plurality of storage devices 715, a plurality of media management component index caches 710 and a storage manager index cache 730. The system and elements thereof are further described in application Ser. No. 09/610,738 which is incorporated by reference in its entirety.
[0055] Data agent 795 is generally a software module that is generally responsible for storage operations such as archiving, migrating, and recovering data of client computer 785 stored in a production data store 790 or other memory location. Each client computer 785 has at least one data agent 795 and system 700 can support many client computers 785. System 700 provides a plurality of data agents 795 each of which is intended to perform storage operations such as backups, migration, and recovery of data associated with a different application. For example, different individual data agents 795 may be designed to handle MICROSOFT EXCHANGE data, LOTUS NOTES data, MICROSOFT WINDOWS 2000 file system data, MICROSOFT Active Directory Objects data, and other types of data known in the art.
[0056] Further, at least one or more of the data agents may by implemented with, or contain, or be contained in, one or more procedures which are executed by a data pipe described above. These procedures perform tasks such as compression, encryption, and content analysis of data for transmission in a shared memory.
[0057] If client computer 785 has two or more types of data, one data agent 795 is generally used for each data type to archive, migrate, and restore the client computer 785 data. For example, to backup, migrate, and restore all of the data on a MICROSOFT EXCHANGE 2000 server, client computer 785 would use one MICROSOFT EXCHANGE 2000 Mailbox data agent 795 to backup the Exchange 2000 mailboxes, one MICROSOFT EXCHANGE 2000 Database data agent 795 to backup the Exchange 2000 databases, one MICROSOFT EXCHANGE 2000 Public Folder data agent 795 to backup the Exchange 2000 Public Folders, and one MICROSOFT WINDOWS 2000 File System data agent 795 to backup the file system. These data agents 795 would be treated as four separate data agents 795 by system 700 even though they reside on the same client computer 785.
[0058] Each media management component 705 maintains an index cache 710 which stores index data the system generates during storage operations as further described herein. For example, storage operations for MICROSOFT EXCHANGE generate index data. Index data includes, for example, information regarding the location of the stored data on a particular media, information regarding the content of the data stored such as file names, sizes, creation dates, formats, application types, and other file-related criteria, information regarding one or more clients associated with the data stored, information regarding one or more storage policies, storage criteria, or storage preferences associated with the data stored, compression information, retention-related information, encryption-related information, stream-related information, and other types of information. Index data thus provides the system with an efficient mechanism for performing storage operations including locating user files for recovery operations and for managing and tracking stored data.
[0059] The system generally maintains two copies of the index data regarding particular stored data. A first copy is generally stored with the data copied to a storage device 715. Thus, a tape may contain the stored data as well as index information related to the stored data. In the event of a system restore, the index data stored with the stored data can be used to rebuild a media management component index 705 or other index useful in performing storage operations. In addition, the media management component 705 that controls the storage operation also generally writes an additional copy of the index data to its index cache 710. The data in the media management component index cache 710 is generally stored on faster media, such as magnetic media, and is thus readily available to the system for use in storage operations and other activities without having to be first retrieved from the storage device 715.
[0060] The storage manager 720 also maintains an index cache 730. Storage manager index cache 730 is used to indicate, track, and associate logical relationships and associations between components of the system, user preferences, management tasks, and other useful data. For example, the storage manager 720 might use its index cache 730 to track logical associations between media management components 705 and storage devices 715. The storage manager 720 may also use its index cache 730 to track the status of storage operations to be performed, storage patterns associated with the system components such as media use, storage growth, network bandwidth, service level agreement (“SLA”) compliance levels, data protection levels, storage policy information, storage criteria associated with user preferences, retention criteria, storage operation preferences, and other storage-related information. Index caches 730 and 710 typically reside on their corresponding storage component's hard disk or other fixed storage device. For example, the media management component 705 of a storage manager component 720 may retrieve storage manager index cache 710 data regarding a storage policy and storage operation to be performed or scheduled for a particular client 785. The media management component 705, either directly or via some interface module, communicates with the data agent 795 at the client 785 regarding the storage operation.
[0061] Jobs agent 740 may also retrieve from the index cache 730 a storage policy (not shown) associated with the client 785 and use information from the storage policy to communicate to the data agent 795 one or more media management components 705 associated with performing storage operations for that particular client 785 as well as other information regarding the storage operation to be performed such as retention criteria, encryption criteria, streaming criteria, etc. The data agent 795 then packages or otherwise manipulates the client data stored in the client production data store 790 in accordance with the storage policy information and/or according to a user preference, and communicates this client data to the appropriate media management component(s) 705 for processing. The media management component(s) 705 store the data according to storage preferences associated with the storage policy including storing the generated index data with the stored data, as well as storing a copy of the generated index data in the media management component index cache 710.
[0062] While the invention has been described and illustrated in connection with preferred embodiments, many variations and modifications as will be evident to those skilled in this art may be made without departing from the spirit and scope of the invention, and the invention is thus not to be limited to the precise details of methodology or construction set forth above as such variations and modification are intended to be included within the scope of the invention.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A method which, when executed on a computer, stores data in a tiered storage system, the method comprising:
accessing a storage policy associated with a tiered data storage system, wherein the storage policy defines a timing storage policy for copying source data from a data source to at least two storage media destinations in the tiered data storage system;
dividing the source data into a plurality of portions, and assigning a plurality of headers to the plurality of portions by one or more media management components, wherein one or more of the headers comprises time information, the time information based on the timing storage policy, wherein the one or more media management components access and read the time information to determine a time to perform one or more storage operations;
copying with the one or more media management components the plurality of portions, according to the time information in said headers, to a first storage media destination to produce the first auxiliary copy of the source data at a first storage media destination; and
copying with the one or more media management components the plurality of portions according to said headers from the first auxiliary copy to the second storage media destination to produce a second auxiliary copy of the source data at a second storage media destination.
2. The method of claim 1, comprising monitoring the copying of the plurality of portions to the first storage media destination.
3. The method of claim 2, comprising monitoring the copying of the plurality of portions to the second storage media destination.
4. The method of claim 1, comprising: determining that an interruption occurred in the production of the first auxiliary copy or the secondary auxiliary copy; completing the production of the uninterrupted copy; and thereafter, when the interruption is resolved, completing the interrupted production of the first auxiliary copy or the second auxiliary copy.
5. The method of claim 1, wherein copying the plurality of portions to the first and second storage media destinations comprises formatting the plurality of portions in a first format based on a media type of the first storage media destination and formatting the plurality of portions in a second format based on the a media type of the second storage media destination.
6. The method of claim 1, wherein said copying the source data further comprises performing compression on the source data.
7. The method of claim 1, wherein said copying the source data further comprises performing encryption on the source data.
8. The method of claim 1, further comprising: determining when the first auxiliary copy is about to be deleted; and performing a copy of the first auxiliary copy to a third storage media destination.
9. A computer storage system comprising:
a storage manager component executing in one or more computer processors to access a storage policy associated with a tiered data storage system, wherein the storage policy defines a timing storage policy for copying source data from a data source to at least two storage media destinations in the tiered data storage system;
a plurality of headers associated with a plurality of portions of the source data, wherein one or more of the headers comprises time information associated with the timing storage policy regarding a time to perform one or more storage operations, the time information assigned by one or more media management components;
the one or more media management components executing in one or more computer processors that access and read the time information in the headers to determine the time to perform one or more storage operations, and wherein one or more of the media management components directs copying of the plurality of portions, according to the time information in the headers, to the first storage media destination to produce a first auxiliary copy of the source data; and
a transfer stream configured to stream one or more portions of the first auxiliary copy to the second storage media destination according to the headers to produce a second auxiliary copy of the source data.
10. The system of claim 9, comprising a monitoring module executing in one or more processors adapted to monitor the copying of the plurality of portions to the first storage media destination.
11. The system of claim 10, wherein the monitoring module is further adapted to monitor the copying of the portions of the first auxiliary copy to the second storage media destination.
12. The system of claim 9, comprising one or more computer processors configured to determine that an interruption occurred in the copying of the auxiliary copy or the second auxiliary copy, to complete the copying of the uninterrupted copy, and thereafter, when the interruption is resolved, to complete the interrupted copying of the first auxiliary copy or the second auxiliary copy.
13. The system of claim 9, wherein the media management component is further configured to format the plurality of portions in a first format based on a media type of the first storage media destination and format the plurality of portions in a second format based on the a media type of the second storage media destination.
14. The system of claim 9, wherein the media management component is further adapted to determine when the first auxiliary copy is about to be deleted, and perform a copy of the first auxiliary coy to a third storage media destination.
15. The system of claim 9, wherein the information is further associated with a time to produce the second auxiliary copy.
Patent Citations (268)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4686620(A) | 1987-08-01 | Ng | Applicant |
| US4995035(A) | 1991-02-01 | Cole et al. | Applicant |
| US5005122(A) | 1991-04-01 | Griffin et al. | Applicant |
| US5093912(A) | 1992-03-01 | Dong et al. | Applicant |
| US5133065(A) | 1992-07-01 | Cheffetz et al. | Applicant |
| US5193154(A) | 1993-03-01 | Kitajima et al. | Applicant |
| US5212772(A) | 1993-05-01 | Masters | Applicant |
| US5226157(A) | 1993-07-01 | Nakano et al. | Applicant |
| US5239647(A) | 1993-08-01 | Anglin et al. | Applicant |
| US5241668(A) | 1993-08-01 | Eastridge et al. | Applicant |
| US5241670(A) | 1993-08-01 | Eastridge et al. | Applicant |
| US5276860(A) | 1994-01-01 | Fortier et al. | Applicant |
| US5276867(A) | 1994-01-01 | Kenley et al. | Applicant |
| US5287500(A) | 1994-02-01 | Stoppani, Jr. | Applicant |
| US5301310(A) | 1994-04-01 | Isman et al. | Applicant |
| US5321816(A) | 1994-06-01 | Rogan et al. | Applicant |
| US5333315(A) | 1994-07-01 | Saether et al. | Applicant |
| US5347653(A) | 1994-09-01 | Flynn et al. | Applicant |
| US5388243(A) | 1995-02-01 | Glider et al. | Applicant |
| US5410700(A) | 1995-04-01 | Fecteau et al. | Applicant |
| US5448724(A) | 1995-09-01 | Hayashi et al. | Applicant |
| US5465359(A) | 1995-11-01 | Allen et al. | Applicant |
| US5491810(A) | 1996-02-01 | Allen | Applicant |
| US5495607(A) | 1996-02-01 | Pisello et al. | Applicant |
| US5504873(A) | 1996-04-01 | Martin et al. | Applicant |
| US5544345(A) | 1996-08-01 | Carpenter et al. | Applicant |
| US5544347(A) | 1996-08-01 | Yanai et al. | Applicant |
| US5559957(A) | 1996-09-01 | Balk | Applicant |
| US5619644(A) | 1997-04-01 | Crockett et al. | Applicant |
| US5633999(A) | 1997-05-01 | Clowes et al. | Applicant |
| US5638509(A) | 1997-06-01 | Dunphy et al. | Applicant |
| US5659743(A) | 1997-08-01 | Adams et al. | Applicant |
| US5673381(A) | 1997-09-01 | Huai et al. | Applicant |
| US5699361(A) | 1997-12-01 | Ding et al. | Applicant |
| US5729743(A) | 1998-03-01 | Squibb | Applicant |
| US5737747(A) | 1998-04-01 | Vishlitsky et al. | Applicant |
| US5751997(A) | 1998-05-01 | Kullick et al. | Applicant |
| US5758359(A) | 1998-05-01 | Saxon | Applicant |
| US5761677(A) | 1998-06-01 | Senator et al. | Applicant |
| US5764972(A) | 1998-06-01 | Crouse et al. | Applicant |
| US5778395(A) | 1998-07-01 | Whiting et al. | Applicant |
| US5812398(A) | 1998-09-01 | Nielsen | Applicant |
| US5813008(A) | 1998-09-01 | Benson et al. | Applicant |
| US5813009(A) | 1998-09-01 | Johnson et al. | Applicant |
| US5813017(A) | 1998-09-01 | Morris | Applicant |
| US5829023(A) | 1998-10-01 | Bishop | Applicant |
| US5829046(A) | 1998-10-01 | Tzelnic et al. | Applicant |
| US5875478(A) | 1999-02-01 | Blumenau | Applicant |
| US5875481(A) | 1999-02-01 | Ashton et al. | Applicant |
| US5887134(A) | 1999-03-01 | Ebrahim | Applicant |
| US5890159(A) | 1999-03-01 | Sealby et al. | Applicant |
| US5901327(A) | 1999-05-01 | Ofek | Applicant |
| US5924102(A) | 1999-07-01 | Perks | Applicant |
| US5950205(A) | 1999-09-01 | Aviani, Jr. | Applicant |
| US5958005(A) | 1999-09-01 | Thorne et al. | Applicant |
| US5974563(A) | 1999-10-01 | Beeler, Jr. | Applicant |
| US6021415(A) | 2000-02-01 | Cannon et al. | Applicant |
| US6026414(A) | 2000-02-01 | Anglin | Applicant |
| US6035306(A) | 2000-03-01 | Lowenthal et al. | Applicant |
| US6052735(A) | 2000-04-01 | Ulrich et al. | Applicant |
| US6076148(A) | 2000-06-01 | Kedem et al. | Applicant |
| US6094416(A) | 2000-07-01 | Ying | Applicant |
| US6105136(A) | 2000-08-01 | Cromer et al. | Applicant |
| US6128750(A) | 2000-10-01 | Espy | Applicant |
| US6131095(A) | 2000-10-01 | Low et al. | Applicant |
| US6131190(A) | 2000-10-01 | Sidwell | Applicant |
| US6137864(A) | 2000-10-01 | Yaker | Applicant |
| US6148412(A) | 2000-11-01 | Cannon et al. | Applicant |
| US6154787(A) | 2000-11-01 | Urevig et al. | Applicant |
| US6154852(A) | 2000-11-01 | Amundson et al. | Applicant |
| US6161111(A) | 2000-12-01 | Mutalik et al. | Applicant |
| US6167402(A) | 2000-12-01 | Yeager | Applicant |
| US6175829(B1) | 2001-01-01 | Li et al. | Applicant |
| US6212512(B1) | 2001-04-01 | Barney et al. | Applicant |
| US6260069(B1) | 2001-07-01 | Anglin | Applicant |
| US6269431(B1) | 2001-07-01 | Dunham | Applicant |
| US6275953(B1) | 2001-08-01 | Vahalia et al. | Applicant |
| US6295541(B1) | 2001-09-01 | Bodnar et al. | Applicant |
| US6301592(B1) | 2001-10-01 | Aoyama et al. | Applicant |
| US6304880(B1) | 2001-10-01 | Kishi | Applicant |
| US6324581(B1) | 2001-11-01 | Xu et al. | Applicant |
| US6328766(B1) | 2001-12-01 | Long | Applicant |
| US6330570(B1) | 2001-12-01 | Crighton | Applicant |
| US6330572(B1) | 2001-12-01 | Sitka | Applicant |
| US6330642(B1) | 2001-12-01 | Carteau | Applicant |
| US6343324(B1) | 2002-01-01 | Hubis et al. | Applicant |
| US6343342(B1) | 2002-01-01 | Carlson | Applicant |
| US6350199(B1) | 2002-02-01 | Williams et al. | Applicant |
| USRE37601(E) | 2002-03-01 | Eastridge et al. | Applicant |
| US6353878(B1) | 2002-03-01 | Dunham | Applicant |
| US6356801(B1) | 2002-03-01 | Goodman et al. | Applicant |
| US6374266(B1) | 2002-04-01 | Shnelvar | Applicant |
| US6374336(B1) | 2002-04-01 | Peters et al. | Applicant |
| US6385673(B1) | 2002-05-01 | DeMoney | Applicant |
| US6389432(B1) | 2002-05-01 | Pothapragada et al. | Applicant |
| US6418478(B1) | 2002-07-01 | Ignatius et al. | Applicant |
| US6421711(B1) | 2002-07-01 | Blumenau et al. | Applicant |
| US6438586(B1) | 2002-08-01 | Hass et al. | Applicant |
| US6487561(B1) | 2002-11-01 | Ofek et al. | Applicant |
| US6487644(B1) | 2002-11-01 | Huebsch et al. | Applicant |
| US6505307(B1) | 2003-01-01 | Stell et al. | Applicant |
| US6519679(B2) | 2003-02-01 | Devireddy et al. | Applicant |
| US6538669(B1) | 2003-03-01 | Lagueux, Jr. et al. | Applicant |
| US6542909(B1) | 2003-04-01 | Tamer et al. | Applicant |
| US6542972(B2) | 2003-04-01 | Ignatius et al. | Applicant |
| US6564228(B1) | 2003-05-01 | O'Connor | Applicant |
| US6571310(B1) | 2003-05-01 | Ottesen | Applicant |
| US6581143(B2) | 2003-06-01 | Gagne et al. | Applicant |
| US6631442(B1) | 2003-10-01 | Blumenau | Applicant |
| US6631493(B2) | 2003-10-01 | Ottesen et al. | Applicant |
| US6647396(B2) | 2003-11-01 | Parnell et al. | Applicant |
| US6658436(B2) | 2003-12-01 | Oshinsky et al. | Applicant |
| US6658526(B2) | 2003-12-01 | Nguyen et al. | Applicant |
| US6665740(B1) | 2003-12-01 | Mason et al. | Applicant |
| US6732124(B1) | 2004-05-01 | Koseki et al. | Applicant |
| US6757794(B2) | 2004-06-01 | Cabrera et al. | Applicant |
| US6763351(B1) | 2004-07-01 | Subramaniam et al. | Applicant |
| US6789161(B1) | 2004-09-01 | Blendermann et al. | Applicant |
| US6791910(B1) | 2004-09-01 | James et al. | Applicant |
| US6832186(B1) | 2004-12-01 | Margulieux | Applicant |
| US6859758(B1) | 2005-02-01 | Prabhakaran et al. | Applicant |
| US6871163(B2) | 2005-03-01 | Hiller et al. | Applicant |
| US6880052(B2) | 2005-04-01 | Lubbers et al. | Applicant |
| US6941396(B1) | 2005-09-01 | Thorpe et al. | Applicant |
| US6952758(B2) | 2005-10-01 | Chron et al. | Applicant |
| US6965968(B1) | 2005-11-01 | Touboul et al. | Applicant |
| US6968351(B2) | 2005-11-01 | Butterworth | Applicant |
| US6973553(B1) | 2005-12-01 | Archibald, Jr. et al. | Applicant |
| US6983277(B2) | 2006-01-01 | Yamaguchi et al. | Applicant |
| US6983351(B2) | 2006-01-01 | Gibble et al. | Applicant |
| US7003519(B1) | 2006-02-01 | Biettron et al. | Applicant |
| US7003641(B2) | 2006-02-01 | Prahlad et al. | Applicant |
| US7035880(B1) | 2006-04-01 | Crescenti et al. | Applicant |
| US7062761(B2) | 2006-06-01 | Slavin et al. | Applicant |
| US7069380(B2) | 2006-06-01 | Ogawa et al. | Applicant |
| US7085904(B2) | 2006-08-01 | Mizuno et al. | Applicant |
| US7103731(B2) | 2006-09-01 | Gibble et al. | Applicant |
| US7103740(B1) | 2006-09-01 | Colgrove et al. | Applicant |
| US7107298(B2) | 2006-09-01 | Prahlad et al. | Applicant |
| US7107395(B1) | 2006-09-01 | Ofek et al. | Applicant |
| US7117246(B2) | 2006-10-01 | Christenson et al. | Applicant |
| US7120757(B2) | 2006-10-01 | Tsuge | Applicant |
| US7130970(B2) | 2006-10-01 | Devassy et al. | Applicant |
| US7155465(B2) | 2006-12-01 | Lee et al. | Applicant |
| US7155633(B2) | 2006-12-01 | Tuma et al. | Examiner |
| US7159110(B2) | 2007-01-01 | Douceur et al. | Applicant |
| US7162496(B2) | 2007-01-01 | Amarendran et al. | Applicant |
| US7173929(B1) | 2007-02-01 | Testardi | Applicant |
| US7174433(B2) | 2007-02-01 | Kottomtharayil et al. | Applicant |
| US7246140(B2) | 2007-07-01 | Therrien et al. | Applicant |
| US7246207(B2) | 2007-07-01 | Kottomtharayil et al. | Applicant |
| US7246272(B2) | 2007-07-01 | Cabezas et al. | Applicant |
| US7249357(B2) | 2007-07-01 | Landman et al. | Applicant |
| US7251708(B1) | 2007-07-01 | Justiss et al. | Examiner |
| US7257257(B2) | 2007-08-01 | Anderson et al. | Applicant |
| US7269612(B2) | 2007-09-01 | Devarakonda et al. | Applicant |
| US7272606(B2) | 2007-09-01 | Borthakur et al. | Applicant |
| US7278142(B2) | 2007-10-01 | Bandhole et al. | Applicant |
| US7287047(B2) | 2007-10-01 | Kavuri | Applicant |
| US7287252(B2) | 2007-10-01 | Bussiere et al. | Applicant |
| US7293133(B1) | 2007-11-01 | Colgrove et al. | Applicant |
| US7315807(B1) | 2008-01-01 | Lavallee et al. | Applicant |
| US7346623(B2) | 2008-03-01 | Prahlad et al. | Applicant |
| US7359917(B2) | 2008-04-01 | Winter et al. | Applicant |
| US7380014(B2) | 2008-05-01 | LeCroy et al. | Applicant |
| US7380072(B2) | 2008-05-01 | Kottomtharayil et al. | Applicant |
| US7383462(B2) | 2008-06-01 | Osaki et al. | Applicant |
| US7409509(B2) | 2008-08-01 | Devassy et al. | Applicant |
| US7434090(B2) | 2008-10-01 | Hartung et al. | Applicant |
| US7447149(B1) | 2008-11-01 | Beesley et al. | Applicant |
| US7448079(B2) | 2008-11-01 | Tremain | Applicant |
| US7454569(B2) | 2008-11-01 | Kavuri et al. | Applicant |
| US7467167(B2) | 2008-12-01 | Patterson | Applicant |
| US7472238(B1) | 2008-12-01 | Gokhale | Applicant |
| US7484054(B2) | 2009-01-01 | Kottomtharayil et al. | Applicant |
| US7490207(B2) | 2009-02-01 | Amarendran | Applicant |
| US7496492(B2) | 2009-02-01 | Dai | Applicant |
| US7500053(B1) | 2009-03-01 | Kavuri et al. | Applicant |
| US7500150(B2) | 2009-03-01 | Sharma et al. | Applicant |
| US7519726(B2) | 2009-04-01 | Palliyil et al. | Applicant |
| US7523483(B2) | 2009-04-01 | Dogan | Applicant |
| US7529748(B2) | 2009-05-01 | Wen et al. | Applicant |
| US7536291(B1) | 2009-05-01 | Retnamma et al. | Applicant |
| US7552294(B1) | 2009-06-01 | Justiss | Applicant |
| US7596586(B2) | 2009-09-01 | Gokhale et al. | Applicant |
| US7613748(B2) | 2009-11-01 | Brockway et al. | Applicant |
| US7627598(B1) | 2009-12-01 | Burke | Applicant |
| US7627617(B2) | 2009-12-01 | Kavuri et al. | Applicant |
| US7631194(B2) | 2009-12-01 | Wahlert et al. | Applicant |
| US7685126(B2) | 2010-03-01 | Patel et al. | Applicant |
| US7739459(B2) | 2010-06-01 | Kottomtharayil et al. | Applicant |
| US7765369(B1) | 2010-07-01 | Prahlad et al. | Applicant |
| US7769961(B2) | 2010-08-01 | Kottomtharayil et al. | Applicant |
| US7809914(B2) | 2010-10-01 | Kottomtharayil et al. | Applicant |
| US7827363(B2) | 2010-11-01 | Devassy et al. | Applicant |
| US7831553(B2) | 2010-11-01 | Prahlad et al. | Applicant |
| US7840537(B2) | 2010-11-01 | Gokhale et al. | Applicant |
| US7849266(B2) | 2010-12-01 | Kavuri et al. | Applicant |
| US7873802(B2) | 2011-01-01 | Gokhale et al. | Applicant |
| US7949512(B2) | 2011-05-01 | Vijayan Retnamma et al. | Applicant |
| US7958307(B2) | 2011-06-01 | Kavuri et al. | Applicant |
| US2002/0029281(A1) | 2002-03-01 | Zeidner et al. | Applicant |
| US2002/0040405(A1) | 2002-04-01 | Gold | Applicant |
| US2002/0049778(A1) | 2002-04-01 | Bell et al. | Applicant |
| US2002/0107877(A1) | 2002-08-01 | Whiting et al. | Applicant |
| US2002/0122543(A1) | 2002-09-01 | Rowen | Examiner |
| US2002/0157113(A1) | 2002-10-01 | Allegrezza | Applicant |
| US2002/0188592(A1) | 2002-12-01 | Leonhardt et al. | Applicant |
| US2002/0194340(A1) | 2002-12-01 | Ebstyne et al. | Applicant |
| US2003/0014433(A1) | 2003-01-01 | Teloh et al. | Applicant |
| US2003/0016609(A1) | 2003-01-01 | Rushton et al. | Applicant |
| US2003/0061491(A1) | 2003-03-01 | Jaskiewicz et al. | Applicant |
| US2003/0099237(A1) | 2003-05-01 | Mitra et al. | Applicant |
| US2003/0126361(A1) | 2003-07-01 | Slater et al. | Applicant |
| US2003/0169733(A1) | 2003-09-01 | Gurkowski et al. | Applicant |
| US2003/0204700(A1) | 2003-10-01 | Biessener et al. | Applicant |
| US2004/0010523(A1) | 2004-01-01 | Wu et al. | Applicant |
| US2004/0073716(A1) | 2004-04-01 | Boom et al. | Applicant |
| US2004/0088432(A1) | 2004-05-01 | Hubbard et al. | Applicant |
| US2004/0098547(A1) | 2004-05-01 | Ofek et al. | Applicant |
| US2004/0107199(A1) | 2004-06-01 | Dairymple et al. | Applicant |
| US2004/0193397(A1) | 2004-09-01 | Lumb et al. | Applicant |
| US2004/0193953(A1) | 2004-09-01 | Callahan et al. | Applicant |
| US2005/0033756(A1) | 2005-02-01 | Kottomtharayil et al. | Applicant |
| US2005/0080992(A1) | 2005-04-01 | Massey et al. | Applicant |
| US2005/0114477(A1) | 2005-05-01 | Willging et al. | Applicant |
| US2005/0166011(A1) | 2005-07-01 | Burnett et al. | Applicant |
| US2005/0172093(A1) | 2005-08-01 | Jain | Applicant |
| US2005/0246568(A1) | 2005-11-01 | Davies | Applicant |
| US2005/0256972(A1) | 2005-11-01 | Cochran et al. | Applicant |
| US2005/0262296(A1) | 2005-11-01 | Peake | Applicant |
| US2006/0005048(A1) | 2006-01-01 | Osaki et al. | Applicant |
| US2006/0010227(A1) | 2006-01-01 | Atluri | Applicant |
| US2006/0020569(A1) | 2006-01-01 | Goodman et al. | Applicant |
| US2006/0044674(A1) | 2006-03-01 | Martin et al. | Applicant |
| US2006/0224846(A1) | 2006-10-01 | Amarendran et al. | Applicant |
| US2007/0288536(A1) | 2007-12-01 | Sen et al. | Applicant |
| US2008/0059515(A1) | 2008-03-01 | Fulton | Applicant |
| US2008/0229037(A1) | 2008-09-01 | Bunte et al. | Applicant |
| US2008/0243914(A1) | 2008-10-01 | Prahlad et al. | Applicant |
| US2008/0243957(A1) | 2008-10-01 | Prahlad et al. | Applicant |
| US2008/0243958(A1) | 2008-10-01 | Prahlad et al. | Applicant |
| US2009/0187711(A1) | 2009-07-01 | Amarendran et al. | Applicant |
| US2009/0319534(A1) | 2009-12-01 | Gokhale | Applicant |
| US2009/0319585(A1) | 2009-12-01 | Gokhale | Applicant |
| US2010/0005259(A1) | 2010-01-01 | Prahlad et al. | Applicant |
| US2010/0017184(A1) | 2010-01-01 | Retnamma et al. | Applicant |
| US2010/0131461(A1) | 2010-05-01 | Prahlad et al. | Applicant |
| US2010/0287234(A1) | 2010-11-01 | Kottomtharayil et al. | Applicant |
| US2011/0010440(A1) | 2011-01-01 | Kottomtharayil et al. | Applicant |
| US2011/0040799(A1) | 2011-02-01 | Devassy et al. | Applicant |
| EP259912 | 1988-03-01 | Applicant | |
| EP405926 | 1991-01-01 | Applicant | |
| EP467546 | 1992-01-01 | Applicant | |
| EP774715 | 1997-05-01 | Applicant | |
| EP809184 | 1997-11-01 | Applicant | |
| EP899662 | 1999-03-01 | Applicant | |
| EP981090 | 2000-02-01 | Applicant | |
| EP1174795 | 2002-01-01 | Applicant | |
| EP1115064 | 2004-12-01 | Applicant | |
| GB2366048 | 2002-02-01 | Applicant | |
| WO91/14229(A1) | 1991-09-01 | Applicant | |
| WO95/13580 | 1995-05-01 | Applicant | |
| WO99/12098 | 1999-03-01 | Applicant | |
| WO99/14692 | 1999-03-01 | Applicant | |
| WO99/17204 | 1999-04-01 | Applicant | |
| WO2004/090788 | 2004-10-01 | Applicant | |
| WO2005/055093 | 2005-06-01 | Applicant |
Non-Patent Literature (45)
- International Search Report, PCT/US2005/040606, dated Feb. 14, 2007.Applicant
- U.S. Appl. No. 13/272,706, filed Oct. 13, 2011, Varghese Devassy, et al., Systems and Methods for Allocating Control of Storage Media in a Network Environment.Applicant
- U.S. Appl. No. 10/819,101, filed Apr. 5, 2004, Kottomtharayil et al., System and Method for Dynamically Sharing Storage Volumes in a Computer Network, Abandoned.Applicant
- U.S. Appl. No. 11/269,512, filed Nov. 7, 2005, Amarendran, et al., System and Method To Support Single Instance Storage Operations, Now Abandoned.Applicant
- U.S. Appl. No. 11/269,513, filed Nov. 7, 2005, Prahlad, et al., Method and System for Monitoring a Storage Network.Applicant
- U.S. Appl. No. 11/269,520, filed Nov. 7, 2005, Gokhale, et al., System and Method for Performing Multistream Storage Operations.Applicant
- U.S. Appl. No. 12/970,536, filed Dec. 16, 2010, Gokhale, et al., Systems and Methods for Recovering Electronic Information From a Storage Medium.Applicant
- U.S. Appl. No. 13/149,647, filed May 31, 2011, Kavuri, et al., Method and System for Grouping Storage System Components.Applicant
- U.S. Appl. No. 11/269,513, filed Nov. 7, 2005, Prahlad, et al.Applicant
- U.S. Appl. No. 11/269,520, filed Nov. 7, 2005, Gokhale, et al.Applicant
- U.S. Appl. No. 12/145,342, filed Jun. 24, 2008, Gokhale.Applicant
- U.S. Appl. No. 12/145,347, filed Jun. 24, 2008, Gokhale.Applicant
- U.S. Appl. No. 12/167,933, filed Jul. 3, 2008, Gokhale.Applicant
- Armstead et al., “Implementation of a Campus-Wide Distributed Mass Storage Service: The Dream vs. Reality,” IEEE, 1995, pp. 190-199.Applicant
- Arneson, “Development of Omniserver; Mass Storage Systems,” Control Data Corporation, 1990, pp. 88-93.Applicant
- Arneson, “Mass Storage Archiving in Network Environments” IEEE, 1998, pp. 45-50.Applicant
- 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.Applicant
- Cabrera, et al. “ADSM: A Multi-Platform, Scalable, Back-up and Archive Mass Storage System,” Digest of Papers, Compcon '95, Proceedings of the 40th IEEE Computer Society International Conference, Mar. 5, 1995-Mar. 9, 1995, pp. 420-427, San Francisco, CA.Applicant
- Canadian Office Action dated Feb. 9, 2009, Application No. CA2498174.Applicant
- Canadian Office Action dated May 30, 2008, Application No. CA2498174.Applicant
- Commvault Systems, Inc., Continuous Data Replicator 7.0, Product Data Sheet, 2007.Applicant
- Eitel, “Backup and Storage Management in Distributed Heterogeneous Environments,” IEEE, 1994, pp. 124-126.Applicant
- Farley, “Building Storage Networks,” pp. 328-331, Osborne/McGraw-Hill, 2000.Applicant
- First Examination Report in EU Application No. 04 758 913.0-2413 dated Nov. 21, 2008.Applicant
- 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).Applicant
- Gibson, “Network Attached Storage Architecture,” pp. 37-45, ACM, Nov. 2000.Applicant
- Great Britain Office Action dated Apr. 4, 2008, Application No. GB/07071772.Applicant
- Great Britain Office Action dated Aug. 3, 2006, Application No. GB/0507268.1.Applicant
- Great Britain Office Action dated Nov. 2, 2007, Application No. GB/07071772.Applicant
- http://en.wikipedia.org/wiki/Naive—Bayes—classifier, printed on Jun. 1, 2010, in 7 pages.Applicant
- Indian Office Action dated May 29, 2008, Application No. 60/CHENP/2005-AR.Applicant
- International Search Report and Preliminary Report on Patentability dated Sep. 22, 2004, PCT/US2004/010504.Applicant
- International Search Report and Preliminary Report on Patentability dated Dec. 3, 2003, PCT/US2003/028319.Applicant
- International Search Report and Written Opinion dated Nov. 13, 2009, PCT/US2007/081681.Applicant
- International Search Report dated Sep. 20, 2004, PCT/US2004/010503.Applicant
- International Search Report from International Application No. PCT/US05/40656, dated Mar. 1, 2007; 1 page.Applicant
- Jander, “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4(Mar. 21, 1998), pp. 64-72.Applicant
- Office Action in Canadian Application No. 2,520,498 issued Jun. 15, 2011.Applicant
- Office Action in Israeli Application No. 171121 issued Feb. 13, 2011.Applicant
- Recycle Bin (Windows), Aug. 2007, Wikipedia, pp. 1-3.Applicant
- Rosenblum et al., “The Design and Implementation of a Log-Structure File System,” Operating Systems Review SIGOPS, vol. 25, No. 5, New York, US, pp. 1-15 (May 1991).Applicant
- Second Examination Report in EU Application 04 758 913.0-2413 dated May 26, 2010.Applicant
- Szor, The Art of Virus Research and Defense, Symantec Press (2005) ISBN 0-321-30454-3.Applicant
- Witten et al., Data Mining: Practical Machine Learning Tools and Techniques, Ian H. Witten & Eibe Frank, Elsevier (2005) ISBN 0-12-088407-0.Applicant
- Written Opinion; International Application No. PCT/US05/40606; mailed Feb. 14, 2007; 5 pages.Applicant