Systems and methods for performing storage operations in a computer network

Information

  • Patent Grant
  • 9940043
  • Patent Number
    9,940,043
  • Date Filed
    Wednesday, October 28, 2015
    9 years ago
  • Date Issued
    Tuesday, April 10, 2018
    6 years ago
Abstract
Methods and systems are described for performing storage operations on electronic data in a network. In response to the initiation of a storage operation and according to a first set of selection logic, a media management component is selected to manage the storage operation. In response to the initiation of a storage operation and according to a second set of selection logic, a network storage device to associate with the storage operation. The selected media management component and the selected network storage device perform the storage operation on the electronic data.
Description
CROSS-REFERENCE TO RELATED APPLICATIONS

Any and all priority claims identified in the Application Data Sheet, or any correction thereto, are hereby incorporated by reference under 37 CFR 1.57.


This application is also related to the following patents and application, each of which is hereby incorporated herein by reference in its entirety:

    • U.S. Pat. No. 6,418,478, titled PIPELINED HIGH SPEED DATA TRANSFER MECHANISM, issued Jul. 9, 2002;
    • U.S. Pat. No. 7,035,880, titled MODULAR BACKUP AND RETRIEVAL SYSTEM USED IN CONJUNCTION WITH A STORAGE AREA NETWORK, issued Apr. 25, 2006;
    • U.S. Pat. No. 6,542,972, titled LOGICAL VIEW AND ACCESS TO PHYSICAL STORAGE IN MODULAR DATA AND STORAGE MANAGEMENT SYSTEM, issued Apr. 1, 2003; and
    • U.S. Provisional Patent Application No. 60/409,183, titled DYNAMIC STORAGE DEVICE POOLING IN A COMPUTER SYSTEM, filed Sep. 9, 2002.


COPYRIGHT NOTICE

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.


BACKGROUND OF THE INVENTION

Field of the Invention


The invention disclosed herein relates generally to performing storage operations on electronic data in a computer network. More particularly, the present invention relates to selecting, in response to the initiation of a storage operation and according to selection logic, a media management component and a network storage device to perform storage operations on electronic data.


Description of the Related Art


Storage of electronic data has evolved through many forms. During the early development of the computer, storage of this data was limited to individual computers. Electronic data was stored in the Random Access Memory (RAM) or some other storage medium such as a hard drive or tape drive that was an actual part of the individual computer.


Later, with the advent of networked computing, storage of electronic data gradually migrated from the individual computer to stand-alone storage devices accessible via a network. These individual network storage devices soon evolved in the form of networkable tape drives, optical libraries, Redundant Arrays of Inexpensive Disks (RAID), CD-ROM jukeboxes, and other devices. Common architectures included drive pools, which generally are logical collections of drives with associated media groups including the tapes or other storage media used by a given drive pool.


Serial, parallel, Small Computer System Interface (SCSI), or other cables, directly connected these stand-alone storage devices to individual computers that were part of a network of other computers such as a Local Area Network (LAN) or a Wide Area Network (WAN). Each individual computer on the network controlled the storage devices that were physically attached to that computer and could also access the storage devices of the other network computers to perform backups, transaction processing, file sharing, and other storage-related operations.


Network Attached Storage (NAS) is another storage scheme using stand-alone storage devices in a LAN or other such network. In NAS, a storage controller computer still “owns” the storage device to the exclusion of other computers on the network, but the SCSI or other cabling directly connecting that storage device to the individual controller or owner computer is eliminated. Instead, storage devices are directly attached to the network itself.


Yet another network storage scheme is modular storage architecture which is more fully described in application Ser. No. 09/610,738, now U.S. Pat. No. 7,035,880, issued Apr. 25, 2006, and application Ser. No. 09/774,268, now U.S. Pat. No. 6,542,972, issued Apr. 1, 2003. An example of such a software application is the Galaxy™ system, by CommVault Systems of Oceanport, N.J. The Galaxy™ system is a multi-tiered storage management solution which includes, among other components, a storage manager, one or more media agents, and one or more storage devices. The storage manager directs storage operations of client data to storage devices such magnetic and optical media libraries. Media agents are storage controller computers that serve as intermediary devices managing the flow of data from client information stores to individual storage devices. Each storage device is uniquely associated with a particular media agent and this association is tracked by the storage manager.


A common feature shared by all of the above-described network architectures is the static relationship between storage controller computers and storage devices. In these traditional network architectures, storage devices can each only be connected, virtually or physically, to a single storage controller computer. Only the storage controller computer to which a particular device is physically connected has read/write access to that device. A drive pool and its associated media group, for example, can only be controlled by the computer to which it is directly connected. Therefore, all backup from other storage controller computers needs to be sent via the network before it can be stored on the storage device connected to the first storage controller computer.


At times, storage solutions in some of the above-described network architectures including LAN, NAS, and modular storage systems may cause overloading of network traffic during certain operations associated with use of storage devices on the network. The network cable has a limited amount of bandwidth that must be shared among all the computers on the network. The capacity of most LAN or network cabling is measured in megabits per second (mbps) with 10 mbps and 100 mbps being standard. During common operations such as system backups, transaction processing, file copies, and other similar operations, network traffic often becomes overloaded as hundreds of megabytes (MB) and gigabytes (GB) of information are sent over the network to the associated storage devices. The capacity of the network computers to stream data over the network to the associated storage devices in this manner is greater than the bandwidth capacity of the cabling itself so ordinary network activity and communication slows to a crawl. As long as the storage devices are attached to the LAN or other network, this bandwidth issue remains a problem.


The Storage Area Network (SAN) is a highly-evolved network architecture designed to facilitate transport of electronic data and address this bandwidth issue. SAN architecture requires at least two networks. First, there is the traditional network described above which is typically a LAN or other such network designed to transport ordinary traffic between network computers. Then, there is the SAN itself which is a second network that is attached to the servers of the first network. The SAN is a separate network generally reserved for bandwidth-intensive operations such as backups, transaction processing, and the like also described above. The cabling used in the SAN is usually of much higher bandwidth capacity than that used in the first network such as the LAN and the communication protocols used over the SAN cabling are optimized for bandwidth-intensive traffic. Most importantly, the storage devices used by the network computers for the bandwidth-intensive operations are attached to the SAN rather than the LAN. Thus, when the bandwidth-intensive operations are required, they take place over the SAN and the LAN remains unaffected.


CommVault's proprietary DataPipe™ mechanism further described in U.S. Pat. No. 6,418,478 is used with a SAN to further reduce bandwidth constraints. The DataPipe™ is the transport protocol used to facilitate and optimize electronic data transfers taking place over a Storage Area Network (SAN) as opposed to those taking place over a LAN using NAS.


None of these solutions, however, address the static relationship between individual storage controller computers and individual storage devices. LANs, WANs, and even SANs using a DataPipe™ all require a static relationship between storage controller computer and storage device since each storage device on the network is uniquely owned by a storage controller computer. As discussed, when a storage device in this traditional architecture is assigned to a storage controller computer, that storage controller computer owns the device indefinitely and to the exclusion of other computers on the network. This is also true with both logical and physical storage volumes. One computer cannot control the drive pool and media group being that is controlled by another. Requests to store and retrieve data from such a drive pool and media group would have to first pass through the controlling computer. Such a static relationship between storage controller computer and storage device often leads to an inefficient use of resources.


For example, if each storage controller computer needs access to two storage devices and there are five storage controller computers in the network, then a total of ten storage devices will be required. The actual amount of work each of the ten storage devices performs might be much less than the workload capacity of each storage device. Such underutilization of storage device resources cannot be solved when a static relationship is required between storage device and storage controller computer.


If the static relationship were dynamic, however, and storage controller computers could actually share devices, then this underutilization can be addressed. Assuming in the above example that each of the five storage controller computers only uses ten percent of each device's workload capacity, then if all the storage controller computers could actually share the same two storage devices, eight of the storage devices could be eliminated without loss of performance or capability.


Furthermore, none of these existing solutions provide access to storage devices in the event of a storage controller failure. For example, if a storage controller computer were unavailable due to a hardware or software malfunction, then other computers on the network would not be able to access data stored on any storage device associated with the storage controller computer. Until the storage controller computer was brought back online, the data contained on any associated storage device would be effectively unrecoverable. If the association between the storage controller computer and a storage device were not static, however, then another storage controller computer could bypass the unavailable storage controller computer and access the storage device to retrieve the data.


There is thus also a need for a system which enables dynamic association of storage controller computers and storage devices.


SUMMARY OF THE INVENTION

The present invention addresses, among other things, the problems discussed above performing storage operations on electronic data in a computer network.


In accordance with some aspects of the present invention, computerized methods are provided for dynamically selecting media agents and storage devices to perform storage operations on data. The system selects, in response to the initiation of a storage operation and according to a first set of selection logic, a media management component to manage the storage operation. The system also selects, in response to the initiation of the storage operation and according to a second set of selection logic, a network storage device to associate with the storage operation. Using the selected media management component and the selected network storage device, the system performs the storage operation on the data.


