KR102216746B1 - virtual machine placement method in a virtual machine based service function chaining - Google Patents

Abstract

Disclosed are a method and apparatus for arranging a virtual machine in a virtual machine-based service function chaining. The method of arranging service nodes includes the steps of: determining required resources of service nodes constituting a service chain; Calculating a link cost for each link between service nodes constituting a service chain, and aligning links between service nodes according to the calculated link cost; Checking remaining resources of at least one computing node; And a pseudo service node by grouping service nodes on the basis of the requested resource of the service nodes, the cost for each link, and the residual resource of at least one computing node, and the similar service node is one of at least one computing node. It may be configured including the step of allocating to the computing node.

Description

Virtual machine placement method in a virtual machine based service function chaining

The present invention relates to a virtual machine-based service function chaining (SFC), and more particularly, a method of efficiently deploying virtual machine-based service nodes constituting a service chain to improve service performance. And to an apparatus.

Network Functions Virtualization (NFV) technology is a network address translation (NAT), firewall, intrusion prevention system (IPS), and virtual private implemented with independent hardware devices. It is a virtualization technology that implements and operates various network functions such as a network (VPN: Virtual Private Network) based on a virtual machine in the form of software. Therefore, if NFV technology is used, the flexibility of network services can be improved by using a software-based framework.

In addition, there is increasing interest in service chaining or service function chaining (SFC) technology that implements one network service by selectively combining and executing network functions required according to traffic.

Service Function Chaining (SFC) is a concept that allows network users' traffic to selectively pass through only the functions necessary for the user among network services such as NAT, Firewall, and IPS, and these services can be operated on a physical server. It can also run on a virtual machine. Therefore, SFC can be understood as a concept having a close relationship with NFV (Network Function Virtualization).

In accordance with interest in virtualized network services, various public and commercial virtualization service platforms are being provided. A virtual machine is deployed on such a virtual service platform to provide service functions. In this case, the physical computer on which the virtual machine is placed is called a computing node, and running the virtual machine on the computing node is called placement or scheduling. A service using a virtual machine is defined using a means of service chaining, and this service chaining expresses the connection between each virtual machine to provide a service. At this time, the virtual machine that forms the service chain is called a service node.

However, communication between virtual machines for the purpose of providing a service brings significant performance limitations. In other words, virtual machines deployed on different computing nodes generate a communication load of various methods (VLAN, VxLAN, GRE, etc.). Therefore, appropriately arranging service nodes composed of virtual machines has an important influence on the performance of a provided network service.

An object of the present invention for solving the above problems is, in an NFV-based service function chaining environment, virtual machine service nodes are efficiently arranged in a computing node to improve the performance of a provided network service. It is to provide a method of deploying machine service nodes.

Another object of the present invention for solving the above problems is that in an NFV-based service function chaining environment, each virtual machine service node is efficiently arranged in a computing node, thereby improving the performance of a provided network service. It is to provide a device for deploying virtual machine service nodes.

In order to achieve the above object, the present invention provides a method for arranging service nodes constituting a service chain in service function chaining, comprising the steps of: (a) identifying required resources of service nodes constituting the service chain; (B) calculating a link cost for each link between service nodes constituting the service chain, and aligning links between service nodes according to the calculated link cost; (C) checking the remaining resources of at least one computing node; And configuring a pseudo service node by grouping the service nodes based on the requested resource of the service nodes, the cost for each link, and the remaining resource of the at least one computing node, and the similar service node It may include the step (d) of allocating to one of the one computing node.

Here, the required resource of the service nodes may include at least one of a computing resource, a disk capacity, and a memory capacity required for operation of each service node.

Here, the link cost may be calculated based on at least one of a requested number of transactions, a requested bandwidth, and an importance level between links between the service nodes. In addition, the link cost may be calculated using a cost function based on at least one of a number of requested transactions, a requested bandwidth, and an importance level between links between the service nodes.

Here, in the allocating step, from a link having a high link cost among the links arranged in the order of the link cost, service nodes constituting the link are allocated to the same computing node to configure the similar service node. have.

In this case, the sum of the requested resources of the service nodes constituting the similar service node is configured to be smaller than the spare resources of the same computing node.

Here, the service node may be operated based on a virtual machine.

Here, steps (c) and (d) may be repeatedly performed until similar service nodes are no longer configured.

