JP2013149118A - Virtual machine management server, virtual machine movement order control method and control program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a virtual machine management server and the like capable of effectively avoiding a rise in load caused by temporary concentration of a virtual machine on a specific virtual host.SOLUTION: A virtual machine management server 10 includes: an operation state collection section 101 for collecting a resource utilization rate of each of a plurality of virtual computers operated in each virtual host 20 from each virtual host 20; an optimum arrangement determination section 102 for determining the arrangement of the virtual computers most leveling load applied to each virtual host; a movement order determination section 103 for specifying a movement pattern in which the plurality of virtual computers of each virtual host are sequentially moved one by one and the movement is repeated until the arrangement of the virtual computers is optimally arranged and outputting the movement pattern as an optimum movement order; and a virtual machine movement commanding section 104 for commanding a movement instruction of the virtual computer to each virtual host on the basis of the optimum movement order.

Description

  The present invention relates to a virtual machine management server, a virtual machine movement order control method, and a control program, and more particularly, to a virtual machine management server and the like that equalize loads among a plurality of virtual hosts that operate virtual machines.

  In organizations such as corporations that construct and operate large-scale computer networks, computer virtualization is often promoted rapidly. For example, by operating various server computers that operate business systems and client computers operated by each user as virtual computers, the cost of operating these computers can be reduced, and there are equipment failures and large-scale disasters. However, it is thought that the operation can be continued.

  A virtual computer (hereinafter referred to as a virtual machine) operating on a certain physical computer (hereinafter referred to as a virtual host) can be moved to another virtual host via a network without change in its operating state even during operation.

  At that time, if a virtual machine with a high operating load is concentrated on a specific virtual host, the computer resources (hereinafter referred to as resources) of the virtual host are insufficient, and as a result, the operating performance of the virtual machine operating on the virtual host is reduced. Will be reduced. Therefore, it is necessary for stable computer system operation to arrange virtual machines between virtual hosts so that the load is leveled and resources are optimized among the virtual hosts.

  There are the following technical documents related to this. Among them, Patent Document 1 describes a virtual server system that obtains an evaluation value of a resource of each virtual host before and after the movement of the virtual machine and moves the virtual machine based on the evaluation value. Japanese Patent Application Laid-Open No. 2004-228688 describes a criterion for moving a virtual machine operating on a high-load virtual host to another virtual host.

  Patent Document 3 describes a technique for determining a schedule for moving a virtual machine operating on a virtual host to another virtual host. Non-Patent Document 1 describes an example of a general technique related to movement of a virtual machine.

Republished patent WO2008 / 102737 JP 2011-186701 A JP 2010-244524 A

"Realization of virtual machine live migration with VMware vMotion", 2011, VMware, Inc. [Search January 16, 2012], Internet <URL: http://www.vmware.com/jp/products/ datacenter-virtualization / vsphere / vmotion / overview.html>

  In some cases, it is necessary to move a plurality of virtual machines between the virtual hosts in order to balance the load between the plurality of virtual hosts and optimize the resources. In this case, a method of moving virtual machines at the same time or a method of moving them in stages can be considered, but with the former method, the virtual host's simultaneous movement increases the load temporarily on the virtual host, causing a shortage of resources. However, the operation of the virtual machine running on the virtual host may become unstable. Even if it is temporary, it is not desirable to be in such a state.

  Therefore, it can be said that the method of moving the virtual machine in stages is preferable. However, in the middle of the optimization, virtual machines may temporarily concentrate on a specific virtual host. Even if it happens temporarily, the load on the virtual host may increase and the operation of the virtual machine may become unstable.

  In the techniques described in Patent Documents 1 to 3 and Non-Patent Document 1 described above, consideration is not given to such points as the virtual machine movement method and the movement order. The technique described in Patent Literature 3 determines a “schedule” for moving a virtual machine to another virtual host, not the order. Therefore, the above problem cannot be solved by a combination of these techniques.

  An object of the present invention is to effectively avoid a virtual machine temporarily concentrating on a specific virtual host and increasing the load during the process of leveling the load by moving the virtual machine. A virtual machine management server, a virtual machine movement order control method, and a control program are provided.

  To achieve the above object, a virtual machine management server according to the present invention is a virtual machine management server connected via a network to a plurality of virtual hosts each operating a plurality of virtual computers. An operating state collection unit that collects the resource usage rate of each virtual computer that operates on the host, and the virtual resource on each virtual host that most equalizes the total resource usage rate of each virtual host from the collected resource usage rate A movement pattern that includes an optimum arrangement determination unit that decides the arrangement of computers as an optimum arrangement, and sequentially moves a plurality of virtual computers of each virtual host one by one until the arrangement of the virtual computers becomes the optimum arrangement And a movement order determination unit that outputs the movement pattern as an optimum movement order, and an optimum movement Based on the mechanism, and having a virtual machine moving headquarters sequentially emits movement instruction of the virtual computer for each virtual host.

  In order to achieve the above object, a virtual machine movement order control method according to the present invention is provided in a virtual machine management server connected via a network to a plurality of virtual hosts each operating a plurality of virtual computers. The operating state collection unit collects the resource usage rate of each virtual computer running on the host from the host, and on each virtual host that most equalizes the total resource usage rate of each virtual host from the collected resource usage rate The optimal placement determination unit determines the placement of the virtual computers as the optimal placement, sequentially moves a plurality of virtual computers of each virtual host one by one, and repeats the movement pattern until the placement of the virtual computers becomes the optimal placement. The movement order determination unit identifies and outputs this as the optimum movement order, and each virtual host is based on the optimum movement order. Virtual machine movement headquarters, characterized in that the successively issuing a movement instruction of the virtual machine with respect.

  In order to achieve the above object, a virtual machine movement order control program according to the present invention is provided in a virtual machine management server connected via a network to a plurality of virtual hosts each operating a plurality of virtual computers. The procedure for collecting the resource utilization rate of each virtual computer running on the host from each virtual host on the computer provided with the management server, and the level of the total resource utilization rate of each virtual host from the collected resource utilization rate The procedure for determining the placement of virtual computers on each virtual host as the optimum placement, moving multiple virtual computers on each virtual host one by one, and repeating this until the placement of virtual computers reaches the optimum placement Identify and output this as the optimal moving order, and the optimal moving order Based on, characterized in that to execute sequentially emits procedure movement instruction of the virtual computer for each virtual host.

  As described above, the present invention is configured to specify the movement pattern in which the virtual computers are sequentially moved one by one until the optimal arrangement in which the load is leveled most is achieved. The situation of concentrating on virtual hosts can be effectively avoided. As a result, it is possible to effectively avoid a virtual machine temporarily concentrating on a specific virtual host and effectively increasing the load, and a virtual machine management server having a superior feature and a virtual machine movement order control method And a control program can be provided.

