JP6930443B2 - Process processing equipment, process processing system, process migration order determination method, and program - Google Patents

Description

The present invention relates to a method of calculating a migration schedule used when a process running on one physical device is migrated and operated on another physical device.

With the maturity of virtual network technology, packet processing using software has come into practical use. Such software is called a virtual network function (VNF).

In addition, service function chaining (SFC) that processes packets in a predetermined order by implementing functions such as tunnel termination, NAPT, and IPSec gateway in VNF and connecting these VNFs with a tunnel or the like. ) Is beginning to spread.

In SFC, VNF is called a service function (SF). However, since SF includes not only software-based network functions but also physical devices, in order to clarify that packet processing software is targeted, packet processing software that runs on a server that is a physical device is used in this specification. VNF is used as the name of.

When a plurality of VNFs constituting an SFC are operated on a plurality of different servers, data is transferred from the VNF of one server to the VNFs operating on another server, which causes traffic in the network. Hereinafter, this traffic will be referred to as a server-to-server traffic.

VNF is expected to operate in a data center. There is a desire to reduce traffic in data centers in order to improve equipment costs and power costs. In order to realize this, it is desired that VNFs belonging to the same SFC run on the same server. By operating VNFs belonging to the same SFC on the same server, data transfer between VNFs is performed via the memory in the server, the CPU bus, and the interconnect between cores, eliminating the need to transfer data to the network. This is because the traffic in the data center is reduced.

By the way, in providing the SFC service, it is an important issue for the SFC service provider to avoid the failure of the server and continue the service. With the spread of AI technology, the accuracy of detecting signs of server failure has improved, so it has become possible to continue the service by migrating the VNF running on the corresponding server to another server when the sign of server failure is detected. rice field. In addition, by performing regular server maintenance and quickly recognizing abnormalities, it has become possible to prevent sudden service interruptions.

Live migration technology exists as a means of migrating VNF to another server. The live migration technology is a technology for transmitting VNF data to another server when migrating a VNF running on one server to another server.

Generally, when migrating VNF, it is necessary to suspend packet processing. In order to shorten the time, in live migration, packet processing is continued until the data migration is completed. Pauses when completed and resumes packet processing at the migration destination.

When resuming packet processing at the migration destination, the data at the time of suspension at the migration source is required. In addition, since packet processing is continued until the data migration is completed, the data is continuously updated during that time. Therefore, during the live migration, the updated data is continuously transmitted to the migration destination server.

The amount of data transmitted depends on how often the application as a VNF updates the data. Also, if the update data generation rate exceeds the network bandwidth, the migration cannot be completed. In particular, when migrating a plurality of VNFs in parallel at the same time, all the data updated by the VNF being migrated is transmitted. Therefore, when migrating a plurality of VNFs from the migration source server to another server, it is necessary to control so that the generation rate of the update data by the VNFs to be migrated at a certain point does not exceed the network bandwidth. Non-Patent Document 1 discloses a technique for suppressing the occurrence of the above-mentioned inter-server traffic while performing this control.

Further, Non-Patent Document 1 discloses a migration scheduling method for reducing inter-server traffic that occurs while migrating virtual machines communicating with each other.

In the method disclosed in Non-Patent Document 1, VNFs to be migrated are grouped so that the generation rate of update data does not exceed the network bandwidth, and VNFs are migrated so that the migration completion timings of VNFs belonging to the same group are the same. do. Then, by changing the combination of VNFs belonging to the group, the migration schedule of VNFs that minimizes the amount of inter-server traffic is determined. The transition scheduling algorithm used in Non-Patent Document 1 is based on the algorithm disclosed in Non-Patent Document 2.

V. Kherbache, "Scheduling Live Migration of Virtual Machines," IEEE Transactions on Cloud Computing, 2017 J. Zheng, "COMMA: Coordinating the Migration of Multi-tier Applications", in 10th ACM SIGPLAN / SIGOPS international conference on Virtual execution environments, 2014