The present invention for achieving the above other object is, in the service function chaining based on Network Function Virtualization (NFV), including a memory device loaded with a program code and at least one processor executing the program code, , As an apparatus for performing arrangement of service nodes constituting a service chain, the program code is a step of grasping requested resources of service nodes constituting the service chain from an orchestrator or a predetermined description ( a); (B) calculating a link cost for each link between service nodes constituting the service chain, and aligning links between service nodes according to the calculated link cost; (C) checking a residual resource of at least one computing node existing on a network function virtualization infrastructure (NFVI); And configuring a pseudo service node by grouping the service nodes based on the requested resource of the service nodes, the cost for each link, and the remaining resource of the at least one computing node, and the similar service node It may include the step (d) of allocating to one of the one computing node.

Here, the required resource of the service nodes may include at least one of a computing resource, a disk capacity, and a memory capacity required for operation of each service node.

Here, the link cost may be calculated based on at least one of a requested number of transactions, a requested bandwidth, and an importance level between links between the service nodes. In addition, the link cost may be calculated using a cost function based on at least one of a number of requested transactions, a requested bandwidth, and an importance level between links between the service nodes.

Here, in the allocating step, from a link having a high link cost among the links arranged in the order of the link cost, service nodes constituting the link are allocated to the same computing node to configure the similar service node. have.

In this case, the sum of the required resources of the service nodes constituting the similar service node may be configured to be smaller than the spare resources of the same computing node.

Here, steps (c) and (d) may be repeatedly performed until similar service nodes are no longer configured.

Here, the device may be included in a virtualized infrastructure manager (VIM).

Using the service node arrangement method and apparatus according to the present invention as described above, by configuring a similar service node and efficiently placing the service node on the computing node, The load can be reduced.

1 is a conceptual diagram illustrating a configuration of a service chain to which a service node arrangement method according to the present invention can be applied.
2 is a diagram illustrating a concept of link cost of links between service nodes constituting a service chain according to an embodiment of the method for distributing service nodes of the present invention.
3 is a table illustrating link costs calculated for links between service nodes constituting a service chain according to an embodiment of the service node arrangement method of the present invention.
4 is a table illustrating computing nodes to which service nodes constituting a service chain can be allocated according to an embodiment of the method of disposing a service node of the present invention.
5 is a conceptual diagram illustrating a concept of configuring a similar service node in relation to a link cost according to an embodiment of a service node arrangement method of the present invention.
6 is a flow chart for explaining a service node arrangement method according to the present invention.
7 is an overall conceptual diagram of a service node arrangement method according to the present invention.
8 is a block diagram for explaining a concept in which the service node arrangement method of the present invention is performed on the NFV architecture.

In the present invention, various modifications may be made and various embodiments may be provided, and specific embodiments will be illustrated in the drawings and described in detail in the detailed description. However, this is not intended to limit the present invention to a specific embodiment, it is to be understood to include all changes, equivalents, and substitutes included in the spirit and scope of the present invention. In describing each drawing, similar reference numerals have been used for similar elements.

Terms such as first, second, A, and B may be used to describe various elements, but the elements should not be limited by the terms. These terms are used only for the purpose of distinguishing one component from another component. For example, without departing from the scope of the present invention, a first element may be referred to as a second element, and similarly, a second element may be referred to as a first element. The term and/or includes a combination of a plurality of related listed items or any of a plurality of related listed items.

When a component is referred to as being "connected" or "connected" to another component, it is understood that it may be directly connected or connected to the other component, but other components may exist in the middle. Should be. On the other hand, when a component is referred to as being "directly connected" or "directly connected" to another component, it should be understood that there is no other component in the middle.

The terms used in the present application are only used to describe specific embodiments, and are not intended to limit the present invention. Singular expressions include plural expressions unless the context clearly indicates otherwise. In the present application, terms such as "comprise" or "have" are intended to designate the presence of features, numbers, steps, actions, components, parts, or combinations thereof described in the specification, but one or more other features. It is to be understood that the presence or addition of elements or numbers, steps, actions, components, parts, or combinations thereof, does not preclude in advance.

Unless otherwise defined, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which the present invention belongs. Terms as defined in a commonly used dictionary should be interpreted as having a meaning consistent with the meaning in the context of the related technology, and should not be interpreted as an ideal or excessively formal meaning unless explicitly defined in this application. Does not.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is a conceptual diagram illustrating a configuration of a service chain to which a service node arrangement method according to the present invention can be applied.