It is explanatory drawing shown about the structure of the virtual machine management server which concerns on the 1st Embodiment of this invention. 3 is a flowchart illustrating the operation of each unit of the virtual machine management server illustrated in FIG. 1. FIG. 3 is an explanatory diagram illustrating resources of each virtual machine operating on a virtual host as an example of an operation in which the movement order determination unit illustrated as steps S203 to S206 in FIG. 2 determines the movement order of virtual machines. FIG. 4 is an explanatory diagram showing an example in which each virtual machine is moved so that the load is leveled most in each virtual host shown in FIG. FIG. 4 is an explanatory diagram showing a change in the maximum value Rmax (1, k ′) of the utilization rates of all virtual hosts in each stage when each virtual machine illustrated in FIG. 3 is moved by “movement path A”. It is a continuation of FIG. FIG. 4 is an explanatory diagram showing a change in the maximum value Rmax (2, k ′) of the utilization rates of all virtual hosts at each stage when each virtual machine illustrated in FIG. 3 is moved by “movement path B”. FIG. 7 is a continuation of FIG. It is explanatory drawing shown about the structure of the virtual machine management server which concerns on the 2nd Embodiment of this invention. 10 is a flowchart showing the operation of each unit of the virtual machine management server shown in FIG.

(First embodiment)
Hereinafter, the configuration of an embodiment of the present invention will be described with reference to FIG.
First, the basic content of the present embodiment will be described, and then more specific content will be described.
The virtual machine management server 10 according to the present embodiment is a virtual machine management server connected via a network 40 to a plurality of virtual hosts 20 each operating a plurality of virtual computers (virtual machines 31 to 33). The virtual machine management server 10 includes an operation state collection unit 101 that collects the resource utilization rate of each virtual computer operating on the host from each virtual host, and the resource utilization rate of each virtual host from the collected resource utilization rate. And an optimal placement determination unit 102 that determines the placement of virtual computers on each virtual host that levels the total value most as an optimum placement. In addition, move multiple virtual computers of each virtual host one by one, specify a movement pattern that repeats until the virtual computer layout is optimal, and output the movement pattern as the optimal movement order And a virtual machine migration command unit 104 that sequentially issues a virtual computer migration command to each virtual host based on the optimum migration order.

  Then, even if the migration order determination unit 103 migrates one virtual computer from one virtual host to another virtual host, the maximum total resource utilization rate of each virtual host after migration is the virtual host before migration. The virtual computers are sequentially moved one by one so as not to exceed the maximum value of the total resource utilization rate, and a movement pattern is repeated until the virtual computers are arranged optimally.

  In addition, when a plurality of movement patterns are searched for, the movement order determination unit 103 finds the movement pattern that optimizes the maximum value of the total resource utilization rate earliest among the plurality of movement patterns searched for. It has the function.