In another embodiment, the system provides a method for sharing a magnetic media volume in a network. The system, in response to a volume sharing request, removes an association between a first media management component and the magnetic media volume. For example, in some embodiments, the system removes an index entry associating a first media management component and the magnetic media volume. In response to a volume sharing request and according to a set of selection logic, the system associates a second media management component with the magnetic media volume. For example, in some embodiments the system creates an index entry associating the second media management component and the magnetic media volume. In other embodiments, the system mounts the magnetic media volume to the second media management component.





BRIEF DESCRIPTION OF THE DRAWINGS

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:



FIG. 1 is a block diagram of a network architecture for a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention;



FIG. 2 is a block diagram of an exemplary tape library storage device for a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention; and



FIG. 3 is a block diagram of an exemplary magnetic media storage device for a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention;



FIG. 4 is a flow chart of a method for performing storage operations on electronic data in a computer network according to an embodiment of the invention;



FIG. 5 is a flow chart of a method to archive electronic data in a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention;



FIG. 6 is a flow chart of a method for restoring or auxiliary copying electronic data in a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention;



FIG. 7 is a flow chart of a method to restore a storage index in a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention; and



FIG. 8 is a flow diagram of a method to perform dynamic volume sharing according to one embodiment of the invention;





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

With reference to FIGS. 1 through 7, embodiments of the invention are presented. FIG. 1 presents a block diagram of a network architecture for a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention. As shown, the system includes a storage manager 100 and one or more of the following: a client 85, an information store 90, a data agent 95, a media agent 105, an index cache 110, and a storage device 115. The system and elements thereof are exemplary of a three-tier backup system such as the CommVault Galaxy™ backup system, available from CommVault Systems, Inc. of Oceanport, N.J., and further described in application Ser. No. 09/610,738, now U.S. Pat. No. 7,035,880, issued Apr. 25, 2006, which is incorporated herein by reference in its entirety.


A data agent 95 is generally a software module that is generally responsible for archiving, migrating, and recovering data of a client computer 85 stored in an information store 90 or other memory location. Each client computer 85 has at least one data agent 95 and the system can support many client computers 85. The system provides a plurality of data agents 95 each of which is intended to backup, migrate, and recover data associated with a different application. For example, different individual data agents 95 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.


If a client computer 85 has two or more types of data, one data agent 95 is generally required for each data type to archive, migrate, and restore the client computer 85 data. For example, to backup, migrate, and restore all of the data on a Microsoft Exchange 2000™ server, the client computer 85 would use one Microsoft Exchange™ 2000 Mailbox data agent 95 to backup the Exchange 2000™ mailboxes, one Microsoft Exchange 2000™ Database data agent 95 to backup the Exchange 2000™ databases, one Microsoft Exchange 2000™ Public Folder data agent 95 to backup the Exchange 2000™ Public Folders, and one Microsoft Windows 2000™ File System data agent 95 to backup the client computer's 85 file system. These data agents 95 would be treated as four separate data agents 95 by the system even though they reside on the same client computer 85.


The storage manager 100 is generally a software module or application that coordinates and controls the system. The storage manager 100 communicates with all elements of the system including client computers 85, data agents 95, media agents 105, and storage devices 115, to initiate and manage system backups, migrations, and recoveries.


A media agent 105 is generally a software module that conducts data, as directed by the storage manager 100, between the client computer 85 and one or more storage devices 115 such as a tape library, a magnetic media storage device, an optical media storage device, or other storage device. The media agent 105 is communicatively coupled with and controls the storage device 115. For example, the media agent 105 might instruct the storage device 115 to use a robotic arm or other means to load or eject a media cartridge, and to archive, migrate, or restore application specific data. The media agent 105 generally communicates with the storage device 115 via a local bus such as a SCSI adaptor. In some embodiments, the storage device 115 is communicatively coupled to the data agent 105 via a Storage Area Network (“SAN”).


Each media agent 105 maintain an index cache 110 which stores index data the system generates during backup, migration, and restore storage operations as further described herein. For example, storage operations for Microsoft Exchange data generate index data. Index data provides the system with an efficient mechanism for locating user files for recovery operations. This index data is generally stored with the data backed up to the storage device 115, and the media agent 105 that controls the storage operation also writes an additional copy of the index data to its index cache 110. The data in the media agent 105 index cache 110 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 115.


The storage manager 100 also maintains an index cache 110. Index data is also used to indicate logical associations between components of the system, user preferences, management tasks, and other useful data. For example, the storage manager 100 might use its index cache 110 to track logical associations between media agents 105 and storage devices 115.


Index caches 110 typically reside on their corresponding storage component's hard disk or other fixed storage device. Like any cache, the index cache 110 has finite capacity and the amount of index data that can be maintained directly corresponds to the size of that portion of the disk that is allocated to the index cache 110. In one embodiment, the system manages the index cache 110 on a least recently used (“LRU”) basis as known in the art. When the capacity of the index cache 110 is reached, the system overwrites those files in the index cache 110 that have been least recently accessed with the new index data. In some embodiments, before data in the index cache 110 is overwritten, the data is copied to an index cache 110 copy in a storage device 115. If a recovery operation requires data that is no longer stored in the index cache 110, such as in the case of a cache miss, the system recovers the index data from the index cache 110 copy stored in the storage device 115.


In some embodiments, components of the system may reside and execute on the same computer. In some embodiments, a client computer 85 component such as a data agent 95, a media agent 105, or a storage manager 100 coordinates and directs local archiving, migration, and retrieval application functions as further described in application Ser. No. 09/610,738, now U.S. Pat. No. 7,035,880, issued Apr. 25, 2006. This client computer 85 component can function independently or together with other similar client computer 85 components.



FIG. 2 presents a block diagram of an exemplary tape library storage device 120 for a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention. The tape library storage device 120 contains tapes 145 and drives 125, 130, 135, and 140. The tapes 145 store electronic data containing backups of application data, user preferences, system information, and other useful information known in the art. Drives 125, 130, 135, and 140 are used to store and retrieve electronic data from the tapes 145. In some embodiments, drives 125, 130, 135, and 140 function as a drive pool, as further described in Application Ser. No. 60/409,183 which is hereby incorporated herein by reference in its entirety. A drive pool is generally a logical concept associated with a storage policy. Storage policies representing storage patterns and preferences are more fully discussed in application Ser. No. 09/774,268, now U.S. Pat. No. 6,542,972, issued Apr. 1, 2003, which is hereby incorporated by reference herein in its entirety.


The drive pool is identified by a set of drives within a tape library storage device 120 as pointed to by one or more media agents 105. For example, a drive pool known as DP1 consisting of drives 125 and 130 in tape library 120 known as LIB 1 could be associated by a storage policy with a first media agent 105 MA 1 in an index cache 110 entry as follows: LIB1/MA1/DP1. A second drive pool consisting of drives 130, 135, and 140 within the tape library storage device 120 associated with the same media agent 105 might be expressed in the index cache 110 as follows: LIB1/MA1/DP2.


Previously, however, drive pools had a static association with a particular media agent 105. A drive pool associated with a first media agent 105 could not be logically associated with a second drive pool associated with a second media agent 105. An index cache 110 entry associating a drive pool with a media agent 105 and other system components might, for example, specify a media library or media group, a media agent, and a drive pool. Only one of each component could be specified in a particular index cache 110 entry. Thus, such drive pools were logically exclusive and separate entries in an index cache 110 entry for a storage policy and could be logically represented as:

















LIB1/MA1/DP1



LIB1/MA2/DP2










As further described herein, the present invention permits logical association of drive pools associated with different media agents 105. Multiple drive pools, media agents, and other system components can be associated in a single index cache 110 entry. Thus, for example, an index cache 110 entry for a storage policy, according to the present invention, may combine the two previous entries instead and thus be logically represented as:

















LIB1/MA1/DP1/DP2



LIB1/MA2/DP2/DP1










In addition and as further described herein, tapes 145 are associated by the system with drive pools or storage policies, and not with individual drives 125, 130, 135, and 140. The recording format used to archive electronic data is a property of both its media group and its associated drive pool. A media group is a collection of tapes 145 or other storage media assigned to a specific storage policy. The media group dynamically points to different drive pools, even to those with different recording formats since the system updates the recording format of the media group in a media group table stored in the index cache 110 of the storage manager 100. Previously, tapes 145 associated with drive pools could share individual drives 125, 130, and 135, and 140, but tapes 145 associated with each drive pool remained logically separate by, among other factors, media groups. Thus, a given set of tapes 145 associated with a particular drive pool and storing data associated with a first storage policy copy could not also store data from a second storage policy copy. An index cache 110 entry would thus associate different tape sets 145 with different media agents 105, storage policies, drive pools, and other system components. For example, two different tape sets might be associated in two index cache 110 entries as follows:

















storage policy1: media agent1: drive pool1: tape set1



storage policy2: media agent2: drive pool2: tape set2











All components are thus uniquely associated and require separate index cache 110 entries.