It is conceivable to apply the migration scheduling method disclosed in Non-Patent Documents 1 and 2 to the migration scheduling of VNF in SFC. However, the migration scheduling method disclosed in Non-Patent Documents 1 and 2 has the following problems.

In the migration scheduling method disclosed in Non-Patent Documents 1 and 2, there is a process of grouping VNFs into migratory units, and in order to derive the optimum solution of the migration schedule, all combinations of VNFs that can be in the same group are calculated. I had to do it. There are 2 VNFs in this combination (there are as many VNFs as there are two options, VNFs in or out of the group). Therefore, there is a problem that the time for deriving the migration schedule becomes long.

The present invention has been made in view of the above points, and provides a technique capable of shortening the time for deriving a migration schedule for migrating a process from a migration source server to a migration destination server. With the goal.

According to the disclosed technology, it is a process processing device that determines the process migration order in a system having a migration source server that runs a process and a migration destination server that is a migration destination of the process.
A group management table that stores information on the group of processes determined based on the communication relationship between processes, and
A process from the migration source server to the migration destination server so that a migration group is determined based on the group in the group management table and the migration is completed at consecutive timings by a plurality of migration groups belonging to the same group. With a deciding means to determine the migration order of
The determination means is characterized in that the power set of processes included in the group is calculated for each group including the process to be migrated in the group management table, and the migration group is determined from the elements of the power set. Process processing equipment is provided.

According to the disclosed technology, a technology that makes it possible to reduce the time for deriving a migration schedule for migrating a process from a migration source server to a migration destination server is provided.

It is a figure which shows the structural example of the system in embodiment of this invention. It is a figure which shows an example of the functional structure of the process processing apparatus 100. It is a figure which shows each table. It is a figure which shows an example of the hardware composition of the process processing apparatus 100. It is a figure for demonstrating the calculation method of the schedule calculation group. It is a figure for demonstrating the migration process. It is a figure for demonstrating the update procedure (at the time of adding SFC) of a group management table. It is a figure which shows the communication relationship between VNFs. It is a figure for demonstrating the update procedure (at the time of SFC deletion) of a group management table. It is a figure which shows the communication relationship between VNFs.

Hereinafter, embodiments of the present invention (the present embodiments) will be described with reference to the drawings. The embodiments described below are merely examples, and the embodiments to which the present invention is applied are not limited to the following embodiments. For example, in the following description, an example is shown in which the VNF to be migrated constitutes the SFC, but the technique according to the present invention is applicable to any method other than the SFC as long as the communication relationship is defined between the VNFs. It is possible.

(System configuration)
FIG. 1 is a diagram showing an example of an overall configuration of a system according to an embodiment of the present invention. In FIG. 1, a server 10 and a server 20 are shown as examples of servers that provide SFC. Here, each server is a physical device, and the network function in the server is a virtual network function realized by software.

As shown in FIG. 1, a process processing apparatus 100 is provided. The process processing device 100 can communicate with each server via a network. The process processing device 100 is a device that performs migration sequence calculation (may be referred to as migration scheduling) for migrating the VNFs constituting the SFC from the migration source server to the migration destination server, and also controls the migration. However, in the present embodiment, the process processing apparatus 100 is mainly described by focusing on the transition order calculation. Existing technology can be used to control the execution of migrations after the migration order has been determined.

In the example of FIG. 1, the server 10 and the server 20 are connected by a line having a certain band. The virtual switches 13, VNF11, and VNF12, are operating in the server 10. In the server 20, the switch 22 which is a virtual switch and the VNF 21 are operating. The VNF may be referred to as a "process".

FIG. 1 shows a packet flow in an SFC using VNF11, VNF12, and VNF21. As shown in FIG. 1, when a packet (labeled) is input to the server 10, the switch 13 refers to the label of the packet and makes the packet an appropriate VNF (here VNF11, VNF12). ). The same applies to the server 20.