With this configuration, the virtual machine management server 10 can effectively avoid the virtual machine temporarily concentrating on a specific virtual host and increasing the load.
Hereinafter, this will be described in more detail.

  FIG. 1 is an explanatory diagram showing the configuration of the virtual machine management server 10 according to the first embodiment of the present invention. The virtual machine management server 10 has a basic configuration as a computer device. In other words, the computer 11 includes a processor 11 that is an operation subject of the computer program, a storage unit 12 that stores the program and data, and a communication unit 13 that communicates with other devices via the network 40.

  The virtual machine management server 10 is connected to the virtual hosts 20a, 20b, 20c,... Which are a plurality of physical computers via the network 40. Each of the virtual hosts 20a, 20b, 20c,... (Hereinafter collectively referred to as the virtual host 20) is a physical computer having a function of forming and operating a virtual machine (virtual computer).

  There is no limitation on the number of virtual hosts 20 connected to the virtual machine management server 10 and the virtual machines operating there. However, FIG. 1 shows three virtual hosts 20a to 20c corresponding to an operation example described later. In the virtual host 20a (A), the virtual machines 31a to c (1-1 to 3), in the virtual host 20b (B), the virtual machines 32a to c (2-1 to 3), and in the virtual host 20c (C) are virtual. An example in which the machines 33a to 33b (3-1 to 2) are operating is described.

  The processor 11 of the virtual machine management server 10 operates as an operation state collection unit 101, an optimal arrangement determination unit 102, a movement order determination unit 103, and a virtual machine movement command unit 104 by operating a virtual machine management program. The operation state collection unit 101 collects information on the resource usage rate of each virtual machine operating from each virtual host 20.

  The optimum arrangement determination unit 102 determines the arrangement of the virtual machines that level the load most from the information collected by the operation state collection unit 101 by a known technique described in the above-mentioned Patent Document 1 or the like. The movement order determination unit 103 also determines the movement order of the virtual machines from the information collected by the operation state collection unit 101. The virtual machine migration command unit 104 issues a virtual machine migration command to each virtual host 20 based on the determined migration order.

  FIG. 2 is a flowchart showing the operation of each unit of the virtual machine management server 10 shown in FIG. First, the operation state collection unit 101 collects the resource usage rate of each virtual machine that operates from each virtual host 20 (step S201). Here, the resource usage rate to be collected includes, for example, a CPU usage rate, a main memory usage rate, a hard disk usage rate, and a network usage rate.

  Based on the information collected in step S201, first, the optimum placement determination unit 102 has the most equal load on each virtual host, that is, the total resource utilization of all virtual machines operating on the virtual host. The placement of the virtual machine is determined as the optimum placement (step S202). The operation of the optimum arrangement determining unit 102 for determining the “optimum arrangement” can be performed by a known technique described in Patent Document 1 described above, and is not within the scope of the present invention.

  Subsequently, the movement order determination unit 103 determines the movement order of the virtual machines when moving the virtual machines so as to have the arrangement determined by the optimum arrangement determination unit 102 (steps S203 to 206). . The operation will be described below.

  First, for all virtual machines operating on all virtual hosts 20, even if one virtual machine is moved from one virtual host 20 to another virtual host 20, the maximum total resource utilization rate for each virtual host 20 is the same. The movement of the virtual machine is repeated so as not to increase, and a movement pattern (this is called a movement path) for achieving the optimal arrangement determined in the previous step is searched from all the movement paths (step S203).

  It is determined whether or not there is only one travel path searched (step S204). If there is only one travel path, it is determined as an optimal travel path (step S206). If there are a plurality of searched movement paths, a movement path capable of leveling the resource utilization rate most efficiently is determined from them (step S205), and determined as an optimum movement path (step S206). The virtual machine migration command unit 104 issues a virtual machine migration command to each virtual host 20 based on the optimum migration path determined in step S206 (step S207).

  FIG. 3 is an explanatory diagram showing the resources of each virtual machine operating on the virtual host 20 as an example of the operation in which the movement order determination unit 103 shown as steps S203 to 206 in FIG. 2 determines the movement order of the virtual machines. .

  In order to explain the concept of the present invention in a simple manner, first, the virtual host 20 is limited to three, 20a to 20c, and is called virtual hosts A to C, respectively. It is assumed that a total of eight virtual machines are operating on these, the virtual machines 31a to c (1-1 to 3) in the virtual host 20a (A), and the virtual machines 32a in the virtual host 20b (B). ˜c (2-1 to 3) and the virtual host 20c (C), virtual machines 33a to 33b (3-1 to 2) are operating.

  Each virtual host 20 can be considered to have the same type and number of CPUs, main memory capacity, hard disk capacity, and network transfer speed. That is, the physical resources of each virtual host 20 are all the same. When a virtual machine operating on one virtual host 20 is moved to another virtual host 20, the utilization rate is the same at the source and destination. It can be considered equivalent.

  The resource utilization rate collected by the operation state collection unit 101 is limited to the utilization rate of the CPU. Hereinafter, this is simply referred to as utilization. The virtual machines 31a to 31c (1-1 to 3) have a usage rate of "32", "8", and "30", respectively, and the virtual machines 32a to 32c (2-1 to 3) have "15", "5", and "18", respectively. The utilization rates of “32” and “10” for the virtual machines 33a to 33b (3-1 to 2) are collected by the operation state collection unit 101.

  That is, the total utilization rate of the virtual machines 31a to 31c (1-1 to 3) operating on the virtual host 20a (A) is "70", and the virtual machines 32a to 32c (2) operating on the virtual host 20b (B). -1 to 3) is "38", and the virtual machines 33a to 33b (3-1 to 2) operating on the virtual host 20c (C) are "42".

  In this case, the virtual machine 31c (1-3) is transferred from the virtual host 20a (A) to the virtual host 20b (B), and the virtual machine 32c (2-3) is transferred from the virtual host 20b (B) to the virtual host 20c (C). When the virtual machine 33b (3-2) is moved from the virtual host 20c (C) to the virtual host 20a (A), the total utilization rate is “50” in all the virtual hosts 20a to 20c (A to C). So this is the placement of the virtual machines where the load is leveled most. The optimal arrangement determination unit 102 determines this arrangement by the above-described known technique.

  FIG. 4 is an explanatory diagram showing an example in which each virtual machine is moved so as to equalize the load most in each of the virtual hosts 20a to 20c (A to C) shown in FIG. In order to change the state shown in FIG. 3 to the state shown in FIG. 4, the following six movement orders (movement paths A to F) are conceivable.

