Computer data is vital to today's organizations, and a significant part of protection against disasters is focused on data protection. As solid-state memory has advanced to the point where cost of memory has become a relatively insignificant factor, organizations may afford to operate with systems that store and process terabytes of data.
Conventional data protection systems include tape backup drives, for storing organizational production site data on a periodic basis. Such systems suffer from several drawbacks. First, they require a system shutdown during backup, since the data being backed up cannot be used during the backup operation. Second, they limit the points in time to which the production site may recover. For example, if data is backed up on a daily basis, there may be several hours of lost data in the event of a disaster. Third, the data recovery process itself takes a long time.
Another conventional data protection system uses data replication, by creating a copy of the organization's production site data on a secondary backup storage system, and updating the backup with changes. The backup storage system may be situated in the same physical location as the production storage system, or in a physically remote location. Data replication systems generally operate either at the application level, at the file system level, or at the data block level.
Current data protection systems try to provide continuous data protection, which enable the organization to roll back to any specified point in time within a recent history. Continuous data protection systems aim to satisfy two conflicting objectives, as best as possible; namely, (i) minimize the down time, in which the organization production site data is unavailable, during a recovery, and (ii) enable recovery as close as possible to any specified point in time within a recent history.
Continuous data protection typically uses a technology referred to as “journaling,” whereby a log is kept of changes made to the backup storage. During a recovery, the journal entries serve as successive “undo” information, enabling roll back of the backup storage to previous points in time. Journaling was first implemented in database systems, and was later extended to broader data protection.
One challenge to continuous data protection is the ability of a backup site to keep pace with the data transactions of a production site, without slowing down the production a site. The overhead of journaling inherently requires several data transactions at the backup site for each data transaction at the production site. As such, when data transactions occur at a high rate at the production site, the backup site may not be able to finish backing up one data transaction before the next production site data transaction occurs. If the production site is not forced to slow down, then necessarily a backlog of un-logged data transactions may build up at the backup site. Without being able to satisfactorily adapt dynamically to changing data transaction rates, a continuous data protection system chokes and eventually forces the production site to shut down.
In one aspect, a method includes intercepting write I/Os going to a volume on a storage array and sending the write I/Os to targets on a plurality of source-side data protection appliances based on a load balancing scheme.
In another aspect, an article includes a non-transitory machine-readable medium that stores executable instructions. The instructions cause a machine to intercept write I/Os going to a volume on a storage array and send the write I/Os to targets on a plurality of source-side data protection appliances based on a load balancing scheme.
In a further aspect, an apparatus includes circuitry configured to intercept write I/Os going to a volume on a storage array and send the write I/Os to targets on a plurality of source-side data protection appliances based on a load balancing scheme.
Described herein are various techniques to replicate data using consistency groups. Replication of one consistency group may be across several replication appliances (called herein data protection appliances (DPA)). In one example, volumes may be striped. Each volume may be presented as a set of stripes striped volume. A new virtual CG may be formed which may include several internal CGs. The virtual CG may be presented to the user and the user may be able to perform all actions on the virtual CG. Internally, in some examples, each internal CG may replicate just some of the stripes of the volumes. As well a consistency point may be achieved across internal CGs. That is, it may be possible to form an image of a particular time by rolling each internal CG group to that time. In some examples, the internal CGs may not be exposed to the user and all actions happen automatically on the internal CGs when performed on the virtual CG. Internal CG groups may also be referred to as Grid Copies.
Typical replication technologies either run in the array or run on network or host. Conventional array based technologies are limited to the internal array and are homogenous, network technologies limited to replicating whole LUs (logical units). The typical arrays have trouble replicating a high performance environment in a single consistency group, or have trouble with real time load balancing. Current host based replication is usually limited, intrusive and cannot replicate data shared in clusters. Conversely, the current specification, in some examples, enable load balancing though the volume virtualization and enables high performance replication using clusters of replication devices.
The following definitions may be useful in understanding the specification and claims.
BACKUP SITE—a facility where replicated production site data is stored; the backup site may be located in a remote site or at the same location as the production site;
Data Protection Appliance (DPA)—a computer or a cluster of computers responsible for data protection services including inter alia data replication of a storage system, and journaling of I/O requests issued by a host computer to the storage system;
CG—consistency group—a set of logical units (LUs) which are replicated together for which write order fidelity is preserved;
Grid Copy—another name for an internal consistency group, a grid copy is a unit of replication which runs on a single replication appliance and replicates part of consistency group data;
HOST—at least one computer or networks of computers that runs at least one data processing application that issues I/O requests to one or more storage systems; a host is an initiator with a SAN;
HOST DEVICE—an internal interface in a host, to a logical storage unit;
IMAGE—a copy of a logical storage unit at a specific point in time;
INITIATOR—a node in a SAN that issues I/O requests;
INTERNAL CONSISTENCY GROUP—another name for grid copy. A consistency Group includes one or more internal consistency groups;
I/O REQUEST—an input/output request which may be a read I/O request (read request) or a write I/O request (write request), also referred to as an I/O;
JOURNAL—a record of write transactions issued to a storage system; used to maintain a duplicate storage system, and to roll back the duplicate storage system to a previous point in time;
LOGICAL UNIT—a logical entity provided by a storage system for accessing data from the storage system;
LUN—a logical unit number for identifying a logical unit;
PHYSICAL STORAGE UNIT—a physical entity, such as a disk or an array of disks, for storing data in storage locations that can be accessed by address;
PRODUCTION SITE—a facility where one or more host computers run data processing applications that write data to a storage system and read data from the storage system;
REMOTE ACKNOWLEDGEMENTS—an acknowledgement from remote DPA to the local DPA that data arrived at the remote DPA (either to the appliance or the journal);
SPLITTER ACKNOWLEDGEMENT—an acknowledgement from a DPA to a data protection agent (splitter) that data has been received at the DPA; this may be achieved by a SCSI status command;
SAN—a storage area network of nodes that send and receive I/O and other requests, each node in the network being an initiator or a target, or both an initiator and a target;
SOURCE SIDE—a transmitter of data within a data replication workflow, during normal operation a production site is the source side; and during data recovery a backup site is the source side;
STORAGE SYSTEM—a SAN entity that provides multiple logical units for access by multiple SAN initiators;
TARGET—a node in a SAN that replies to I/O requests;
TARGET SIDE—a receiver of data within a data replication workflow; during normal operation a back site is the target side, and during data recovery a production site is the target side;
VIRTUAL CONSISTENCY GROUP—represents a consistency group and includes one or more internal consistency groups (grid copies) sometimes over more than one DPA; and
WAN—a wide area network that connects local networks and enables them to communicate with one another, such as the Internet.
A description of journaling and some techniques associated with journaling may be described in the patent titled “METHODS AND APPARATUS FOR OPTIMAL JOURNALING FOR CONTINUOUS DATA REPLICATION” and with U.S. Pat. No. 7,516,287, which is hereby incorporated by reference.
An Example of a Replication System
Referring to
During normal operations, the direction of replicate data flow goes from source side to target side. It is possible, however, for a user to reverse the direction of replicate data flow, in which case Site I starts to behave as a target backup site, and Site II starts to behave as a source production site. Such change of replication direction is referred to as a “failover”. A failover may be performed in the event of a disaster at the production site, or for other reasons. In some data architectures, Site I or Site II behaves as a production site for a portion of stored data, and behaves simultaneously as a backup site for another portion of stored data. In some data architectures, a portion of stored data is replicated to a backup site, and another portion is not.
The production site and the backup site may be remote from one another, or they may both be situated at a common site, local to one another. Local data protection has the advantage of minimizing data lag between target and source, and remote data protection has the advantage is being robust in the event that a disaster occurs at the source side.
The source and target sides communicate via a wide area network (WAN) 128, although other types of networks may be used.
Each side of system 100 includes three major components coupled via a storage area network (SAN); namely, (i) a storage system, (ii) a host computer, and (iii) a data protection appliance (DPA). Specifically with reference to
Generally, a SAN includes one or more devices, referred to as “nodes”. A node in a SAN may be an “initiator” or a “target”, or both. An initiator node is a device that is able to initiate requests to one or more other devices; and a target node is a device that is able to reply to requests, such as SCSI commands, sent by an initiator node. A SAN may also include network switches, such as fiber channel switches. The communication links between each host computer and its corresponding storage system may be any appropriate medium suitable for data transfer, such as fiber communication channel links.
The host communicates with its corresponding storage system using small computer system interface (SCSI) commands.
System 100 includes source storage system 108 and target storage system 120. Each storage system includes physical storage units for storing data, such as disks or arrays of disks. Typically, storage systems 108 and 120 are target nodes. In order to enable initiators to send requests to storage system 108, storage system 108 exposes one or more logical units (LU) to which commands are issued. Thus, storage systems 108 and 120 are SAN entities that provide multiple logical units for access by multiple SAN initiators.
Logical units are a logical entity provided by a storage system, for accessing data stored in the storage system. A logical unit is identified by a unique logical unit number (LUN). Storage system 108 exposes a logical unit 136, designated as LU A, and storage system 120 exposes a logical unit 156, designated as LU B.
LU B is used for replicating LU A. As such, LU B is generated as a copy of LU A. In one embodiment, LU B is configured so that its size is identical to the size of LU A. Thus for LU A, storage system 120 serves as a backup for source side storage system 108. Alternatively, as mentioned hereinabove, some logical units of storage system 120 may be used to back up logical units of storage system 108, and other logical units of storage system 120 may be used for other purposes. Moreover, there is symmetric replication whereby some logical units of storage system 108 are used for replicating logical units of storage system 120, and other logical units of storage system 120 are used for replicating other logical units of storage system 108.
System 100 includes a source side host computer 104 and a target side host computer 116. A host computer may be one computer, or a plurality of computers, or a network of distributed computers, each computer may include inter alia a conventional CPU, volatile and non-volatile memory, a data bus, an I/O interface, a display interface and a network interface. Generally a host computer runs at least one data processing application, such as a database application and an e-mail server.
Generally, an operating system of a host computer creates a host device for each logical unit exposed by a storage system in the host computer SAN. A host device is a logical entity in a host computer, through which a host computer may access a logical unit. Host device 104 identifies LU A and generates a corresponding host device 140, designated as Device A, through which it can access LU A. Similarly, host computer 116 identifies LU B and generates a corresponding device 160, designated as Device B.
In the course of continuous operation, host computer 104 is a SAN initiator that issues I/O requests (write/read operations) through host device 140 to LU A using, for example, SCSI commands. Such requests are generally transmitted to LU A with an address that includes a specific device identifier, an offset within the device, and a data size. Offsets are generally aligned to 512 byte blocks. The average size of a write operation issued by host computer 104 may be, for example, 10 kilobytes (KB); i.e., 20 blocks. For an I/O rate of 50 megabytes (MB) per second, this corresponds to approximately 5,000 write transactions per second.
System 100 includes two data protection appliances, a source side DPA 112 and a target side DPA 124. A DPA performs various data protection services, such as data replication of a storage system, and journaling of I/O requests issued by a host computer to source side storage system data. As explained in detail herein, when acting as a target side DPA, a DPA may also enable roll back of data to an earlier point in time, and processing of rolled back data at the target site. Each DPA 112 and 124 is a computer that includes inter alia one or more conventional CPUs and internal memory.
For additional safety precaution, each DPA is a cluster of such computers. Use of a cluster ensures that if a DPA computer is down, then the DPA functionality switches over to another computer. The DPA computers within a DPA cluster communicate with one another using at least one communication link suitable for data transfer via fiber channel or IP based protocols, or such other transfer protocol. One computer from the DPA cluster serves as the DPA leader. The DPA cluster leader coordinates between the computers in the cluster, and may also perform other tasks that require coordination between the computers, such as load balancing.
In the architecture illustrated in
DPAs 112 and 124 are configured to act as initiators in the SAN; i.e., they can issue I/O requests using, for example, SCSI commands, to access logical units on their respective storage systems. DPA 112 and DPA 124 are also configured with the necessary functionality to act as targets; i.e., to reply to I/O requests, such as SCSI commands, issued by other initiators in the SAN, including inter alia their respective host computers 104 and 116. Being target nodes, DPA 112 and DPA 124 may dynamically expose or remove one or more logical units.
As described hereinabove, Site I and Site II may each behave simultaneously as a production site and a backup site for different logical units. As such, DPA 112 and DPA 124 may each behave as a source DPA for some logical units, and as a target DPA for other logical units, at the same time.
Host computer 104 and host computer 116 include data protection agents 144 and 164, respectively. Data protection agents 144 and 164 intercept SCSI commands issued by their respective host computers, via host devices to logical units that are accessible to the host computers. A data protection agent (also referred to herein as a splitter or simply as a protection agent) may act on an intercepted SCSI commands issued to a logical unit, in one of the following ways: send the SCSI commands to its intended logical unit; redirect the SCSI command to another logical unit; split the SCSI command by sending it first to the respective DPA; after the DPA returns an acknowledgement, send the SCSI command to its intended logical unit; fail a SCSI command by returning an error return code; and delay a SCSI command by not returning an acknowledgement to the respective host computer.
A data protection agent may handle different SCSI commands, differently, according to the type of the command. For example, a SCSI command inquiring about the size of a certain logical unit may be sent directly to that logical unit, while a SCSI write command may be split and sent first to a DPA associated with the agent. A data protection agent may also change its behavior for handling SCSI commands, for example as a result of an instruction received from the DPA.
Specifically, the behavior of a protection agent for a certain host device generally corresponds to the behavior of its associated DPA with respect to the logical unit of the host device. When a DPA behaves as a source site DPA for a certain logical unit, then during normal course of operation, the associated protection agent splits I/O requests issued by a host computer to the host device corresponding to that logical unit. Similarly, when a DPA behaves as a target device for a certain logical unit, then during normal course of operation, the associated protection agent fails I/O requests issued by host computer to the host device corresponding to that logical unit.
Communication between protection agents and their respective DPAs may use any protocol suitable for data transfer within a SAN, such as fiber channel, or SCSI over fiber a channel. The communication may be direct, or via a logical unit exposed by the DPA. Protection agents communicate with their respective DPAs by sending SCSI commands over fiber channel.
Protection agents 144 and 164 are drivers located in their respective host computers 104 and 116. Alternatively, a protection agent may also be located in a fiber channel switch, or in any other device situated in a data path between a host computer and a storage system or on the storage system itself.
What follows is a detailed description of system behavior under normal production mode, and under recovery mode.
In production mode DPA 112 acts as a source site DPA for LU A. Thus, protection agent 144 is configured to act as a source side protection agent; i.e., as a splitter for host device A. Specifically, protection agent 144 replicates SCSI I/O write requests. A replicated SCSI I/O write request is sent to DPA 112. After receiving an acknowledgement from DPA 124, protection agent 144 then sends the SCSI I/O write request to LU A. After receiving a second acknowledgement from storage system 108 host computer 104 acknowledges that an I/O command complete.
When DPA 112 receives a replicated SCSI write request from data protection agent 144, DPA 112 transmits certain I/O information characterizing the write request, packaged as a “write transaction”, over WAN 128 to DPA 124 on the target side, for journaling and for incorporation within target storage system 120.
DPA 112 may send its write transactions to DPA 124 using a variety of modes of transmission, including inter alia (i) a synchronous mode, (ii) an asynchronous mode, and (iii) a snapshot mode. In synchronous mode, DPA 112 sends each write transaction to DPA 124, receives back an acknowledgement from DPA 124, and in turns sends an acknowledgement back to protection agent 144. Protection agent 144 waits until receipt of such acknowledgement before sending the SCSI write request to LU A.
In asynchronous mode, DPA 112 sends an acknowledgement to protection agent 144 upon receipt of each I/O request, before receiving an acknowledgement back from DPA 124.
In snapshot mode, DPA 112 receives several I/O requests and combines them into an aggregate “snapshot” of all write activity performed in the multiple I/O requests, and sends the snapshot to DPA 124, for journaling and for incorporation in target storage system 120. In snapshot mode DPA 112 also sends an acknowledgement to protection agent 144 upon receipt of each I/O request, before receiving an acknowledgement back from DPA 124.
For the sake of clarity, the ensuing discussion assumes that information is transmitted at write-by-write granularity.
While in production mode, DPA 124 receives replicated data of LU A from DPA 112, and performs journaling and writing to storage system 120. When applying write operations to storage system 120, DPA 124 acts as an initiator, and sends SCSI commands to LU B.
During a recovery mode, DPA 124 undoes the write transactions in the journal, so as to restore storage system 120 to the state it was at, at an earlier time.
As described hereinabove, LU B is used as a backup of LU A. As such, during normal production mode, while data written to LU A by host computer 104 is replicated from LU A to LU B, host computer 116 should not be sending I/O requests to LU B. To prevent such I/O requests from being sent, protection agent 164 acts as a target site protection agent for host Device B and fails I/O requests sent from host computer 116 to LU B through host Device B.
Target storage system 120 exposes a logical unit 176, referred to as a “journal LU”, for maintaining a history of write transactions made to LU B, referred to as a “journal”. Alternatively, journal LU 176 may be striped over several logical units, or may reside within all of or a portion of another logical unit. DPA 124 includes a journal processor 180 for managing the journal.
Journal processor 180 functions generally to manage the journal entries of LU B. Specifically, journal processor 180 enters write transactions received by DPA 124 from DPA 112 into the journal, by writing them into the journal LU, reads the undo information for the transaction from LU B, updates the journal entries in the journal LU with undo information, applies the journal transactions to LU B, and removes already-applied transactions from the journal.
Referring to
Write transaction 200 generally includes the following fields: one or more identifiers; a time stamp, which is the date & time at which the transaction was received by source side DPA 112; a write size, which is the size of the data block; a location in journal LU 176 where the data is entered; a location in LU B where the data is to be written; and the data itself.
Write transaction 200 is transmitted from source side DPA 112 to target side DPA 124. As shown in
In practice each of the four streams holds a plurality of write transaction data. As write transactions are received dynamically by target DPA 124, they are recorded at the end of the DO stream and the end of the DO METADATA stream, prior to committing the transaction. During transaction application, when the various write transactions are applied to LU B, prior to writing the new DO data into addresses within the storage system, the older data currently located in such addresses is recorded into the UNDO stream.
By recording old data, a journal entry can be used to “undo” a write transaction. To undo a transaction, old data is read from the UNDO stream in a reverse order, from the most recent data to the oldest data, for writing into addresses within LU B. Prior to writing the UNDO data into these addresses, the newer data residing in such addresses is recorded in the DO stream.
The journal LU is partitioned into segments with a pre-defined size, such as 1 MB segments, with each segment identified by a counter. The collection of such segments forms a segment pool for the four journaling streams described hereinabove. Each such stream is structured as an ordered list of segments, into which the stream data is written, and includes two pointers—a beginning pointer that points to the first segment in the list and an end pointer that points to the last segment in the list.
According to a write direction for each stream, write transaction data is appended to the stream either at the end, for a forward direction, or at the beginning, for a backward direction. As each write transaction is received by DPA 124, its size is checked to determine if it can fit within available segments. If not, then one or more segments are chosen from the segment pool and appended to the stream's ordered list of segments.
Thereafter the DO data is written into the DO stream, and the pointer to the appropriate first or last segment is updated. Freeing of segments in the ordered list is performed by simply changing the beginning or the end pointer. Freed segments are returned to the segment pool for re-use.
In some examples, DPAs may be virtual machines and the data protection agents may run in a storage array, a host, in a fabric switch or at a hypervisor layer. The data protection may run in a hypervisor kernel replicating a single virtual machine, or in any other location at the data path for both virtual or physical environments.
Virtual Consistency Groups
A virtual Consistency Group may be used to present a single Consistency Group which may span several different appliances. In some examples, forming one large consistency group is achieved by n internal consistency groups (iCGs) or grid copies. Each grid copy may have the same configuration as the original consistency group, i.e., user volumes and journal volumes. Each internal CG may be also called a Grid Copy (e.g., as labeled in
The grid copies may be numbered 0, . . . , n−1. For example refer to
Referring to
Referring to
Referring to
All the grid copies (internal consistency groups) behave in an identical way. A data protection agent 775 is aware that a replicated volume is replicated by multiple data protection appliances, since a target for replication of the volume is exposed by multiple DPAs. The data protection agent 775 may send I/Os intercepted by the volume to any of the data protection appliances replicating the volume. The data protection agent 775 may use load balancing techniques to assure that the load on each of the appliances is similar and prevent data protection appliances from being over loaded.
Further, the virtual consistency group 700 may be used for replication of a single volume. As well, the virtual consistency group 700 may be used to replicate multiple volumes. In one example, the virtual consistency group 700 may represent any number of underlying internal consistency groups (grid copies), or DPAs, however the virtual consistency group may be presented to the user as a single consistency group.
Splitting the Data
Referring to
System 800 includes storage arrays (e.g., a storage array 802a, a storage array 802b), source-side data protection appliances (DPAs) (a source-side DPA 806a, a source side DPA 806b), target-side DPAs (e.g., a target-side DPA 808a, a target-side DPA 808b) and a storage array 810. The storage array 802a includes a journal 804, a data protection agent 812a and volume 1814a and the storage array 802b includes a data protection agent 1412b and volume 1814b.
The source-side DPA 806a exposes targets (e.g., a volume 1 target 816a and a volume 2 target 818a) and maintains a delta marking stream (DMS) 822a at the journal 804 on a storage array 802a. The source-side DPA 806b exposes targets (e.g., a volume 1 target 816b and a volume 2 target 818b) and maintains a delta marking stream (DMS) 822b on the journal 804 on storage 802a. The protection agent 812a splits (write) I/Os going to the volume 1814a to either the volume 1 target 816a or the volume 1 target 816b. The protection agent 812b splits (write) I/Os going to volume 2814b to either volume 2 target 818a or the volume 2 target 818b. In one example, I/Os from volume 1814a are sent to the volume 1 target 816a and volume 1 target 816b in a round robin fashion. One of ordinary skill in the art would appreciate that targets may not necessarily be volume targets such as volume 1 targets 816a, 818a and volume 2 targets 816b, 818b but may instead be another type of data storage location.
A virtual consistency group 830 includes the grid copy 0834a at the source-side DPA 806a and the grid copy 1834b on the source-side DPA 806b. The target-side DPA 808a includes a grid copy 0844a and the target-side DPA 808b includes a grid copy 1844b. Each grid copy 844a, 844b is a unit of replication which is responsible for replication of a portion of the data of the full virtual consistency group 830.
In order to be able to replicate high performance volumes, the volumes are broken up into slices, for example slices of 1 MB size. In one particular example, if the virtual consistency group 830 is composed of two grid copies, each grid copy will be responsible for the replication of half of the slices. In another example, if the virtual consistency group 830 is composed of four grid copies, then each grid copy will be responsible for the replication of a quarter of the slices of each volume.
In one example, the target-side DPA 808a receives even-numbered slices (e.g., slice 0, slice 2, and so forth (
The storage array 810 includes a volume 1854a, which is a replication of volume 1814a, a volume 2854b, which is a replication of volume 2814b, and a replica journal 860.
At the target-side, grid copy 844a is responsible for the replication of the even slices. Thus, all I/Os going to even sliced portions of either volume 1814a or volume 2814b are sent to the DPA 808b which runs grid copy 844b. The grid copy 844b journals the I/Os to the portion of the journal 860 which grid copy 844b uses and applies the I/Os to the corresponding volume 854a, 854b at the storage array 810.
Grid copy 844B is responsible for the replication of the odd slices. All I/Os going to odd sliced portions of either the volume 1814a or the volume 2814b are sent to the DPA 808b which runs grid copy 844b. The grid copy 844b journals the I/Os to the portion of the journal 860 which grid copy 844b uses and applies the I/Os to the corresponding volume 854a, 854b at storage array 810.
Referring to
Process 900 receives I/Os from the data protection agents 812a, 812b (904). For example, the data protection agent 812a sends an I/O from the first volume 814a to the volume 1 target 816a at the source-side DPA 806a.
Process 900 adds metadata to the local delta marking stream (912). For example, if an I/O is received from the source-side storage array 806a to volume 1 target 816a, then metadata describing an IO arrival to volume 814a is written to the journal containing the metadata stream for grid copy 834a by the DMS 822a service.
Process 900 sends I/Os to the correct target-side DPA (918). For example, even-numbered slices are sent to the target-side DPA 808a and odd-numbered slices are sent to the target-side DPA 808b.
Process 900 periodically quiesces I/Os arriving from the data protection agents so (922). For example, the data is quiesced by notifying all DPAs running an internal CG of the CG to stop acknowledging new I/Os arriving from the data protection agents 812a, 812b to volumes replicated by the CG. A bookmark is created. A bookmark is a notification which is kept at the replica journal 860 and indicates a point of consistency. Once the bookmark is created for all the grid copies of the CG, the I/Os are unquiesced (926) and the DPAs continue to acknowledge new I/Os.
Referring to
The process 1000 filters (1003) the list of dirty locations to be the only locations of which are inside slices which are handled by the relevant grid copy. For example, the process running at the grid copy 834a will filter only locations on the disk which are inside even slices of the replicated volume, and a process running at the grid copy 834b will only filter locations which are inside odd slices of the replicated volume and synchronizes the markers relevant for slices replicated by the corresponding appliance (1004). Synchronization includes reading the locations which are marked as dirty (only the locations which remained after the filtering), sending the dirty locations to the replica site and writing the data to the replication journal 860.
Referring to
Process 1100 selects a DPA to send the intercepted I/O (1106) and sends the I/O to the selected DPA. For example, the data protection agent 812 determines which source-side DPA to send the intercepted I/O. For example, the V/Os may be sent in a round robin fashion. In another example, a multi-path processor determines the source-side DPA to send the intercepted I/O.
Journal
For a replicated volume or volumes, the journal for the replication may be striped so across each grid copy. The journal volumes may create a virtual striped space, each grid copy may get specific portions of the space, on which the grid copy may handle its journal. As well, the journal of each grid copy may manage its own list of snapshots.
Referring back to
Referring to
Image Accessing
In some examples, to access an image of the virtual consistency group, each grid copy may need to create an image the same point in time. Referring to
After the image is created, user may access the volume in virtual or logged access mode
Snapshot List
The DPA may hold a list of n selected snapshots, where n=1000. As there may be many grid copies in the virtual CG, each grid copy may hold a different list of 1000 snapshots. The presented list of snapshots may be the intersection of the list of snapshots of all the grid copies. This may be because the list of 1000 snapshots is a selected list and it may be necessary to make sure the selection algorithm of each copy works the same. During a disaster, a message may arrive at one grid copy and not another. In this case, it may not be assumed that the lists are identical.
Referring to
In some examples, the selection algorithm may keep the snapshot list with at most 1000 entries. When a new entry arrives, the selection algorithm may remove one entry from the list. The entry that may be removed may be the one with the lowest priority. In some examples, user bookmarks have the highest priority. In other examples, a system bookmark with odd bookmark IDs may have the lowest priority than snapshots with even ID not dividable by 4, than not dividable by 8; this type of deletion may maintain an equal distance between bookmarks. In some examples, if all the bookmarks have the same priority, selection may be made to ensure that the distance between bookmarks in terms of data is almost the same; that the delta between bookmarks is minimized. In other examples, it may be stated that the 10 bookmarks most recent bookmarks may not allowed to be diluted.
Referring to
The processes described herein (e.g., processes 900, 1000 and 1100) are not limited to use with the hardware and software of
The system may be implemented, at least in part, via a computer program product, (e.g., in a machine-readable storage device), for execution by, or to control the operation of; data processing apparatus (e.g., a programmable processor, a computer, or multiple computers)). Each such program may be implemented in a high level procedural or object-oriented programming language to communicate with a computer system. However, the programs may be implemented in assembly or machine language. The language may be a compiled or an interpreted language and it may be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program may be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network. A computer program may be stored on a storage medium or device (e.g., CD-ROM, hard disk, or magnetic diskette) that is readable by a general or special purpose programmable computer for configuring and operating the computer when the storage medium or device is read by the computer to perform the processes described herein. The processes described herein may also be implemented as a machine-readable storage medium, configured with a computer program, where upon execution, instructions in the computer program cause the computer to operate in accordance with the processes. A non-transitory machine-readable medium may include but is not limited to a hard drive, compact disc, flash memory, non-volatile memory, volatile memory, magnetic diskette and so forth but does not include a transitory signal per se.
The processes described herein are not limited to the specific examples described. For example, the processes 900, 1000 and 1100 are not limited to the specific processing order of
The processing blocks (for example, in the processes 900, 1000 and 1100) associated with implementing the system may be performed by one or more programmable processors executing one or more computer programs to perform the functions of the system. All or part of the system may be implemented as, special purpose logic circuitry (e.g., an FPGA (field-programmable gate array) and/or an ASIC (application-specific integrated circuit)).
Elements of different embodiments described herein may be combined to form other embodiments not specifically set forth above. Other embodiments not specifically described herein are also within the scope of the following claims.
Number | Name | Date | Kind |
---|---|---|---|
5170480 | Mohan et al. | Dec 1992 | A |
5249053 | Jain | Sep 1993 | A |
5388254 | Betz et al. | Feb 1995 | A |
5499367 | Bamford et al. | Mar 1996 | A |
5526397 | Lohman | Jun 1996 | A |
5864837 | Maimone | Jan 1999 | A |
5990899 | Whitten | Jan 1999 | A |
5879459 | Gadgil et al. | Mar 1999 | A |
6042652 | Hyun et al. | Mar 2000 | A |
6065018 | Beier et al. | May 2000 | A |
6143659 | Leem | Nov 2000 | A |
6148340 | Bittinger et al. | Nov 2000 | A |
6174377 | Doering et al. | Jan 2001 | B1 |
6174809 | Kang et al. | Jan 2001 | B1 |
6203613 | Gates et al. | Mar 2001 | B1 |
6260125 | McDowell | Jul 2001 | B1 |
6270572 | Kim et al. | Aug 2001 | B1 |
6272534 | Guha | Aug 2001 | B1 |
6287965 | Kang et al. | Sep 2001 | B1 |
6467023 | DeKoning et al. | Oct 2002 | B1 |
6574657 | Dickinson | Jun 2003 | B1 |
6621493 | Whitten | Sep 2003 | B1 |
6804676 | Bains, II | Oct 2004 | B1 |
6947981 | Lubbers et al. | Sep 2005 | B2 |
7051126 | Franklin | Mar 2006 | B1 |
7043610 | Horn et al. | May 2006 | B2 |
7076620 | Takeda et al. | Jul 2006 | B2 |
7111197 | Kingsbury et al. | Sep 2006 | B2 |
7117327 | Hirakawa et al. | Oct 2006 | B2 |
7120768 | Mizuno et al. | Oct 2006 | B2 |
7130975 | Suishu et al. | Oct 2006 | B2 |
7139927 | Park et al. | Nov 2006 | B2 |
7159088 | Hirakawa et al. | Jan 2007 | B2 |
7167963 | Hirakawa et al. | Jan 2007 | B2 |
7203741 | Marco et al. | Apr 2007 | B2 |
7222136 | Brown et al. | May 2007 | B1 |
7296008 | Passerini et al. | Nov 2007 | B2 |
7328373 | Kawamura et al. | Feb 2008 | B2 |
7353335 | Kawamura | Apr 2008 | B2 |
7360113 | Anderson et al. | Apr 2008 | B2 |
7426618 | Vu et al. | Sep 2008 | B2 |
7516287 | Ahal et al. | Apr 2009 | B2 |
7519625 | Honami et al. | Apr 2009 | B2 |
7519628 | Leverett | Apr 2009 | B1 |
7546485 | Cochran et al. | Jun 2009 | B2 |
7577867 | Lewin et al. | Aug 2009 | B2 |
7590887 | Kano | Sep 2009 | B2 |
7606940 | Yamagami | Oct 2009 | B2 |
7627612 | Ahal et al. | Dec 2009 | B2 |
7627687 | Ahal et al. | Dec 2009 | B2 |
7719443 | Natanzon | May 2010 | B1 |
7757057 | Sangapu et al. | Jul 2010 | B2 |
7774565 | Lewin et al. | Aug 2010 | B2 |
7797358 | Ahal et al. | Sep 2010 | B1 |
7840536 | Ahal et al. | Nov 2010 | B1 |
7840662 | Natanzon | Nov 2010 | B1 |
7844856 | Ahal et al. | Nov 2010 | B1 |
7849361 | Ahal et al. | Dec 2010 | B2 |
7860836 | Natanzon et al. | Dec 2010 | B1 |
7882286 | Natanzon et al. | Feb 2011 | B1 |
7934262 | Natanzon et al. | Apr 2011 | B1 |
7958372 | Natanzon | Jun 2011 | B1 |
8037162 | Marco et al. | Oct 2011 | B2 |
8041940 | Natanzon et al. | Oct 2011 | B1 |
8060713 | Natanzon | Nov 2011 | B1 |
8060714 | Natanzon | Nov 2011 | B1 |
8103937 | Natanzon et al. | Jan 2012 | B1 |
8108634 | Natanzon et al. | Jan 2012 | B1 |
8205009 | Hellen et al. | Jun 2012 | B2 |
8214612 | Natanzon | Jul 2012 | B1 |
8250149 | Marco et al. | Aug 2012 | B2 |
8271441 | Natanzon et al. | Sep 2012 | B1 |
8271447 | Natanzon et al. | Sep 2012 | B1 |
8332687 | Natanzon et al. | Dec 2012 | B1 |
8335761 | Natanzon | Dec 2012 | B1 |
8335771 | Natanzon et al. | Dec 2012 | B1 |
8341115 | Natanzon et al. | Dec 2012 | B1 |
8370648 | Natanzon | Feb 2013 | B1 |
8380885 | Natanzon | Feb 2013 | B1 |
8392680 | Natanzon et al. | Mar 2013 | B1 |
8429362 | Natanzon et al. | Apr 2013 | B1 |
8433869 | Natanzon et al. | Apr 2013 | B1 |
8438135 | Natanzon et al. | May 2013 | B1 |
8464101 | Natanzon et al. | Jun 2013 | B1 |
8478955 | Natanzon et al. | Jul 2013 | B1 |
8495304 | Natanzon et al. | Jul 2013 | B1 |
8510279 | Natanzon et al. | Aug 2013 | B1 |
8521691 | Natanzon | Aug 2013 | B1 |
8521694 | Natanzon | Aug 2013 | B1 |
8543609 | Natanzon | Sep 2013 | B1 |
8583885 | Natanzon | Nov 2013 | B1 |
8600945 | Natanzon et al. | Dec 2013 | B1 |
8601085 | Ives et al. | Dec 2013 | B1 |
8627012 | Derbeko et al. | Jan 2014 | B1 |
8683592 | Dotan et al. | Mar 2014 | B1 |
8694700 | Natanzon et al. | Apr 2014 | B1 |
8706700 | Natanzon et al. | Apr 2014 | B1 |
8712962 | Natanzon et al. | Apr 2014 | B1 |
8719497 | Don et al. | May 2014 | B1 |
8725691 | Natanzon | May 2014 | B1 |
8725692 | Natanzon et al. | May 2014 | B1 |
8726066 | Natanzon et al. | May 2014 | B1 |
8738813 | Natanzon et al. | May 2014 | B1 |
8745004 | Natanzon et al. | Jun 2014 | B1 |
8751828 | Raizen et al. | Jun 2014 | B1 |
8769336 | Natanzon et al. | Jul 2014 | B1 |
8805786 | Natanzon | Aug 2014 | B1 |
8806161 | Natanzon | Aug 2014 | B1 |
8825848 | Dotan et al. | Sep 2014 | B1 |
8832399 | Natanzon et al. | Sep 2014 | B1 |
8850143 | Natanzon | Sep 2014 | B1 |
8850144 | Natanzon et al. | Sep 2014 | B1 |
8862546 | Natanzon et al. | Oct 2014 | B1 |
8892835 | Natanzon et al. | Nov 2014 | B1 |
8898112 | Natanzon et al. | Nov 2014 | B1 |
8898409 | Natanzon et al. | Nov 2014 | B1 |
8898515 | Natanzon | Nov 2014 | B1 |
8898519 | Natanzon et al. | Nov 2014 | B1 |
8914595 | Natanzon | Dec 2014 | B1 |
8924668 | Natanzon | Dec 2014 | B1 |
8930500 | Marco et al. | Jan 2015 | B2 |
8930947 | Derbeko et al. | Jan 2015 | B1 |
8935498 | Natanzon | Jan 2015 | B1 |
8949180 | Natanzon et al. | Feb 2015 | B1 |
8954673 | Natanzon et al. | Feb 2015 | B1 |
8954796 | Cohen et al. | Feb 2015 | B1 |
8959054 | Natanzon | Feb 2015 | B1 |
8977593 | Natanzon et al. | Mar 2015 | B1 |
8977826 | Meiri et al. | Mar 2015 | B1 |
8996460 | Frank et al. | Mar 2015 | B1 |
8996461 | Natanzon et al. | Mar 2015 | B1 |
8996827 | Natanzon | Mar 2015 | B1 |
9003138 | Natanzon et al. | Apr 2015 | B1 |
9026696 | Natanzon et al. | May 2015 | B1 |
9031913 | Natanzon | May 2015 | B1 |
9032160 | Natanzon et al. | May 2015 | B1 |
9037818 | Natanzon et al. | May 2015 | B1 |
9063994 | Natanzon et al. | Jun 2015 | B1 |
9069479 | Natanzon | Jun 2015 | B1 |
9069709 | Natanzon et al. | Jun 2015 | B1 |
9081754 | Natanzon et al. | Jul 2015 | B1 |
9081842 | Natanzon et al. | Jul 2015 | B1 |
9087008 | Natanzon | Jul 2015 | B1 |
9087112 | Natanzon et al. | Jul 2015 | B1 |
9104529 | Derbeko et al. | Aug 2015 | B1 |
9110914 | Frank et al. | Aug 2015 | B1 |
9116811 | Derbeko et al. | Aug 2015 | B1 |
9128628 | Natanzon et al. | Sep 2015 | B1 |
9128855 | Natanzon et al. | Sep 2015 | B1 |
9134914 | Derbeko et al. | Sep 2015 | B1 |
9135119 | Natanzon et al. | Sep 2015 | B1 |
9135120 | Natanzon | Sep 2015 | B1 |
9146878 | Cohen et al. | Sep 2015 | B1 |
9152339 | Cohen et al. | Oct 2015 | B1 |
9152578 | Saad et al. | Oct 2015 | B1 |
9152814 | Natanzon | Oct 2015 | B1 |
9158578 | Derbeko et al. | Oct 2015 | B1 |
9158630 | Natanzon | Oct 2015 | B1 |
9160526 | Raizen et al. | Oct 2015 | B1 |
9177670 | Derbeko et al. | Nov 2015 | B1 |
9189339 | Cohen et al. | Nov 2015 | B1 |
9189341 | Natanzon et al. | Nov 2015 | B1 |
9201736 | Moore et al. | Dec 2015 | B1 |
9223659 | Natanzon et al. | Dec 2015 | B1 |
9225529 | Natanzon et al. | Dec 2015 | B1 |
9235481 | Natanzon et al. | Jan 2016 | B1 |
9235524 | Derbeko et al. | Jan 2016 | B1 |
9235632 | Natanzon | Jan 2016 | B1 |
9244997 | Natanzon et al. | Jan 2016 | B1 |
9256605 | Natanzon | Feb 2016 | B1 |
9274718 | Natanzon et al. | Mar 2016 | B1 |
9275063 | Natanzon | Mar 2016 | B1 |
9286052 | Solan et al. | Mar 2016 | B1 |
9305009 | Bono et al. | Apr 2016 | B1 |
9323750 | Natanzon et al. | Apr 2016 | B2 |
9330155 | Bono et al. | May 2016 | B1 |
9336094 | Wolfson et al. | May 2016 | B1 |
9336230 | Natanzon | May 2016 | B1 |
9367260 | Natanzon | Jun 2016 | B1 |
9378096 | Erel et al. | Jun 2016 | B1 |
9378219 | Bono et al. | Jun 2016 | B1 |
9378261 | Bono et al. | Jun 2016 | B1 |
9383937 | Frank et al. | Jul 2016 | B1 |
9389800 | Natanzon et al. | Jul 2016 | B1 |
9405481 | Cohen et al. | Aug 2016 | B1 |
9405684 | Derbeko et al. | Aug 2016 | B1 |
9405765 | Natanzon | Aug 2016 | B1 |
9411535 | Shemer et al. | Aug 2016 | B1 |
9459804 | Natanzon et al. | Oct 2016 | B1 |
9460028 | Raizen et al. | Oct 2016 | B1 |
9471579 | Natanzon | Oct 2016 | B1 |
9477407 | Marshak et al. | Oct 2016 | B1 |
9501542 | Natanzon | Nov 2016 | B1 |
9507732 | Natanzon et al. | Nov 2016 | B1 |
9507845 | Natanzon et al. | Nov 2016 | B1 |
9514138 | Natanzon et al. | Dec 2016 | B1 |
9524218 | Veprinsky et al. | Dec 2016 | B1 |
9529885 | Natanzon et al. | Dec 2016 | B1 |
9535800 | Natanzon et al. | Jan 2017 | B1 |
9535801 | Natanzon et al. | Jan 2017 | B1 |
9547459 | BenHanokh et al. | Jan 2017 | B1 |
9547591 | Natanzon et al. | Jan 2017 | B1 |
9552405 | Moore et al. | Jan 2017 | B1 |
9557921 | Cohen et al. | Jan 2017 | B1 |
9557925 | Natanzon | Jan 2017 | B1 |
9563517 | Natanzon et al. | Feb 2017 | B1 |
9563684 | Natanzon et al. | Feb 2017 | B1 |
9575851 | Natanzon et al. | Feb 2017 | B1 |
9575857 | Natanzon | Feb 2017 | B1 |
9575894 | Natanzon et al. | Feb 2017 | B1 |
9582382 | Natanzon et al. | Feb 2017 | B1 |
9588703 | Natanzon et al. | Mar 2017 | B1 |
9588847 | Natanzon et al. | Mar 2017 | B1 |
9594822 | Natanzon et al. | Mar 2017 | B1 |
9600377 | Cohen et al. | Mar 2017 | B1 |
9619543 | Natanzon et al. | Apr 2017 | B1 |
9632881 | Natanzon | Apr 2017 | B1 |
9665305 | Natanzon et al. | May 2017 | B1 |
9710177 | Natanzon | Jul 2017 | B1 |
9720618 | Panidis et al. | Aug 2017 | B1 |
9722788 | Natanzon et al. | Aug 2017 | B1 |
9727429 | Moore et al. | Aug 2017 | B1 |
9733969 | Derbeko et al. | Aug 2017 | B2 |
9737111 | Lustik | Aug 2017 | B2 |
9740572 | Natanzon et al. | Aug 2017 | B1 |
9740573 | Natanzon | Aug 2017 | B1 |
9740880 | Natanzon et al. | Aug 2017 | B1 |
9749300 | Cale et al. | Aug 2017 | B1 |
9772789 | Natanzon et al. | Sep 2017 | B1 |
9798472 | Natanzon et al. | Oct 2017 | B1 |
9798490 | Natanzon | Oct 2017 | B1 |
9804934 | Natanzon et al. | Oct 2017 | B1 |
9811431 | Natanzon et al. | Nov 2017 | B1 |
9823865 | Natanzon et al. | Nov 2017 | B1 |
9823973 | Natanzon | Nov 2017 | B1 |
9832261 | Don et al. | Nov 2017 | B2 |
9846698 | Panidis et al. | Dec 2017 | B1 |
9875042 | Natanzon et al. | Jan 2018 | B1 |
9875162 | Panidis et al. | Jan 2018 | B1 |
9880777 | Bono et al. | Jan 2018 | B1 |
9881014 | Bono et al. | Jan 2018 | B1 |
9910620 | Veprinsky et al. | Mar 2018 | B1 |
9910621 | Golan et al. | Mar 2018 | B1 |
9910735 | Natanzon | Mar 2018 | B1 |
9910739 | Natanzon et al. | Mar 2018 | B1 |
9917854 | Natanzon et al. | Mar 2018 | B2 |
9921955 | Derbeko et al. | Mar 2018 | B1 |
9933957 | Cohen et al. | Apr 2018 | B1 |
9934302 | Cohen et al. | Apr 2018 | B1 |
9940205 | Natanzon | Apr 2018 | B2 |
9940460 | Derbeko et al. | Apr 2018 | B1 |
9946649 | Natanzon et al. | Apr 2018 | B1 |
9959061 | Natanzon et al. | May 2018 | B1 |
9965306 | Natanzon et al. | May 2018 | B1 |
9990256 | Natanzon | Jun 2018 | B1 |
9996539 | Natanzon | Jun 2018 | B1 |
10007626 | Saad et al. | Jun 2018 | B1 |
10019194 | Baruch et al. | Jul 2018 | B1 |
10025931 | Natanzon et al. | Jul 2018 | B1 |
10031675 | Veprinsky et al. | Jul 2018 | B1 |
10031690 | Panidis et al. | Jul 2018 | B1 |
10031692 | Elron et al. | Jul 2018 | B2 |
10031703 | Natanzon et al. | Jul 2018 | B1 |
10037251 | Bono et al. | Jul 2018 | B1 |
10042579 | Natanzon | Aug 2018 | B1 |
10042751 | Veprinsky et al. | Aug 2018 | B1 |
10055146 | Natanzon et al. | Aug 2018 | B1 |
10055148 | Natanzon et al. | Aug 2018 | B1 |
10061666 | Natanzon et al. | Aug 2018 | B1 |
10067694 | Natanzon et al. | Sep 2018 | B1 |
10067837 | Natanzon et al. | Sep 2018 | B1 |
10078459 | Natanzon et al. | Sep 2018 | B1 |
10082980 | Cohen et al. | Sep 2018 | B1 |
10083093 | Natanzon et al. | Sep 2018 | B1 |
10095489 | Lieberman et al. | Oct 2018 | B1 |
10101943 | Ayzenberg et al. | Oct 2018 | B1 |
20020129168 | Kanai et al. | Sep 2002 | A1 |
20030048842 | Fourquin et al. | Mar 2003 | A1 |
20030061537 | Cha et al. | Mar 2003 | A1 |
20030110278 | Anderson | Jun 2003 | A1 |
20030145317 | Chamberlain | Jul 2003 | A1 |
20030196147 | Hirata et al. | Oct 2003 | A1 |
20040205092 | Longo et al. | Oct 2004 | A1 |
20040250032 | Ji et al. | Dec 2004 | A1 |
20040254964 | Kodama et al. | Dec 2004 | A1 |
20050015663 | Armangau et al. | Jan 2005 | A1 |
20050028022 | Amano | Feb 2005 | A1 |
20050049924 | DeBettencourt et al. | Mar 2005 | A1 |
20050172092 | Lam et al. | Aug 2005 | A1 |
20050273655 | Chow et al. | Dec 2005 | A1 |
20060031647 | Hirakawa et al. | Feb 2006 | A1 |
20060047996 | Anderson et al. | Mar 2006 | A1 |
20060064416 | Sim-Tang | Mar 2006 | A1 |
20060107007 | Hirakawa et al. | May 2006 | A1 |
20060117211 | Matsunami et al. | Jun 2006 | A1 |
20060161810 | Bao | Jul 2006 | A1 |
20060179343 | Kitamura | Aug 2006 | A1 |
20060195670 | Iwamura et al. | Aug 2006 | A1 |
20060212462 | Hellen et al. | Sep 2006 | A1 |
20070055833 | Vu et al. | Mar 2007 | A1 |
20070162513 | Lewin et al. | Jul 2007 | A1 |
20070180304 | Kano | Aug 2007 | A1 |
20070198602 | Ngo et al. | Aug 2007 | A1 |
20070198791 | Iwamura et al. | Aug 2007 | A1 |
20070220311 | Lewin et al. | Sep 2007 | A1 |
20070266053 | Ahal et al. | Nov 2007 | A1 |
20080082591 | Ahal et al. | Apr 2008 | A1 |
20080082592 | Ahal et al. | Apr 2008 | A1 |
20080082770 | Ahal et al. | Apr 2008 | A1 |
Number | Date | Country |
---|---|---|
1154356 | Nov 2001 | EP |
WO 00 45581 | Aug 2000 | WO |
Entry |
---|
Gibson, “Five Point Plan Lies at the Heart of Compression Technology;” Apr. 29, 1991; 1 Page. |
Soules, “Metadata Efficiency in Versioning File Systems;” 2003; 16 Pages. |
AIX System Management Concepts: Operating Systems and Devices; May 2000; 280 Pages. |
Soules et al.; “Metadata Efficiency in a Comprehensive Versioning File System;” May 2002; CMU-CS-02-145; School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213; 33 Pages. |
Linux Filesystems; Sams Publishing; 2002; 12 Pages. |
Bunyan, “Multiplexing in a BrightStor® ARCserve® Backup Release 11;” Mar. 2004; 4 Pages. |
Marks, “Network Computing;” Feb. 2, 2006; 8 Pages. |
Hill, “Network Computing;” Jun. 8, 2006; 9 Pages. |
Microsoft Computer Dictionary; 2002; Press Fifth Edition; 3 Pages. |
Retrieved from http://en.wikipedia.org/wiki/DEFLATE; DEFLATE; Jun. 19, 2008; 6 Pages. |
Retrieved from http://en.wikipedia.org/wiki/Huffman_coding; Huffman Coding; Jun. 8, 2008; 11 Pages. |
Retrieved from http:///en.wikipedia.org/wiki/LZ77; LZ77 and LZ78; Jun. 17, 2008; 2 Pages. |
U.S. Appl. No. 11/609,560. |
U.S. Appl. No. 12/057,652. |
U.S. Appl. No. 11/609,561. |
U.S. Appl. No. 11/356,920. |
U.S. Appl. No. 10/512,687. |
U.S. Appl. No. 11/536,233. |
U.S. Appl. No. 11/536,215. |
U.S. Appl. No. 11/536,160. |
U.S. Appl. No. 11/964,168. |