As described above, in the system according to the present embodiment, as communication means between processes, a means having a low speed and a large number of processes (network between the server 10 and the server 20) and a means having a high speed and a large number of processes are used. There are few means (memory in the server, CPU bus, inter-core interconnect, etc.). Further, in the system according to the present embodiment, for example, a source process, a destination process, and an intermediate process exist in order to process data along a series of flows, and their relationships are predetermined. ing.

(Functional configuration of process processing device 100)
FIG. 2 shows an example of the functional configuration of the process processing apparatus 100. As shown in FIG. 2, the process processing apparatus 100 includes a processing unit 110, a recording medium 120, and an input / output interface 130.

The processing unit 110 includes a group management unit 111 and a process migration order calculation unit 112, which calculate the migration order of the VNF (process). The input / output interface 130 inputs data from the network 140 (example: input of SFC information) and outputs data to the network 140 (example: output of VNF migration order).

The recording medium 120 stores, for example, a group management table as shown in FIG. 3 and an SFC management table. The group management table is a table that manages each group composed of a plurality of related VNFs. FIG. 3A shows, for example, that Group 1 is composed of two VNFs, a and b.

The SFC management table manages SFC configuration information. In FIG. 3B, for example, an SFC with ID = 1 is composed of two VNFs a and b, and packets are processed in the processing order from a to b in the SFC. It is shown. That is, it is shown that there is a communication relationship between a and b.

The group management unit 111 in the processing unit 110 manages the above two tables. Specifically, the group management unit 111 executes addition / deletion of SFC in the SFC management table, creation / update of the group management table based on the SFC management table, and the like. Further, the group management unit 111 executes the calculation of the group used for the process migration order calculation (the migration group described later) based on the request from the process migration order calculation unit 112.

The process migration order calculation unit 112 in the processing unit 110 determines the migration order of the VNF. Further, the process migration order calculation unit 112 requests and acquires a group to be used for the calculation by requesting the group management unit 111 at the time of the migration order calculation.

The information of the SFC to be managed is input from the external device via the input / output interface 130. Further, the migration order of the VNF calculated by the process migration order calculation unit 112 is notified to the external device via the input / output interface 130.

(Hardware configuration example)
The above-mentioned process processing apparatus 100 can be realized by, for example, causing a computer to execute a program describing the processing contents described in the present embodiment.

That is, the process processing device 100 can be realized by executing a program corresponding to the processing executed by the process processing device 100 by using hardware resources such as a CPU and a memory built in the computer. .. The above program can be recorded on a computer-readable recording medium (portable memory, etc.), stored, and distributed. It is also possible to provide the above program through a network such as the Internet or e-mail.

FIG. 4 is a diagram showing a hardware configuration example of the computer according to the present embodiment. The computer of FIG. 4 has a drive device 150, an auxiliary storage device 152, a memory device 153, a CPU 154, an interface device 155, a display device 156, an input device 157, and the like, each of which is connected to each other by a bus B.

The program that realizes the processing in the computer is provided by, for example, a recording medium 151 such as a CD-ROM or a memory card. When the recording medium 151 storing the program is set in the drive device 150, the program is installed in the auxiliary storage device 152 from the recording medium 151 via the drive device 150. However, the program does not necessarily have to be installed from the recording medium 151, and may be downloaded from another computer via the network. The auxiliary storage device 152 stores the installed program and also stores necessary files, data, and the like.

The memory device 153 reads and stores the program from the auxiliary storage device 152 when the program is instructed to start. The CPU 154 realizes the function related to the process processing device 100 according to the program stored in the memory device 153. The interface device 155 is used as an interface for connecting to a network. The display device 156 displays a programmatic GUI (Graphical User Interface) or the like. The input device 157 is composed of a keyboard, a mouse, buttons, a touch panel, and the like, and is used for inputting various operation instructions.