(Movement path A)
Move virtual machine 31c (1-3) from virtual host 20a (A) to virtual host 20b (B) → move virtual machine 32c (2-3) from virtual host 20b (B) to virtual host 20c (C) → Move virtual machine 33b (3-2) from virtual host 20c (C) to virtual host 20a (A)

(Movement path B)
Move the virtual machine 31c (1-3) from the virtual host 20a (A) to the virtual host 20b (B) → Move the virtual machine 33b (3-2) from the virtual host 20c (C) to the virtual host 20a (A) → Move virtual machine 32c (2-3) from virtual host 20b (B) to virtual host 20c (C)

(Movement path C)
Move the virtual machine 32c (2-3) from the virtual host 20b (B) to the virtual host 20c (C) → Move the virtual machine 31 c (1-3) from the virtual host 20 a (A) to the virtual host 20 b (B) → Move virtual machine 33b (3-2) from virtual host 20c (C) to virtual host 20a (A)

(Movement path D)
Move the virtual machine 32c (2-3) from the virtual host 20b (B) to the virtual host 20c (C) → Move the virtual machine 33 b (3-2) from the virtual host 20 c (C) to the virtual host 20 a (A) → Move virtual machine 31c (1-3) from virtual host 20a (A) to virtual host 20b (B)

(Movement path E)
Move the virtual machine 33b (3-2) from the virtual host 20c (C) to the virtual host 20a (A) → move the virtual machine 31 c (1-3) from the virtual host 20 a (A) to the virtual host 20 b (B) → Move virtual machine 32c (2-3) from virtual host 20b (B) to virtual host 20c (C)

(Movement path F)
Move virtual machine 33b (3-2) from virtual host 20c (C) to virtual host 20a (A) → move virtual machine 32c (2-3) from virtual host 20b (B) to virtual host 20c (C) → Move virtual machine 31c (1-3) from virtual host 20a (A) to virtual host 20b (B)

  For example, when the virtual machine 33b (3-2) is moved from the virtual host 20c (C) to the virtual host 20a (A) in the first movement of the movement path E, the virtual machine 20a (A) Four virtual machines 31a to c (1-1 to 3) and 33b (3-2) are operated, and the total utilization rate of these virtual machines is “80”. This is not preferable because it is a higher value than that before the leveling operation even in a temporary state.

  Therefore, the movement order determination unit 103 determines an optimal movement order so that the load of the migration destination virtual host does not exceed the load of the migration source virtual host before the movement of the virtual machine, and the virtual machine movement command unit in that order. 104 is instructed to move the virtual machine. Hereinafter, specific calculation processing by the movement order determination unit 103 will be described.

  The total number of virtual hosts 20 is N, each virtual host 20 is Hn (1 ≦ n ≦ N), the total utilization rate of each virtual host Hn is R (Hn), and the total amount of resources available to each virtual host Hn is Let C (Hn). As described above, in the example described here, N = 3, and the total amount C (Hn) of resources that can be used in each virtual host Hn is equal.

  The total number of virtual machines to be migrated among virtual machines operating on all virtual hosts 20 is K, each virtual machine is Vk (1 ≦ k ≦ K), and the usage rate of the virtual machine Vk is R (Vk). As described above, in the example described here, the total number of virtual machines is 8, but here, the virtual machine 31c (1-3), the virtual machine 32c (2-3), and the virtual machine 33b (3-2) Therefore, the number of objects to be moved is K = 3. Therefore, the number of possible movement paths is 3! = 6 ways.

  In the kth movement, the virtual machine Vk is moved from the virtual host Hsrc to Hdst. In this case, the total utilization rates of the virtual hosts Hsrc and Hdst before and after the migration are expressed by the following formulas 1 and 2, respectively.

