US 8,930,306 B1Grant
Synchronized data deduplication
Issue Date:2015-01-06
•12 Claims
•10 Drawing Sheets
Abstract
A system and method for data deduplication is presented. Data received from one or more computing systems is deduplicated, and the results of the deduplication process stored in a reference table. A representative subset of the reference table is shared among a plurality of systems that utilize the data deduplication repository. This representative subset of the reference table can be used by the computing systems to deduplicate data locally before it is sent to the repository for storage. Likewise, it can be used to allow deduplicated data to be returned from the repository to the computing systems. In some cases, the representative subset can be a proper subset wherein a portion of the referenced table is identified shared among the computing systems to reduce bandwidth requirements for reference-table synchronization.
Metadata
Assignee
- CommVault Systems, Inc.
Inventors
- David Ngo
- Marcus Muller
Application Information
Application Number:US 12/499,717
Filing Date:2009-07-08
Priority Date:2009-07-08
Art Unit:2161
Classifications
IPC:
G06F17/30
Field of Search:
G06F 17/30194G06F 17/30174G06F 17/30578G06F 17/30156
Patent Drawings (10 sheets)
Description
Technical Field
[0001] The present invention generally relates to data deduplication, and more particularly, some embodiments relate to systems and methods for facilitating shared deduplication information.
Description of the Related Art
[0002] The storage and retrieval of data is an age-old art that has evolved as methods for processing and using data have evolved. In the early 18th century, Basile Bouchon is purported to have used a perforated paper loop to store patterns used for printing cloth. In the mechanical arts, similar technology in the form of punch cards and punch tape were also used in the 18th century in textile mills to control mechanized looms. Two centuries later, early computers also used punch cards and paper punch tape to store data and to input programs.
[0003] However, punch cards were not the only storage mechanism available in the mid 20th century. Drum memory was widely used in the 1950s and 1960s with capacities approaching about 10 kb, and the first hard drive was developed in the 1950s and is reported to have used 50 24-inch discs to achieve a total capacity of almost 5 MB. However, these were large and costly systems and although punch cards were inconvenient, their lower cost contributed to their longevity as a viable alternative.
[0004] In 1980 the hard drive broke the 1 GB capacity mark with the introduction of the IBM 3380, which could store more than two gigabytes of data. The IBM 3380, however, was about as large as a refrigerator, weighed ¼ ton, and cost in the range of approximately $97,000 to $142,000, depending on the features selected. This is in stark contrast to contemporary storage systems that provide for storage of hundreds of terabytes of data or more for seemingly instantaneous access by networked devices. Even handheld electronic devices such as digital cameras, MP3 players and others are capable of storing gigabytes of data, and today's desktop computers boast hundreds of gigabytes of storage capacity.
[0005] However, with the advent of networked computing, storage of electronic data has migrated from the individual computer to network-accessible storage devices. These include, for example, optical libraries, Redundant Arrays of Inexpensive Disks (RAID), CD-ROM jukeboxes, drive pools and other mass storage technologies. These storage devices are accessible to and can be shared by individual computers such as via a Local Area Network (LAN), a Wide Area Network (WAN), or a Storage Area Network (SAN) to name a few. These client computers not only access their own local storage devices but also storage devices of the network to perform backups, transaction processing, file sharing, and other storage-related operations.
[0006] The large volumes of data often stored and shared by networked devices can cause overloading of the limited network bandwidth. For example, during operations such as system backups, transaction processing, file copying and transfer, and other similar operations, the communication bandwidth of the network often becomes the rate-determining factor.
[0007] In addition, even with large capacity storage systems, computing enterprises are being overloaded by vast amounts of data. Documents sent via email, for example, can be copied and resent multiple times and several instances of the very same document might be stored many times in many different locations. IT administrators are struggling to keep up with the seemingly exponential increase in the volume of documents, media and other data. This problem is severly compounded by other factors such as the large file sizes often associated with multi-media files, and file proliferation through email and other content sharing mechanisms. However, additional storage capacity requires capital expenditures, consumes power, takes up floor space and burdens administrative overhead. Even with additional storage capacity, the sheer volume of data becomes a strain on backup and data recovery plans, leading to greater risk in data integrity.
[0008] As an alternative to simply increasing the amount of storage capacity, contemporary enterprises have turned to compression and other like technologies to reduce the volume of data. One such technology that can be used is known as data deduplication. Data deduplication in its various forms eliminates or reduces the amount of redundant data by implementing policies that strive to reduce the quantity of, or even eliminate, instances of redundant data blocks in storage. With data deduplication, data is broken up into segments or blocks. As new data enters the system, the segments are checked to see if they already exist in storage. If a segment already exists, rather than store that segment again, a pointer to the location of the existing segment is stored.
[0009] The segment size selected for data deduplication can be defined at various levels, from small segment sizes (for example, 1 kB or less) to much larger segment sizes, and to entire files. A larger segment size can yield greater space or bandwidth savings on a per-instance basis, however, the opportunities for identifying redundancies may be reduced with larger segment sizes. These tradeoffs can depend on the system with which deduplication is implemented and the types of data or files it handles.
[0010] As indicated above, in some instances, deduplication can be performed on a file-by-file basis. With such a system, rather than storing multiple copies of the same file, one instance of the file is stored, for example, in a central repository, and pointers to the file are stored in place of the redundant copies. However, deduplication at the file level can suffer in efficiencies as compared to deduplication using smaller segment sizes because even a small change in the file generally requires that an entire copy of the file be re-stored.
[0011] In addition to reducing the amount of storage space consumed, data deduplication can also help to relieve congestion on crowded communication pathways. In addition, the more efficient use of disk space can often allow data retention periods to increase, adding more integrity to the enterprise. Data deduplication is frequently used in conjunction with other forms of data reduction, including conventional data compression algorithms and delta difference storage.
[0012] Data deduplication often relies on hashing algorithms that hash the data segments to generate an identifying signature for the segments. Accordingly, each segment is processed using the hashing algorithm to generate a hash value. The resultant hash value is compared against hash values stored in a hash table to determine whether the segment already exists. If so, the segment is replaced with a pointer to the entry in the table containing the appropriate hash value or pointing to the location of the data in storage. Otherwise, the the new data is stored and its hash value is added to the table along with an address for the data.
[0013] Because hash functions are not perfect, the same hash value can in some cases be returned for segments containing different data. When such a false-positive occurs, the system can mistake new data for already-stored data and fail to store the new segment. Accordingly, multiple hash algorithms and other techniques can be employed to reduce the likelihood of these so-called hash collisions.
Brief Summary of Embodiments of the Invention
[0014] According to various embodiments, systems and methods are provided for data deduplication. Particularly, in some embodiments, techniques for performing reference table distribution and synchronization are provided. Accordingly, a reference table generated as a result of the deduplication process at a storage repository can be shared among a plurality of client systems that utilize a repository for data storage. This can be implemented to allow the client systems to perform local data deduplication before their data is sent to the repository. Likewise, this can also allow the client systems to receive deduplicated data from the storage repository. Accordingly, systems and methods can be implemented to allow deduplicated data to be transferred among a plurality of computing systems thereby reducing bandwidth requirements for data storage and retrieval operations.
[0015] In some embodiments, rather than distribute the entire reference table to each client for synchronization, a proper subset of reference table entries can be identified and shared with the client devices for synchronization. This can be implemented so as to reduce the amount of bandwidth required to synchronize the reference table among the computing systems. In further embodiments, the subset can be identified based on data utilization criteria.
[0016] According to an embodiment of the invention, systems and methods are provided for performing data deduplication for data used by a plurality of computing systems. The systems and methods can be configured to perform the steps of receiving at a shared storage repository data from the plurality of computing systems, performing a data deduplication operation on the received data, and transmitting an instantiation of a reference table for the deduplication to determined ones of the plurality of computing systems to allow deduplication to be performed by the determined ones of the plurality of computing systems.
[0017] The deduplication operation can include defining a segment of the received data; applying an algorithm to the defined data segment to generate a signature for the defined data segment; comparing the signature for the defined data segment with one or more signatures stored in a reference table for one or more previously defined data segments to determine whether the defined segment is already stored in the shared storage repository; and updating the reference table to include the signature for the defined data segment and a reference for the defined data segment if the defined data segment is not in the shared storage repository.
[0018] In one embodiment, a first instantiation of the reference table is sent to a first group of one or more of the plurality of computing systems and a second instantiation of the reference table is sent to a second group of one or more of the plurality of computing systems, wherein the first instantiation of the reference table is different from the second instantiation of the reference table.
[0019] The operation can further include a step of determining the instantiation of the reference table to be transmitted, and wherein the instantiation of the reference table is a proper subset of the reference table. The step of determining the instantiation of the reference table can include selecting one or more entries of the reference table based on at least one of utilization rate of data segments represented by the entries and size of the data segments represented by the entries. In another embodiment, the step of determining the instantiation of the reference table comprises selecting one or more entries of the reference table based on a combination of utilization rate of data segments represented by the entries and size of the data segments represented by the entries. Any of a number of combinations can be used. Fore example, the combination can be a weighted combination of utilization rate of data segments represented by the entries and size of the data segments represented by the entries.
[0020] Other features and aspects of the invention will become apparent from the following detailed description, taken in conjunction with the accompanying drawings, which illustrate, by way of example, the features in accordance with embodiments of the invention. The summary is not intended to limit the scope of the invention, which is defined solely by the claims attached hereto.
Brief Description of the Drawings
[0021] The present invention, in accordance with one or more various embodiments, is described in detail with reference to the following figures. The drawings are provided for purposes of illustration only and merely depict typical or example embodiments of the invention. These drawings are provided to facilitate the reader's understanding of the invention and shall not be considered limiting of the breadth, scope, or applicability of the invention. It should be noted that for clarity and ease of illustration these drawings are not necessarily made to scale.
[0022] FIG. 1 is a diagram illustrating an example process for data deduplication in accordance with various embodiments.
[0023] FIG. 2 is a diagram illustrating an example environment in which data from multiple computing systems is stored in one or more shared storage facilities.
[0024] FIG. 3 is a simplified block diagram illustrating another example environment with which embodiments of the invention can be implemented.
[0025] FIG. 4 is a diagram illustrating an example process for reference table synchronization in accordance with one embodiment of the invention.
[0026] FIG. 5 is a diagram illustrating an example of reference table synchronization in accordance with one embodiment of the invention.
[0027] FIG. 6 is a diagram illustrating an example of client groupings for targeted reference table synchronization in accordance with one embodiment of the invention.
[0028] FIG. 7 is a diagram illustrating an example process for reference table subset updating for synchronization in accordance with one embodiment of the invention.
[0029] FIG. 8 is a diagram illustrating another example process for reference table subset updating for synchronization in accordance with one embodiment of the invention.
[0030] FIG. 9 is a diagram illustrating an example computing system with which aspects of the systems and methods described herein can be implemented in accordance with one embodiment of the invention.
[0031] The figures are not intended to be exhaustive or to limit the invention to the precise form disclosed. It should be understood that the invention can be practiced with modification and alteration, and that the invention be limited only by the claims and the equivalents thereof.
Detailed Description of Embodiments of the Invention
[0032] The present invention is directed toward a system and method for data deduplication, and more particularly various embodiments are directed toward systems and methods for synchronization of reference tables to facilitate data deduplication. In various embodiments, data is stored for a plurality of clients in a shared storage environment, and rather than transfer large amounts of data among the clients and the shared storage, the data in shared storage is deduplicated and the hash table or other reference table for the data is shared among some or all of the clients. When a client has data to transfer to or place in the shared storage, that client can run a deduplication algorithm on segments of the data and use its own representative instantiation of the reference table to determine whether the data segments already exist in a shared data store. Accordingly, for a given segment, the client can determine whether to send the entire data segment to the shared storage or just send a reference or pointer or other information from the reference table if the segment is duplicative of what is already in the data store. In a situation where the analyzed segment is not in the data store, the client device can send the hash value or other reference table information to the central storage (or other location maintaining the main reference table) so that the primary reference table can be updated with the information on the newly added segment.
[0033] In various embodiments, the data store or shared storage repository can comprise any of a number of data storage architectures. For example, in one application, the shared storage can comprise one or more data storage systems accessible by and shared among multiple client systems such as, for example, one or more dedicated storage repositories or centralized storage repositories. In another example, the shared storage repository can comprise a plurality of storage locations distributed across some or all of the multiple clients among which the data is shared, or a combination of distributed and centralized storage devices.
[0034] In further embodiments of the invention, rather than send an entire reference table to each of the clients or client groups that are sharing the common storage, a subset of the table can be identified and only that subset is transmitted to the client systems to synchronize the reference tables among all of the devices. Additionally, different client systems or groups of client systems can receive different subsets of the reference table. Subsets can be defined for a given client or group of clients based on data utilization or other factors. Transferring a subset of the reference table rather than the entire reference table can reduce bandwidth consumption across the network, result in increased efficiency and reduce synchronization problems with the database.
[0035] For clarification, in the various embodiments described herein, the teim synchronization is not intended to require that all client devices be updated with a representative instantiation of the reference table at the same time or that all client devices receive the same reference table. Although in some embodiments the reference table or updates thereto can be broadcast to all participating systems simultaneously (or close to simultaneously), in other embodiments the reference table or its updates can be sent to different client devices or groups of client devices at different times. Likewise, in some embodiments the same reference table, or the same subset can be sent to all clients. However, in other embodiments, subsets can be tailored for a given client or group of clients.
[0036] Before describing the invention in detail, it is useful to describe a few example environments with which the invention can be implemented. One such example is that of a straightforward data deduplication algorithm with which the systems and methods described herein can be implemented. FIG. 1 is a diagram illustrating an example process for data deduplication in accordance with various embodiments. It will be appreciated after reading the description provided herein that the various embodiments of the invention not limited to applicability with this example data deduplication process, but can be implemented with any of a variety of foims of data deduplication.
[0037] Referring now to FIG. 1 , the illustrated example assumes an incoming data stream 120. For purposes of deduplication, the data stream can be segmented into a plurality of preferably equal-length segments. For example, in some embodiments, the data is broken up into segments that are 128 kB in length. In the illustrated example, incoming data stream 120 includes the segments A, B, C, A, C and D in that order. To perform the data deduplication, the computing system 132 receives the data, segments the data, and runs a hash function or other signature generation algorithm against each segment. The computing system 132 checks the resultant hash value for a given segment with hash values stored in hash table 127. If the resultant hash value does not match a hash value already stored, this indicates that the segment is a new segment of data. In this case, this new segment of data is written into file system 124, its hash value is added to hash table 127 as is a pointer to its address in the file system 124.
[0038] On the other hand, if the resultant hash value for a given segment already exists in the hash table 127, this indicates that the same data sequence in that segment is already stored in file system 124. Accordingly, rather than storing the entire segment in the file, only the pointer or address to the same segment that was previously stored needs to be retained. Following this methodology for data stream 120 results in the example file 129 illustrated as being stored in file system 124. This example file includes the first instances of segments A, B, C and D. However, for the subsequent instances of segments A and C that occurred in the incoming data stream 120, the file includes a pointer to the originally stored segments A and C. This is illustrated by ADDRESS A and ADDRESS C in file system 124.
[0039] To re-create the original data stream, segments are retrieved from file system 124 and assembled in order. Where an address exists in place of the actual data elements of the segment (ADDRESS A and ADDRESS C in the instant example), that address is accessed, the data retrieved and packaged into the reassembled data stream. In this example, resultant data stream 121 contains the same data as existed in original data stream 120.
[0040] Although the illustrated example depicts a system that utilizes a simple reference table having a hash value and pointer value for each segment, more complex systems can also make up an environment for the systems and methods described herein. Fore example, for the hash values the reference table can also include the source or sources of the data segment represented by the hash, a counter of the number of times that a given segment is encountered, the location of where the segments occur on client devices, and so on. As such, the reference table can be implemented as a hybrid of a hash table and a file allocation table (FAT). This can be useful as a backup in the event that a client system crashes or otherwise goes off line.
[0041] The above example is described in terms of an individual computing system (having one or more computing devices) performing local data deduplication for local data storage using a hash function. Data deduplication can also be performed for a plurality of computing systems using shared or local data storage or a combination thereof. For example, the data segments need not be stored at a central location such as file system 124 but can be stored at one or more client locations or at a combination of client locations and central storage locations. Accordingly, the pointers or addresses stored in the reference table can point to the actual storage location of the referenced segment whether that location be at a client storage location or in a central storage repository.
[0042] In addition, techniques other than hash functions can be used for data deduplication. Other algorithms can be used to generate a signature for the blocks of data. Likewise, other deduplication methods can also be used to identify redundancies or duplicate entries. Accordingly, the terms hash table, signature table, or reference table might be used in this document interchangeably to refer to the table, index, or other like mechanism used to track the data deduplication process, regardless of the actual file structure and regardless of the function used to arrive at the signatures.
[0043] As illustrated in the example of FIG. 1 , data deduplication can be implemented with a single or small computing system using local data storage. In other examples data deduplication can be implemented for data communications as well as for environments where information storage is at a centralized or other shared location, or spread across storage devices associated with multiple computing systems. FIG. 2 is a diagram illustrating an example environment in which data from multiple computing systems is stored in one or more shared storage facilities. Referring now to FIG. 2 , the illustrated example includes a plurality of computer systems 132 connected via one or more networks 147, 149 to two network-accessible storage facilities. These storage facilities in this example include a storage area network 128 and a network attached storage facility 137. Networks 147, 149 can be implemented utilizing any of a number of network technologies or topologies. The physical layer can include, for example fiber, copper, or wireless communication channels.
[0044] In this example, storage area network 128 can include a plurality of media drives 102 to provide sufficient quantities of data storage for the networked computing systems 132. For example, hard disk drives, disk arrays, optical storage drives and other high-volume memory or storage devices can be included with storage area network 128 to provide desired amounts of data storage at specified access speeds. Similarly, network attached storage can include any variety of storage media 114 to provide sufficient quantities of data storage at desired access speeds. Illustrated in this example, network attached storage 137 includes removable storage media 114, although fixed media can also be used. Likewise, media drives 102 associated with storage area network 128 can also use fixed or removable media.
[0045] Computing systems 132 connected to networks 147, 149 typically include application software 122 to perform desired operations. Although not illustrated, computing systems 132 typically also include an operating system on which the application software 122 runs. The file system 124 can be provided to facilitate and control file access by the operating system and application software 122. File systems 122 can facilitate access to local and remote storage devices for file or data access and storage. As also illustrated, computer systems 132 can include local storage such as a media module media drive 126 with fixed or removable media 136.
[0046] FIG. 3 is a simplified block diagram illustrating another example environment with which embodiments of the invention can be implemented. In the example illustrated in FIG. 3 , a plurality of computer systems 132 rely on a centralized server repository system 151 for data storage. In such an environment, computing systems 132 may retain some level of local data storage but may also rely on repository system 151 for larger-volume data storage. In such environments, computer systems 132 can transfer data files and the like to repository system 151 for storage via, for example, a communication network. Preferably, to reduce the volume of storage at repository system 151, data deduplication can be performed on data items that are received for storage using any of a number of different data deduplication techniques.
[0047] In one example, as data is received from a computer system 132 for storage, repository system 151 performs the data deduplication in an in-line or post-processing methodology for storage. For example, in terms of the exemplary deduplication methodology described above with respect to FIG. 1 , repository system 151 can break up the received data into a plurality of data segments or chunks; hash or otherwise process the bit patterns in each segment to generate a hash value or other signature; and compare the signature value of the newly received segment to signatures already stored in table 127. If the signature value already exists in table 127, this indicates the same bit sequence is already in the data storage and accordingly, the pointer to that segment is retrieved from table 127 and inserted in the file in place of that segment. The reference table 127 can be updated to include information reflecting this instance of the data segment. For example, a reference counter for the signature value can be incremented, the source of this instance of the data segment can be added to the table, the location of where the segment existed on the client can be added and so on.
[0048] If, on the other hand, the signature value does not already exist in table 127, the bit sequence is not in data storage. In such a case, this segment is placed into storage and the signature is placed in a new entry in table 127 along with a pointer to the storage location of the new segment. The reference table 127 can also include additional information reflecting information about the data segment such as, for example, the source of this first instance of the data segment, the location of where the segment existed on the client, and a reference counter indicating the number of times the segment was encountered.
[0049] As the example of FIG. 3 illustrates, in environments where data is stored and deduplicated at a centralized repository, large volumes of data that have not been deduplicated might still be stored or utilized locally and communicated across the network or other communication channels between the clients and the repository. The same scenario can hold true with other environments including the example illustrated in FIG. 2 . Accordingly, in various embodiments, the hash table or other like reference table can be shared among the various computer systems 132 so that synchronized deduplication can be performed. This can be accomplished by sending an instantiation of the reference table to the client devices 132. This instantiation can be the entire reference table itself, or a subset of the reference table.
[0050] Sharing the reference table with the client computing systems 132 allows the client systems 132 to deduplicate the data before it is passed to repository system 151 for storage. Further, this can allow the client systems 132 to consider segments already stored in the repository system 151 when doing their local deduplication. With such an arrangement, and assuming again the example duplication process described above with respect to FIG. 1 , a client system 132 can segment its data, hash the data to obtain a signature, and compare the obtain signature with the signatures in its local hash table. If the signature already exists, this indicates that the segment already exists in storage, assuming it is not a false positive. Accordingly, rather than transmit the entire segment to the repository system 141, client computing system 132 can retrieve the designated pointer for the signature from its local table and pass that pointer along in place of the data.
[0051] For large networks or other large computing environments, the hash table or other reference table 127 can grow to be quite large. Where this is the case, a substantial amount of bandwidth can be consumed by synchronizing the reference table 127 amongst repository system 151 and the various client computing systems 132. This situation can be compounded where large amounts of data are being stored by a large number of computing systems 132. In addition, as the repository is pruned, further reference-table synchronization opportunities are presented, leading to additional bandwidth consumption. Accordingly, embodiments can be implemented wherein a proper subset or portion of the reference table 127 is shared among the multiple computing systems to reduce, minimize or avoid sending the entire reference table 127 to the various systems for synchronization. For example, in one implementation, an entire reference table 127 can be sent to the client devices initially, and updates to synchronize the table to account for ongoing changes can be done by sending a proper subset containing less than the entire original table. As another example, in another embodiment, a proper subset is defined and sent initially rather than sending the entire table. Then, updates to the subset are made on an ongoing basis.
[0052] FIG. 4 is a diagram illustrating an example process for reference table synchronization in accordance with one embodiment of the invention. This example is described with reference to the exemplary environment of FIG. 3 and assumes the exemplary data deduplication process described above with reference to FIG. 1 . Description of this and other embodiments in terms of this exemplary environment an exemplary data deduplication process is made for ease of discussion purposes only. After reading these descriptions, one of ordinary skill will understand how the various embodiments described herein can be used in other data storage and communication environments and with other deduplication algorithms or processes.
[0053] Referring now to FIG. 4 , in step 181 data for deduplication and storage is received. In terms of the exemplary environments described above, data can be received from a client device 132 by storage repository 151 for storage. Storage repository 151 deduplicates the data, creating a reference table in the process. For example, in terms of the example described above with respect to FIG. 1 , storage repository 151 segments of data, hashes each segment to create a hash value signature, and compares the signature to existing entries in the reference table 127. Accordingly, a result of step 181 is storage of deduplicated data and creation of the reference table (such as, for example a hash table 127).
[0054] As illustrated at step 185, as additional data is received by storage repository 151 and other data removed from storage repository 151, the reference table is updated and maintained by storage repository 151. For example, new entries to the reference table are made to include signatures and pointers for new data segments received and old signatures and pointers are removed from the table as segments are deleted from the repository.
[0055] At step 188, the system performs reference table selection to identify a subset of entries in the reference table for streamlined reference-table-synchronization operations. Various algorithms or processes can be used to identify or define a subset of entries for streamlined synchronization. Generally, in one embodiment, algorithms are implemented to identify those data segments being stored in repository system 151 that have the highest utilization for highest likelihood of occurrence. In such an embodiment, synchronization of a relatively small portion of the reference table can result in bandwidth savings of a relatively larger proportion.
[0056] At step 192, the reference table is synchronized with one or more client devices 132. In the illustrated example, it is the subset identified in step 188 that is shared with (for example, sent to) client devices 132 to synchronize or update their local instances of the reference table. The process can continue through subsequent deduplication operations in which the reference table is updated with new entries, relevant subsets of the entries are identified in light of the changes to the reference table, and synchronization performed based on the reference table subset. This is indicated by step 195, which shows the reference-table subset generation and synchronization being performed on a periodic basis. In addition to adding new entries to the reference table for newly stored segments, updates to the reference table can also include updates to reference counter values, sources of data segments, and so on. In one embodiment, the synchronization operations can be run on a periodic basis based on temporal criteria such as the expiration of a period of time, or they can be triggered based on throughput metrics or other criteria. Examples of throughput criteria can include criteria such as, for example, the amount of new data stored in or removed from the system, the number of updates made to the reference table, and so on.
[0057] As indicated above with reference to step 188, one criteria that can be used to define the relevant subsets for reference table is based on data utilization. For example, in one embodiment, the system tracks not only the existence of a segment in the repository but also the utilization of each of the segments. One way in which utilization can be tracked is by tracking the quantity or frequency of occurrences of a given segment or the number of times it is accessed. The segments can be scored based on the utilization or access rates and ranked accordingly. This can be used in one embodiment to define or identify segments whose signatures will appear on the reference table subset.
[0058] As one example, the number of times that a given segment is presented to repository 151 for storage can be tracked by the system. This number can, in many applications, be directly proportional to the amount of communication bandwidth that is being consumed by transferring the segment from client devices 132 to storage repository 151. Accordingly, these higher utilization segments tend to have a larger impact on system bandwidth than segments within lower utilization. In such environments, defining the reference table subset based on utilization can allow a trade-off between reference table size and marginal improvements in bandwidth savings to be made. In other words, where a reference table for synchronization includes entries for infrequently used data segments, inclusion of these entries in the table for synchronization could consume more bandwidth than is saved by allowing these entries to be used for deduplication at the client side.
[0059] Another way to define a subset of the reference table for table synchronization can be to identify changes to the table since the last synchronization operation, such as new table entries or deletions. With changes identified, the system can be configured to send only those changes to the clients to update their local copies of the table. As noted above, in some embodiments not all clients are updated at the same time. Accordingly, changes to the reference table can be tracked on a client-by-client basis, or on the basis of groups of clients so that the updates can be managed based on the actual need of given clients.
[0060] FIG. 5 is a diagram illustrating an example of reference table synchronization in accordance with one embodiment of the invention. Referring now to FIG. 5 , in this example a reference table 211 is maintained in server repository system 151 for data deduplication purposes. Reference table 215 represents distribution of reference table 211 or portions thereof to the client computer systems 132. As indicated above, reference table 215 can be a subset of reference table 211 and can be updated using subsets identified for reference table 211 such as, for example, in accordance with the embodiment described above with reference to FIG. 4 . In an optimized system, a trade-off is made between the number of entries of the subset reference table pushed to each client system 132 and the actual or anticipated bandwidth saved by the inclusion of each additional entry.
[0061] In various environments, the process might be further streamlined by defining the reference table subset differently for different clients or different groups of clients 132. Thus, for example, different subsets of reference table 211 can be sent to different computing devices resulting in some or all of the client devices 132 having a reference table that is different from other client devices 132. As another example, client devices 132 can be combined into groupings based on various characteristics (described below) and different subsets of reference table 211 can be sent to the different groupings of client devices. FIG. 6 is a diagram illustrating an example of client groupings for targeted reference table synchronization in accordance with one embodiment of the invention. Referring now to FIG. 6 , client systems 132 are illustrated as being broken into two groupings 201, 202. This example also illustrates that two different reference tables 216, 217 are distributed to groupings 201, 202, respectively.
[0062] A number of factors or criteria can be considered when identifying targeted reference tables for a client and a group of clients. For example, the system can be configured to analyze the traffic received from each client or client grouping and perform client-specific utilization measurements. The most utilized entries can be identified on a client-by-client basis and the reference table subset identified accordingly. In another example, the reference table subsets for particular clients or groups of clients can be identified based on a number of other criteria including, for example, they size of the segments utilized by each of the clients, the type of processes being performed by each client, the client environment, characteristics of the client system, and so on. Each of these may have an effect on the quantity and type of data to be stored. As noted above, in some embodiments data in the reference table can be included to indicate the source of the data, its storage location, the number of occurrences and so on. Such data can be used in making the determination as to which clients or groups of clients will receive which subsets of the reference table.
[0063] As stated above, both segment size and utilization can be used as a metric to identify a subset of entries for the targeted reference tables for a client or group of clients. For example, in embodiments where stored segments can be of different sizes, selecting reference table data for larger segments would generally result in a greater gain in efficiencies than sharing reference data for smaller segments. Likewise, selecting reference table data for more frequently encountered segments generally results in a greater gain in efficiencies than sharing of reference data for infrequently used data. However, these generalizations are not always without exception. Consider for example a large segment of data that is very rarely used, or consider the opposite case of a smaller segment of data that is frequently utilized by a client or group of clients. In the first case, selecting the rarely used large segment for the subset may not yield the greatest gain in efficiencies. Therefore, a combination of factors, such as a combination of object size and utilization can be used to determine the subset of entries for synchronization.
[0064] Such a combination can made, for example, by multiplying the size of an object by its utilization frequency. As another example such a combination can be made as a weighted combination of utilization frequency and object size. As a further illustration of this latter example, objects can be weighted by their size, with larger objects being weighted higher than smaller objects. Their weight can then be multiplied by their utilization frequency to rank them for subset selection. Weighting can be done on a sliding scale or it can be done in groupings based on data object sizes in the system. As an example of such a grouping, the top 20% of objects by size can be given a weighting of 100%, the next 20% by size a weighting of 80% and so on. As another example, size thresholds can be defined such that objects above a certain size threshold can be given a certain weighting. As a specific example of this, objects above 1 MB might be weighted 100%, objects between 750 kB and 1 MB weighted 90% and so on. As these examples illustrate, there are a number of specific implementations that can be used to define a subset based on a combination of factors such as block size and frequency of utilization.
[0065] FIG. 7 is a diagram illustrating an example process for reference table subset updating in accordance with one embodiment of the invention. At step 227, client systems 132 that utilize repository system 151 can be identified. In embodiments where reference tables are targeted to particular clients or groups of clients, client characteristics can also be identified. At steps 231 and 234, a subset of the reference table is identified for a given client or client grouping and that subset is sent to that client or client group for synchronization. As illustrated by step 237, this process can be repeated for a plurality of clients or groups of clients.
[0066] At step 240, the reference table is monitored as data is received and deduplicated. The table is checked to determine whether changes are made to the reference table as a result of the new data. This check can also be made for data that is deleted from storage. This monitoring can be performed at the client side, the central repository, or at both locations. If changes are made, the process of identifying the subset and resynchronizing one or more of the clients with the new subset can be repeated as illustrated by step 244. In one example, the repository can receive data from a client, process and deduplicate the data for storage, and identify and send a representative hash table to the client for use in future storage operations. Because the data and hence the reference table can change over time, the subset can be re-defined and redistributed to the clients. As noted above, in one embodiment the subset is resent while in another embodiment only deltas to the subset are sent to the client to update the clients reference table.
[0067] FIG. 8 is a diagram illustrating another example process for reference table subset updating for synchronization in accordance with one embodiment of the invention. At step 262 and 266, a client system obtains data for storage and hashes representative segments of that data to determine deduplication signatures. Any of a number of techniques can be used to identify the representative segments that are determined for this process. For example, the first several segments can be chosen, a periodic or random sampling can be made, the most utilized segments from previous deduplication operations can be chosen, or other criteria used to identify a representative sampling. In steps 270 and 275, the signatures for these representative segments are sent to repository 151 and compared with signatures already existing at the central repository. As illustrated by steps 280 in 284, if changes are made the tables can be resynchronized.
[0068] The deduplication table subsets defined in the various embodiments can be used by the client devices for deduplication of data before it is sent to a central repository for storage. Because reference table updates can be client specific and because they can also be sent to different clients at different times, in some embodiments the synchronization does not result in an exact copy of the reference table being instantiated at each client device. Instead, at any given time, different clients can have different instantiations of the reference table and these instantiations are preferably selected based on size, utilization and other factors specific to the client or client group.
[0069] As used herein, the term module might describe a given unit of functionality that can be performed in accordance with one or more embodiments of the present invention. As used herein, a module might be implemented utilizing any form of hardware, software, or a combination thereof. For example, one or more processors, controllers, ASICs, PLAs, logical components, software routines or other mechanisms might be implemented to make up a module. In implementation, the various modules described herein might be implemented as discrete modules or the functions and features described can be shared in part or in total among one or more modules. In other words, as would be apparent to one of ordinary skill in the art after reading this description, the various features and functionality described herein may be implemented in any given application and can be implemented in one or more separate or shared modules in various combinations and permutations. Even though various features or elements of functionality may be individually described or claimed as separate modules, one of ordinary skill in the art will understand that these features and functionality can be shared among one or more common software and hardware elements, and such description shall not require or imply that separate hardware or software components are used to implement such features or functionality.
[0070] Where components or modules of the invention are implemented in whole or in part using software, in one embodiment, these software elements can be implemented to operate with a computing or processing module capable of carrying out the functionality described with respect thereto. One such example-computing module is shown in FIG. 9 . Various embodiments are described in terms of this example-computing module 300. After reading this description, it will become apparent to a person skilled in the relevant art how to implement the invention using other computing modules or architectures.
[0071] Referring now to FIG. 9 , computing module 300 may represent, for example, computing or processing capabilities found within desktop, laptop and notebook computers; hand-held computing devices (PDA's, smart phones, cell phones, palmtops, etc.); mainframes, supercomputers, workstations or servers; or any other type of special-purpose or general-purpose computing devices as may be desirable or appropriate for a given application or environment. Computing module 300 might also represent computing capabilities embedded within or otherwise available to a given device. For example, a computing module might be found in other electronic devices such as, for example, digital cameras, navigation systems, cellular telephones, portable computing devices, modems, routers, WAPs, terminals and other electronic devices that might include some form of processing capability.
[0072] Computing module 300 might include, for example, one or more processors, controllers, control modules, or other processing devices, such as a processor 304. Processor 304 might be implemented using a general-purpose or special-purpose processing engine such as, for example, a microprocessor, controller, or other control logic. In the example illustrated in FIG. 9 , processor 304 is connected to a bus 302, although any communication medium can be used to facilitate interaction with other components of computing module 300 or to communicate externally.
[0073] Computing module 300 might also include one or more memory modules, simply referred to herein as main memory 308. For example, preferably random access memory (RAM) or other dynamic memory might be used for storing information and instructions to be executed by processor 304. Main memory 308 might also be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 304. Computing module 300 might likewise include a read only memory (“ROM”) or other static storage device coupled to bus 302 for storing static information and instructions for processor 304.
[0074] The computing module 300 might also include one or more various forms of information storage mechanism 310, which might include, for example, a media drive 312 and a storage unit interface 320. The media drive 312 might include a drive or other mechanism to support fixed or removable storage media 314. For example, a hard disk drive, a floppy disk drive, a magnetic tape drive, an optical disk drive, a CD or DVD drive (R or RW), or other removable or fixed media drive might be provided. Accordingly, storage media 314, might include, for example, a hard disk, a floppy disk, magnetic tape, cartridge, optical disk, a CD or DVD, or other fixed or removable medium that is read by, written to or accessed by media drive 312. As these examples illustrate, the storage media 314 can include a computer usable storage medium having stored therein computer software or data.
[0075] In alternative embodiments, information storage mechanism 310 might include other similar instrumentalities for allowing computer programs or other instructions or data to be loaded into computing module 300. Such instrumentalities might include, for example, a fixed or removable storage unit 322 and an interface 320. Examples of such storage units 322 and interfaces 320 can include a program cartridge and cartridge interface, a removable memory (for example, a flash memory or other removable memory module) and memory slot, a PCMCIA slot and card, and other fixed or removable storage units 322 and interfaces 320 that allow software and data to be transferred from the storage unit 322 to computing module 300.
[0076] Computing module 300 might also include a communications interface 324. Communications interface 324 might be used to allow software and data to be transferred between computing module 300 and external devices. Examples of communications interface 324 might include a modem or softmodem, a network interface (such as an Ethernet, network interface card, WiMedia, IEEE 802.XX or other interface), a communications port (such as for example, a USB port, IR port, RS232 port Bluetooth® interface, or other port), or other communications interface. Software and data transferred via communications interface 324 might typically be carried on signals, which can be electronic, electromagnetic (which includes optical) or other signals capable of being exchanged by a given communications interface 324. These signals might be provided to communications interface 324 via a channel 328. This channel 328 might carry signals and might be implemented using a wired or wireless communication medium. These signals can deliver the software and data from memory or other storage medium in one computing system to memory or other storage medium in computing system 300. Some examples of a channel might include a phone line, a cellular link, an RF link, an optical link, a network interface, a local or wide area network, and other wired or wireless communications channels.
[0077] In this document, the terms “computer program medium” and “computer usable medium” are used to generally refer to physical storage media such as, for example, memory 308, storage unit 320, and media 314. These and other various forms of computer program media or computer usable media may be involved in storing one or more sequences of one or more instructions to a processing device for execution. Such instructions embodied on the medium, are generally referred to as “computer program code” or a “computer program product” (which may be grouped in the form of computer programs or other groupings). When executed, such instructions might enable the computing module 300 to perform features or functions of the present invention as discussed herein.
[0078] While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example only, and not of limitation. Likewise, the various diagrams may depict an example architectural or other configuration for the invention, which is done to aid in understanding the features and functionality that can be included in the invention. The invention is not restricted to the illustrated example architectures or configurations, but the desired features can be implemented using a variety of alternative architectures and configurations. Indeed, it will be apparent to one of skill in the art how alternative functional, logical or physical partitioning and configurations can be implemented to implement the desired features of the present invention. Also, a multitude of different constituent module names other than those depicted herein can be applied to the various partitions. Additionally, with regard to flow diagrams, operational descriptions and method claims, the order in which the steps are presented herein shall not mandate that various embodiments be implemented to perform the recited functionality in the same order unless the context dictates otherwise.
[0079] Although the invention is described above in terms of various exemplary embodiments and implementations, it should be understood that the various features, aspects and functionality described in one or more of the individual embodiments are not limited in their applicability to the particular embodiment with which they are described, but instead can be applied, alone or in various combinations, to one or more of the other embodiments of the invention, whether or not such embodiments are described and whether or not such features are presented as being a part of a described embodiment. Thus, the breadth and scope of the present invention should not be limited by any of the above-described exemplary embodiments.
[0080] Terms and phrases used in this document, and variations thereof, unless otherwise expressly stated, should be construed as open ended as opposed to limiting. As examples of the foregoing: the term “including” should be read as meaning “including, without limitation” or the like; the term “example” is used to provide exemplary instances of the item in discussion, not an exhaustive or limiting list thereof; the terms “a” or “an” should be read as meaning “at least one,” “one or more” or the like; and adjectives such as “conventional,” “traditional,” “normal,” “standard,” “known” and terms of similar meaning should not be construed as limiting the item described to a given time period or to an item available as of a given time, but instead should be read to encompass conventional, traditional, normal, or standard technologies that may be available or known now or at any time in the future. Likewise, where this document refers to technologies that would be apparent or known to one of ordinary skill in the art, such technologies encompass those apparent or known to the skilled artisan now or at any time in the future.
[0081] The presence of broadening words and phrases such as “one or more,” “at least,” “but not limited to” or other like phrases in some instances shall not be read to mean that the narrower case is intended or required in instances where such broadening phrases may be absent. The use of the term “module” does not imply that the components or functionality described or claimed as part of the module are all configured in a common package. Indeed, any or all of the various components of a module, whether control logic or other components, can be combined in a single package or separately maintained and can further be distributed in multiple groupings or packages or across multiple locations.
[0082] Additionally, the various embodiments set forth herein are described in terms of exemplary block diagrams, flow charts and other illustrations. As will become apparent to one of ordinary skill in the art after reading this document, the illustrated embodiments and their various alternatives can be implemented without confinement to the illustrated examples. For example, block diagrams and their accompanying description should not be construed as mandating a particular architecture or configuration.
Claims
The invention claimed is:
1. A computer-implemented method for performing data deduplication for data used by a plurality of computing systems, the method comprising:
receiving, over a computer network and at a shared deduplicated storage repository, data from a first computing system of a plurality of computing systems, each of the plurality of computing systems physically separate from the shared deduplicated storage repository and including application software executing thereon, the application software of the first computing system generating the received data;
with a processing system which comprises computer hardware, is physically separate from the plurality of computing systems, and is located at the shared deduplicated storage repository, performing a data deduplication operation on the received data, the deduplication operation comprising:
defining a segment of the received data;
applying an algorithm to the defined data segment to generate a signature for the defined data segment;
comparing the signature for the defined data segment with one or more signatures stored in a central reference table for one or more previously defined data segments to determine whether the defined segment is already stored in the shared deduplicated storage repository; and
updating the central reference table to include the signature for the defined data segment and a reference for the defined data segment if the defined data segment is not in the shared deduplicated storage repository;
subsequent to said performing the data deduplication operation, analyzing data traffic received from the plurality of computing systems;
based on said analyzing the data traffic, determining at least a second computing system of the plurality of computing systems to which to transmit an updated partial instantiation of the central reference table, the partial instantiation including the signature for the defined data segment;
transmitting the updated partial instantiation of the central reference table from the shared deduplicated storage repository to the determined second computing system of the plurality of computing systems, such that the partial instantiation of the central reference table local to the second computing system includes the at least one signature and a partial instantiation of the central reference table local to a third computing system of the plurality of computing systems does not include the at least one signature; and
with the second computing system, subsequent to said transmitting the partial instantiation of the central reference table:
generating a signature for a first data segment generated by the application software executing on the second computing system, the first data segment matching the defined data segment and scheduled for storage in the shared deduplicated storage repository;
comparing the signature for the first data segment with one or more signatures stored in the partial instantiation of the central reference table local to the second computing system;
determining that an entry exists in the partial instantiation of the central reference table local to the second computing system that corresponds to the signature for the first data segment; and
transmitting the signature for the first data segment over the network from the second computing system to the shared deduplicated storage repository without transmitting the first data segment itself.
2. The method of claim 1, wherein the partial instantiations of the reference table local to the second and third computing systems are proper subsets of the central reference table.
3. The method of claim 2, further comprising determining entries to include in the updated partial instantiation instantiation of the central reference table based on at least one of utilization rate of data segments represented by the entries and size of the data segments represented by the entries.
4. The method of claim 2, further comprising determining entries in the updated instantiation of the central reference table based on a combination of utilization rate of data segments represented by the entries and size of the data segments represented by the entries.
5. The method of claim 4, wherein the combination comprises a weighted combination of utilization rate of data segments represented by the entries and size of the data segments represented by the entries.
6. The method of claim 1, wherein the updated partial instantiation of the central reference table comprises a subset of some or all of the central reference table.
7. A computing system, comprising:
a deduplicated data storage repository in communication with a plurality of computing devices over a network, the deduplicated data storage repository shared by the plurality of computing devices, the plurality of computing devices each physically separate from the shared deduplicated storage repository and having application software executing thereon; and
a data deduplication computing device comprising computing hardware, physically separate from the plurality of computing systems, communicatively coupled to the data storage repository, and configured to:
perform data deduplication on a defined data segment received from a first computing system of the plurality of computing systems, the data segment generated by the application software executing on the first computing system;
generate a central reference table that includes signatures corresponding to deduplicated data contained in the data storage repository;
update the central reference table to include a signature for the defined data segment;
subsequent to updating the central reference table, analyze data traffic received from the plurality of computing systems;
based on the analysis of the data traffic, determine at least a second computing system of the plurality of computing systems to which to transmit an updated partial instantiation of the central reference table, the partial instantiation including the signature for the defined data segment; and
transmit the partial updated instantiation of the central reference table the second computing system, such that the partial instantiation of the central reference table local to the second computing system is updated to include the at least one signature while a partial instantiation of the central reference table local to the third computing system does not include the at least one signature;
the second computing system configured, subsequent to receiving the updated partial instantiation of the central reference table, to:
generate a signature for a first data segment generated by the application software executing on the second computing system, the first data segment matching the defined data segment and scheduled for storage in the shared deduplicated storage repository;
compare the signature for the first data segment with one or more signatures stored in the partial instantiation of the central reference table local to the second computing system;
determine that an entry exists in the partial instantiation of the central reference table local to the second computing system that corresponds to the signature for the first data segment; and
transmit the signature for the first data segment over the network from the second computing system to the deduplicated data storage repository without transmitting the first data segment itself.
8. The computing system of claim 7, wherein partial instantiations of the central reference table local to the second and third computing device are proper subsets of the central reference table.
9. The computing system of claim 8, wherein the data deduplication computing device is further configured to determine entries in the updated partial instantiation of the central reference table based on at least one of utilization rate of data segments represented by the entries and size of the data segments represented by the entries.
10. The computing system of claim 8, wherein the data deduplication computing device is further configured to determine entries in the updated instantiation of the reference table based on a combination of utilization rate of data segments represented by the entries and size of the data segments represented by the entries.
11. The computing system of claim 10, wherein the combination comprises a weighted combination of utilization rate of data segments represented by the entries and size of the data segments represented by the entries.
12. The computing system of claim 8, wherein the updated partial instantiation of the central reference table comprises a subset of some or all of the central reference table.
Patent Citations (250)
| 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 |
| 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 |
| US5410700(A) | 1995-04-01 | Fecteau et al. | Applicant |
| US5448724(A) | 1995-09-01 | Hayashi et al. | Applicant |
| US5491810(A) | 1996-02-01 | Allen | Applicant |
| US5495607(A) | 1996-02-01 | Pisello et al. | Applicant |
| US5499367(A) | 1996-03-01 | Bamford 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 |
| US5625793(A) | 1997-04-01 | Mirza | Applicant |
| US5638509(A) | 1997-06-01 | Dunphy 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 |
| US5732240(A) | 1998-03-01 | Caccavale | 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 |
| US5875478(A) | 1999-02-01 | Blumenau | Applicant |
| US5887134(A) | 1999-03-01 | Ebrahim | Applicant |
| US5901327(A) | 1999-05-01 | Ofek | Applicant |
| US5924102(A) | 1999-07-01 | Perks | Applicant |
| US5940833(A) | 1999-08-01 | Benson | Applicant |
| US5950205(A) | 1999-09-01 | Aviani, Jr. | Applicant |
| US5974563(A) | 1999-10-01 | Beeler, Jr. | Applicant |
| US5990810(A) | 1999-11-01 | Williams | Applicant |
| US6021415(A) | 2000-02-01 | Cannon et al. | Applicant |
| US6026414(A) | 2000-02-01 | Anglin | 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 |
| US6131095(A) | 2000-10-01 | Low et al. | Applicant |
| US6131190(A) | 2000-10-01 | Sidwell | Applicant |
| US6148412(A) | 2000-11-01 | Cannon et al. | Applicant |
| US6154787(A) | 2000-11-01 | Urevig et al. | Applicant |
| US6161111(A) | 2000-12-01 | Mutalik et al. | Applicant |
| US6167402(A) | 2000-12-01 | Yeager | 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 |
| US6301592(B1) | 2001-10-01 | Aoyama et al. | Applicant |
| US6324581(B1) | 2001-11-01 | Xu et al. | Applicant |
| US6328766(B1) | 2001-12-01 | Long | Applicant |
| US6330570(B1) | 2001-12-01 | Crighton | Applicant |
| US6330642(B1) | 2001-12-01 | Carteau | Applicant |
| US6343324(B1) | 2002-01-01 | Hubis et al. | Applicant |
| USRE37601(E) | 2002-03-01 | Eastridge et al. | Applicant |
| US6356801(B1) | 2002-03-01 | Goodman et al. | Applicant |
| US6389432(B1) | 2002-05-01 | Pothapragada et al. | Applicant |
| US6421711(B1) | 2002-07-01 | Blumenau et al. | Applicant |
| US6425057(B1) | 2002-07-01 | Cherkasova et al. | Applicant |
| US6487561(B1) | 2002-11-01 | Ofek et al. | Applicant |
| US6519679(B2) | 2003-02-01 | Devireddy et al. | Applicant |
| US6538669(B1) | 2003-03-01 | Lagueux, Jr. et al. | Applicant |
| US6564228(B1) | 2003-05-01 | O'Connor | Applicant |
| US6658526(B2) | 2003-12-01 | Nguyen et al. | Applicant |
| US6704730(B2) | 2004-03-01 | Moulton et al. | Applicant |
| US6757794(B2) | 2004-06-01 | Cabrera et al. | Applicant |
| US6810398(B2) | 2004-10-01 | Moulton | Applicant |
| US6823377(B1) | 2004-11-01 | Wu et al. | Applicant |
| US6865655(B1) | 2005-03-01 | Andersen | Applicant |
| US6952758(B2) | 2005-10-01 | Chron et al. | Applicant |
| US7028096(B1) | 2006-04-01 | Lee | Applicant |
| US7085904(B2) | 2006-08-01 | Mizuno et al. | Applicant |
| US7117246(B2) | 2006-10-01 | Christenson et al. | Applicant |
| US7143091(B2) | 2006-11-01 | Charnock | Applicant |
| US7246272(B2) | 2007-07-01 | Cabezas et al. | Applicant |
| US7272606(B2) | 2007-09-01 | Borthakur et al. | Applicant |
| US7287252(B2) | 2007-10-01 | Bussiere et al. | Applicant |
| US7383462(B2) | 2008-06-01 | Osaki et al. | Applicant |
| US7437388(B1) | 2008-10-01 | DeVos | Applicant |
| US7472238(B1) | 2008-12-01 | Gokhale et al. | Applicant |
| US7490207(B2) | 2009-02-01 | Amarendran et al. | Applicant |
| US7516186(B1) | 2009-04-01 | Borghetti et al. | Applicant |
| US7519726(B2) | 2009-04-01 | Palliyll et al. | Applicant |
| US7539710(B1) | 2009-05-01 | Haustein et al. | Examiner |
| US7568080(B2) | 2009-07-01 | Prahlad et al. | Applicant |
| US7584338(B1) | 2009-09-01 | Bricker et al. | Examiner |
| US7613748(B2) | 2009-11-01 | Brockway et al. | Applicant |
| US7631194(B2) | 2009-12-01 | Wahlert et al. | Applicant |
| US7657550(B2) | 2010-02-01 | Prahlad et al. | Applicant |
| US7685126(B2) | 2010-03-01 | Patel et al. | Applicant |
| US7720841(B2) | 2010-05-01 | Gu et al. | Applicant |
| US7734820(B1) | 2010-06-01 | Ranade et al. | Applicant |
| US7747579(B2) | 2010-06-01 | Prahlad et al. | Applicant |
| US7761425(B1) | 2010-07-01 | Erickson et al. | Applicant |
| US7797279(B1) | 2010-09-01 | Starling et al. | Applicant |
| US7814074(B2) | 2010-10-01 | Anglin et al. | Examiner |
| US7814149(B1) | 2010-10-01 | Stringham | Examiner |
| US7822939(B1) | 2010-10-01 | Veprinsky et al. | Applicant |
| US7827150(B1) | 2010-11-01 | Wu et al. | Applicant |
| US7831795(B2) | 2010-11-01 | Prahlad et al. | Applicant |
| US7962452(B2) | 2011-06-01 | Anglin | Examiner |
| US8074043(B1) | 2011-12-01 | Zeis | Applicant |
| US8145614(B1) | 2012-03-01 | Zimran et al. | Applicant |
| US8200923(B1) | 2012-06-01 | Healey et al. | Applicant |
| US8209334(B1) | 2012-06-01 | Doerner | Applicant |
| US8280854(B1) | 2012-10-01 | Emmert | Applicant |
| US8364652(B2) | 2013-01-01 | Vijayan et al. | Applicant |
| US8468320(B1) | 2013-06-01 | Stringham | Examiner |
| US8484162(B2) | 2013-07-01 | Prahlad et al. | Applicant |
| US8572340(B2) | 2013-10-01 | Vijayan et al. | Applicant |
| US8577851(B2) | 2013-11-01 | Vijayan et al. | Applicant |
| US8578109(B2) | 2013-11-01 | Vijayan et al. | Applicant |
| US2001/0052015(A1) | 2001-12-01 | Lin et al. | Applicant |
| US2002/0107877(A1) | 2002-08-01 | Whiting et al. | Applicant |
| US2002/0143892(A1) | 2002-10-01 | Mogul | Applicant |
| US2002/0169934(A1) | 2002-11-01 | Krapp et al. | Applicant |
| US2003/0033308(A1) | 2003-02-01 | Patel et al. | Applicant |
| US2003/0172130(A1) | 2003-09-01 | Fruchtman et al. | Applicant |
| US2003/0174648(A1) | 2003-09-01 | Wang et al. | Applicant |
| US2003/0187917(A1) | 2003-10-01 | Cohen | Applicant |
| US2003/0188106(A1) | 2003-10-01 | Cohen | Applicant |
| US2004/0010562(A1) | 2004-01-01 | Itonaga | Applicant |
| US2004/0148306(A1) | 2004-07-01 | Moulton et al. | Applicant |
| US2004/0230753(A1) | 2004-11-01 | Amiri et al. | Applicant |
| US2005/0033756(A1) | 2005-02-01 | Kottomtharayil et al. | Applicant |
| US2005/0117558(A1) | 2005-06-01 | Angermann et al. | Applicant |
| US2005/0204108(A1) | 2005-09-01 | Ofek et al. | Applicant |
| US2005/0216659(A1) | 2005-09-01 | Ogawa et al. | Applicant |
| US2005/0243609(A1) | 2005-11-01 | Yang et al. | Applicant |
| US2005/0246393(A1) | 2005-11-01 | Coates et al. | Applicant |
| US2005/0273654(A1) | 2005-12-01 | Chen et al. | Applicant |
| US2006/0010227(A1) | 2006-01-01 | Atluri | Applicant |
| US2006/0064456(A1) | 2006-03-01 | Kalthoff et al. | Applicant |
| US2006/0095527(A1) | 2006-05-01 | Malik | Applicant |
| US2006/0101096(A1) | 2006-05-01 | Fuerst | Applicant |
| US2006/0168318(A1) | 2006-07-01 | Twiss | Applicant |
| US2006/0179405(A1) | 2006-08-01 | Chao et al. | Applicant |
| US2006/0224846(A1) | 2006-10-01 | Amarendran et al. | Applicant |
| US2007/0156966(A1) | 2007-07-01 | Sundarrajan et al. | Applicant |
| US2007/0162462(A1) | 2007-07-01 | Zhang et al. | Applicant |
| US2007/0179995(A1) | 2007-08-01 | Prahlad et al. | Applicant |
| US2007/0192542(A1) | 2007-08-01 | Frolund et al. | Applicant |
| US2007/0192544(A1) | 2007-08-01 | Frolund et al. | Applicant |
| US2007/0203937(A1) | 2007-08-01 | Prahlad et al. | Applicant |
| US2007/0250670(A1) | 2007-10-01 | Fineberg et al. | Applicant |
| US2007/0255758(A1) | 2007-11-01 | Zheng et al. | Applicant |
| US2008/0005509(A1) | 2008-01-01 | Smith et al. | Applicant |
| US2008/0016131(A1) | 2008-01-01 | Sandorfi et al. | Applicant |
| US2008/0091655(A1) | 2008-04-01 | Gokhale et al. | Applicant |
| US2008/0098041(A1) | 2008-04-01 | Chidambaran et al. | Applicant |
| US2008/0133561(A1) | 2008-06-01 | Dubnicki et al. | Applicant |
| US2008/0159331(A1) | 2008-07-01 | Mace et al. | Applicant |
| US2008/0229037(A1) | 2008-09-01 | Bunte et al. | Applicant |
| US2008/0243879(A1) | 2008-10-01 | Gokhale et al. | Applicant |
| US2008/0243914(A1) | 2008-10-01 | Prahlad et al. | Applicant |
| US2008/0243953(A1) | 2008-10-01 | Wu et al. | Applicant |
| US2008/0243957(A1) | 2008-10-01 | Prahlad et al. | Applicant |
| US2008/0243958(A1) | 2008-10-01 | Prahlad et al. | Applicant |
| US2008/0244172(A1) | 2008-10-01 | Kano | Applicant |
| US2008/0244199(A1) | 2008-10-01 | Nakamura et al. | Applicant |
| US2008/0244204(A1) | 2008-10-01 | Cremelie et al. | Applicant |
| US2008/0250204(A1) | 2008-10-01 | Kavuri et al. | Applicant |
| US2008/0294696(A1) | 2008-11-01 | Frandzel | Applicant |
| US2009/0013129(A1) | 2009-01-01 | Bondurant | Applicant |
| US2009/0043767(A1) | 2009-02-01 | Joshi et al. | Applicant |
| US2009/0055425(A1) | 2009-02-01 | Evans et al. | Applicant |
| US2009/0055471(A1) | 2009-02-01 | Kozat et al. | Applicant |
| US2009/0138481(A1) | 2009-05-01 | Chatley et al. | Applicant |
| US2009/0144416(A1) | 2009-06-01 | Chatley et al. | Applicant |
| US2009/0144422(A1) | 2009-06-01 | Chatley et al. | Applicant |
| US2009/0172139(A1) | 2009-07-01 | Wong et al. | Applicant |
| US2009/0204636(A1) | 2009-08-01 | Li et al. | Applicant |
| US2009/0204649(A1) | 2009-08-01 | Wong et al. | Applicant |
| US2009/0210431(A1) | 2009-08-01 | Marinkovic et al. | Applicant |
| US2009/0254507(A1) | 2009-10-01 | Hosoya et al. | Applicant |
| US2009/0271454(A1) | 2009-10-01 | Anglin et al. | Applicant |
| US2009/0276454(A1) | 2009-11-01 | Smith | Applicant |
| US2009/0307251(A1) | 2009-12-01 | Heller et al. | Applicant |
| US2009/0319534(A1) | 2009-12-01 | Gokhale | Applicant |
| US2009/0319585(A1) | 2009-12-01 | Gokhale | Applicant |
| US2009/0327625(A1) | 2009-12-01 | Jaquette et al. | Applicant |
| US2010/0005259(A1) | 2010-01-01 | Prahlad | Applicant |
| US2010/0036887(A1) | 2010-02-01 | Anglin et al. | Applicant |
| US2010/0042790(A1) | 2010-02-01 | Mondal et al. | Applicant |
| US2010/0070478(A1) | 2010-03-01 | Anglin | Applicant |
| US2010/0077161(A1) | 2010-03-01 | Stoakes et al. | Applicant |
| US2010/0082672(A1) | 2010-04-01 | Kottomtharayil et al. | Applicant |
| US2010/0094817(A1) | 2010-04-01 | Ben-Shaul et al. | Applicant |
| US2010/0114833(A1) | 2010-05-01 | Mu | Applicant |
| US2010/0169287(A1) | 2010-07-01 | Klose | Applicant |
| US2010/0180075(A1) | 2010-07-01 | McCloskey et al. | Applicant |
| US2010/0250501(A1) | 2010-09-01 | Mandagere et al. | Examiner |
| US2010/0250896(A1) | 2010-09-01 | Matze | Applicant |
| US2010/0299490(A1) | 2010-11-01 | Attarde et al. | Applicant |
| US2010/0312752(A1) | 2010-12-01 | Zeis et al. | Applicant |
| US2011/0072291(A1) | 2011-03-01 | Murase | Examiner |
| US2011/0113016(A1) | 2011-05-01 | Gruhl et al. | Applicant |
| US2011/0161723(A1) | 2011-06-01 | Taleck et al. | Applicant |
| US2011/0276543(A1) | 2011-11-01 | Matze | Applicant |
| US2011/0289281(A1) | 2011-11-01 | Spackman | Applicant |
| US2012/0011101(A1) | 2012-01-01 | Fang et al. | Applicant |
| US2012/0078881(A1) | 2012-03-01 | Crump et al. | Applicant |
| US2012/0150814(A1) | 2012-06-01 | Retnamma et al. | Applicant |
| US2012/0150817(A1) | 2012-06-01 | Retnamma et al. | Applicant |
| US2012/0150818(A1) | 2012-06-01 | Retnamma et al. | Applicant |
| US2012/0150826(A1) | 2012-06-01 | Retnamma et al. | Applicant |
| US2012/0150949(A1) | 2012-06-01 | Retnamma et al. | Applicant |
| US2012/0221817(A1) | 2012-08-01 | Yueh | Examiner |
| US2013/0232309(A1) | 2013-09-01 | Vijayan et al. | Applicant |
| US2013/0290280(A1) | 2013-10-01 | Prahlad et al. | Applicant |
| US2013/0339298(A1) | 2013-12-01 | Muller et al. | Applicant |
| US2013/0339299(A1) | 2013-12-01 | Muller et al. | Applicant |
| US2013/0339300(A1) | 2013-12-01 | Muller et al. | Applicant |
| US2013/0339310(A1) | 2013-12-01 | Muller et al. | Applicant |
| US2013/0339390(A1) | 2013-12-01 | Muller et al. | Applicant |
| US2013/0346373(A1) | 2013-12-01 | Muller et al. | Applicant |
| US2014/0032864(A1) | 2014-01-01 | Vijayan et al. | Applicant |
| US2014/0201170(A1) | 2014-07-01 | Vijayan et al. | Applicant |
| US2014/0201171(A1) | 2014-07-01 | Vijayan 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 | |
| WO95/13580 | 1995-05-01 | Applicant | |
| WO99/09480(A1) | 1999-02-01 | Applicant | |
| WO99/12098 | 1999-03-01 | Applicant | |
| WO2010/013292(A1) | 2010-02-01 | Applicant | |
| WO2012/044366 | 2012-04-01 | Applicant | |
| WO2012/044367 | 2012-04-01 | Applicant | |
| WO2013/188550 | 2013-12-01 | Applicant |
Non-Patent Literature (22)
- Armstead et al., “Implementation of a Campus-Wide Distributed Mass Storage Service: The Dream vs. Reality,” IEEE, 1995, pp. 190-199.Applicant
- Arneson, “Mass Storage Archiving in Network Environments,” Digest of Papers, Ninth IEEE Symposium on Mass Storage Systems, Oct. 31-Nov. 3, 1988, pp. 45-50, Monterey, CA.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-9, 1995, pp. 420-427, San Francisco, CA.Applicant
- Cohen, Edith, et al., “The Age Penalty and Its Effect on Cache Performance.” In USITS, pp. 73-84. 2001.Applicant
- Cohen, Edith, et al., “Aging through cascaded caches: Performance issues in the distribution of web content.” In ACM SIGCOMM Computer Communication Review, vol. 31, No. 4, pp. 41-53. ACM, 2001.Applicant
- Cohen, Edith, et al., “Refreshment policies for web content caches.” Computer Networks 38.6 (2002): 795-808.Applicant
- CommVault Systems, Inc. “Continuous Data Replicator 7.0,” Product Data Sheet, 2007.Applicant
- CommVault Systems, Inc., “Deduplication—How To,” http://documentation.commvault.com/commvault/release—8—0—0/books—online—1/english—US/features/single—instance/single—instance—how—to.htm, internet accessed on Jan. 26, 2009, 7 pages.Applicant
- CommVault Systems, Inc., “Deduplication,” http://documentation.commvault.com/commvault/release—8—0—0/books—online—1/english—US/features/single—instance/single—instance.htm, internet accessed on Jan. 26, 2009, 9 pages.Applicant
- Diligent Technologies HyperFactor, http://www.dilligent.com/products:protecTIER-1:HyperFactor-1, Internet accessed on Dec. 5, 2008, 2 pages.Applicant
- Eitel, “Backup and Storage Management in Distributed Heterogeneous Environments,” IEEE, 1994, pp. 124-126.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
- Jander, “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4(Mar. 21, 1998), pp. 64-72.Applicant
- Kornblum, Jesse, “Identifying Almost Identical Files Using Context Triggered Piecewise Hashing,” www.sciencedirect.com, Digital Investigation 3S (2006), pp. S91-S97.Applicant
- Lortu Software Development, “Kondar Technology—Deduplication,” http://www.lortu.com/en/deduplication.asp, Internet accessed on Dec. 5, 2008, 3 pages.Applicant
- Overland Storage, “Data Deduplication,” http://www.overlandstorage.com/topics/data—deduplication.html, Internet accessed on Dec. 5, 2008, 2 pages.Applicant
- Quantum Corporation, “Data De-Duplication Background: A Technical White Paper,” May 2008, 13 pages.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
- International Search Report and Written Opinion, International Application No. PCT/US2009/58137, Mail Date Dec. 23, 2009, 9 pages.Applicant
- International Search Report and Written Opinion, International Application No. PCT/US2011/030804, mailed Jun. 9, 2011, 14 pages.Applicant
- International Search Report and Written Opinion, International Application No. PCT/US2011/030814, mailed Jun. 9, 2011, 14 pages.Applicant
- International Search Report and Written Opinion, International Application No. PCT/US2013/045443 mailed Nov. 14, 2013, 16 pages.Applicant