By contrast, the present invention, as further described herein, permits data associated with a particular storage policy copy, to be stored on and share tapes 145, and other pieces or removable media such as optical discs, associated with and sharing one or more drive pools or storage policy copies. Data from each storage policy copy is appended to tapes 145 shared by other storage policy copies. Thus, a storage policy copy is shared between many media agents 105 in a dynamic drive pooling setting with tapes 145 also being shared by the different media agents 105 and storage policies. Tapes 145 can be located in any storage device 115 and tapes 145 for a given storage policy copy can even be spread across multiple storage devices 115. Thus, an index cache entry would associate multiple tape sets 145 with multiple media agents, storage policies, drive pools, and other system components. For example, two different tape sets from the previous example of index entries might be associated in a single index cache 110 entry as follows:

















storage policy1: media agent1: drive pool1: tape set1: tape set2



storage policy2: media agent2: drive pool2: tape set1: tape set2










In addition to tape sets 145, a single index cache 110 entry can also specify and associate multiple media agents 105, storage policies, drive pools, network pathways, and other components.


Similarly, different media agents 105 and storage policies can also be associated with the same volumes on magnetic media. For example, turning to FIG. 3, a block diagram is presented of an exemplary magnetic media storage device for a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention. A magnetic media storage device 150, such as a hard disk, is shown. The magnetic media storage device 150 is divided into two volumes 155 and 160 which are associated with a first media agent 165 and a second media agent 170. Previously, each volume on a magnetic media storage device 150 maintained a static relationship with a given media agent 105. For example, if the first volume 155 was associated with the first media agent 165, then the second media agent 170 would only be able to conduct storage operations with the first volume 155 by passing any associated electronic data through the first media agent 165.


The present invention, however, permits media agents 105 to share the same volume(s) on a given magnetic storage device. Thus, as further described herein, a first media agent 105 can perform, on a given magnetic media volume, storage operations on data associated with a first storage policy copy, and a second media agent can perform, on the same magnetic media volume, storage operations on different data associated with a second storage policy copy. For example, media agent 165 and 170 can both perform storage operations on the first volume 155 or the second volume 160.



FIG. 4 presents a flow chart of a method for performing storage operations on electronic data in a computer network according to an embodiment of the invention. Selection of desired storage components for storage operations is performed dynamically. The system initiates a storage operation, step 175, in response to a scheduled procedure or as directed by a user. For example, the system might initiate a backup operation or a restore operation at a specific time of day or in response to a certain threshold being passed as specified in a storage policy. The system selects a media agent 105 according to selection logic further described herein, step 180. Some examples of selection logic include the ability to conduct a LAN-free storage operation, such as using a SAN, and the desire to optimize storage operations via load balancing. For example, an index entry in the storage manager 100 index cache 110 might associate certain media agents 105, storage devices 115, or other components with LAN-free storage operations either via user input, network topology detection algorithms known in the art, or other methods. As another example, the system might select a free media agent 105 to optimize storage operations via load balancing when a default media agent 105 or other media agent 105 specified in a storage policy is already performing other storage operations or otherwise occupied. The system also selects an appropriate drive pool in a network storage device according to selection logic further described herein, step 185. Once the system has selected an appropriate media agent and drive pool, the storage operation is performed, step 190 using the selected storage components.



FIG. 5 presents a flow chart of a method to archive electronic data in a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention. More specifically, FIG. 5 presents a method for dynamically selecting a drive pool according to an embodiment of the invention. The system makes a call to reserve one or more archive streams, step 195. Archive streams are generally data paths with permit storage operations to be performed in parallel on electronic data. An archive stream generally has a one-to-one correlation with a media group, such as a media agent 105 and storage device 115.


Thus, according to one embodiment of the invention, the number of archive streams allowed on a storage policy is the sum of all drives in all available drive pools. For example, a system with three drive pools composed of ten total drives could reserve ten archive streams to copy data to each of the drives simultaneously thus increasing storage efficiency and achieving other useful goals. In one embodiment, the system uses the number of drives in a selected drive pool as the default number of streams to reserve. In an alternate embodiment, the system uses magnetic storage libraries as storage devices 115 instead of tape libraries containing drives. Here, the maximum number of streams would equal the number of readers and writers on all mount paths to the magnetic storage libraries.


The system selects one or more appropriate storage locations for the data to be archived, step 200. In some embodiments, a resource manager module associated with the storage manager 100 selects the storage location(s). For example, a resource manager determines the appropriate storage device 115, media agent 105, and drive pool combination based on the pool of available storage network components and other criteria.


Additional criteria used in the selection process generally consider improving efficiency of the storage operation to be performed. Load balancing, for example, is one exemplary consideration. The system may contain a given number of drives, but some of those drives may be used by other jobs and thus unavailable. The system thus selects from among available drives as one selection criterion. Alternatively, the network path to a particular storage component may be experiencing heavy traffic and thus a less trafficked path offering greater bandwidth may be selected as desirable.


Another exemplary selection criterion is whether selection of a given drive or set of drives would enable LAN-free or auxiliary archiving. For example, in a given network, certain drives might be accessible via a SAN or other alternate storage route which would reduce the network traffic caused by an archiving operation. Preference, is thus given to selection of these drives over drives which would instead increase the network load.


Yet another exemplary selection criterion is in the case of a storage component failover situation. For example, where an entire media agent 105 or storage device 115 as a whole is offline or if a certain number of drives in a storage device are offline, then the system, in some embodiments, dynamically selects an alternate media agent 105 or drive pool to perform storage operations. In some embodiments, the alternate media agent 105 or drive pool in the case of failover is specified according to preferences associated with a storage policy. For example, a storage policy may contain a list of failover candidates or selection logic, as described herein, for selecting a storage location to serve as a failover candidate. In some embodiments, the failover candidates are expressed as a triplet indicating the media agent 105, the storage device 115, and, provided the storage device is not a magnetic media storage device 150, the drive pool. Thus, the triplet “LIB1/MA2/DP1” might be used to represent a failover candidate storage path using media agent 115 MA2, storage device 115 LIB1, and drive pool DP1. In other embodiments, a user specifies the alternate storage device 115, media agent 105, or drive pool directly.


The system reserves the selected storage candidates, step 205, and returns the storage IDs of successful reservations to the storage manager 100, step 210. In some embodiments, the storage IDs are unique identifiers enabling components of the system to identify and communicate with the storage candidates. For example, in some embodiments, the storage IDs comprise a unique component name coupled with a network path such as a Uniform Naming Convention (“UNC”) entry. The storage IDs of the successful reservations are used to update a media group table stored in the storage manager 100 index cache 110 or other similar locations accessible to components of the system, step 215. The reserved components are thus accessible to other components of the system to perform the archive operation or other storage operations.



FIG. 6 presents a flow chart of a method to restore or auxiliary copy electronic data in a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention. A restore or auxiliary copy operation is initiated and the electronic data to be restored or copied is identified, step 220.


The system locates the media on which the electronic data to be restored or copied is stored, step 225. Thus, index data stored at the storage manager 100, a media agent 105, or another location is consulted to determine the media ID where the archive file of the electronic data starts. In some embodiments, the system consults a slot map table contained in the index cache 110 to determine the media ID where the archive file of the electronic data starts.


The system determines the library/media agent/drive pool combination for the source tape storing the electronic data being restored or copied, step 230. Alternatively, the system determines the library/media agent/magnetic storage media volume combination for the electronic data being restored or copied. As previously described, in some embodiments the system determines the media agent 105 according to user preferences, selection logic for increasing network efficiency, or other factors. For example, if the electronic data to be restored or copied is located on a particular tape 145 in a given storage device 115, there may be a finite set of media agents 105 that are associated with the storage device 115 due to network pathways, component failures, user preferences, or other reasons.


The system establishes a network connection to the selected media agent 105 and other components, step 235. In some embodiments, the system establishes a high speed connection, such as a DataPipe™ connection manufactured by CommVault Systems, and further described in U.S. Pat. No. 6,418,478, which is hereby incorporated herein by reference in its entirety. Electronic data is thus transferred over the established connection from the storage device 115 to its intended destination such as a network client 85, an information store 90, or other network component, step 240.


In some embodiments, the entire archive file is generally created by a single attempt of backup and is contained within and accessible to the same media agent 105. Thus, a media agent 105 is identified only when initially opening the archive file. When media spanning occurs in the middle of the archive file, however, such as in the case of a file spanning multiple tapes 145 or volumes, the subsequent pieces of media containing the remaining electronic data must be located and requested, step 245. In the case of media spanning, control thus returns to step 225 to locate the additional media and continue the storage operation.


In some embodiments, the initially selected media agent 105 is first queried to determine whether it is associated with the additional media, and if so, to continue the storage operation. If the initially selected media agent 105 is not associated with the additional media, the system queries the other media agents 105 in the network and attempts to locate the additional media. For example, the system may search index caches 110 associated with the system media agents 105 to locate the additional media. Alternatively, if the system cannot locate the additional media, the user is prompted to manually import or otherwise make available the media holding the additional electronic data required to complete the storage operation.



