Method and apparatus to replicate stateful virtual machines between clouds
Summary by NHIP
Cloud VM State Replication
The method replicates a virtual machine between two cloud environments by activating the source while pausing the replica. A hypervisor buffers incoming traffic using a flip engine during the pause, allowing the replica to process buffered data upon activation using the source's state information.
Claim Score by NHIP
Abstract
A method including replicating a first virtual machine (VM) in a first cloud and putting the replicated VM in a second cloud. Activating the first VM and pausing the replicated VM. First processing, at the first VM, traffic from VMs in the first cloud, wherein the first processing occurs when the first VM is activated and the replicated VM is paused. Buffering, at a hypervisor of the replicated VM, traffic from VMs in the second cloud, wherein the buffering occurs when the first VM is activated and the replicated VM is paused. Activating the replicated VM in response to state information of the first VM and pausing the first VM. Second processing, at the replicated VM, the buffered traffic according to the state information of the first VM, wherein the second processing occurs when the replicated VM is activated and the first VM is paused.

Term
Projected expiry 15 September 2033.
- Priority
- Filed
- Granted
- Today
- Projected expiry
15 claims: 3 independent, 12 dependent
- 1A computer program product, comprising:a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to replicate a first virtual machine (VM) found in a first cloud computing environment and put the replicated VM in a second cloud computing environment;wherein the first cloud computing environment comprises: a first hypervisor coupled to the first VM;a first flip engine included with the first hypervisor;and a first buffer included with the first hypervisor for buffering traffic of VMs within the first cloud computing environment destined for the first VM;wherein the second cloud computing environment comprises: a second hypervisor coupled to the replicated VM;a second flip engine included with the second hypervisor;and a second buffer included with the second hypervisor for buffering traffic of VMs within the second cloud computing environment destined for the replicated VM;computer readable program code configured to activate the first VM and pause the replicated VM;computer readable program code configured to first process, at the first VM, traffic from the VMs in the first cloud computing environment, wherein the first processing occurs when the first VM is activated and the replicated VM is paused;computer readable program code configured to first buffer, at the second buffer of the second hypervisor corresponding to the replicated VM, traffic destined for the replicated VM from VMs in the second cloud computing environment, wherein the first buffering occurs when the first VM is activated and the replicated VM is paused;computer readable program code configured to determine, with the first flip engine, state information for sending a state delta signal to the replicated VM for activation, wherein the state information represents a number of packets received at the first VM or a number of packets stored in the second buffer of the replicated VM;computer readable program code configured to automatically send the state delta signal from the first flip engine to the second flip engine, wherein the state delta signal includes virtual memory and central processing unit states that have been updated since the first VM became active;computer readable program code configured, in response to the state delta signal, to use memory pages modified by the first VM to overwrite state memory pages in the replicated VM before the replicated VM becomes active so that the replicated VM processes the buffered traffic in the second buffer at the last state of the first VM;computer readable program code configured to activate the replicated VM in response to overwriting state memory pages and pause the first VM;and computer readable program code configured to second process, at the replicated VM, the buffered traffic in the second buffer according to the state information of the first VM, wherein the second processing occurs when the replicated VM is activated and the first VM is paused.
- 6Broadest claimClaim Score 13, narrow(NHIP)A computer program product, comprising:a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to replicate a first virtual machine (VM) found in a first physical machine and put the replicated VM in a second physical machine;wherein the first physical machine comprises: a first hypervisor coupled to the first VM;a first flip engine included within the first hypervisor;and a first buffer residing within the first hypervisor for buffering traffic of VMs within the first physical machine destined to the first VM;wherein the second physical machine comprises: a second hypervisor coupled to the replicated VM;a second flip engine included within the second hypervisor;and a second buffer residing within the second hypervisor for buffering traffic of VMs within the second physical machine destined to the replicated VM;computer readable program code configured to activate the first VM and pause the replicated VM;computer readable program code configured to first process, at the first VM, traffic from the VMs in the first physical machine, wherein the first processing occurs when the first VM is activated and the replicated VM is paused;computer readable program code configured to first buffer, at the second buffer, traffic destined to the replicated VM from the VMs in the second physical machine, wherein the first buffering occurs when the first VM is activated and the replicated VM is paused;computer readable program code configured to dynamically determine, by at least one of the flip engines, state information for sending a state delta signal to the replicated VM for activation wherein the state information represents a number of packets received at the first VM or a number of packets stored in the second buffer of the replicated VM;computer readable program code configured to automatically send the state delta signal from the first flip engine to the second flip engine, wherein the state delta signal includes virtual memory and central processing unit states that have been updated since the first VM became active;computer readable program code configured, in response to the state delta signal, to use memory pages modified by the first VM to overwrite state memory pages in the replicated VM before the replicated VM becomes active so that the replicated VM processes the buffered traffic in the second buffer at the last state of the first VM;computer readable program code configured to activate the replicated VM in response to overwriting state memory pages, and pause the first VM;and computer readable program code configured to second process, at the replicated VM, the buffered traffic in the second buffer according to the state information of the first VM, wherein the second processing occurs when the replicated VM is activated and the first VM is paused.
- 11A computer program product, comprising:a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to replicate a first virtual machine (VM) found in a first physical machine to produce a first replicated VM and a second replicated VM;computer readable program code configured to put the replicated VM in a second physical machine and the second replicated VM in a third physical machine;wherein the first physical machine comprises: a first hypervisor coupled to the first VM;a first flip engine included within the first hypervisor;and a first buffer residing within the first hypervisor for buffering traffic of VMs within the first physical machine destined to the first VM;wherein the second physical machine comprises: a second hypervisor coupled to the first replicated VM;a second flip engine included within the second hypervisor;and a second buffer residing within the second hypervisor for buffering traffic of VMs within the second physical machine destined to the first replicated VM;wherein the third physical machine comprises: a third hypervisor coupled to the second replicated VM;a third flip engine included within the third hypervisor;and a third buffer residing within the third hypervisor for buffering traffic of VMs within the third physical machine destined to the second replicated VM;computer readable program code configured to activate the first VM and pause the first replicated VM and the second replicated VM;computer readable program code configured to first process, at the first VM, traffic from the VMs in the first physical machine, wherein the first processing occurs when the first VM is activated and the first replicated VM and the second replicated VM are paused;computer readable program code configured to first buffer, at the second buffer of the second hypervisor corresponding to the first replicated VM and at the third buffer of the third hypervisor corresponding to the second replicated VM, traffic destined to the first replicated VM from the VMs in the second physical machine and traffic destined to the second replicated VM from the VMs in the third physical machine, wherein the first buffering occurs when the first VM is activated and the first replicated VM and the second replicated VM are paused;computer readable program code configured to dynamically determine, by at least one of the flip engines, state information for sending a state delta signal to the first replicated VM or the second replicated VM for activation;wherein the state information represents a number of packets received at the first VM or a number of packets stored in the second buffer of the first replicated VM;wherein the state delta signal sent to the first replicated VM is determined to have the greatest number of packets residing in the second buffer compared to the third buffer;computer readable program code configured to automatically send the state delta signal from the first flip engine to the second flip engine, wherein the state delta signal includes virtual memory and central processing unit states that have been updated since the first VM became active;computer readable program code configured, in response to the state delta signal, to use memory pages modified by the first VM to overwrite state memory pages in the first replicated VM before the first replicated VM became active so that the first replicated VM processes the first buffered traffic at the last state of the first VM;computer readable program code configured to activate the first replicated VM in response to overwriting state memory pages, and pausing the first VM;and computer readable program code configured to second process, at the first replicated VM, the first buffered traffic in the second buffer according to the state information of the first VM, wherein the second processing occurs when the first replicated VM is activated and the first VM is paused.
Independent claims3
49 paragraphs in 5 sections, as filed
CROSS-REFERENCE TO RELATED APPLICATION
This application claims priority to U.S. patent application Ser. No. 13/537,348 filed Jun. 29, 2012, the disclosure of which is incorporated by reference herein in its entirety.
BACKGROUND
1. Technical Field
The present invention relates to cloud based virtual networks, and more particularly, to a virtual machine replication scheme applicable to such networks.
2. Discussion of the Related Art
As enterprise workloads are migrated to the cloud, it is essential that hybrid and/or multi-cloud deployments are supported. However, enterprise workloads often contain servers or network components that act as choke points that may be tied to a single site and difficult to replicate. For example, many servers may communicate with a stateful firewall, dynamic host configuration protocol (DHCP) server, authentication server or file server. Servers on different clouds cannot communicate with these components locally, thereby causing significant traffic overhead between clouds or requiring the redesign of the application or component. <figref idref="DRAWINGS">FIGS. 1-3</figref> exemplarily illustrate this scenario.
For example, <figref idref="DRAWINGS">FIG. 1</figref> shows an enterprise workload built from a virtual network that includes virtual machines VM<b>1</b>-VM<b>4</b> and a middlebox MB in a cloud computing environment <b>110</b>. The middlebox MB may be a virtual machine that performs packet inspection, protocol acceleration, DHCP, authentication, etc. of traffic flowing between VM<b>1</b>-VM<b>4</b>, for example. The dashed lines between the virtual machines VM<b>1</b> and VM<b>2</b> and the middlebox MB illustrate traffic flowing from VM<b>1</b> to VM<b>2</b> and vice versa. The dashed lines between the virtual machines VM<b>3</b> and VM<b>4</b> and the middlebox MB illustrate traffic flowing from VM<b>3</b> to VM<b>4</b> and vice versa. <figref idref="DRAWINGS">FIG. 2</figref> shows that even when the virtual machines VM<b>3</b> and VM<b>4</b> are moved to cloud computing environment <b>120</b>, their traffic must still go through the middlebox MB in the cloud computing environment <b>110</b>. <figref idref="DRAWINGS">FIG. 3</figref> shows that the movement of the middlebox MB to the cloud computing environment <b>120</b> does not help much as traffic flow between VM<b>1</b> and VM<b>2</b> in the cloud computing environment <b>110</b> must still pass through the middlebox MB.
As can be seen, the placement of the middlebox MB in the cloud computing environment <b>110</b> or <b>120</b> can lead to a drop in performance of the virtual network. For example, in the case shown in <figref idref="DRAWINGS">FIG. 3</figref>, the traffic must leave the cloud computing environment <b>110</b> to be processed by the middlebox MB in the cloud computing environment <b>120</b>. This transit takes time and affects latency. This transit also increases cost, since traffic leaving a cloud costs additional monies.
BRIEF SUMMARY
The present invention discloses a virtual machine replication scheme that improves performance of cloud based virtual networks.
In an exemplary embodiment of the present invention, the method includes: replicating a first virtual machine (VM) found in a first cloud computing environment and putting the replicated VM in a second cloud computing environment; activating the first VM and pausing the replicated VM; first processing, at the first VM, traffic from VMs in the first cloud computing environment, wherein the first processing occurs when the first VM is activated and the replicated VM is paused; first buffering, at a hypervisor corresponding to the replicated VM, traffic from VMs in the second cloud computing environment, wherein the first buffering occurs when the first VM is activated and the replicated VM is paused; activating the replicated VM in response to state information of the first VM and pausing the first VM; and second processing, at the replicated VM, the first buffered traffic according to the state information of the first VM, wherein the second processing occurs when the replicated VM is activated and the first VM is paused.
In an exemplary embodiment of the present invention, the method includes replicating a first VM to produce a second VM; activating the first VM and pausing the second VM; first processing traffic at the first VM, wherein the first processing occurs when the first VM is activated and the second VM is paused; buffering, at a virtual machine manager of the second VM, traffic destined for the second VM, wherein the first buffering occurs when the first VM is activated and the second VM is paused; activating the second VM in response to state information of the first VM and pausing the first VM; and second processing, at the second VM, the buffered traffic according to the state information of the first VM, wherein the second processing occurs when the second VM is activated and the first VM is paused.
In an exemplary embodiment of the present invention, the method includes replicating a first VM to produce a second VM and a third VM; activating the first VM and pausing the second VM and the third VM; first processing traffic at the first VM, wherein the first processing occurs when the first VM is activated and the second and third VMs are paused; first buffering, at a virtual machine manager of the second VM, traffic destined for the second VM, wherein the first buffering occurs when the first VM is activated and the second and third VMs are paused; second buffering, at a virtual machine manager of the third VM, traffic destined for the third VM, wherein the second buffering occurs when the first VM is activated and the second and third VMs are paused; activating the second VM in response to state information of the first VM and pausing the first VM; and second processing, at the second VM, the first buffered traffic according to the state information of the first VM, wherein the second processing occurs when the second VM is activated and the first and third VMs are paused.
BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS
<figref idref="DRAWINGS">FIG. 1</figref> illustrates a prior art virtual network configuration in a single cloud;
<figref idref="DRAWINGS">FIG. 2</figref> illustrates a prior art virtual network configuration across clouds;
<figref idref="DRAWINGS">FIG. 3</figref> illustrates a prior art virtual network configuration across clouds;
<figref idref="DRAWINGS">FIG. 4</figref> illustrates a virtual network configuration across clouds, according to an exemplary embodiment of the present invention;
<figref idref="DRAWINGS">FIGS. 5 and 6</figref> illustrate the operation and configuration of a virtual machine (VM), its virtual machine manager (VMM), a replica of the VM and the replica's VMM, according to an exemplary embodiment of the present invention; and
<figref idref="DRAWINGS">FIG. 7</figref> illustrates an apparatus for implementing an exemplary embodiment of the present invention.
DETAILED DESCRIPTION
A cloud or a cloud computing environment may refer to the delivery of computing as a service rather than a product, whereby shared resources, software, and information are provided to computers and other devices as a metered service over a network (typically the internet).
A virtual machine (VM) may be a software implementation of a machine (e.g., a computer) that executes programs like a physical machine. VMs may be separated into two major categories, based on their use and degree of correspondence to any real machine. A system VM provides a complete system platform which supports the execution of a complete operating system (OS), for example. In contrast, a process VM is designed to run a single program, which means that it supports a single process, for example. An essential characteristic of a VM is that the software running inside is limited to the resources and abstractions provided by the VM, thus it cannot break out of its virtual environment.
As stateful VM may mean the VM keeps track of the state of an interaction, usually by setting values in a storage field designated for that purpose.
An enterprise workload may consist of a number of VMs that communicate with each other to form a network topology. Each VM may contain an application component or a middlebox that may be shared by multiple applications. An example enterprise workload may consist of two “three-tier” applications (a three-tier application includes a web server, an application server and a database, for example) in which all traffic from either Web tier must flow through a shared middlebox VM acting as a firewall or an intrusion detection system.
In brief, the present invention discloses a method and apparatus to replicate stateful VMs between multiple clouds, even if the VMs were not designed to be easily replicated. Replica VMs may be identical, down to the memory contents, internet protocol (IP) address and network connections that they contain. However, unlike standard replication schemes, according to the present invention, traffic can enter either of the VM replicas: there is no concept of master and slave. Additionally, only one of the VM replicas may be running at any one time. In other words, the replicas are time multiplexed. For example, before a replica begins to run, the two replicas become synchronized via a snapshot update of the VM memory state from the other replica, thus ensuring that the internal state of the VM (or replica) is always consistent.
Traffic at each site (e.g., cloud) is destined for its local replica. If the replica is currently running, the traffic proceeds into the VM for processing. Otherwise, the traffic is buffered until the replica becomes active.
This present inventive approach requires no knowledge of the internal workings of the VM; it operates at the hypervisor level. Furthermore, the potential diversion of every network packet to a different cloud is avoided: resulting in reduced cost both monetarily (clouds charge a fee for data coming in and going out of the cloud) and in terms of latency.
<figref idref="DRAWINGS">FIG. 4</figref> illustrates a virtual network configuration across clouds, according to an exemplary embodiment of the present invention. In <figref idref="DRAWINGS">FIG. 4</figref>, middlebox MBy is a replica of middlebox MBx. A VM may be replicated by temporarily suspending the VM and copying all virtual memory, virtual central processing unit (CPU), and virtual device state to another physical machine, after which either the VM or its replica can be resumed. As shown in <figref idref="DRAWINGS">FIG. 4</figref>, traffic within the cloud computing environment <b>110</b> proceeds through the middlebox MBx and traffic within the cloud computing environment <b>120</b> proceeds through the middlebox MBy.
In an exemplary embodiment of the present invention, when the middlebox MBx is active, traffic from VM<b>1</b> and VM<b>2</b> in the cloud computing environment <b>110</b> is processed. While the middlebox MBx is active, the middlebox MBy is paused. While the middlebox MBy is paused, traffic from VM<b>3</b> and VM<b>4</b> in the cloud computing environment <b>120</b> is buffered at the hypervisor (or virtual machine manager (VMM)) of the middlebox MBy. These processes will now be described in detail with reference to <figref idref="DRAWINGS">FIGS. 5 and 6</figref>, with reference back to <figref idref="DRAWINGS">FIG. 4</figref>.
In <figref idref="DRAWINGS">FIG. 5</figref>, there is shown the middlebox MBx in the active state and the middlebox MBy in the paused state. The middlebox MBx has its own hypervisor VMMx and the middlebox MBy has its own hypervisor VMMy. The hypervisor VMMx includes a buffer and a flip engine. The hypervisor VMMy includes a buffer and a flip engine. Since the middleboxes MBx and MBy are replicas, the buffers are the same as each other and the flip engines are the same as each other. In other words, architecturally, the buffers and the flip engines are the same. However, each buffer will be holding different network packets destined for MBx or MBy, respectively.
The buffer may be a reserved portion of memory on a physical machine which temporarily stores incoming network traffic while a replica is inactive. The flip engine may be a small program that determines when an active replica should become inactive and selects a target replica that should become active, based on the state of the buffer and/or input from other programs or users. A user may do this via an interface. The flip engine may also be responsible for transferring the state that was updated since the local active replica started to run the target replica.
When the middlebox MBx is active, as shown in <figref idref="DRAWINGS">FIG. 5</figref>, the middlebox MBx processes incoming traffic. For example, the middlebox MBx may process traffic from VM<b>1</b> and VM<b>2</b> in the cloud computing environment <b>110</b> of <figref idref="DRAWINGS">FIG. 4</figref>. However, the middlebox MBx may process traffic from VMs in another cloud. The actions performed by the middlebox MBx depend on the type of middlebox. For example, a firewall middlebox may examine headers on received packets, compare them against firewall rules and drop the packets if they violate any rules. In general, a middlebox may examine traffic and/or modify it as packets are processed.
After being processed by the middlebox MBx, the outgoing traffic is provided to the VMs in the cloud computing environment <b>110</b>. However, the outgoing traffic may be provided to VMs in another cloud. While the middlebox MBx is active, the paused middlebox MBy may buffer incoming traffic. In this case, traffic from VM<b>3</b> and VM<b>4</b> in the cloud computing environment <b>120</b> may be kept in the buffer of hypervisor VMMy. The middlebox MBy also process traffic from VMs in another cloud.
While the middlebox MBx is active and processing incoming traffic, the modified state of the middlebox MBx is maintained in the flip engine of the middlebox MBx. Variables in the memory of the middlebox MBx may be updated; for example, a counter may be incremented or a firewall rule may be updated. In addition, the virtual CPU state, identifying which instruction the middlebox MBx is currently executing will continuously update. Depending on a particular circumstance, for example, when the number of packets received at the middlebox MBx reaches a predetermined threshold, when the number of packets stored in the buffer of the hypervisor VMMy reaches a predetermined threshold, or to achieve a target latency (e.g., by avoiding long packet wait times in the buffer), the flip engine sends a state delta signal (also shown as <b>130</b> in <figref idref="DRAWINGS">FIG. 4</figref>) to the paused middlebox MBy.
The state delta includes virtual memory and virtual CPU states that have been updated since the middlebox MBx became active. To track the modified virtual memory state, shadow memory techniques can be applied, as used for example in Cully et al., “Remus: High Availability via Asynchronous Virtual Machine Replication,” NSDI 2008, pp. 161-174, the disclosure of which is incorporated by reference herein in its entirety. The state delta also includes the virtual CPU state maintained by the VMMx corresponding to the middlebox MBx.
In response to the state delta, the middlebox MBy is activated as shown in <figref idref="DRAWINGS">FIG. 6</figref>. The middlebox MBx is paused at this time. Because the middlebox MBy received the state delta, which includes the last state of the middlebox MBx, the now active middlebox MBy is able to process the traffic stored in its buffer at that state. Based on the state delta, the memory pages modified by the middlebox MBx overwrite the state memory pages in the middlebox MBy before the middlebox MBy becomes active. Similarly, the virtual CPU context that the middlebox MBx was running is copied to the middlebox MBy. In other words, the middlebox MBy operates in synch with the middlebox MBy.
After the middlebox MBy finishes processing the packets stored in its buffer, the middlebox MBy processes incoming traffic. Since the middlebox MBx is paused, traffic destined for the middlebox MBx is stored in the buffer of the hypervisor VMMx. Similar to that described above, once the determination is made to reactivate the middlebox MBx, the flip engine of the hypervisor VMMy will send the state delta to the flip engine of the middlebox MBx and the middlebox MBx will first process the data stored in its buffer, and then, any new incoming packets. The middlebox MBy will be paused and operate like a paused VM as described above.
Although not shown, the present invention may be applicable to more than two replicated VMs. In this case, a set of scheduling policies may be used to trigger flips. For example, using a load balancing technique, the flip engine of an active VM may send a state delta to an inactive VM based on a comparison of the amount of data in each of the buffers of the inactive VMs. Thus, the VM with the most packets gets to run next.
In addition, the present invention provides a methodology to collapse the replicas back into a single instance. If, for any reason, multiple replicas are no longer necessary (e.g., all VMs are migrated to the same cloud), a VM one of the replicas can be selected to be destroyed. When the dying replica finishes its last period of activity, its buffer is marked as inactive and all packets from the virtual network that would have been received by the replica's buffer are diverted to a still living replica. All flip engines are notified of the departure of a replica so that it will not be scheduled again. Then, the VMM can reclaim the resources associated with the replica. This process can be repeated for all replicas until a single VM remains.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article or manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
Referring now to <figref idref="DRAWINGS">FIG. 7</figref>, according to an exemplary embodiment of the present invention, a computer system <b>701</b> can comprise, inter alia, a CPU <b>702</b>, a memory <b>703</b> and an input/output (I/O) interface <b>704</b>. The computer system <b>701</b> is generally coupled through the I/O interface <b>704</b> to a display <b>705</b> and various input devices <b>706</b> such as a mouse and keyboard. The support circuits can include circuits such as cache, power supplies, clock circuits, and a communications bus. The memory <b>703</b> can include RAM, ROM, disk drive, tape drive, etc., or a combination thereof. Exemplary embodiments of present invention may be implemented as a routine <b>707</b> stored in memory <b>703</b> (e.g., a non-transitory computer-readable storage medium) and executed by the CPU <b>702</b> to process the signal from the signal source <b>708</b>. As such, the computer system <b>701</b> is a general-purpose computer system that becomes a specific purpose computer system when executing the routine <b>707</b> of the present invention.
The computer platform <b>701</b> also includes an operating system and micro-instruction code. The various processes and functions described herein may either be part of the micro-instruction code or part of the application program (or a combination thereof) which is executed via the operating system. In addition, various other peripheral devices may be connected to the computer platform such as an additional data storage device and a printing device.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical functions(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a,” “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
Contents5
8 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8
Every citation, both waysCites: the store holds 30 of 31
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US11074134B2 | Cited by | United States of America | Search report |
| US9507624B2 | Cited by | United States of America | Search report |
| US2020065195A1 | Cited by | United States of America | Search report |
| US2016004548A1 | Cited by | United States of America | Pre-grant |
| US2006143517A1 | Cites | United States of America | Applicant |
| US2007169121A1 | Cites | United States of America | Applicant |
| US2009113109A1 | Cites | United States of America | Search report |
| US2010107162A1 | Cites | United States of America | Search report |
| US2010174811A1 | Cites | United States of America | Applicant |
| US2011007746A1 | Cites | United States of America | Applicant |
| US2011167298A1 | Cites | United States of America | Applicant |
| US2011208908A1 | Cites | United States of America | Applicant |
| US2012017031A1 | Cites | United States of America | Search report |
| US2012084445A1 | Cites | United States of America | Search report |
| US2012096459A1 | Cites | United States of America | Search report |
| US2012137287A1 | Cites | United States of America | Applicant |
| US2013086236A1 | Cites | United States of America | Search report |
| US7613749B2 | Cites | United States of America | Applicant |
| US7739349B2 | Cites | United States of America | Applicant |
| US8396986B2 | Cites | United States of America | Search report |
| US8819678B2 | Cites | United States of America | Applicant |
| US20060143517A1 | Cites | United States of America | Applicant |
| US20070169121A1 | Cites | United States of America | Applicant |
| US20090113109A1 | Cites | United States of America | Search report |
| US20100107162A1 | Cites | United States of America | Search report |
| US20100174811A1 | Cites | United States of America | Applicant |
| US20110007746A1 | Cites | United States of America | Applicant |
| US20110167298A1 | Cites | United States of America | Applicant |
| US20110208908A1 | Cites | United States of America | Applicant |
| US20120017031A1 | Cites | United States of America | Search report |
| US20120084445A1 | Cites | United States of America | Search report |
| US20120096459A1 | Cites | United States of America | Search report |
| US20120137287A1 | Cites | United States of America | Applicant |
| US20130086236A1 | Cites | United States of America | Search report |
| Cully, et al., "Remus: High Availability via Asynchronous Virtual Machine Replication", NSDI'08: 5th UNSENIX Symposium on Networked Systems Design and Implementation, pp. 161-174. | Non-patent | – | Applicant |
| Cully, et al., “Remus: High Availability via Asynchronous Virtual Machine Replication”, NSDI'08: 5th UNSENIX Symposium on Networked Systems Design and Implementation, pp. 161-174. | Non-patent | – | Applicant |
4 members in 1 office
Priority claims6
| Document | Office | Kind | Date |
|---|---|---|---|
| 201213537348 | United States of America | A | |
| 201213537348 | United States of America | A | |
| 201213550708 | United States of America | A | |
| 13537348 | – | – | – |
| US201213537348 | – | – | – |
| US201213550708 | – | – | – |
Members4
| Document | Office | Kind | |
|---|---|---|---|
| US2014007088A1 | United States of America | A1 | |
| US2014007094A1 | United States of America | A1 | |
| US9256463B2 | United States of America | B2 | |
| US9256464B2This record | United States of America | B2 |
68 transactions on the USPTO file
Allowed after 2 non-final rejections, 1 final rejection and 1 RCE.
- Non-final rejections
- 2
- Final rejections
- 1
- RCEs
- 1
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Expire PatentEXP. | EXP. | |
| Maintenance Fee Reminder MailedREM. | REM. | |
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Email NotificationEML_NTR | EML_NTR | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Correspondence Address ChangeC.AD | C.AD | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Examiner's Amendment CommunicationEX.A | EX.A | |
| Paralegal or electronic terminal disclaimer approvedP574 | P574 | |
| Terminal Disclaimer FiledDIST | DIST | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Disposal for a RCE / CPA / R129AbandonedABN9 | ABN9 | |
| Request for Continued Examination (RCE)RCEX | RCEX | |
| Workflow - Request for RCE - BeginBRCE | BRCE | |
| Email NotificationEML_NTR | EML_NTR | |
| Mail Advisory Action (PTOL - 303)MCTAV | MCTAV | |
| Advisory Action (PTOL-303)CTAV | CTAV | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Final ActionA.NE | A.NE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Reference capture on IDSRCAP | RCAP | |
| Electronic Information Disclosure StatementEIDS. | EIDS. | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Reference capture on IDSRCAP | RCAP | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Email NotificationEML_NTR | EML_NTR | |
| PG-Pub Issue NotificationPG-ISSUE | PG-ISSUE | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Application Is Now CompleteCOMP | COMP | |
| Email NotificationEML_NTR | EML_NTR | |
| Filing ReceiptFLRCPT.O | FLRCPT.O | |
| Sent to Classification ContractorPGPC | PGPC | |
| Reference capture on IDSRCAP | RCAP | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Applicants have given acceptable permission for participating foreignAPPERMS | APPERMS | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Cleared by OIPE CSRL194 | L194 | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Initial Exam Team nnIEXX | IEXX |
5 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Lapsed due to failure to pay maintenance feeLapsedFP | FP | |
| Lapse for failure to pay maintenance feesLapsedPATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYLAPS | LAPS | |
| Information on status: patent discontinuationPATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362STCH | STCH | |
| Fee payment procedureMAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF |
Numbers
- Publication
- 09256464
- Publication, DOCDB
- 9256464
- Publication, EPODOC
- US9256464
- Application
- 13550708
- Application, DOCDB
- 201213550708
- Application, EPODOC
- US201213550708
Titles
- English
- Method and apparatus to replicate stateful virtual machines between clouds
Patent term adjustment
- A delay
- +275 daysthe office missed an examination deadline
- B delay
- +177 dayspendency past three years
- Applicant delay
- −9 days
- Net adjustment
- 443 days
Classification
- CPC, 7
- G06F9/4868
- G06F9/5077
- G06F9/5088
- G06F9/455
- G06F9/45533
- H04L67/1001
- H04L67/1002
- IPC, 4
- G06F9 455
- G06F9 48
- G06F9 50
- H04L29 08
- USPC, 1
- 001001000