1 is a general service chaining graph (), illustrating a service chain 100.

Referring to FIG. 1, a service chain 100 may be composed of n service nodes 101, 102, 103, and 104. In this case, each service node may mean each unit function (eg, server) for the purpose of providing a service on the virtual machine. That is, each service node is a functional block that performs designated processing on a received packet, and can be understood as a service service function (SF) constituting a service function chain. For example, each service node may be a functional unit that performs at least one of network devices such as a firewall, an intrusion prevention system (IPS), deep packet inspection (DPI), and network address translation (NAT).

Meanwhile, a resource required for operation may be defined for each service node. For example, the required resource may mean a resource such as computing resources (eg, CPU usage, required number of cores), disk capacity, and memory capacity required for operation for each service node.

In other words, in FIG. 1, the requested resource of the service node 101 is defined as r1, the requested resource of the service node 102 is defined as r2, the requested resource of the service node 103 is defined as r3, and the service The required resource of the node 104 may be defined as rn.

In the following, the requested resource is expressed as one variable (r1, r2, r3, rn), but this means a representative value obtained by combining various resources. That is, depending on the embodiment, the required resource may be expressed by two or more variables.

In addition, at least one of the number of transactions required for each link between service nodes, a required bandwidth, and a weight may be defined. For example, the number of transactions required for the link between the service node 101 and the service node 102 may be expressed as t1, the required bandwidth is b1, and the importance level may be expressed as w1. In a similar manner, for a link between the service node 102 and the service node 103, the number of transactions can be expressed as t2, the required bandwidth is b2, and the importance is expressed as w2. In a similar manner, for a link between a given service node and the service node 104, the number of transactions may be expressed as ti, the required bandwidth is bi, and the importance level may be expressed as wi.

2 is a diagram illustrating a concept of link cost of links between service nodes constituting a service chain according to an embodiment of the method for distributing service nodes of the present invention.

2, the link cost between the service node 101 and the service node 102 can be expressed as cost1, and the link cost between the service node 102 and the service node 103 is expressed as cost2. Can be. Further, the link cost between the service node 104 and a predetermined service node may be expressed as costi.

In this case, the link cost may be calculated by a cost function based on at least one of the aforementioned number of transactions required for each link, bandwidth required, and importance. For example, a value obtained by multiplying each weight (or scale value) by at least two or more of the number of transactions, the required bandwidth, and the importance, and then adding it, or a value obtained by applying a predefined cost function, may be used as the link cost . In various embodiments of the present invention, the cost function used to calculate the link cost is not limited to a specific function.

For example, an example of a cost function for calculating a link cost used in an embodiment of the present invention may be defined as in Equation 1 below.

[Equation 1]

In Equation 1, Ci denotes the link cost for link i, and wi and bi denote the importance and bandwidth of link i, respectively.

On the other hand, in the case of a transaction, the deviation must be considered for each link, and the importance may be different for each transaction exchanged for the overall performance of the service. Therefore, ti can be converted to nti to which normalization is applied and applied to Equation 1 above. Normalization can be expressed by Equation 2 below.

[Equation 2]

That is, the link cost (cost1) between the service node 101 and the service node 102 may be calculated by a cost function based on at least one of t1, b1, and w1 described above, and the service node 102 The link cost (cost2) between the and the service node 103 may be calculated by a cost function based on at least one value of t2, b2, and w2 described above, and the link between the predetermined service node and the service node 104 Costi may be calculated by a cost function based on at least one of ti, bi, and wi described above.

At this time, it may vary depending on the definition of the cost function used, but in general, a link with a high link cost can process more transactions, require a larger bandwidth, or be a link with higher importance than a link with a low link cost. have.

3 is a table illustrating link costs calculated for links between service nodes constituting a service chain according to an embodiment of the service node arrangement method of the present invention.

The table illustrated in FIG. 3 is a table created for service nodes and links constituting the service chain illustrated in FIGS. 1 and 2.

In the table shown in FIG. 3, the first column 301 represents the calculated link costs, the second column 302 represents a pair of service nodes constituting each link, and the third column 303 The number of requested transactions for each link, the fourth column 304 is the requested bandwidth of each link, the fifth column 305 is the importance of each link, and the sixth column 306 is the requested resource of a pair of service nodes constituting each link. Information on is listed.