FIG. 7 presents a flow chart of a method to restore a storage index in a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention. In larger storage networks, scalability problems sometimes occasion the loss of index cache 110 directories from media agents 105. For example, in a network with many media agents 105 and a great deal of storage operations being performed, media agents 105 may load and unload different index caches 110 depending on the electronic data subject to the storage operations being performed. Such loss of an index cache 110 directory from the memory of a media agent 105 requires that the index cache 110 directory be reloaded from stored media such as tapes 145 in a storage device. Reloading an index in this manner, however, often places strain on the network drives, and also results in high system resource usage through the instantiation of related processes and threads such as, for example, ifind, createindex, pipelines, and other actions. For example, when a media agent 105 performs a storage operation, the media agent index cache 110 is updated using a createindex process to indicate any new network pathways, changes to the files system, version information, and other information useful in performing storage operations. The index cache 110 directory must first be restored before the createindex process can be run to reflect these changes. The present invention, thus provides, in some embodiments, a method for efficiently restoring an index cache 110 directory.


The system determines whether there is an index in the cache 110 of a selected media agent, step 255. The system may query media agents 105 directly to determine if there is a copy of the index in a local cache 110. Alternatively, the system may look for the index in other locations, such as in a shared index system as further described herein.


If the index is not in the cache 110, then the system determines the media ID of the archive file containing the index by consulting reference tables stored in the media agent 105 or the storage manager 100 index cache 110, step 260. These tables identify the location of the index file and identify the actual storage media holding the index file such as a particular tape 145, volume 155, or other storage media. In the case of a tape 145 or other similar removable storage media, the system reserves a drive for accessing the media, step 265, and performs a storage operation to restore the index to the local cache 110 of the selected media agent 105, step 270. In some embodiments, such as in the case of multiple media agents 105 having access to the index, preference is given to a LAN-free or otherwise preferred media agent 105. This is advantageous in the case of backups since the createindex has a high chance of being on the same machine as the tail of the pipeline.


Once the system determines that the index is in the local cache 110 of the selected media agent 105, the index is updated or otherwise accessed, such as through a createindex process, to perform the storage operation at hand, step 275. The storage group table is updated to reflect the storage operations performed, step 280.


In some embodiments, the system employs a shared index cache 110 location. A shared index might be employed, for example, to make the index available to all media agents 105 that may need to participate in a storage operation. Multiple media agents 105, for example, might be candidates for load balancing or failover operations, and all need access to the network path of the index so that the index will be available to each of them. Otherwise, extra index restores would be required when different media agents 105 were used for subsequent storage operations. Thus, in some embodiments, the index cache location is indicated by a UNC path universally accessible via a username and password.


Each media agent 105 is also associated with a unique username and password that permit component authentication, access control, and other similar functions. The username, password, and UNC path to the shared index location is stored in memory associated with each media agent 105. In some embodiments, an indexing module of the media agent 105 employs user impersonation before accessing the index cache.


In an alternate embodiment, the system employs a shared index cache 110 in which a pool of network UNC paths is designated for each media agent 105 as a secondary storage area for the index. At the end of each backup, a media agent 105 copies the index to this secondary area which is accessible to all media agents 105 in the pool. Thus, when a media agent 105 requires the index, the media agent 105 queries both its local cache 110 and the pool of UNC paths to locate the correct index. If the index is located in the secondary area and not in the local cache 105, then the index is copied to the local area for immediate use. Upon completion of a storage operation, such as a backup or a restore, the index is copied back to the shared area so that other media agents 105 and processes can access the index.


In some embodiments, the system determines which media agent 105, for a given browse of a client 85 at a point in time, is most likely to already to have a useable index version already in its local cache 110. For example, in some embodiments, the storage manager 100 tracks which media agent 105 performed the last storage operation for a particular client 85. A media agent 105 is selected for a client 85 browse at time T such that the last backup in the full backup cycle at time>=T was done with indexing at that media agent 105.



FIG. 8 presents a flow diagram showing how dynamic volume sharing is accomplished according to one embodiment of the invention. A client application or other application initiates a request to the storage manager 100 to perform a storage operation on electronic data on a storage device 115, such as a magnetic media storage device 150, in the network, and the storage manager 100 processes this request by requesting access to the volume on which the data is storage, step 285. When a client computer 85 is configured, client data that is to be subject to storage operations is associated with a particular media agent 115. When that client data is stored or retrieved in the future, the client computer 85 passes storage operation requests on to the associated media agent 115. The media agent 115 associates this client data with a particular storage media, such as a volume on a magnetic media storage device 150. Using dynamic volume sharing, one or more media agents can store and retrieve data among multiple volumes spanning multiple magnetic media storage devices 150.


When the media sharing request is received, the storage manager 100 verifies that a storage device 115 is available that can be switched to accommodate the request, step 290. The storage manager 100 tracks storage device 115 availability in the storage manager index cache 110 populated with information regarding available storage devices 115 and their respective media agent 105 controllers. Access paths across the network to media agents 105 and then on to appurtenant storage devices 115 are also stored in the storage manager index cache 110.


Upon identifying an appropriate storage device 115, the storage manager 100 directs the media agent 105 controlling the storage device 115 to go into a deactivated state with respect to that storage device, step 295. Even though, in some embodiments, there are multiple media agents executing on various hosts for the same storage device 115, the relationship is static and only one of them can control a storage device 115 at a given instant. The other media agents 105 are said to be in a deactivated state with respect to that storage device 115.


The deactivated media agents 105 run a listening process waiting for a message from the storage manager 100 directing them to become active with respect to a storage device 115. Once the first media agent 105 has been deactivated with respect to the storage device 115, the storage manager communicates to the listening process of a second media agent 105 on which the storage device 115 will be mounted to change from a deactivated state to an activated state with respect to the storage device 115, step 300. At this point the storage manager 100 also updates the storage manager cache 110 to reflect that control of the storage device 115 has been shifted from the first media agent 105 to the second media agent 105, and that the first media agent is now deactivated and that the second media agent is now activated with respect to that storage device, step 305.


The second media agent 105 communicates with the storage device 115 and executes procedures necessary to mount storage device 115 and any associated volumes to the second media agent, step 310. In some embodiments, the second media agent 105 mounts one or more of the volumes associated with the storage device 115, and volumes in the same storage device 115 not mounted by the second media agent 105 may be mounted or otherwise associated with other media agents 105. Once the mount is performed the storage device 150 and its associated volumes 150 are logically connected to the second media agent 105, and this access path is stored by the second media agent 105 in its index cache 110, step 315. The media agent 105 stores the access path to the storage device 115 in the media agent index cache 110 because a storage device 115 connected to multiple media agents 105 may have multiple access paths. Mounting the storage device 115 to the media agent 105 and the resultant access path produced is in large part related to the hardware configuration of the media agent 105. The media agent 105 is generally best-suited to store and delegate management of the access path to the storage device that it controls. In some alternate embodiments, the storage manager 100 stores and tracks the individual hardware configuration of all the network media agents 105 in the storage manager index cache 110 and then passes the resultant access paths to the network storage devices 115 on to the media agents 105 when necessary. In other embodiments, media agent 105 hardware configurations and resultant access paths to the network storage devices 115 are stored in a shared index location as further described herein.


Once the media agent 105 has completed the mount of the storage device 115 (and any associated volumes) and stored the access path to the storage device 115 in its own media agent index cache 110 or other location, then the access path to the storage device 115 is returned by the media agent 105 to the storage manager 100 where it is also stored in the storage manager index cache 110 for future recall, step 320. While media agents 115 generally communicate with storage devices 115 and the storage manager 100, the storage manager 100 generally communicates with client applications. In some embodiments, the storage manager 100 returns the storage device access path to a client application or other application and initiates a storage operation as appropriate, step 325.