Therefore, the maximum value Rmax (k ′) of the utilization rates of all virtual hosts after the k ′ (0 ≦ k ′ ≦ K) migration is completed, and the k ′ + 1 migration after the migration is completed. Maximum value Rmax
(K ′ + 1) is represented by the following equations 3 to 4, respectively. However, MAX (A, B, C,...) Represents the maximum value among a plurality of numerical values in parentheses.

  The movement order determining unit 103 performs the processing shown in step S203 of FIG. 2 with p possible movement paths (1 ≦ p) as the movement paths satisfying the condition shown in the following equation 5 in all k ′. ≦ K!).

  If there is one movement path that satisfies this condition, the movement order determination unit 103 performs steps S206 to S207 based on the movement path. If there are two or more movement paths satisfying this condition, each path is represented as p, and Rmax (k ′) corresponding to the path is represented as Rmax (p, k ′), the movement order determination unit 103 performs the process of step S205. Then, the evaluation value E (p, k ′) shown in the following equation 6 is calculated for each path, and the path having the smallest evaluation value E (p, k ′) is most efficiently used. It is determined that it can be converted. However, MIN (A, B, C,...) Represents the minimum value among a plurality of numerical values in parentheses.

  When the example shown as FIGS. 3 to 4 is applied to this calculation formula, the movement path that satisfies the condition shown in the following Expression 5 in all k ′ in the process shown in step S203 of FIG. The movement path A and the movement path B are two. The movement paths C to F each have a movement “the load of the migration destination virtual host exceeds the load of the migration source virtual host before the migration of the virtual machine”.

  5 to 6 show the maximum values Rmax (1, k ′) of the utilization rates of all virtual hosts in each stage when the virtual machines illustrated in FIG. 3 are moved by the above-mentioned “movement path A”. It is explanatory drawing which shows a change. Similarly, FIGS. 7 to 8 show the maximum values Rmax (2, k ′) of the utilization rates of all virtual hosts in each stage when the virtual machines illustrated in FIG. 3 are moved by the above-mentioned “movement path B”. It is explanatory drawing which shows the change of (). Here, 0 ≦ k ′ ≦ 3. Due to space limitations, the movement based on “movement path A” and “movement path B” is divided into two sheets.

  Both are the same as the state of the example shown in FIG. 3 in the initial state. That is, the usage rates of “32”, “8”, and “30” are respectively used for the virtual machines 31 a to c (1-1 to 3), and “15”, “5”, and “ 18 ”and the virtual machines 33a to 33b (3-1 to 2) have usage rates of“ 32 ”and“ 10 ”, respectively. 5-8, for example, "1-1 (32)" is displayed on the virtual machine 31a. This is because the symbol of the virtual machine in this system is "1-1", and its utilization rate Means “32”. The same applies to other virtual machines.

  That is, the total utilization rate of the virtual machines 31a to 31c (1-1 to 3) operating on the virtual host 20a (A) is "70", and the virtual machines 32a to 32c (2) operating on the virtual host 20b (B). -1 to 3) is "38", and the virtual machines 33a to 33b (3-1 to 2) operating on the virtual host 20c (C) are "42". Assuming that “movement path A” is p = 1 and “movement path B” is p = 2, the maximum value Rmax of the utilization rates of all virtual hosts shown in FIG. 5 at this stage is Rmax (1, 0). = Rmax (2, 0) = “70”.

  In contrast, first, in the “movement path A” shown in FIGS. 5 to 6, the virtual machine 31c (1-3) having the utilization rate “30” is transferred from the virtual host 20a (A) to the virtual host 20b in the first movement. Move to (B). As a result, the virtual machines 31a to 31b (1-1 to 2) operate on the virtual host 20a (A), and the total utilization rate is “40”. Since the virtual machines 32a to 32c (2-1 to 3) and the virtual machine 31c (1-3) operate on the virtual host 20b (B), the total utilization rate is “68”. In the virtual host 20c (C), the total utilization rate is unchanged and is “42”. Therefore, Rmax (1,1) = “68”.

  In the second movement of “Movement Path A”, the virtual machine 32c (2-3) with the utilization rate “18” is moved from the virtual host 20b (B) to the virtual host 20c (C). Thereby, in the virtual host 20b (B), the virtual machines 32a to 32b (2-1 to 2) and the virtual machine 31c (1-3) operate, so the total utilization rate is “50”. Since the virtual machines 33a to 33b (3-1 to 2) and the virtual machine 32c (2-3) operate on the virtual host 20c (C), the total utilization rate is “60”. In the virtual host 20a (A), the total utilization rate remains unchanged at “40”. Therefore, Rmax (1,2) = “60”.

  In the third movement of “Movement Path A”, the virtual machine 33b (3-2) with the utilization rate “10” is moved from the virtual host 20c (C) to the virtual host 20a (A). As a result, the virtual machine 33a (3-1) and the virtual machine 32c (2-3) operate on the virtual host 20c (C), and the total utilization rate is “50”. Since the virtual machines 31a-b (1-1-2) and the virtual machine 33b (3-2) operate on the virtual host 20a (A), the total utilization rate is “50”. In the virtual host 20b (B), the total utilization rate is unchanged and is “50”. Therefore, Rmax (1,3) = “50”.

  On the other hand, in the “movement path B” illustrated in FIGS. 7 to 8, the virtual machine 31 c (1-3) having the utilization rate “30” is transferred from the virtual host 20 a (A) to the virtual host 20 b (B) in the first movement. Moving. This is the same as the first movement of “movement path A”. Therefore, Rmax (2,1) = “68”.

  In the second movement of “movement path B”, the virtual machine 33 b (3-2) with the utilization rate “10” is moved from the virtual host 20 c (C) to the virtual host 20 a (A). As a result, only the virtual machine 33a (3-1) operates on the virtual host 20c (C), so the total utilization rate is “32”. Since the virtual machines 31a-b (1-1-2) and the virtual machine 33b (3-2) operate on the virtual host 20a (A), the total utilization rate is “50”. In the virtual host 20b (B), the total utilization rate remains unchanged at “68”. Therefore, Rmax (2, 2) = “68”.

  In the third movement of “Movement path B”, the virtual machine 32c (2-3) with the utilization rate “18” is moved from the virtual host 20b (B) to the virtual host 20c (C). Thereby, in the virtual host 20b (B), the virtual machines 32a to 32b (2-1 to 2) and the virtual machine 31c (1-3) operate, so the total utilization rate is “50”. Since the virtual machine 33a (3-1) and the virtual machine 32c (2-3) operate on the virtual host 20c (C), the total utilization rate is “50”. Therefore, Rmax (2, 3) = “50”.

  As described above, in the comparison between “movement path A” and “movement path B”, Rmax (1, 0) = Rmax (2, 0) = “70”, Rmax (1, 1) = Rmax ( 2,1) = “68”, Rmax (1,3) = Rmax (2,3) = “50”, but Rmax (1,2) = “60”, Rmax (2,2) = “68” Is. Therefore, since Rmax (1,2) ≦ Rmax (2,2) is satisfied, in the process of step S205 by the movement order determination unit 103, p = 1, that is, “movement path A” is most efficiently used. It can be determined that leveling is possible.

