KR101710087B1 - Service resource allocation approach Method and System based on a successive knapsack algorithm with variable profits - Google Patents

Abstract

The present invention relates to a mobile network technology. More specifically, the present invention relates to a method and a system for allocating a service resource to a service gateway to execute a service suitable for an order when a task composed of a combination of various services has been given in a distributed service execution environment.

Description

Technical Field [0001] The present invention relates to a service resource allocation method and system based on a continuous nap algorithm applied with a variable profit,

The present invention relates to a mobile network technology, and more particularly, to a mobile network technology in which a service resource is assigned to a service gateway so that a service can be executed in accordance with a sequence when a task composed of a combination of a plurality of services is given in a distributed service execution environment And to a method and system for doing so.

The resource allocation method includes a centralized resource allocation method for providing a cloud and / or a web service and a service resource allocation method in a distributed environment. The centralized resource allocation method centrally manages and / or controls corresponding service resources for efficient resource management. Services in this environment are also provided in a format that a centralized server provides to multiple users.

However, this approach is not suitable for allocating service resources in a mobile ad hoc network environment without an Internet connection. In a distributed service execution environment, a service gateway relays a service provided by surrounding service resources instead of a centralized server.

In particular, there are some issues to be considered in the service resource allocation problem for executing a combined service in a mobile ad hoc network environment. First, there is connectivity between the service resources and the gateway. This is a problem as to whether each resource and each service gateway can be connected. It changes every time the resource and the gateway are deployed. Especially in the environment defined here, it can change after deployment.

Second, the bandwidth availability limit of a service gateway limits the number of resources that can be simultaneously allocated to the gateway. If the number of gateways is too small or the usable limit is small, resource reallocation is required during service execution. Third, the service execution can be stably achieved only if the communication amount between the service gateways is minimized.

1. Korean Patent Publication No. 10-2011-0004729 2. Korean Patent Publication No. 10-2002-0027307

1. Lee, Choon-Woo et al., "Dynamic Resource Allocation Method Using Graph Clustering Method in Tactical Network Environment", Software and Application Vol. 41, No. 8, 569p ~ 579p, 2014

The present invention has been proposed in order to solve the problem according to the above background art, and it is an object of the present invention to efficiently allocate service resources to gateways in such an environment, efficiently relay the communication between resources, Based service resource allocation method and system.

Another object of the present invention is to provide a method and system for allocating service resources based on continuous neural networks, which can find an optimal resource allocation state that satisfies these constraints as much as possible and can reallocate when necessary.

In order to accomplish the above-mentioned problems, the present invention provides a method for allocating service resources based on continuous neural network applying variable benefits to efficiently perform service execution by efficiently allocating service resources to gateways, efficiently relaying inter-resource communication.

The method of claim 1,

 (a) identifying an input value for connecting a plurality of resources to a plurality of services;

(b) allocating the plurality of resources to a plurality of gateways by applying the variable profit among the plurality of resources based on a consecutive nap color algorithm according to a result of the input value check; And

and (c) reallocating the plurality of resources to the plurality of gateways to execute an unexecuted service among the plurality of services as a result of the allocation.

In this case, the input value may include connectivity information of a resource and a gateway, a bandwidth availability limit of a gateway, and a service workflow.

The connectivity information of the resource and the gateway indicates whether each resource can be connected to one of the plurality of gateways and the bandwidth availability limit indicates a maximum bandwidth that the gateway can provide to the allocated resource .

In addition, the service workflow defines an execution order of services for executing the combined service among the plurality of services and a resource required for execution of each service, and each resource required for executing the service is required to execute the service A bandwidth is defined, and a data transfer amount between resources occurring at the time of executing the service and data dependency between resources are defined.

(여기서, a는 가변 이익 상수이고, d는 제 1 특정 자원과 제 2 특정 자원간 데이터 의존도이고, p는 제 1 특정 자원의 기존이익을 나타낸다)로 정의되는 것을 특징으로 할 수 있다.Also, the variable profit can be expressed by Equation

(Where a is a variable profit constant, d is a data dependency between a first specific resource and a second specific resource, and p represents an existing profit of the first specific resource).

In addition, the consecutive network algorithm may be classified into a gateway, a gateway, a capacity of a gateway, an item to put resources into the network, a bandwidth required by each resource, ), Associating the connectivity between the resource and the gateway with assignment constraints (Assignment Restriction), and applying the profit of the item according to the service execution order requiring each resource.