(About calculation of migration order)
When the information of the migration target VNF existing in a certain migration source server and the information of the migration destination server are given to the process processing device 100, the process migration order calculation unit 112 first performs the migration order calculation to the group management unit 111. Request the calculation of the group to be used and acquire the information of the group. Then, the process migration order calculation unit 112 determines the migration order of the VNF using the group.

Hereinafter, in the present embodiment, in order to make it easy to distinguish between the group used for the migration order calculation and the group described in the group management table, the group used for the migration order calculation is referred to as a "migration group". .. For the groups listed in the group management table, "group" is used as it is.

A calculation example of the migration group executed by the group management unit 111 will be described with reference to FIG. As shown in FIG. 5, a and b are described as VNFs belonging to group 1 and c, d, and e are described as VNFs belonging to group 2 in the group management table.

Here, consider the case where a migration request for the five VNFs a, b, c, d, and e is received.

First, the group management unit 111 calculates the power set (all subsets when the VNF belonging to the group is regarded as an element of the set) in each group described in the group management table. Each subset belonging to the power set is a migration group. Specifically, for group 1, three transition groups of {a}, {b}, and {a, b} are calculated. For group 2, seven migration groups of {c}, {d}, {e}, {c, d}, {d, e}, {c, e}, {c, d, e} are calculated. Will be done.

As shown in FIG. 5, when five VNFs are to be migrated by the conventional method, 32 migration groups, which are 2 to the 5th power, had to be calculated. Then, 10 kinds of calculations are enough. This difference becomes more pronounced as the number of VNFs to be migrated increases. By reducing the number of migration groups, the number of migration groups to consider when determining the migration order is reduced. Therefore, in the technique according to the present embodiment, the amount of calculation for determining the migration order can be significantly reduced as compared with the conventional method, so that the VNF migration order can be calculated quickly.

Subsequently, the process migration order calculation unit 112 calculates the migration order of the VNF. The process migration order calculation unit 112 collectively handles VNFs belonging to the same selected migration group. That is, VNFs belonging to the same migration group are migrated at the same time. The term "simultaneous" here means that, for example, the migration completion timings of VNFs belonging to the same migration group are the same.

In the process migration order calculation unit 112, for example, as described in Non-Patent Document 1, the generation rate of VNF update data does not exceed the bandwidth of the line between the migration source server and the migration destination server, and the inter-server traffic Select a migration group to minimize the amount of. However, this is an example, and the migration group may be selected by other methods.

When the selection is completed, the process migration order calculation unit 112 determines the migration order in the plurality of selected migration groups so that the migration groups belonging to the same group complete the migration at consecutive timings. This is because it is desirable that VNFs belonging to the same group complete the transition at the same timing as much as possible.

In the example shown in FIG. 5, as an example, the process migration sequence calculation unit 112 selects two migration groups {a} and {b} as the migration groups used for migration from group 1, and groups 2 to 2 are selected. It is assumed that two migration groups {c, d} and {e} are selected. In this case, {a} and {b} are determined in a continuous order so that the migration groups {a} and {b} belonging to group 1 complete the migration in succession. Similarly, {c, d} and {e} are determined in a continuous order so that the migration groups {c, d} and {e} belonging to group 2 complete the migration in succession.

Which of {c, d} and {e} (and {a} and {b}) comes first is not particularly limited, but for example, the one with the larger update data generation rate () Or the smaller one) first. Further, depending on the characteristics of the application provided by VNF and the like, the group including the application requiring faster processing may be put first. The same applies to the order between groups (here, group 1 and group 2).

FIG. 6 shows a migration procedure when the migration order is determined as {c, d}, {e}, {a}, {b}. As shown in FIG. 6, c and d are transferred in S101, e is transferred in S102, a is transferred in S103, and b is transferred in S104.