(Overall operation of the first embodiment)
Next, the overall operation of the above embodiment will be described.
The virtual machine movement order control method according to the present embodiment includes a virtual machine management server 10 connected via a network to a plurality of virtual hosts each operating a plurality of virtual computers (virtual machines), and each virtual host The operating state collection unit collects the resource usage rate of each virtual computer operating on the host from the virtual machine (FIG. 2, step S201), and the virtual resource that leveles the load on each virtual host most from the collected resource usage rate. The optimal placement determination unit determines the placement of the virtual computers on the host (FIG. 2, step S202), and sequentially moves a plurality of virtual computers of each virtual host one by one. The movement order determination unit identifies a movement pattern that repeats until the optimal arrangement is reached, and outputs this as the optimal movement order. Figure 2 step S203～206), based on the optimum movement path, the virtual machine moves HQ issues a movement instruction of the virtual computer for each virtual host (Fig. 2 step S207).

  In addition, the process of outputting the optimum migration path (FIG. 2, steps S203 to 206) uses the resources of each virtual host after migration even if one virtual computer is migrated from one virtual host to another virtual host. The virtual computers are moved sequentially one by one so that the maximum value of the total rate does not exceed the maximum value of the total resource usage rate of the virtual host before the migration, and this is repeated until the virtual computer placement becomes the optimal placement. It is.

Here, each of the above-described operation steps may be programmed to be executable by a computer and executed by the processor 11 of the virtual machine management server 10 that directly executes each of the steps. The program may be recorded on a non-temporary recording medium, such as a DVD, a CD, or a flash memory. In this case, the program is read from the recording medium by a computer and executed.
By this operation, this embodiment has the following effects.

  According to the present embodiment, in the process of sequentially moving the virtual machines toward the optimal arrangement, it is possible to move the virtual machines while avoiding an increase in the total resource utilization rate for each virtual host at each stage. . Therefore, it is possible to effectively avoid a situation in which a virtual machine temporarily concentrates on a specific virtual host and a load increases. In addition, when a plurality of movement paths for moving the virtual machine are found as described above, the virtual machine can be moved so that the resource utilization rate is leveled more quickly.

(Extension of the first embodiment)
In the above embodiment, the resource usage rate to be processed is limited to “CPU usage rate”, but other numerical values can be used as the resource usage rate, and the above embodiment can be applied to a plurality of types of numerical values. The same processing can be performed. In this case, after multiplying each of a plurality of types of utilization rates by a weighting factor given in advance, a numerical value obtained by summing these weighted utilization rates is used as the utilization rate of the virtual machine, which is the same as in the above embodiment. Perform the process.

  More specifically, the usage rate R (Hn) of the virtual host Hn includes the CPU resource usage rate, the memory resource usage rate, the storage resource usage rate, and the network resource usage rate of the virtual host as Rcpu (Hn), Rmemory ( Hn), RdiskIO (Hn), and RnetworkIO (Hn), and the weight values given to each of them are Wcpu, Wmemory, WdiskIO, and WnetworkIO, respectively.

  If the same processing as that in the above embodiment is performed on the utilization rate R (Hn) of the virtual host Hn obtained by this equation, the optimum movement order can be obtained even for a plurality of resources.

  Further, the arrangement of the virtual machines determined by the optimum arrangement determining unit 102 does not necessarily have to be intended to “level the load”. For example, it is intended to secure a specific amount of free resources in any one specific virtual host, or to stop any one specific virtual host (for power saving), etc. However, it is possible to move the virtual machines in an optimal order without performing the same processing as in the above embodiment and unnecessarily increasing the load on the virtual host.

  Furthermore, in the example described in the present application, all virtual hosts are provided with the same resource. However, even when the total amount of resources that can be used differs for each virtual host, The total amount C (Hn) may be a value corresponding to each virtual host.

(Second Embodiment)
The virtual machine management server 310 according to the second exemplary embodiment of the present invention includes a total resource for each virtual host even if the movement order determination unit 403 moves one virtual computer from a specific virtual host to another virtual host. In order not to increase the maximum value of the utilization rate, when there is no movement pattern for moving the virtual computer, the movement pattern that minimizes the maximum value of the total resource utilization rate is set as a configuration having an optimal movement path.

