Current enterprise level virtual machine file systems, such as VMware Inc.'s VMFS, are typically shared disk file systems that utilize an external storage device, such as a storage area network (SAN), to provide storage resources to virtual machines. These virtual machines are instantiated and run on one or more servers (sometimes referred to as a server cluster) that store their virtual machines' disk images as separate files in the SAN. Each server in the cluster runs a virtualization layer (sometimes referred to as a hypervisor) that includes an implementation of a virtual machine file system that coordinates the interaction of the server with the SAN. For example, each virtual machine file system on each server in a cluster implements and follows a common per-file locking protocol that enables virtual machines running on multiple servers to simultaneously access (e.g., read and write) their disk images in the SAN without fear that other servers may simultaneously access the same disk image at the same time.
The network architecture of
However, SAN 105 itself becomes a potential bottleneck and a single point of failure. Furthermore, by its nature, the use of a central SAN limits the capability to scale the number of servers in a cluster and/or distribute the servers in the cluster over a wide-area network (WAN). Additionally, SANs have traditionally been one of the most expensive components of a data center, often costing more than the aggregate cost of the virtualization software and server cluster.
One or more embodiments of the invention provide a virtual machine file system that employs a replicated and decentralized storage system. In this system, as in warehouse-style or “cloud” computing systems, multiple networked servers utilize cheaper local storage resources (such as SATA disks) rather than a centralized SAN, even though they may be less reliable, because such a replicated and decentralized storage system eliminates the bottleneck and single point of failure of a SAN and also provides the potential for both incremental and large-scale data center growth by simply adding more servers. However, use of such local storage resources is also less reliable than use of a SAN. To improve reliability, data replication techniques that provide high availability and ensure the integrity and consistency of replicated data across the servers are employed.
According to an embodiment, a cluster of computer systems, each of which is configured with a virtualization software layer to support execution of virtual computing instances, includes a first computer system in which a first virtual computing instance is executing, the first computer system including a first local storage unit in which a first log file is stored to capture write operations to a virtual disk of the first virtual computing instance. The cluster also includes a second computer system, networked to the first computer system, in which a second virtual computing instance is executing, the second computer system including a second local storage unit in which a second log file is stored to capture write operations to a virtual disk of the second virtual computing instance and in which a replica of the first log file is stored.
Each of servers 200A to 200H is further networked to one or more of the other servers in the cluster. For example, server 200A is networked to server 200B, server 200C, server 200G and server 200H. As depicted in the network topology of
An embodiment of the invention that utilizes a network architecture similar to that of
In one embodiment of the present invention, a replicated decentralized storage system, such as that depicted in
In step 545, the virtual machine file system for each of the secondary servers receives the update operation structure. In step 550, each virtual machine file system of the secondary servers extracts the parent id entry 430, which is the private unique id of the previous update operation, known only to primary server 200A prior to transmission of the update operation structure to the secondary servers in step 530, from the received update operation structure and generates, in step 555, a hash of the parent id entry 430. In step 560, each virtual machine file system of the secondary servers extracts the id entry 425 from the last update operation in its secondary disk image replica. Similar to the id entry 425 of the update operation structure constructed in step 520, id entry 425 extracted in step 560 is the public unique id that was created by virtual machine file system 220A for the prior update operation. In step 565, if the generated hashed parent id equals the public unique id stored as the id entry 425 of the last update operation of the secondary disk image, then in step 570, the virtual machine file system of the secondary server confirms that the received update operation structure originated from primary server 220A and appends the received update operation structure to the end of its secondary data image (respectively, 305, 310 and 315 for primary disk image 300). In step 575, the virtual machine file system of the secondary server obtains the physical address corresponding to the appended update operation in the secondary data image and inserts the physical address into its B-tree data structure. However, if, in step 565, the generated hashed parent id does not equal the public unique id stored as the id entry 425 of the last update operation of the secondary disk image, then the received update operation structure is rejected in step 580.
The steps depicted in
To avoid losing the master secret token in the event that a primary server fails, one or more embodiments of the present invention utilize a secret sharing protocol to distribute the master secret token across other servers in a manner that does not actually reveal the master secret token.
Upon a failure of primary server 200A, as in step 715, a secondary server, such as secondary server 200B, may recognize the failure of primary server 200A in step 720. For example, in one embodiment, a designated server with failover management responsibilities may inform secondary server 200E of the failure of primary server 200A and instruct secondary server 200B to become the new primary server and initiate failover procedures. In an alternative embodiment, secondary server 200B may itself discover the failure of primary server 200A (i.e., using its own monitoring capabilities) and initiate voting procedures, for example, by utilizing Lamport's Paxos algorithm or similar known voting algorithms, to become the new primary server, potentially competing with other secondary servers that have also recognized the failure of the primary server and initiated their own voting procedures to become the new primary server. For example, in step 725, secondary server 200B issues a request to other servers in the cluster for their respective shares of the master secret token s possessed by failed primary server 200A. In steps 730 and 735, secondary server 200B continues to receive master secret token shares until it has received a threshold t of master secret token shares. In an embodiment having competing secondary servers, another secondary server may obtain the threshold t of master secret token shares before secondary server 200B, for example, if the secondary servers follow the rules of acceptance in accordance with Lamport's Paxos algorithm or similar algorithms. In step 740, secondary server 200B is able to generate master secret token s from the t shares. In step 745, secondary server 200B generates a correct parent id for a new update operation by hashing the intersection of master secret token s, the parent id of the last update operation in its secondary disk image, and the data from the last update operation: H (s | parent | data). In step 750, secondary server 200B notifies all the other secondary servers that it has assumed responsibilities as the new primary server by transmitting a “view-change” update operation that contains the correct version of the parent id generated in step 745. In step 755, the secondary server 200E instantiates a new virtual machine and associates it with its secondary disk image for the failed virtual machine of the failed primary server, assumes responsibility as the new primary server and generates and subsequently propagates a newly generated master key token by returning to step 700.
It should be recognized that various modifications and changes may be made to the specific embodiments described herein without departing from the broader spirit and scope of the invention as set forth in the appended claims. For example, although the foregoing embodiments have described in the context of updating virtual machine disk images in a replicated and decentralized virtualization data center, it should be recognized that any system having any log files or objects (or files or object that may be structured as logs according to the teachings herein) that are replicated over multiple computers or devices may utilize the techniques disclosed herein to ensure exclusive access to such file or object. Similarly, alternative embodiments may transmit other types of operations to be appended into a disk image instead of or in addition to update operations. For example, one embodiment may include a “branch” and a delete operation, where the branch operation enables a new disk image to be created based on the current disk image without requiring knowledge of the master secret token such that any server in the cluster can request the creation of such a new disk image (for example, for snapshotting purposes) and the delete operation enables the deletion of an entire disk image. Alternative embodiments may utilize other techniques to generate a unique id. For example, rather than creating a hash of the intersection of the master secret token, parent id and current data, alternative embodiments may create a hash of the intersection of the master secret token and the current data or the parent id, or generate a unique id in any other manner consistent with its use as described herein. In one embodiment, the unique id may be a 160 bit value. In another alternative embodiment, a virtual machine file system may utilize a 64 bit indexed B-tree that tracks entire extents rather than individual block locations. Server clusters of alternative embodiments may employ a combination of shared storage, such as a SAN, and local storage in the servers themselves. For example, in one such embodiment, a primary server both stores a primary disk image for a virtual machine on a SAN such that other servers networked to the SAN can failover the virtual machine, and also propagates update operations corresponding to the virtual machine to secondary disk images in the local storage units of other secondary servers in order to provide additional safeguards in the event of a failure of the SAN. In yet another alternative embodiment, each server of a cluster includes its own local storage and is also networked to a shared SAN. Severs in such an embodiment may utilize local storage consistent with the teachings herein and access the SAN in the event that its local storage fails or is otherwise full. Alternatively, servers in such an embodiment may utilize the SAN as its primary storage and resort to local storage only upon a failure of the SAN. It should be recognized that various other combinations of using both a shared storage and local storage units may be utilized consistent with the teachings herein.
The various embodiments described herein may employ various computer-implemented operations involving data stored in computer systems. For example, these operations may require physical manipulation of physical quantities usually, though not necessarily, these quantities may take the form of electrical or magnetic signals where they, or representations of them, are capable of being stored, transferred, combined, compared, or otherwise manipulated. Further, such manipulations are often referred to in terms, such as producing, identifying, determining, or comparing. Any operations described herein that form part of one or more embodiments of the invention may be useful machine operations. In addition, one or more embodiments of the invention also relate to a device or an apparatus for performing these operations. The apparatus may be specially constructed for specific required purposes, or it may be a general purpose computer selectively activated or configured by a computer program stored in the computer. In particular, various general purpose machines may be used with computer programs written in accordance with the teachings herein, or it may be more convenient to construct a more specialized apparatus to perform the required operations.
The various embodiments described herein may be practiced with other computer system configurations including hand-held devices, microprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, and the like.
One or more embodiments of the present invention may be implemented as one or more computer programs or as one or more computer program modules embodied in one or more computer readable media. The term computer readable medium refers to any data storage device that can store data which can thereafter be input to a computer system computer readable media may be based on any existing or subsequently developed technology for embodying computer programs in a manner that enables them to be read by a computer. Examples of a computer readable medium include a hard drive, network attached storage (NAS), read-only memory, random-access memory (e.g., a flash memory device), a CD (Compact Discs) CD-ROM, a CD-R, or a CD-RW, a DVD (Digital Versatile Disc), a magnetic tape, and other optical and non-optical data storage devices. The computer readable medium can also be distributed over a network coupled computer system so that the computer readable code is stored and executed in a distributed fashion.
Although one or more embodiments of the present invention have been described in some detail for clarity of understanding, it will be apparent that certain changes and modifications may be made within the scope of the claims. Accordingly, the described embodiments are to be considered as illustrative and not restrictive, and the scope of the claims is not to be limited to details given herein, but may be modified within the scope and equivalents of the claims. In the claims, elements and/or steps do not imply any particular order of operation, unless explicitly stated in the claims.
Plural instances may be provided for components, operations or structures described herein as a single instance. Finally, boundaries between various components, operations and data stores are somewhat arbitrary, and particular operations are illustrated in the context of specific illustrative configurations. Other allocations of functionality are envisioned and may fall within the scope of the invention(s). In general, structures and functionality presented as separate components in exemplary configurations may be implemented as a combined structure or component. Similarly, structures and functionality presented as a single component may be implemented as separate components. These and other variations, modifications, additions, and improvements may fall within the scope of the appended claims(s).
This application is a divisional of U.S. patent application Ser. No. 15/274,866 entitled “System and Method for Using Local Storage to Emulate Centralized Storage” filed on Sep. 23, 2016, which is a continuation of U.S. patent application Ser. No. 13/734,186 entitled “System and Method for Using Local Storage to Emulate Centralized Storage” filed on Jan. 4, 2013, now U.S. Pat. No. 9,454,446, which is a continuation of U.S. patent application Ser. No. 12/506,965 entitled “System and Method for Replicating Disk Images in a Cloud Computing Based Virtual Machine File System” filed on Jul. 21, 2009, now U.S. Pat. No. 8,352,482. This application is further related to U.S. patent application Ser. No. 12/507,013, entitled “Method for Voting with Secret Shares in a Distributed System” filed Jul. 21, 2009, now U.S. Pat. No. 8,234,518, and U.S. patent application Ser. No. 12/604,334, entitled “Method and System for Locating Updated Operations in a Virtual Machine Disk Image” filed on Oct. 22, 2009, now U.S. Pat. No. 8,352,490, both of which are hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
6058493 | Talley | May 2000 | A |
6192472 | Garay et al. | Feb 2001 | B1 |
7069452 | Hind | Jun 2006 | B1 |
7320076 | Caronni | Jan 2008 | B2 |
7426566 | Godwin et al. | Sep 2008 | B2 |
7447854 | Cannon | Nov 2008 | B1 |
7519721 | Godwin et al. | Apr 2009 | B2 |
7548915 | Ramer et al. | Jun 2009 | B2 |
7548928 | Dean et al. | Jun 2009 | B1 |
7555674 | Wang | Jun 2009 | B1 |
7685095 | Ghosh et al. | Mar 2010 | B2 |
7783682 | Patterson | Aug 2010 | B1 |
7802251 | Kitamura | Sep 2010 | B2 |
7873168 | Tateoka et al. | Jan 2011 | B2 |
7916871 | Brookner et al. | Mar 2011 | B2 |
7930547 | Hao et al. | Apr 2011 | B2 |
8046550 | Feathergill | Oct 2011 | B2 |
8135930 | Mattox et al. | Mar 2012 | B1 |
8225029 | Meng et al. | Jul 2012 | B2 |
8234518 | Hansen | Jul 2012 | B2 |
8296759 | Hutchins et al. | Oct 2012 | B1 |
8352482 | Hansen | Jan 2013 | B2 |
8352490 | Hansen | Jan 2013 | B2 |
8386494 | Vachuska | Feb 2013 | B2 |
20020059329 | Hirashima et al. | May 2002 | A1 |
20020133608 | Godwin et al. | Sep 2002 | A1 |
20020165902 | Robb et al. | Nov 2002 | A1 |
20030140204 | Ashton | Jul 2003 | A1 |
20040098425 | Wiss et al. | May 2004 | A1 |
20040175000 | Caronni | Sep 2004 | A1 |
20060005189 | Vega et al. | Jan 2006 | A1 |
20060136713 | Zimmer et al. | Jun 2006 | A1 |
20060155667 | Tolba | Jul 2006 | A1 |
20070094659 | Singh et al. | Apr 2007 | A1 |
20070220605 | Chien | Sep 2007 | A1 |
20080095375 | Tateoka et al. | Apr 2008 | A1 |
20080147599 | Young-Lai | Jun 2008 | A1 |
20080155169 | Hiltgen et al. | Jun 2008 | A1 |
20080189428 | Godwin et al. | Aug 2008 | A1 |
20080235765 | Shimizu | Sep 2008 | A1 |
20090245518 | Bae et al. | Oct 2009 | A1 |
20100011178 | Feathergill | Jan 2010 | A1 |
20100050249 | Newman | Feb 2010 | A1 |
20100107158 | Chen et al. | Apr 2010 | A1 |
20100175061 | Maeda et al. | Jul 2010 | A1 |
20100189014 | Hogan et al. | Jul 2010 | A1 |
20110022574 | Hansen | Jan 2011 | A1 |
20110022883 | Hansen | Jan 2011 | A1 |
20110099187 | Hansen | Apr 2011 | A1 |
20110145188 | Vachuska | Jun 2011 | A1 |
20110276963 | Wu et al. | Nov 2011 | A1 |
20110307530 | Patterson | Dec 2011 | A1 |
20120066677 | Tang | Mar 2012 | A1 |
20130124559 | Hansen | May 2013 | A1 |
Entry |
---|
Hakim Weatherspoon et al., “Antiquity: Exploring a Secure Log for Wide-Area Distributed Storage.” EuroSys '07: Proceedings of the 2007 Conference on EuroSys, pp. 371-384, New York, NY 2007. ACM Press. |
Office Action for U.S. Appl. No. 13/735,792 dated Mar. 1, 2015. |
Naor et al., “Access Control and Signatures via Quorum Secret Sharing,” Parallel and Distributed Systems, IEEE Transactions, 9(9):909-922 Sep. 1998. |
Mazieres et al., “Building Secure File Systems Out of Byzantine Storage,” PODC '02: Proceedings of teh Twenty-First Annual Symposium on Principles of Distributed Computing, pp. 108-117, New York, NY 2002, ACM Press. |
International Search Report and Written Opinion from International Application No. PCT/US2010/042425 dated Mar. 2, 2011. |
Number | Date | Country | |
---|---|---|---|
20190243806 A1 | Aug 2019 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15274866 | Sep 2016 | US |
Child | 16384606 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13734186 | Jan 2013 | US |
Child | 15274866 | US | |
Parent | 12506965 | Jul 2009 | US |
Child | 13734186 | US |