In this case, the links may be sorted in the order of links having a high link cost. For example, in the table illustrated in FIG. 3, cost1, cost2, ... It is illustrated as having a high link cost in the order of, costi.

That is, the link between the service node 101 and the service node 102 has a higher link cost than the link between the service node 102 and the service node 103 (i.e., cost1>cost2), and the service node 102 and the service The link between the nodes 103 means having a higher link cost than the link between the predetermined service node and the service node 104 (ie, cost2>costi).

4 is a table illustrating computing nodes to which service nodes constituting a service chain can be allocated according to an embodiment of the method of disposing a service node of the present invention.

First, a computing node is a physical node on which a virtual machine is placed, and is a node that manages all resources, distributes them to each virtual machine, and manages the virtual machine. That is, since the service nodes on the service chain according to the present invention may be composed of a server instance running on a virtual machine, each service node may be created by being assigned to a computing node. At this time, at least one service node may be disposed in one computing node.

In the table illustrated in FIG. 4, the first column 401 designates the number of computing nodes constituting the computing node pool. For example, FIG. 4 exemplifies the existence of j computing nodes.

The second column 402 represents total resources held by each computing node. Here, the resource is the same as the required resource of the service node described above, the computing resources that each computing node can provide (e.g., CPU usage, the number of required cores), disk capacity, and resources such as memory capacity. It can mean. For example, the first computing node (computing node #1) holds the total resource Rt1, the second computing node (computing node #2) holds the entire resource Rt2, and the j-th computing node (computing node #j). Holds the entire resource Rtj.

The third column 403 represents a resource (assigned resource) already used by each computing node. For example, the first computing node already allocates resources equal to Ra1, the second computing node already allocates resources equal to Ra2, and the jth computing node already allocates resources equal to Raj.

The fourth column 404 represents a remaining resource of each computing node. For example, the first computing node holds the remaining resources as much as R1, the second computing node holds the remaining resources as much as R2, and the jth computing node holds the remaining resources as much as Rj.

Accordingly, the total resources of the second column 402, the allocated resources of the third column 403, and the remaining resources of the fourth column 404 have a relationship of residual resources = all resources-allocated resources.

As mentioned above, all resources/allocated resources/residual resources are all expressed as one variable (rt1, ra1, R1, …), but this means a representative value that aggregates various resources. That is, depending on the embodiment, the total resource/allocated resource/residual resource may be expressed as two or more variables.

The procedure of the present invention includes the steps of calculating a link cost using the number of transactions, required network bandwidth, importance, etc. for a service between each node in the configured service chaining; Calculating resources of two service nodes constituting a link having the highest value among the calculated link costs to find a candidate computing node that can accommodate a remaining resource among the computing nodes; Arranging two service nodes and updating remaining resources of the corresponding computing node; It consists of the steps of constructing a similar service chain by reconfiguring the service chain using the two deployed service nodes as one similar service node. By repeating this series of operations, the above steps are repeatedly performed until a similar service node can no longer be located in one service node or in a computing node.

An embodiment according to the present invention described above will be described with reference to FIGS. 6 and 7 in parallel.

6 is a flow chart for explaining a service node arrangement method according to the present invention, and FIG. 7 is an overall conceptual diagram of a service node arrangement method according to the present invention.

First, in the service node arrangement method according to the present invention, the required resource of each service node constituting the service chain is first identified (S610).

For example, the service chain 710 illustrated in FIG. 7 is composed of four service nodes SN ₁ , SN ₂ , SN ₃ , SN ₄ , and the required resources of each service node are r ₁ , r ₂ , r ₃ , It can be expressed as r ₄ . In addition, the number of requested transactions, required bandwidth, and importance for links between service nodes may be defined. For example, the link between the service node SN ₁ and the service node SN ₂ may be defined as the number of requested transactions t1, the required bandwidth b1, and the importance w1, and the link between the service node SN ₂ and the service node SN ₃ Can be defined as the number of requested transactions t2, the required bandwidth b2, and the importance w2, and the link between the service node (SN ₃ ) and the service node (SN ₄ ) can be defined as the number of requested transactions t3, the required bandwidth b3, and the importance w3. .

Next, a link cost of a link for each service node may be calculated (S620).

For example, in FIG. 7, the link cost between the service node SN ₁ and the service node SN ₂ may be defined as cost1, and the link cost between the service node SN ₂ and the service node SN ₃ may be defined as cost2. Also, the calculated link cost may be sorted according to its value.

Next, the remaining resources of the available computing nodes may be determined (S630).

For example, in FIG. 7, five computing nodes (CN ₁ , CN ₂ , CN ₃ , CN ₄ , CN ₅ ) form a computing node pool (740), and each computing node The remaining resources of may be represented by ar ₁ , ar ₂ , ar ₃ , ar ₄ , and ar ₅ .

Therefore, among the five computing nodes, computing nodes (CN ₂ , CN ₃ , CN ₅ ) having more than the required resources of the similar service node 750 are candidate computing nodes (AN ₁ , AN ₂ , AN ₃ ). It may be selected as (730).

Next, based on the resource requested of the service nodes, the cost for each link, and the remaining resources of the at least one candidate computing node, the service nodes are grouped to form a similar service node (eg, 750) (S640). .

Since the sum of the requested resources (r1+r2+r3) of the service nodes SN ₁ , SN ₂ , SN ₃ is smaller than the remaining resources of one of the candidate computing nodes to be described later, one similar service node 750 ) Can be grouped.