In addition, the continuous neat-color algorithm selects the gateways in random order one by one and applies a dynamic program to each gate through the variable gain.

In addition, when the two resources having data dependency are allocated to the same gateway, the variable gain may be provided with an additional benefit according to the value of the data dependency.

The step (c) may further comprise the steps of: categorizing services among the plurality of services to which resources are allocated in a currently allocated state according to a result of the input value check; Allocating currently allocated resources after the services are executed; And reapplying the consecutive algorithm to only those resources needed for the service to be executed.

According to another embodiment of the present invention, there is provided a continuous network-based service resource allocation system using variable gaps comprising a plurality of gateways, wherein a plurality of gateways have input values for connecting a plurality of resources to a plurality of services Allocating the plurality of resources to the plurality of gateways by applying the variable profit among the plurality of resources based on a consecutive algorithm based on the result of the input value check, And allocating the plurality of resources to the plurality of gateways in order to execute the execution service.

 According to the present invention, in consideration of the connectivity between the resources and the gateway, the resources are allocated as much as possible within the available bandwidth of the gateway, and all the services are reallocated according to the service execution order.

In addition, another advantage of the present invention is that a given service can be stably executed even if the number of gateways and the available limit are limited.

Another advantage of the present invention is that the network can be more efficiently used by reducing the amount of data transferred between gateways, thereby providing a stable service.

1 is a conceptual diagram illustrating an example of a variable profit change according to data dependency according to an embodiment of the present invention.
2 is a conceptual diagram showing an example of a service workflow according to an embodiment of the present invention.
3 is a conceptual diagram showing a state before resource allocation according to an embodiment of the present invention.
FIG. 4 is a conceptual diagram illustrating a state in which resources are allocated to one gateway based on a continuous neat algorithm using a variable profit according to an embodiment of the present invention.
FIG. 5 is a conceptual diagram illustrating a state in which resources are allocated to two gateways based on a continuous neat color algorithm using a variable profit according to another embodiment of the present invention.
FIG. 6 is a conceptual diagram showing a state in which resources are allocated to three gateways based on a consecutive nap color algorithm applying a variable profit according to another embodiment of the present invention.
FIG. 7 is a conceptual diagram showing an example of the profit contribution of each resource according to an embodiment of the present invention.
FIG. 8 is a conceptual diagram illustrating a resource reallocation process according to a service execution procedure according to an embodiment of the present invention.
9 is a flowchart illustrating a process of executing all services according to an embodiment of the present invention.

While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It is to be understood, however, that the invention is not to be limited to the specific embodiments, but includes all modifications, equivalents, and alternatives falling within the spirit and scope of the invention.

Like reference numerals are used for similar elements in describing each drawing.

The terms first, second, etc. may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another.

For example, without departing from the scope of the present invention, the first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component. The term "and / or" includes any combination of a plurality of related listed items or any of a plurality of related listed items.

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 this invention belongs.

Terms such as those defined in commonly used dictionaries are to be interpreted as having a meaning consistent with the contextual meaning of the related art and are to be interpreted as either ideal or overly formal in the sense of the present application Should not.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Reference will now be made in detail to the present embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like reference numerals refer to the like elements throughout.

1 is a conceptual diagram illustrating an example of a variable profit change according to data dependency according to an embodiment of the present invention. 1, among the first to sixth resources 131 to 136 between the first gateway 110 and the second gateway 120, the profit change of the fourth resource R4 according to the data dependency is as follows.

① The existing profit of the fourth resource (R4) is p.

(2) The profit when the fourth resource (R4) is allocated to G1 is p.

(3) The profit when the fourth resource R4 is allocated to G2 is given by the following equation.

Here, a is a variable profit constant, d is a data dependency between the fourth resource R4 and the third resource R3, and p represents the existing profit of the fourth resource R4.

2 is a conceptual diagram showing an example of a service workflow according to an embodiment of the present invention. Referring to FIG. 2, an input value required for a service resource allocation includes connectivity information of a service resource gateway, a bandwidth availability limit of a gateway, and a service workflow. In the dual service workflow, the execution order of services and the resources required to execute each service are defined in order to execute the combined service.

At this time, the bandwidth required for service execution is determined for each resource required for executing the service, and the bandwidth provided by the gateway is used within the available bandwidth when each resource is allocated to the gateway. It also defines the amount of data transfer between resources and the dependency of data between resources during service execution.