Systems and modules described herein may comprise software, firmware, hardware, or any combination(s) of software, firmware, or hardware suitable for the purposes described herein. Software and other modules may reside on servers, workstations, personal computers, computerized tablets, personal digital assistants (PDAs), and other devices suitable for the purposes described herein. Software and other modules may be accessible via local memory, via a network, via a browser or other application in an application service provider (ASP) context, 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, command line interfaces, and other interfaces suitable for the purposes described herein. Screenshots presented and described herein can be displayed differently as known in the art to input, access, change, manipulate, modify, alter, and work with information.


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
  • 1. A system that restores backup data in a computer network, the system comprising: a plurality of storage devices that store backup data;a plurality of storage controller computers, each of which communicates with at least two of the plurality of storage devices and at least two of a plurality of client devices, wherein each of the plurality of storage controller computers has an index cache associated therewith, and wherein each index cache associates at least one of the plurality of the storage controller computers with at least one of the plurality of storage devices, and wherein the each index cache stores location information of at least a portion of the backup data; andwherein a first storage controller computer is selected to restore at least a portion of the backup data;wherein the first storage controller computer locates the backup data on the plurality of storage devices by accessing a first index cache associated with the first storage controller computer; andwherein the first storage controller computer restores the backup data saved on at least one of the storage devices to a least one of the plurality of client devices.
  • 2. The system of claim 1 wherein the first storage controller computer is selected based on an available bandwidth of a network path that includes the first storage controller computer.
  • 3. The system of claim 1 wherein first storage controller computer is selected based on load balancing the plurality of storage controller computers.
  • 4. The system of claim 1 wherein the first storage controller computer is selected by a storage manager computer.
  • 5. The system of claim 1 wherein the first storage controller is selected based at least in part on a comparison of availability of the plurality of storage controller computers.
  • 6. The system of claim 1 wherein the second storage controller computer is a failover module to the first storage controller computer.
  • 7. The system of claim 1 further comprising a storage manager module that queries one of the plurality of storage controller computers to identify the second storage controller computer when the backup data spans multiple storage devices.
  • 8. The system of claim 1 further comprising one or more storage policies that comprise selection logic for selecting the second storage controller computer.
  • 9. The system of claim 1 wherein the first storage controller computer updates the first index cache with at least location information of a portion of the backup data stored in one or more of the plurality of storage devices.
  • 10. The system of claim 1 wherein the second storage controller computer updates a second index cache with at least location information of a portion of the backup data stored in one or more of the plurality of storage devices.
  • 11. A method that restores data in a network, the method comprising: storing instructions in a non-transitory computer storage which perform the following acts when executed by one or more computing devices;selecting at least a first storage controller computer of a plurality of storage controller computers to restore backup data to at least one of a plurality of client devices, each of the plurality of storage controller computers has an index cache associated therewith, wherein each index cache associates a respective storage controller computer with at least one of a plurality of storage devices, wherein each index cache stores location information of at least a portion of the backup data, wherein at least two of the storage devices are shared by at least two of the storage computers, and wherein at least two of the client devices are shared by at least two of the storage computers; andlocating the backup data on the plurality of storage devices by accessing a first index cache associated with the first storage controller computer; andrestoring, with the first storage controller computer, the backup data saved on at least one of the storage devices to at least one of the plurality of client devices.
  • 12. The method of claim 11 wherein selecting the first storage controller computer is based on an available bandwidth of a network path that includes the first storage controller computer.
  • 13. The method of claim 11 wherein selecting the first storage controller computer further comprises load balancing the plurality of storage controller computers.
  • 14. The method of claim 11 further comprising selecting the first storage controller computer is performed by a storage manager computer.
  • 15. The method of claim 11 wherein said selecting the first storage controller computer is based at least in part on availability of the plurality of storage controller computers.
  • 16. The method of claim 11 wherein the second storage controller computer is a failover module to the first storage controller computer.
  • 17. The method of claim 11 further comprising querying with a storage manager module one of the storage controller computers to identify the second storage controller computer when the backup data spans multiple storage devices.
  • 18. The method of claim 11 further comprising one or more storage policies that comprise selection logic for selecting the second storage controller computer.
  • 19. The method of claim 11 further comprising updating, with the first storage controller computer, the first index cache with at least location information of a portion of the backup data stored in one or more of the plurality of storage devices.
  • 20. The method of claim 11 further comprising updating, with the second storage controller computer, a second index cache with at least location information of a portion of the backup data stored in one or more of the plurality of storage devices.