In this process, a link cost table and a residual resource table of a computing node, illustrated in FIGS. 3 and 4, arranged by calculating link cost for each link, may be generated and referred to.

Service nodes SN ₁ , SN ₂ , and SN ₃ forming one similar service node may be allocated to the same computing node CN2 (S650). That is, the service node (SN ₁₎ of the requested resource r1, the service node (SN ₂₎ of the requested resource r2, the service node _{(SN 3) (r1 + r2} + r3) the sum of the requested resource r3 of the computing nodes (CN ₂₎ Since it is smaller than the remaining resource of ar ₂ , it may be disposed in the computing node CN ₂ .

At this time, if there are several candidate computing nodes whose residual resources are larger than the requested resources (r1+r2+r3) of the similar service node (e.g., AN ₁ , AN ₂ , AN ₃ ), load balancing of the computing nodes For balancing), it can be allocated to the computing node with the most remaining resources. However, according to a predetermined policy, the computing node in which the residual resource after allocating the similar service node is the smallest (i.e., the difference between the residual resource and the requested resource (r1+r2+r3) of the similar service node) is smallest. A similar service node may be allocated to a node) (eg, power consumption reduction) or a similar service node may be allocated according to a priority assigned to the computing node.

Meanwhile, the steps (S630) to (S650) are repeatedly performed until the similar service node is configured as one or until the similar service node cannot be configured because it is no longer possible to allocate the remaining resources.

8 is a block diagram for explaining a concept in which the service node arrangement method of the present invention is performed on the NFV architecture.

Referring to FIG. 8, a general NFV architecture includes OSS/BSS 810, a virtualized network function (VNF) 820, and a network function virtualization infrastructure (NFVI). It can be configured. Here, OSS (Operations Support System) and BSS (Business Support System) are systems to support the operator's network operation and the provision and maintenance of customer service, and BSS (Business Support System) is for billing and maintenance of customers. It refers to a system that supports customer relationship management (CRM) and call center business automation.

At least one VNF instances 821 and 822 may exist on the VNF 820. On the NVFI 840, there are real physical hardware (845, 846, 847), a virtualization layer 844 that virtualizes real physical hardware resources, and virtualization resources 841, 842, 843 that are virtualized by the virtualization layer 844. I can.

In addition, an NFV Management and Orchestration component (MANO) 900 for managing and coordinating the components may exist on the NFV architecture.

In the MANO 900, an orchestrator 910 that controls the overall operation, a virtual network function manager (VNFM: VNF manager; 920) that manages the VNF 820, and a virtual infrastructure that manages the NFVI 840. A virtualized infrastructure manager (VIM) may exist.

Here, the service node arrangement method of the present invention may be performed by the virtualization infrastructure manager 930 on the NFV architecture. That is, the VIM 930 grasps information on the service chain from the orchestrator 910 or a predetermined specification 850 and the requested resources of the service nodes constituting the service chain, and is present on the NFVI 840 The remaining resources of the computing nodes are checked.

Accordingly, the VIM 930 according to the present invention includes a program code for executing the service node arrangement method of the present invention, a memory device in which the program code is stored, and at least one processor for executing the program code. I can. In addition, the service node arrangement method of the present invention may be performed by at least one functional block or module included in the VIM.

Although the above has been described with reference to preferred embodiments of the present invention, those skilled in the art will variously modify and change the present invention within the scope not departing from the spirit and scope of the present invention described in the following claims. You will understand that you can do it.

710: service chain, 720: similar service chain
730: candidate computing node 740: computing node pool
750: pseudo service node
SN ₁ , SN ₂ , SN ₃ , SN ₄ : Service node
AN ₁ , AN ₂ , AN ₃ : Candidate Computing Nodes
CN ₁ , CN ₂ , CN ₃ , CN ₄ , CN ₅ : Computing node

Claims (17)

In service function chaining, as a method of arranging service nodes constituting a service chain,
(A) identifying required resources of service nodes constituting the service chain;
(B) calculating a link cost for each link between service nodes constituting the service chain, and aligning links between service nodes according to the calculated link cost;
(C) checking the remaining resources of at least one computing node; And
Based on the requested resource of the service nodes, the link cost for each link, and the residual resource of the at least one computing node, the service nodes are grouped to form a pseudo service node, and the similar service node is at least (D) allocating to one computing node among one computing node,
In the allocating step, from a link having a higher link cost among links arranged in the order of the link cost, service nodes constituting the link are allocated to the same computing node to configure the similar service node,
When there are a plurality of candidate computing nodes whose residual resources are larger than the requested resource of the similar service node, the similar service node is allocated to the computing node having the most residual resources or the remaining resources after allocating the similar service node are the smallest. Is assigned to the losing computing node,
How to deploy service nodes. The method according to claim 1,
The required resource of the service nodes includes at least one of a computing resource, a disk capacity, and a memory capacity required for operation of each service node,
How to deploy service nodes. The method according to claim 1,
The link cost is calculated based on at least one of a requested number of transactions, a requested bandwidth, and an importance between links between the service nodes,
How to deploy service nodes. The method of claim 3,
The link cost is calculated using a cost function based on at least one of a number of requested transactions, a requested bandwidth, and an importance between links between the service nodes,
How to deploy service nodes. delete The method according to claim 1,
In the allocating step, the sum of the requested resources of the service nodes constituting the similar service node is less than the spare resources of the same computing node,
How to deploy service nodes. The method according to claim 1,
The service node is operated based on a virtual machine,
How to deploy service nodes. The method according to claim 1,
The steps (c) and (d) are repeatedly performed until a similar service node is no longer configured,
How to deploy service nodes. In the service function chaining based on Network Function Virtualization (NFV), a memory device loaded with a program code and at least one processor executing the program code are included, and service nodes constituting a service chain are arranged. As a device to perform, the program code,
(A) grasping required resources of service nodes constituting the service chain from an orchestrator or a predetermined description;
(B) calculating a link cost for each link between service nodes constituting the service chain, and aligning links between service nodes according to the calculated link cost;
(C) checking a residual resource of at least one computing node existing on a network function virtualization infrastructure (NFVI); And
Based on the requested resource of the service nodes, the link cost for each link, and the residual resource of the at least one computing node, the service nodes are grouped to form a pseudo service node, and the similar service node is at least (D) allocating to one computing node among one computing node,
In the allocating step, from a link having a higher link cost among links arranged in the order of the link cost, service nodes constituting the link are allocated to the same computing node to configure the similar service node,
When there are a plurality of candidate computing nodes whose residual resources are larger than the requested resource of the similar service node, the similar service node is allocated to the computing node having the most residual resources or the remaining resources after allocating the similar service node are the smallest. Is assigned to the losing computing node,
Service node placement device. The method of claim 9,
The required resource of the service nodes includes at least one of a computing resource, a disk capacity, and a memory capacity required for operation of each service node,
Service node placement device. The method of claim 9,
The link cost is calculated based on at least one of a requested number of transactions, a requested bandwidth, and an importance between links between the service nodes,
Service node placement device. The method of claim 11,
The link cost is calculated using a cost function based on at least one of a number of requested transactions, a requested bandwidth, and an importance between links between the service nodes,
Service node placement device. delete The method of claim 9,
In the allocating step, the sum of the requested resources of the service nodes constituting the similar service node is less than the spare resources of the same computing node,
Service node placement device. The method of claim 9,
The service node is operated based on a virtual machine,
Service node placement device. The method of claim 9,
The steps (c) and (d) are repeatedly performed until a similar service node is no longer configured,
Service node placement device. The method of claim 9,
The device is included in a virtualized infrastructure manager (VIM),
Service node placement device.

Images