With continuing reference to FIG. 2, the first service 211 to the fifth service 215 indicate the order of execution. The first service 211 -> the second service 212 -> the third service 213 -> the fourth service 214 -> the fifth service 215. Resources are required for the first to fifth services 211 to 215. That is, the first resource 131 is stored in the first service 211, the second resource 132 is stored in the second service 212, the third and sixth resources 133 and 136 are stored in the third service 213, The third and fourth resources 133 and 134 are allocated to the fourth service 214 and the fifth resource 135 is allocated to the fifth service 215. [

The first resource 131 and the third resource 133 are connected to the first data dependency resource 221, the third resource 133 and the sixth resource 136 in which the data dependency exists, The data dependency resource 222, the third resource 133 and the fourth resource 134 become the third data dependency resource 223 in which the data dependency exists.

3 is a conceptual diagram showing a state before resource allocation according to an embodiment of the present invention. Referring to FIG. 3, resources are not yet connected between the first to third gateways 110 to 130 and the first to sixth resources 131 to 136, and possible connections are shown.

FIG. 4 is a conceptual diagram illustrating a state in which resources are allocated to one gateway based on a continuous neat algorithm using a variable profit according to an embodiment of the present invention. Referring to FIG. 4, a second resource 132, a fourth resource 134, and a sixth resource 136 are allocated to the second gateway 120 to show a connection state between the gateway and the resources.

FIG. 5 is a conceptual diagram illustrating a state in which resources are allocated to two gateways based on a continuous neat color algorithm using a variable profit according to another embodiment of the present invention. 5, a second resource 132, a fourth resource 134 and a sixth resource 136 are allocated to the second gateway 120, a third resource 133 is allocated to the third gateway 120, And a fifth resource 135 are allocated to indicate the connection state between the gateways and the resources.

FIG. 6 is a conceptual diagram showing a state in which resources are allocated to three gateways based on a consecutive nap color algorithm applying a variable profit according to another embodiment of the present invention. 6, a first resource 131 is allocated to the first gateway 110, a second resource 132, a fourth resource 134 and a sixth resource 136 are allocated to the second gateway 120, And a third resource 133 and a fifth resource 135 are allocated to the third gateway 120 to show a state of connection between the gateways and the resources.

FIG. 7 is a conceptual diagram showing an example of the profit contribution of each resource according to an embodiment of the present invention. Referring to FIG. 7, the higher the profit toward the left, the lower the profit toward the right.

FIG. 8 is a conceptual diagram illustrating a resource reallocation process according to a service execution procedure according to an embodiment of the present invention. Referring to FIG. 8, a service completed execution is shown on the left side and a service is not executed on the right side based on the dotted line. Therefore, the reallocation target resources are R3, R4, and R5, and the reallocation-free resources are R1, R2, and R6.

FIG. 9 is a diagram showing a procedure of a service resource allocation based on a Successive Knapsack Algorithm in which communication between gateways is minimized and a service execution order is considered.

9 is a flowchart illustrating a process of executing all services according to an embodiment of the present invention. Referring to FIG. 9, an input value required for service resource allocation is checked (step S910). These input values include connectivity information of resources and gateways, limitations of gateway bandwidth availability, and service workflow. The resource and gateway connectivity information indicates which gateway each resource can connect to, which is used to find a service gateway to which each resource can be allocated at the time of resource allocation.

In addition, the information on the bandwidth availability limit of each service gateway indicates the maximum bandwidth that the gateway can provide to the allocated resource. In order to execute the combined service, the execution order of the service and the resources required to execute each service are defined in the service workflow. At this time, the bandwidth required for service execution is determined for each resource required for executing the service, and the bandwidth provided by the gateway is used within the available bandwidth when each resource is allocated to the gateway. It also defines the amount of data transfer between resources and the dependency of data between resources during service execution.

Then, when the above input values are given, service resource allocation is executed by applying a variable profit according to the dependency of the inter-resource data to the continuous network algorithm for resource allocation (step S920). This continuous nap-color algorithm is a method to convert the service resource allocation problem into a multiple-nap problem (Multiple Knapsack Problem with Assignment Restriction). Therefore, it is necessary to use the gateway as a node, the capacity of the gateway as the capacity of the network, the item to put resources into the network, the bandwidth required by each resource as the weight of the item, It associates connectivity with Assignment Restriction and applies the profit of the item according to the service execution order that requires each resource.

In this case, the consecutive network algorithm selects the gateways in random order and applies dynamic programming to each gateway. Dynamic programming is applied to resources that are connectable to each selected gateway and that are not assigned to other gateways. Dynamic programming compares the bandwidth required by each resource with the benefit of allocating that resource, and finds an optimized allocation state at the gateway.

At this time, when two resources having data dependency are allocated to the same gateway, an additional benefit is given according to the value of data dependency. This is called a variable profit. In one embodiment of the present invention, dynamic programming is applied with variable benefit. When variable profit is applied, the possibility that resources with data dependency are allocated to the same gateway increases, which reduces the amount of data transferred between gateways. When dynamic programming is applied to all the gateways and the resources are allocated, the result of the allocation state is outputted and all the processes are terminated (steps S930, S940, S950).

As a result of the determination in step S940, if all the services are allocated to all the service gateways but all the resources are not allocated, reallocation is performed according to the service execution order (step S941). When allocation is completed for all gateways, resources are allocated in the currently allocated state according to the service execution order defined in the service workflow, and the executable services are selected. After these services are executed, the currently allocated resources are deallocated. It then reapplies the continuous networking algorithm described above to only the resources needed for the services that need to be further executed on the service workflow.

This reallocation method is repeatedly applied in steps S920 to S940 until all services are executed.

110, 120, 130: first to third gateway
R1, R2, R3, R4, R5, R6: first to sixth resources
211, 212, 213, 214, 215: first to fifth services
221: First data dependency resource
222: second data dependency resource
223: Third data dependency resource

Claims (10)

(a) identifying an input value for connecting a plurality of resources to a plurality of services;
(b) allocating the plurality of resources to a plurality of gateways by applying the variable profit among the plurality of resources based on a consecutive nap color algorithm according to a result of the input value check; And
(c) reassigning the plurality of resources to the plurality of gateways to execute an unexecuted service among the plurality of services as a result of the allocation;
The method comprising the steps of: (a) providing a variable profit based on a continuous nap color algorithm;
The method according to claim 1,
Wherein the input value includes connectivity information of a resource and a gateway, a bandwidth availability limit of a gateway, and a service workflow.
3. The method of claim 2,
Wherein the connectivity information of the resource and the gateway indicates whether each resource can be connected to any of the plurality of gateways and the bandwidth limit of the gateway indicates a maximum bandwidth that the gateway can provide to the allocated resource. A method of allocating service resources based on continuous nap algorithm applying variable profit.
3. The method of claim 2, wherein the service workflow defines an execution order of services for executing the combined service among the plurality of services and a resource required for execution of each service, And the data transfer amount between resources and the dependency of data between resources occurring at the execution of the service are defined, and a method for allocating service resources based on a continuous nap color algorithm applying variable profit.
The method according to claim 1,
The variable profit can be calculated using Equation

(Where a is a variable profit constant, d is a data dependency between a first specific resource and a second specific resource, and p represents an existing profit of the first specific resource). A method of service resource allocation based on neural algorithm.
The method according to claim 1,
The consecutive nap color algorithm is based on the following three methods: the gateway is a knapsack, the limit of the gateway is the capacity of the network, the item is the item to put resources into the network, the bandwidth required by each resource is the weight of the item, A successive napple algorithm based on variable profit, which is characterized by associating the connectivity between the resource and the gateway with assignment constraints and assigning the profit of the item according to the execution order of the service requiring each resource Service resource allocation method.
The method according to claim 6,
Wherein the consecutive nap color algorithm selects the gateways in random order one by one and applies the dynamic program through the variable gain for each gate.
The method according to claim 1,
Wherein the variable gains are provided with additional benefits according to a value of data dependency when two resources having data dependency are allocated to the same gateway.
The method according to claim 1,
The step (c)
Culling services among the plurality of services to which resources are allocated in a currently allocated state according to a result of the input value check;
Allocating currently allocated resources after the services are executed; And
And reapplying the consecutive nap color algorithm only to the resources required for the service to be further executed.
1. A service resource allocation system based on a continuous network algorithm using variable gaps comprising a plurality of gateways,
A plurality of gateways are configured to identify input values for connecting a plurality of resources to a plurality of services and to apply the variable profit among the plurality of resources on the basis of a consecutive network algorithm according to a result of the input value check, Allocating a plurality of resources to a plurality of gateways, and allocating the plurality of resources to the plurality of gateways to execute unexecuted services among the plurality of services as a result of the allocation. Resource allocation system.

Images