When the bandwidth is larger than the number of VNFs to be migrated, the order in which a plurality of migration groups are collectively migrated may be determined. For example, the order in which {c, d}, {e}, {a}, and {b} are transferred at the same time may be determined.

(About management of group management table)
Next, as an example of managing the group management table executed by the group management unit 111, the update process of the group management table when the SFC is added or deleted will be described.

<When SFC is added>
First, the update process of the group management table when the SFC is added will be described with reference to FIG. 7.

In S201, the group management unit 111 adds the newly added SFC information to the SFC management table based on the information from the external device and the like. Here, as shown in FIG. 7, a-> e-> f is added as the SFC with ID = 4.

In S202, the group management unit 111 searches the group management table for a group containing at least one VNF included in the newly added SFC. In the example shown in FIG. 7, the group management unit 111 detects that among the VNFs a, e, and f included in the newly added SFC, a is included in group 1 and e is included in group 2.

In S203, when there are a plurality of groups including VNF included in the newly added SFC, the group management unit 111 integrates the plurality of groups into one group. Integrating a plurality of groups into one group means to combine all VNFs included in the plurality of groups into one group. In the example of FIG. 7, one group (a, b, c, d, e) integrates a and b of group 1 and c, d and e of group 2 so as to include VNF included in the newly added SFC. , F).

The communication relationship of a, b, c, d, e, and f is illustrated as shown in FIG. 8 based on the processing order of each SFC included in this one group (see the SFC management table described in S201).

As shown in the figure, the VNFs of each set in a plurality of VNFs included in one group created by the above procedure are on the same processing flow (eg, a set of a and f, a set of c and e, etc.). , One VNF is processing two processing flows (eg, a pair of b and f. A is processing the processing flow of b and the processing flow of f), and so on.

A plurality of VNFs including these relationships are related, and it is desirable that the plurality of VNFs migrate at the same time as possible. Therefore, such grouping is performed.

<When SFC is deleted>
Next, the update process of the group management table when the SFC is deleted will be described with reference to FIG.

In S301, the group management unit 111 deletes the information of the SFC to be deleted from the SFC management table based on the information from the external device and the like. Here, as shown in FIG. 9, a-> e-> f, which is an SFC with ID = 4, is deleted.

In S302, the group management unit 111 searches the group management table for a group including all VNFs included in the SFC to be deleted. In the example shown in FIG. 9, the group management unit 111 detects that the VNFs a, e, and f included in the deletion target SFC are included in the group 1. The group is subject to group division in S303.

In S303, the group management unit 111 examines the communication relationship between VNFs based on the SFC management table. FIG. 10 shows the SFC to be deleted surrounded by a dotted line in the communication relationship based on the SFC management table before the SFC is deleted. As shown in FIG. 10, when the deletion target SFC is deleted, it can be seen that there is no communication relationship between {a, b} and {c, d, e}. In S303, the group management unit 111 checks for the presence or absence of such a communication relationship.

Then, the group management unit 111 manages {a, b} and {c, d, e} as separate groups. Here, as shown in FIG. 9, {a, b} is group 1 and {c, d, e} is group 2.

(Summary of embodiments)
As described above, according to the present embodiment, it is a process processing device that determines the process migration order in a system having a migration source server that runs a process and a migration destination server that is a migration destination of the process. A migration group is determined based on a group management table that stores information on a group of processes determined based on the communication relationship between processes and a group in the group management table, and a plurality of migration groups belonging to the same group. Provided is a process processing apparatus including a determination means for determining a process migration order from the migration source server to the migration destination server so that the migration is completed at consecutive timings.

The determination means calculates, for example, a power set of processes included in the group for each group including the process to be migrated in the group management table, and determines the migration group from the elements of the power set.

The process processing apparatus may further include an update means for updating the group management table based on the addition or deletion of a plurality of processes having a communication relationship.

When adding a plurality of processes having a communication relationship, the update means integrates each group including at least one process in the plurality of processes into one group, for example.