In addition to obtaining the same effect as in the first embodiment by this configuration, even when there is no movement path that can repeat the movement of the virtual machine so that the maximum value of the resource utilization rate does not increase further, The increase in the maximum value of the resource utilization rate can be suppressed as much as possible, and the utilization rate can be leveled.
Hereinafter, this will be described in more detail.

  FIG. 9 is an explanatory diagram showing the configuration of the virtual machine management server 310 according to the second embodiment of the present invention. The virtual machine management server 310 has the same hardware configuration as the virtual machine management server 10 of the first embodiment shown in FIG. The network 40 and the virtual host 20 (including the virtual machine operating there) connected thereto are the same as those in the first embodiment. The software is the same as that of the first embodiment except that the movement order determination unit 103 is replaced with another movement order determination unit 403. Therefore, elements that are the same as in the first embodiment are referred to by the same designations and reference numbers.

  FIG. 10 is a flowchart showing the operation of each unit of the virtual machine management server 310 shown in FIG. Again, the same operation numbers as those in the first embodiment are denoted by the same reference numerals. Steps S201 to 203 are the same as those in the first embodiment. However, in the subsequent step S501, the movement order determination unit 403 does not increase the maximum resource utilization rate in the entire virtual host 20. It is determined whether or not there is a movement path capable of repeating the movement of the virtual machine so as to satisfy the above-described equation (5).

  When it is determined that such a movement path does not exist, the movement order determination unit 403 calculates an evaluation value E (p, k) represented by the following equation 8 for each movement path (p). The mobile path having the smallest evaluation value is determined as the one that can most efficiently level the utilization (step S502). However, MAX (A, B, C,...) Represents the maximum value among a plurality of numerical values in parentheses.

  Step S502 is followed by the same processing as that after step S204 shown in FIG. Even when it is determined in step S501 that the corresponding movement path exists, the same processing as in step S204 and subsequent steps continues.

  In the first embodiment, it is assumed that there is always at least one movement path that can repeat the movement of the virtual machine so that the maximum value of the resource utilization rate does not increase. May not exist. In the second embodiment, even in such a case, the increase in the maximum value of the resource utilization rate can be suppressed as much as possible, and the utilization rate can be leveled.

  Although the present invention has been described with reference to the specific embodiments shown in the drawings, the present invention is not limited to the embodiments shown in the drawings, and any known ones can be used as long as the effects of the present invention are exhibited. Even if it is a structure, it is employable.

  Regarding the embodiment described above, the main points of the new technical contents are summarized as follows. In addition, although a part or all of the said embodiment is put together as follows as a novel technique, this invention is not necessarily limited to this.

(Supplementary note 1) A virtual machine management server connected via a network to a plurality of virtual hosts each operating a plurality of virtual computers,
The operation state collection unit that collects the resource utilization rate of each virtual computer operating on the host from each virtual host, and the total value of the resource utilization rate of each virtual host is most equalized from the collected resource utilization rate An optimal placement determination unit that determines the placement of the virtual computer on each virtual host to be the optimum placement,
A plurality of virtual computers of each virtual host are sequentially moved one by one, a movement pattern that is repeated until the arrangement of the virtual computers becomes the optimum arrangement is specified, and the movement pattern is output as an optimum movement order A moving order determination unit to
A virtual machine management server comprising: a virtual machine migration command unit that sequentially issues a migration command of the virtual computer to each virtual host based on the optimum migration order.

(Supplementary Note 2) The movement order determination unit
Even if one virtual computer is moved from one virtual host to another virtual host, the maximum total resource utilization of each virtual host after the migration is the resource of the virtual host before the migration The virtual computer is sequentially moved one by one so as not to exceed the maximum total utilization rate, and a movement pattern is repeated until the virtual computer is placed in the optimum placement. The virtual machine management server according to 1.

(Supplementary Note 3) The movement order determination unit
When searching for a plurality of movement patterns, the movement pattern for leveling the maximum value of the resource utilization rate earliest among the plurality of movement patterns searched is set as the optimum movement order. The virtual machine management server according to Supplementary Note 2, wherein

(Additional remark 4) The said movement order determination part is
Even if one virtual computer is moved from one virtual host to another virtual host, the maximum total resource utilization of each virtual host after the migration is the resource of the virtual host before the migration When it is impossible to move the virtual computers one by one so that the maximum total utilization rate is not exceeded, the virtual computer is moved so that the maximum total resource utilization rate after the migration is minimized The virtual machine management server according to attachment 2, wherein the virtual machine management server has a function of

(Supplementary note 5) A virtual value according to supplementary note 1, wherein a value obtained by multiplying each of the collected resource utilization factors of each virtual computer by a weighting factor is used as the resource utilization factor. Machine management server.

(Supplementary Note 6) A virtual machine management server connected via a network to a plurality of virtual hosts each operating a plurality of virtual computers,
The operating state collection unit collects the resource usage rate of each virtual computer running on the host from each virtual host,
From the collected resource utilization rate, the optimum placement determination unit determines the placement of the virtual computer on each virtual host that most equalizes the total value of the resource utilization rate of each virtual host as the optimum placement,
The movement order determination unit identifies a movement pattern in which the plurality of virtual computers of each virtual host are sequentially moved one by one and the arrangement is repeated until the arrangement of the virtual computers becomes the optimum arrangement, and this is optimally moved. Output as order,
A virtual machine movement order control method, wherein a virtual machine movement command unit sequentially issues a movement instruction of the virtual computer to each virtual host based on the optimum movement order.

(Supplementary note 7) The process of outputting the optimum movement order is:
Even if one virtual computer is moved from one virtual host to another virtual host, the maximum total resource utilization of each virtual host after the migration is the resource of the virtual host before the migration Appendix 6 is characterized in that the virtual computers are sequentially moved one by one so as not to exceed the maximum total utilization, and this is repeated until the placement of the virtual computers reaches the optimum placement. The virtual machine movement order control method described.

(Supplementary Note 8) Each of the virtual machine management servers is connected to a plurality of virtual hosts that operate a plurality of virtual computers via a network.
In the computer provided in the virtual machine management server,
A procedure for collecting the resource utilization rate of each virtual computer running on the host from each virtual host;
A procedure for determining, from the collected resource utilization rates, an optimal placement of the virtual computers on the virtual hosts that most equalizes the total resource utilization of the virtual hosts;
A procedure of sequentially moving a plurality of virtual computers of each virtual host one by one, specifying a movement pattern that is repeated until the placement of the virtual computers becomes the optimum placement, and outputting this as an optimum movement order ,
And a virtual machine movement order control program for causing each virtual host to sequentially issue a movement instruction for the virtual computer based on the optimum movement order.