US Referenced Citations (533)
Number Name Date Kind
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
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
5301310 Isman et al. Apr 1994 A
5321816 Rogan et al. Jun 1994 A
5333315 Saether et al. Jul 1994 A
5347653 Flynn et al. Sep 1994 A
5388243 Glider et al. Feb 1995 A
5410700 Fecteau et al. Apr 1995 A
5412668 Dewey May 1995 A
5448724 Hayashi et al. Sep 1995 A
5455926 Keele et al. Oct 1995 A
5465359 Allen et al. Nov 1995 A
5491810 Allen Feb 1996 A
5495007 Pisello et al. Feb 1996 A
5495457 Takagi et al. Feb 1996 A
5499364 Klein et al. Mar 1996 A
5504873 Martin et al. Apr 1996 A
5506986 Healy Apr 1996 A
5544345 Carpenter et al. Aug 1996 A
5544347 Yanai et al. Aug 1996 A
5548521 Krayer et al. Aug 1996 A
5559957 Balk Sep 1996 A
5608865 Midgely et al. Mar 1997 A
5619644 Crockett et al. Apr 1997 A
5633999 Clowes et al. May 1997 A
5638509 Dunphy et al. Jun 1997 A
5659743 Adams et al. Aug 1997 A
5673381 Huai et al. Sep 1997 A
5677900 Nishida et al. Oct 1997 A
5699361 Ding et al. Dec 1997 A
5729743 Squibb Mar 1998 A
5737747 Vishlitsky et al. Apr 1998 A
5751997 Kullick et al. May 1998 A
5758359 Saxon May 1998 A
5761677 Senator et al. Jun 1998 A
5764972 Crouse et al. Jun 1998 A
5778395 Whiting et al. Jul 1998 A
5790775 Marks et al. Aug 1998 A
5812398 Nielsen Sep 1998 A
5813008 Benson et al. Sep 1998 A
5813009 Johnson et al. Sep 1998 A
5813017 Morris Sep 1998 A
5815662 Ong Sep 1998 A
5829023 Bishop Oct 1998 A
5829046 Tzelnic et al. Oct 1998 A
5832522 Blickenstaff et al. Nov 1998 A
5860068 Cook Jan 1999 A
5875478 Blumenau Feb 1999 A
5875481 Ashton et al. Feb 1999 A
5887134 Ebrahim Mar 1999 A
5890159 Sealby et al. Mar 1999 A
5893139 Kamiyama et al. Apr 1999 A
5898593 Baca et al. Apr 1999 A
5901327 Ofek May 1999 A
5924102 Perks Jul 1999 A
5950205 Aviani, Jr. Sep 1999 A
5958005 Thorne et al. Sep 1999 A
5974563 Beeler, Jr. Oct 1999 A
5978577 Rierden et al. Nov 1999 A
6021415 Cannon et al. Feb 2000 A
6023705 Bellinger et al. Feb 2000 A
6026398 Brown et al. Feb 2000 A
6026414 Anglin Feb 2000 A
6035306 Lowenthal et al. Mar 2000 A
6052735 Ulrich et al. Apr 2000 A
6076148 Kedem Jun 2000 A
6078990 Frazier Jun 2000 A
6081812 Boggs et al. Jun 2000 A
6088694 Burns et al. Jul 2000 A
6094416 Ying Jul 2000 A
6105122 Muller et al. Aug 2000 A
6105136 Cromer et al. Aug 2000 A
6119209 Bauman Sep 2000 A
6128750 Espy et al. Oct 2000 A
6131095 Low et al. Oct 2000 A
6131099 Johnson et al. Oct 2000 A
6131147 Takagi Oct 2000 A
6131190 Sidwell Oct 2000 A
6137864 Yaker Oct 2000 A
6148349 Chow et al. Nov 2000 A
6148412 Cannon et al. Nov 2000 A
6149316 Harari et al. Nov 2000 A
6154738 Call Nov 2000 A
6154787 Urevig et al. Nov 2000 A
6154852 Amundson et al. Nov 2000 A
6161111 Mutalik et al. Dec 2000 A
6167402 Yeager Dec 2000 A
6176829 Li et al. Jan 2001 B1
6195794 Buxton Feb 2001 B1
6212512 Barney et al. Apr 2001 B1
6223205 Harchol-Balter et al. Apr 2001 B1
6246882 Lachance Jun 2001 B1
6247077 Muller et al. Jun 2001 B1
6256740 Muller et al. Jul 2001 B1
6260069 Anglin Jul 2001 B1
6266078 McDevitt et al. Jul 2001 B1
6266784 Hsiao et al. Jul 2001 B1
6269382 Cabrera et al. Jul 2001 B1
6269431 Dunham Jul 2001 B1
6275953 Vahalia et al. Aug 2001 B1
6295541 Bodnar Sep 2001 B1
6301592 Aoyama et al. Oct 2001 B1
6304880 Kishi Oct 2001 B1
6308245 Johnson et al. Oct 2001 B1
6324581 Xu et al. Nov 2001 B1
6328766 Long Dec 2001 B1
6330570 Crighton Dec 2001 B1
6330572 Sitka Dec 2001 B1
6330642 Carteau Dec 2001 B1
6338006 Jesionowski et al. Jan 2002 B1
6343324 Hubis et al. Jan 2002 B1
6343342 Carlson 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
6356901 MacLeod et al. Mar 2002 B1
6366900 Hu Apr 2002 B1
6374266 Shnelvar Apr 2002 B1
6374336 Peters et al. Apr 2002 B1
6385673 DeMoney May 2002 B1
6389432 Pothapragada et al. May 2002 B1
6411571 Mitsunari et al. Jun 2002 B1
6418441 Call Jul 2002 B1
6418478 Ignatius et al. Jul 2002 B1
6421711 Blumenau et al. Jul 2002 B1
6434682 Ashton et al. Aug 2002 B1
6438586 Hass et al. Aug 2002 B1
6457017 Watkins et al. Sep 2002 B2
6484166 Maynard Nov 2002 B1
6487561 Ofek et al. Nov 2002 B1
6487644 Huebsch et al. Nov 2002 B1
6490666 Cabrera et al. Dec 2002 B1
6496744 Cook Dec 2002 B1
6505307 Stell et al. Jan 2003 B1
6519679 Devireddy et al. Feb 2003 B2
6538669 Lagueux, Jr. et al. Mar 2003 B1
6542909 Tamer et al. Apr 2003 B1
6542972 Ignatius et al. Apr 2003 B2
6564228 O'Connor May 2003 B1
6571310 Ottesen et al. May 2003 B1
6581143 Gagne et al. Jun 2003 B2
6594698 Chow et al. Jul 2003 B1
6615349 Hair Sep 2003 B1
6631442 Blumenau Oct 2003 B1
6631493 Ottesen et al. Oct 2003 B2
6647396 Parnell et al. Nov 2003 B2
6658436 Oshinsky et al. Dec 2003 B2
6658526 Nguyen et al. Dec 2003 B2
6662281 Ballard et al. Dec 2003 B2
6665740 Mason et al. Dec 2003 B1
6669832 Saito et al. Dec 2003 B1
6674924 Wright et al. Jan 2004 B2
6704839 Butterworth et al. Mar 2004 B2
6711632 Chow et al. Mar 2004 B1
6721334 Ketcham Apr 2004 B1
6732124 Koseki et al. May 2004 B1
6732293 Schneider May 2004 B1
6757794 Cabrera et al. Jun 2004 B2
6763351 Subramaniam et al. Jul 2004 B1
6763438 Ogawa et al. Jul 2004 B2
6771595 Gilbert et al. Aug 2004 B1
6785078 Basham et al. Aug 2004 B2
6789161 Blendermann et al. Sep 2004 B1
6791910 James et al. Sep 2004 B1
6799255 Blumenau et al. Sep 2004 B1
6802025 Thomas et al. Oct 2004 B1
6820035 Zahavi Nov 2004 B1
6832186 Margulieux Dec 2004 B1
6851031 Trimmer et al. Feb 2005 B2
6859758 Prabhakaran et al. Feb 2005 B1
6862622 Jorgensen Mar 2005 B2
6871163 Hiller et al. Mar 2005 B2
6880052 Lubbers et al. Apr 2005 B2
6886020 Zahavi et al. Apr 2005 B1
6909356 Brown et al. Jun 2005 B2
6912627 Matsunami et al. Jun 2005 B2
6912645 Dorward Jun 2005 B2
6922687 Vernon Jul 2005 B2
6934879 Misra et al. Aug 2005 B2
6941370 Boles et al. Sep 2005 B2
6941396 Thorpe et al. Sep 2005 B1
6950723 Gallo et al. Sep 2005 B2
6952758 Chron et al. Oct 2005 B2
6965968 Touboul et al. Nov 2005 B1
6968351 Butterworth Nov 2005 B2
6968479 Wyatt et al. Nov 2005 B2
6972918 Kokami et al. Dec 2005 B2
6973369 Trimmer et al. Dec 2005 B2
6973553 Archibald, Jr. et al. Dec 2005 B1
6983277 Yamaguchi et al. Jan 2006 B2
6983322 Tripp et al. Jan 2006 B1
6983361 Gibble et al. Jan 2006 B1
6993625 Ogawa et al. Jan 2006 B2
7003519 Biettron et al. Feb 2006 B1
7003641 Prahlad et al. Feb 2006 B2
7006435 Davies et al. Feb 2006 B1
7010387 Lantry et al. Mar 2006 B2
7012529 Sajkowsky Mar 2006 B2
7013372 Achiwa et al. Mar 2006 B2
7034683 Ghazarian Apr 2006 B2
7035880 Crescenti et al. Apr 2006 B1
7039827 Meyer et al. May 2006 B2
7058649 Ough et al. Jun 2006 B2
7062761 Slavin et al. Jun 2006 B2
7069380 Ogawa et al. Jun 2006 B2
7069466 Trimmer et al. Jun 2006 B2
7082441 Zahavi et al. Jul 2006 B1
7085786 Carlson et al. Aug 2006 B2
7085904 Mizuno et al. Aug 2006 B2
7093089 De Brebisson Aug 2006 B2
7096269 Yamagami Aug 2006 B2
7096315 Takeda et al. Aug 2006 B2
7103619 Rajpurkar et al. Sep 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
7117246 Christenson et al. Oct 2006 B2
7118034 Baldassari et al. Oct 2006 B2
7120757 Tsuge Oct 2006 B2
7120823 Foster et al. Oct 2006 B2
7130970 Devassy et al. Oct 2006 B2
7136720 Deckers Nov 2006 B2
7146377 Nowicki et al. Dec 2006 B2
7155486 Aoshima et al. Dec 2006 B2
7155633 Tuma et al. Dec 2006 B2
7159110 Douceur et al. Jan 2007 B2
7162496 Amarendran et al. Jan 2007 B2
7162604 Nourmohamadian et al. Jan 2007 B1
7162693 Yamanaka et al. Jan 2007 B2
7165455 Magee et al. Jan 2007 B2
7173929 Testardi Feb 2007 B1
7174433 Kottomtharayil et al. Feb 2007 B2
7181578 Guha et al. Feb 2007 B1
7191283 Amemiya et al. Mar 2007 B2
7197490 English Mar 2007 B1
7200621 Beck et al. Apr 2007 B2
7203944 Van Rietschote et al. Apr 2007 B1
7209949 Mousseau et al. Apr 2007 B2
7213118 Goodman et al. May 2007 B2
7216244 Amano May 2007 B2
7222172 Arakawa et al. May 2007 B2
7246140 Therrien et al. Jul 2007 B2
7246207 Kottomtharayil et al. Jul 2007 B2
7246258 Chen et al. Jul 2007 B2
7246272 Cabezas et al. Jul 2007 B2
7249347 Chang et al. Jul 2007 B2
7249357 Landman et al. Jul 2007 B2
7251218 Jorgensen Jul 2007 B2
7251708 Justiss et al. Jul 2007 B1
7257257 Anderson et al. Aug 2007 B2
7269612 Devarakonda et al. Sep 2007 B2
7272606 Borthakur et al. Sep 2007 B2
7276063 Horn Sep 2007 B2
7277246 Barbian et al. Oct 2007 B2
7277953 Wils et al. Oct 2007 B2
7278142 Bandhole et al. Oct 2007 B2
7281032 Kodama Oct 2007 B2
7287047 Kavuri Oct 2007 B2
7287252 Bussiere et al. Oct 2007 B2
7293133 Colgrove et al. Nov 2007 B1
7302540 Holdman et al. Nov 2007 B1
7315807 Lavallee et al. Jan 2008 B1
7330997 Odom Feb 2008 B1
7343356 Prahlad 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
7359917 Winter et al. Apr 2008 B2
7379850 Sprogis et al. May 2008 B2
7380014 LeCroy et al. May 2008 B2
7380019 Shiga et al. May 2008 B2
7380072 Kottomtharayil et al. May 2008 B2
7383462 Osaki et al. Jun 2008 B2
7395282 Crescenti et al. Jul 2008 B1
7395387 Berkowitz et al. Jul 2008 B2
7401728 Markham et al. Jul 2008 B2
7409509 Devassy et al. Aug 2008 B2
7421312 Trossell Sep 2008 B2
7421511 Shiga et al. Sep 2008 B2
7426537 Lee et al. Sep 2008 B2
7434090 Hartung et al. Oct 2008 B2
7447149 Beesley et al. Nov 2008 B1
7447907 Hart, III et al. Nov 2008 B2
7448079 Tremain Nov 2008 B2
7451283 Chen et al. Nov 2008 B2
7454569 Kavuri et al. Nov 2008 B2
7467167 Patterson Dec 2008 B2
7472238 Gokhale Dec 2008 B1
7484054 Kottomtharayil et al. Jan 2009 B2
7490207 Amarendran Feb 2009 B2
7496492 Dai Feb 2009 B2
7500053 Kavuri et al. Mar 2009 B1
7500150 Sharma et al. Mar 2009 B2
7509443 Matsuo et al. Mar 2009 B2
7519726 Palliyll et al. Apr 2009 B2
7523483 Dogan Apr 2009 B2
7529748 Wen et al. May 2009 B2
7529782 Prahlad et al. May 2009 B2
7536291 Retnamma et al. May 2009 B1
7539702 Deshmukh et al. May 2009 B2
7539783 Kochunni et al. May 2009 B2
7552294 Justiss Jun 2009 B1
7565340 Herlocker et al. Jul 2009 B2
7581011 Teng Aug 2009 B2
7584227 Gokhale et al. Sep 2009 B2
7584298 Klinker et al. Sep 2009 B2
7587749 Leser et al. Sep 2009 B2
7596586 Gokhale et al. Sep 2009 B2
7603518 Kottomtharayil Oct 2009 B2
7613748 Brockway et al. Nov 2009 B2
7617392 Hair Nov 2009 B2
7627598 Burke Dec 2009 B1
7627617 Kavuri et al. Dec 2009 B2
7631194 Wahlert et al. Dec 2009 B2
7644245 Prahlad et al. Jan 2010 B2
7657666 Kottomtharayil et al. Feb 2010 B2
7659820 Schnee et al. Feb 2010 B2
7660812 Findlay Feb 2010 B2
7680843 Panchbudhe et al. Mar 2010 B1
7685126 Patel Mar 2010 B2
7689510 Lamkin et al. Mar 2010 B2
7702659 Ban et al. Apr 2010 B2
7702831 Ma et al. Apr 2010 B2
7707060 Chainer et al. Apr 2010 B2
7712094 Shapiro May 2010 B2
7720817 Stager et al. May 2010 B2
7739450 Kottomtharayil Jun 2010 B2
7739459 Kottomtharayil et al. Jun 2010 B2
7748610 Bell et al. Jul 2010 B2
7751628 Reisman Jul 2010 B1
7765167 Prahlad et al. Jul 2010 B2
7765369 Prahlad et al. Jul 2010 B1
7769961 Kottomtharayil et al. Aug 2010 B2
7805416 Compton et al. Sep 2010 B1
7809699 Passmore et al. Oct 2010 B2
7809914 Kottomtharayil et al. Oct 2010 B2
7818417 Ginis et al. Oct 2010 B2
7822715 Petruzzo Oct 2010 B2
7827363 Devassy et al. Nov 2010 B2
7831553 Prahlad et al. Nov 2010 B2
7831566 Kavuri et al. Nov 2010 B2
7840537 Gokhale et al. Nov 2010 B2
7849266 Kavuri et al. Dec 2010 B2
7861011 Kottomtharayil et al. Dec 2010 B2
7873802 Gokhale et al. Jan 2011 B2
7877351 Crescenti et al. Jan 2011 B2
7877362 Gokhale et al. Jan 2011 B2
7889847 Gainsboro Feb 2011 B2
7890796 Pawar et al. Feb 2011 B2
7904350 Ayala et al. Mar 2011 B2
7917473 Kavuri et al. Mar 2011 B2
7917695 Ulrich et al. Mar 2011 B2
7934071 Abe et al. Apr 2011 B2
7937365 Prahlad et al. May 2011 B2
7937393 Prahlad et al. May 2011 B2
7945810 Soren et al. May 2011 B2
7949512 Retnamma et al. May 2011 B2
7953802 Mousseau et al. May 2011 B2
7958307 Kavuri et al. Jun 2011 B2
7962714 Amarendran et al. Jun 2011 B2
7969306 Ebert et al. Jun 2011 B2
7975061 Gokhale et al. Jul 2011 B1
7987319 Kottomtharayil Jul 2011 B2
8032718 Kottomtharayil Oct 2011 B2
8040727 Harari Oct 2011 B1
8041905 Devassy et al. Oct 2011 B2
8051043 Young Nov 2011 B2
8074042 Kottomtharayil et al. Dec 2011 B2
8140786 Bunte et al. Mar 2012 B2
8161318 D'Souza et al. Apr 2012 B2
8166263 Prahlad et al. Apr 2012 B2
8176268 Kottomtharayil et al. May 2012 B2
8219524 Gokhale Jul 2012 B2
8230195 Amarendran et al. Jul 2012 B2
8291177 Devassy et al. Oct 2012 B2
8341359 Kottomtharayil et al. Dec 2012 B2
8364914 Kottomtharayil et al. Jan 2013 B2
8402244 Kottomtharayil et al. Mar 2013 B2
8443142 Kavuri et al. May 2013 B2
8510516 Kottomtharayil et al. Aug 2013 B2
8661216 Kavuri et al. Feb 2014 B2
8688931 Kottomtharayil et al. Apr 2014 B2
8799613 Kottomtharayil et al. Aug 2014 B2
8892826 Kottomtharayil et al. Nov 2014 B2
9021213 Kottomtharayil et al. Apr 2015 B2
9201917 Kottomtharayll et al. Dec 2015 B2
20020010661 Waddington et al. Jan 2002 A1
20020029281 Zeidner et al. Mar 2002 A1
20020032613 Buettgenbach et al. Mar 2002 A1
20020040405 Gold Apr 2002 A1
20020049778 Bell et al. Apr 2002 A1
20020069324 Gerasimov et al. Jun 2002 A1
20020107877 Whiting et al. Aug 2002 A1
20020122543 Rowen Sep 2002 A1
20020157113 Allegrezza Oct 2002 A1
20020188592 Leonhardt et al. Dec 2002 A1
20020194340 Ebstyne et al. Dec 2002 A1
20030016609 Rushton et al. Jan 2003 A1
20030014433 Teloh et al. Mar 2003 A1
20030055671 Nasser Mar 2003 A1
20030061491 Jaskiewicz et al. Mar 2003 A1
20030065759 Britt et al. Apr 2003 A1
20030099237 Mitre et al. May 2003 A1
20030101155 Gokhale et al. May 2003 A1
20030126361 Slater et al. Jul 2003 A1
20030134619 Phillips et al. Jul 2003 A1
20030169733 Gurkowski et al. Sep 2003 A1
20030204700 Biessener et al. Oct 2003 A1
20030220901 Carr et al. Nov 2003 A1
20040010523 Wu et al. Jan 2004 A1
20040044855 Carlson et al. Mar 2004 A1
20040054607 Waddington et al. Mar 2004 A1
20040073677 Honma et al. Apr 2004 A1
20040073716 Boom et al. Apr 2004 A1
20040083202 Mu et al. Apr 2004 A1
20040088432 Hubbard et al. May 2004 A1
20040098363 Anglin et al. May 2004 A1
20040098547 Ofek et al. May 2004 A1
20040107199 Dalrymple et al. Jun 2004 A1
20040122832 Callahan et al. Jun 2004 A1
20040153719 Achiwa et al. Aug 2004 A1
20040186847 Rappaport et al. Sep 2004 A1
20040193397 Lumb et al. Sep 2004 A1
20040193953 Callahan et al. Sep 2004 A1
20040204949 Shaji et al. Oct 2004 A1
20050008163 Leser et al. Jan 2005 A1
20050021524 Oliver Jan 2005 A1
20050033756 Kottomtharayll et al. Feb 2005 A1
20050033913 Kottomtharayil et al. Feb 2005 A1
20050039069 Prahlad et al. Feb 2005 A1
20050044114 Kottomtharayll et al. Feb 2005 A1
20050076264 Rowan et al. Apr 2005 A1
20050080992 Massey et al. Apr 2005 A1
20050102203 Keong May 2005 A1
20050114477 Willging et al. May 2005 A1
20050125807 Brady et al. Jun 2005 A1
20050166011 Burnett et al. Jul 2005 A1
20050172093 Jain Aug 2005 A1
20050174869 Kottomtharayil et al. Aug 2005 A1
20050177828 Graham et al. Aug 2005 A1
20050210304 Hartung et al. Sep 2005 A1
20050216534 Ikezawa et al. Sep 2005 A1
20050246342 Vernon Nov 2005 A1
20050246398 Barzilai et al. Nov 2005 A1
20050246568 Davies Nov 2005 A1
20050256972 Cochran et al. Nov 2005 A1
20050262296 Peake Nov 2005 A1
20050278299 Yamada et al. Dec 2005 A1
20060004639 O'Keefe Jan 2006 A1
20060004675 Bennett et al. Jan 2006 A1
20060005048 Osaki et al. Jan 2006 A1
20060010227 Atluri Jan 2006 A1
20060011720 Call Jan 2006 A1
20060020569 Goodman et al. Jan 2006 A1
20060044674 Martin et al. Mar 2006 A1
20060075007 Anderson et al. Apr 2006 A1
20060095385 Atkinson et al. May 2006 A1
20060100912 Kumar et al. May 2006 A1
20060161879 Lubrecht et al. Jul 2006 A1
20060169769 Boyarsky et al. Aug 2006 A1
20060224846 Amarendran et al. Oct 2006 A1
20060248165 Sridhar et al. Nov 2006 A1
20060282194 Schaefer et al. Dec 2006 A1
20060285172 Hull et al. Dec 2006 A1
20060288044 Kashiwagi et al. Dec 2006 A1
20070061266 Moore et al. Mar 2007 A1
20070130105 Papatia Jun 2007 A1
20070156897 Lim Jul 2007 A1
20070185912 Gupta et al. Aug 2007 A1
20070198722 Kottomtharayil et al. Aug 2007 A1
20070198802 Kavuri Aug 2007 A1
20070288536 Sen et al. Dec 2007 A1
20080059515 Fulton Mar 2008 A1
20080059704 Kavuri Mar 2008 A1
20080141242 Shapiro Jun 2008 A1
20080229037 Bunte et al. Sep 2008 A1
20080243420 Gokhale et al. Oct 2008 A1
20080243754 Gokhale et al. Oct 2008 A1
20080243795 Prahlad et al. Oct 2008 A1
20080243870 Muller et al. Oct 2008 A1
20080243914 Prahlad et al. Oct 2008 A1
20080243957 Prahlad et al. Oct 2008 A1
20080243958 Prahlad et al. Oct 2008 A1
20080244177 Crescenti et al. Oct 2008 A1
20080249656 Gokhale et al. Oct 2008 A1
20080250076 Muller et al. Oct 2008 A1
20080256269 Ookubo Oct 2008 A1
20080320319 Muller et al. Dec 2008 A1
20090063765 Kottomtharayil et al. Mar 2009 A1
20090113056 Tameshige et al. Apr 2009 A1
20090271541 Aoki et al. Oct 2009 A1
20090313448 Gokhale et al. Dec 2009 A1
20090319534 Gokhale Dec 2009 A1
20090319585 Gokhale Dec 2009 A1
20100017184 Retnamma et al. Jan 2010 A1
20100030528 Smith et al. Feb 2010 A1
20100070466 Prahlad et al. Mar 2010 A1
20100070474 Lad Mar 2010 A1
20100070726 Ngo et al. Mar 2010 A1
20100082672 Kottomtharayil et al. Apr 2010 A1
20100131467 Prahlad et al. May 2010 A1
20100138393 Crescenti et al. Jun 2010 A1
20100287234 Kottomtharayil et al. Nov 2010 A1
20100293112 Prahlad et al. Nov 2010 A1
20110010440 Kottomtharayil et al. Jan 2011 A1
20110040799 Devassy et al. Feb 2011 A1
20110087807 Kottomtharayil et al. Apr 2011 A1
20110093672 Gokhale et al. Apr 2011 A1
20110213755 Kavuri et al. Sep 2011 A1
20110231852 Gokhale et al. Sep 2011 A1
20110270859 Kottomtharayil Nov 2011 A1
20120059985 Devassy et al. Mar 2012 A1
20120084523 Littlefield et al. Apr 2012 A1
20120265732 Gokhale et al. Oct 2012 A1
20120265936 Kottomtharayil Oct 2012 A1
20150026401 Kottomtharayil et al. Jan 2015 A1
20150199390 Kottomtharayil et al. Jul 2015 A1
Foreign Referenced Citations (23)
Number Date Country
0259912 Mar 1988 EP
0405926 Jan 1991 EP
0467546 Jan 1992 EP
0620553 Oct 1994 EP
0757317 Feb 1997 EP
0774715 May 1997 EP
0809184 Nov 1997 EP
0899662 Mar 1999 EP
0981090 Feb 2000 EP
1174795 Jan 2002 EP
1115064 Dec 2004 EP
2366048 Feb 2002 GB
7254204 Oct 1995 JP
9044381 Feb 1997 JP
9081424 Mar 1997 JP
WO 9114229 Sep 1991 WO
WO 1995013580 May 1995 WO
WO 1999012098 Mar 1999 WO
WO 1999014692 Mar 1999 WO
WO 1999017204 Apr 1999 WO
WO 2004090788 Oct 2004 WO
WO 2005024573 Mar 2005 WO
WO 2005055093 Jun 2005 WO
Non-Patent Literature Citations (51)
Entry
U.S. Appl. No. 09/609,977, filed Jul. 5, 2000, Prahlad.
U.S. Appl. No. 10/655,764, filed Sep. 5, 2003, Nourmohamadian.
U.S. Appl. No. 11/269,513, filed Nov. 7, 2005, Prahlad.
U.S. Appl. No. 13/534,070, filed Jun. 27, 2012, Kottomtharayil, et al.
U.S. Appl. No. 13/963,693, filed Aug. 9, 2013, Kottomtharayil, et al.
Allen, “Probability, Statistics and Queuing Theory”, 1978, p. 370, Col. 19, Lines 3-33, 1 page.
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, pp. 420-427, San Francisco, CA.
Campbell, “Linux and Windows No. 4.0: Basic Administration—Part III”, internet publication, Oct. 5, 2000, retrieved from the internet.
Carrington, “Backups Using the “at” Command”, internet publication, May 4, 1999, retrieved from the internet.
Commvault Systems, Inc., Continuous Data Replicator 7.0, Product Data Sheet, 2007, in 6 pages.
Cook, “ntbackup: eject tape at end of backup?”, internet publication, Oct. 18, 2000, retrieved from the internet.
Eitel, “Backup and Storage Management in Distributed Heterogeneous Environments,” IEEE, 1994, pp. 124-126.
Farley, “Building Storage Networks,” pp. 328-331, Osborne/McGraw-Hill, 2000.
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).
Gibson, “Network Attached Storage Architecture,” pp. 37-45, ACM, Nov. 2000.
http://en.wikipedia.org/wiki/Naive_Bayes_classifier, printed on Jun. 1, 2010, in 7 pages.
Jander, “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4(Mar. 21, 1998), pp. 64-72.
MDM, Automatically eject tape:, internet publication, Jun. 7, 1999, retrieved from the internet.
Recycle Bin (Windows), Aug. 2007, Wikipedia, pp. 1-3.
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).
Savill, Windows NT FAQ Single File Version: internet publication, 2000, retrieved from the internet.
Szor, The Art of Virus Research and Defense, Symantec Press (2005) ISBN 0-321-30454-3, Part 1.
Szor, The Art of Virus Research and Defense, Symantec Press (2005) ISBN 0-321-30454-3, Part 2.
Witten et al., Data Mining: Practical Machine Learning Tools and Techniques, Ian H. Witten & Eibe Frank, Elsevier (2005) ISBN 0-12-088407-0, Part 1.
Witten et al., Data Mining: Practical Machine Learning Tools and Techniques, Ian H. Witten & Eibe Frank, Elsevier (2005) ISBN 0-12-088407-0, Part 2.
International Search Report and Written Opinion dated Nov. 13, 2009, PCT/US2007/081681, in 8 pages.
International Search Report and Preliminary Report on Patentability dated Dec. 3, 2003, PCT/US2003/028319 in 5 pages.
Great Britain Office Action dated Mar. 8, 2006, Application No. GB/0507268.1, in 3 pages.
Indian Office Action dated May 29, 2008, Application No. 60/CHENP/2005-AR.
Canadian Office Action dated May 30, 2008, Application No. CA2498174, in 3 pages.
Canadian Office Action dated Feb. 9, 2009, Application No. CA2498174, in 2 pages.
International Search Report and Preliminary Report on Patentability dated Sep. 22, 2004, PCT/US2004/010504, in 6 pages.
International Search Report dated Sep. 20, 2004, PCT/US2004/010503, in 2 pages.
Written Opinion dated Mar. 1, 2007, International Application No. PCT/US05/40606, 5 pages.
International Search Report from International Application No. PCT/US05/40656, dated Mar. 1, 2007; 1 page.
Office Action in Canadian Application No. 2,587,055 dated Mar. 14, 2013, in 2 pages.
Office Action in Canadian Application No. 2,587,055 dated Mar. 18, 2014, in 2 pages.
Great Britain Office Action dated Nov. 2, 2007, Application No. GB/07071772, in 3 pages.
Great Britain Office Action dated Apr. 4, 2008, Application No. GB/07071772, in 2 pages.
First Examination Report in EU Application No. 04 758 913.0-2413 dated Nov. 21, 2008, in 6 pages.
Second Examination Report in EU Application 04 758 913.0-2413 dated May 26, 2010, in 7 pages.
First Examination in Australian Appl. No. 2004227949 dated Apr. 17, 2009, in 2 pages.
First Examination Report in Indian Appl, No. 2508/CHENP/2005 dated Feb. 15, 2008, in 2 pages.
Second Office Action in Canadian Application No. 2,520,498 dated Jun. 8, 2010, in 2 pages.
First Office Action in Canadian Application No. 2,520,498 dated Nov. 17, 2008, in 2 pages.
Office Action in Canadian Application No. 2,520,498 dated Jun. 16, 2011, in 2 pages.
Office Action in Israeli Application No. 171121 dated Feb. 13, 2011, in 5 pages.
Related Publications (1)
Number Date Country
20160147469 A1 May 2016 US
Provisional Applications (1)
Number Date Country
60460234 Apr 2003 US
Continuations (8)
Number Date Country
Parent 14491721 Sep 2014 US
Child 14925554 US
Parent 14183777 Feb 2014 US
Child 14491721 US
Parent 13750719 Jan 2013 US
Child 14183777 US
Parent 13465890 May 2012 US
Child 13750719 US
Parent 12813398 Jun 2010 US
Child 13465890 US
Parent 12353510 Jan 2009 US
Child 12813398 US
Parent 11778445 Jul 2007 US
Child 12353510 US
Parent 10818749 Apr 2004 US
Child 11778445 US