When deleting a plurality of processes having a communication relationship, the updating means divides a group including the plurality of processes into a plurality of groups having no communication relationship based on the communication relationship between the processes in the group, for example. ..

Further, according to the present embodiment, a process processing system including the process processing apparatus, the migration source server, and the migration destination server is provided.

Further, according to the present embodiment, the process migration order determined by the process processing apparatus that determines the process migration order in the system having the migration source server that runs the process and the migration destination server that is the migration destination of the process. In a method, the process processing apparatus has a group management table for storing information on a group of processes determined based on a communication relationship between processes, and a migration group based on the group in the group management table. It is characterized by including a determination step of determining the migration order of processes from the migration source server to the migration destination server so that a plurality of migration groups belonging to the same group complete the migration at consecutive timings. A method for determining the process migration order is provided.

Further, according to the present embodiment, a program for causing the computer to function as each means in the process processing apparatus is provided.

The group management unit 111 and the process migration order calculation unit 112 described in the present embodiment are examples of determination means. Further, the group management unit 111 is an example of the updating means.

Although the present embodiment has been described above, the present invention is not limited to such a specific embodiment, and various modifications and changes can be made within the scope of the gist of the present invention described in the claims. It is possible.

10, 20 Server 13, 22 Switch 11, 12 VNF
100 Process processing device 110 Processing unit 120 Recording medium 130 Input / output interface 140 Network 111 Group management unit 112 Process migration sequence calculation unit 150 Drive device 151 Recording medium 152 Auxiliary storage device 153 Memory device 154 CPU
155 Interface device 156 Display device 157 Input device

Claims (9)

A process processing device that determines the process migration order in a system that has a migration source server that runs a process and a migration destination server that is the migration destination of the process.
A group management table that stores information on the group of processes determined based on the communication relationship between processes, and
A process from the migration source server to the migration destination server so that a migration group is determined based on the group in the group management table and the migration is completed at consecutive timings by a plurality of migration groups belonging to the same group. With a deciding means to determine the migration order of
The determination means is characterized in that the power set of processes included in the group is calculated for each group including the process to be migrated in the group management table, and the migration group is determined from the elements of the power set. Process processing equipment. The total data generation rate generated by the data update by the process belonging to the migration group determined by the determination means does not exceed the bandwidth of the line between the migration source server and the migration destination server.
The process processing apparatus according to claim 1. The group is determined based on the communication relationship between the processes according to the processing order of the processes.
The process processing apparatus according to claim 1 or 2. The process processing apparatus according to any one of claims 1 to 3, further comprising an update means for updating the group management table based on the addition or deletion of a plurality of processes having a communication relationship. The process processing apparatus according to claim 4 , wherein when a plurality of processes having a communication relationship are added, the update means integrates each group including at least one process in the plurality of processes into one group. When deleting a plurality of processes having a communication relationship, the update means divides the group including the plurality of processes into a plurality of groups having no communication relationship based on the communication relationship between the processes in the group. The process processing apparatus according to claim 4 or 5. A process processing system including the process processing apparatus according to any one of claims 1 to 6, the migration source server, and the migration destination server. A process migration order determination method executed by a process processing device that determines the process migration order in a system having a migration source server that runs a process and a migration destination server that is a process migration destination.
The process processing device has a group management table that stores information on a group of processes determined based on the communication relationship between processes.
A process from the migration source server to the migration destination server so that a migration group is determined based on the group in the group management table and the migration is completed at consecutive timings by a plurality of migration groups belonging to the same group. With a decision step to determine the migration order of
In the determination step, the process processing apparatus calculates a power set of processes included in the group for each group including the process to be migrated in the group management table, and selects the migration group from the elements of the power set. process migration order determination method characterized by determining. A program for causing a computer to function as each means in the process processing apparatus according to any one of claims 1 to 6.

Images