(Supplementary Note 9) The procedure for outputting the optimum movement order is as follows.
Even if one virtual computer is moved from one virtual host to another virtual host, the maximum total resource utilization of each virtual host after the migration is the resource of the virtual host before the migration Appendix 8 is characterized in that the virtual computers are sequentially moved one by one so as not to exceed the maximum total utilization rate, and this is repeated until the placement of the virtual computers reaches the optimum placement. The virtual machine movement order control program described.

  The present invention can be applied to the operation of a virtual computer in a computer network. As described above, the present invention can be used for purposes other than leveling the load.

DESCRIPTION OF SYMBOLS 10,310 Virtual machine management server 11 Processor 12 Storage means 13 Communication means 20, 20a-c Virtual host 31a-c, 32a-c, 33a-b Virtual machine 101 Operation | movement state collection part 102 Optimal arrangement | positioning determination part 103,403 Movement order Decision part 104 Virtual machine movement command part

Claims (9)

A virtual machine management server connected via a network to a plurality of virtual hosts each operating a plurality of virtual computers,
The operation state collection unit that collects the resource utilization rate of each virtual computer operating on the host from each virtual host, and the total value of the resource utilization rate of each virtual host is most equalized from the collected resource utilization rate An optimal placement determination unit that determines the placement of the virtual computer on each virtual host to be the optimum placement,
A plurality of virtual computers of each virtual host are sequentially moved one by one, a movement pattern that is repeated until the arrangement of the virtual computers becomes the optimum arrangement is specified, and the movement pattern is output as an optimum movement order A moving order determination unit to
A virtual machine management server comprising: a virtual machine migration command unit that sequentially issues a migration command of the virtual computer to each virtual host based on the optimum migration order. The movement order determination unit
Even if one virtual computer is moved from one virtual host to another virtual host, the maximum total resource utilization of each virtual host after the migration is the resource of the virtual host before the migration The virtual computer is sequentially moved one by one so as not to exceed the maximum total utilization rate, and a movement pattern that repeats this until the placement of the virtual computer becomes the optimum placement is searched for. Item 8. The virtual machine management server according to Item 1. The movement order determination unit
When searching for a plurality of movement patterns, the movement pattern for leveling the maximum value of the resource utilization rate earliest among the plurality of movement patterns searched is set as the optimum movement order. The virtual machine management server according to claim 2, wherein: The movement order determination unit
Even if one virtual computer is moved from one virtual host to another virtual host, the maximum total resource utilization of each virtual host after the migration is the resource of the virtual host before the migration When it is impossible to move the virtual computers one by one so that the maximum total utilization rate is not exceeded, the virtual computer is moved so that the maximum total resource utilization rate after the migration is minimized The virtual machine management server according to claim 2, having a function of causing   The virtual machine management server according to claim 1, wherein a value obtained by multiplying each of the collected resource utilization rates of each virtual computer by a weighting factor is used as the resource utilization rate. . A virtual machine management server connected via a network to a plurality of virtual hosts each operating a plurality of virtual computers;
The operating state collection unit collects the resource usage rate of each virtual computer running on the host from each virtual host,
From the collected resource utilization rate, the optimum placement determination unit determines the placement of the virtual computer on each virtual host that most equalizes the total value of the resource utilization rate of each virtual host as the optimum placement,
The movement order determination unit identifies a movement pattern in which the plurality of virtual computers of each virtual host are sequentially moved one by one and the arrangement is repeated until the arrangement of the virtual computers becomes the optimum arrangement, and this is optimally moved. Output as order,
A virtual machine movement order control method, wherein a virtual machine movement command unit sequentially issues a movement instruction of the virtual computer to each virtual host based on the optimum movement order. The process of outputting the optimum movement order is:
Even if one virtual computer is moved from one virtual host to another virtual host, the maximum total resource utilization of each virtual host after the migration is the resource of the virtual host before the migration 7. The virtual computers are sequentially moved one by one so as not to exceed the maximum total utilization rate, and this is repeated until the placement of the virtual computers reaches the optimum placement. The virtual machine movement order control method described in 1. A virtual machine management server connected via a network to a plurality of virtual hosts each operating a plurality of virtual computers;
In the computer provided in the virtual machine management server,
A procedure for collecting the resource utilization rate of each virtual computer running on the host from each virtual host;
A procedure for determining, from the collected resource utilization rates, an optimal placement of the virtual computers on the virtual hosts that most equalizes the total resource utilization of the virtual hosts;
A procedure of sequentially moving a plurality of virtual computers of each virtual host one by one, specifying a movement pattern that is repeated until the placement of the virtual computers becomes the optimum placement, and outputting this as an optimum movement order ,
And a virtual machine movement order control program for causing each virtual host to sequentially issue a movement instruction for the virtual computer based on the optimum movement order. The procedure for outputting the optimum movement order is as follows:
Even if one virtual computer is moved from one virtual host to another virtual host, the maximum total resource utilization of each virtual host after the migration is the resource of the virtual host before the migration 9. The virtual computers are sequentially moved one by one so as not to exceed the maximum total utilization rate, and this is repeated until the placement of the virtual computers reaches the optimum placement. The virtual machine movement order control program described in 1.

Images