KR20230006654A - Method for coordination virtual network function and apparatus for the same - Google Patents

Abstract

A virtual network function coordination method according to embodiments may include the steps of: receiving a plurality of network flows; checking the transmission rate and delay requirements of the plurality of network flows; and mapping the plurality of network flows to a plurality of virtualized network function nodes based on the transmission rate and delay requirements of the plurality of network flows.

Description

Virtual network function coordination method and its device {METHOD FOR COORDINATION VIRTUAL NETWORK FUNCTION AND APPARATUS FOR THE SAME}

The present disclosure relates to a method and apparatus for orchestrating virtual network function(s) in connection with Network Function Virtualization.

Network Function Virtualization (NFV) dynamically creates virtualized network functions (VNFs) on a virtualization platform of a commercially available server. Therefore, by providing services according to traffic characteristics for each VNF, the QoS satisfaction of the traffic flow can be increased.

On the other hand, since image information has various transmission speeds and degrees of urgency, each image information has various time delay requirements. In addition, since the VNF may also be physically separated from a device that collects video information, the amount of video information transmission that satisfies the QoS requirements may vary depending on which VNF the video information is provided with. Therefore, by analyzing the time required for video information to move from the CCTV location to the VNF, from the VNF to the destination, and the time to receive service from the VNF, the total time delay of each flow is adjusted so that the service is received by the VNF that satisfies the time delay requirements. it is necessary to do

The problem to be solved by the present embodiment is to improve the quality of traffic flow. Specifically, the present embodiments may use a greedy network function virtualization orchestration algorithm to orchestrate the virtual network function(s).

In order to solve the above problem, a virtual network function coordination method according to embodiments includes receiving network flows; checking transmission rate and delay requirements of the network flows; sorting the network flows based on transmission rate and delay requirements of the network flows; and mapping the network flows to a plurality of virtualization network function (VNF) nodes based on delay requirements of the network flows. can include

In the sorting step according to embodiments, the network flows may be sorted based on a result of multiplying the transmission rate and the delay requirement of each network flow.

The mapping step according to embodiments may include initially mapping at least one network flow to at least one VNF node by searching delay requirements of the aligned network flows; and rearranging the initially mapped at least one network flow by searching for the plurality of VNF nodes. can include

Furthermore, in the initial mapping step according to embodiments, each VNF node may be mapped by sequentially searching the sorted network flows in a sorted order.

In addition, the rearranging step according to the embodiments rearranges each network flow in the reverse order of the initially mapped at least one network flow, and the rearranging step sequentially searches the plurality of VNF nodes can do.

Furthermore, the mapping step according to embodiments may include a first replacing step of replacing the first flow mapped to the first VNF node and the second flow mapped to the second VNF node.

Furthermore, the mapping step according to embodiments may include a second replacing step of replacing two or more flows among the first flow mapped to the first VNF node and the flows mapped to the second VNF node.

A virtual network function coordination method and apparatus according to embodiments efficiently map data flows received from a plurality of sources to a plurality of virtual network functions, thereby maximizing the satisfaction of the required delay time of each flow, thereby eliminating unnecessary networks. delay can be avoided.

Virtual network function coordination method and apparatus according to embodiments arrange network flows based on a result of multiplying a transmission rate and a delay required time (delay) to map a plurality of network flows to a plurality of virtual network functions By doing so, it is possible to propose a mapping method that can optimize both the satisfaction of the required delay time and the transmission rate of the network.

The virtual network function coordination method and apparatus according to the embodiments perform the first supplementary step and the second supplementary step, thereby preventing network flows from being mapped due to bias in a specific VNF node, and helping to balance the mapping. An effect capable of promoting efficient traffic management can be provided.

A virtual network function tuning method and apparatus according to embodiments provide an optimized mapping method using an algorithm based on a greedy method, thereby satisfying delay requirements of network flows and differentially receiving or responding to each network flow phenomenon can be prevented.

1 shows an electronic device according to embodiments.
2 illustrates a method for an electronic device to coordinate a virtual network function according to embodiments.
3 illustrates a method for an electronic device to coordinate a virtual network function according to embodiments.
4 illustrates a method of mapping network flows to a plurality of virtual network function (VNF) nodes by an electronic device according to embodiments.
5 is a flowchart illustrating another example of a method of mapping network flows to a plurality of virtual network function nodes by an electronic device according to embodiments.
6 shows an analysis result of a virtual network function tuning method according to embodiments.
7 shows an example of a virtual network function orchestration method according to embodiments.
8 shows an example of a virtual network function orchestration method according to embodiments.

The terms used in the embodiments have been selected as general terms that are currently widely used as much as possible while considering the functions in the present disclosure, but they may vary depending on the intention or precedent of a person skilled in the art, the emergence of new technologies, and the like. In addition, in a specific case, there are also terms arbitrarily selected by the applicant, and in this case, the meaning will be described in detail in the corresponding description. Therefore, terms used in the present disclosure should be defined based on the meaning of the term and the general content of the present disclosure, not simply the name of the term.

When it is said that a certain part "includes" a certain component throughout the specification, it means that it may further include other components without excluding other components unless otherwise stated.

The expression of "at least one of a, b, and c" described throughout the specification means 'a alone', 'b alone', 'c alone', 'a and b', 'a and c', 'b and c' ', or 'all a, b, and c'.

A “terminal” referred to below may be implemented as a computer or portable terminal capable of accessing a server or other terminals through a network. Here, the computer includes, for example, a laptop, desktop, laptop, etc. equipped with a web browser, and the portable terminal is, for example, a wireless communication device that ensures portability and mobility. , IMT (International Mobile Telecommunication), CDMA (Code Division Multiple Access), W-CDMA (W-Code Division Multiple Access), LTE (Long Term Evolution), etc. It may include a handheld-based wireless communication device.

Hereinafter, with reference to the accompanying drawings, embodiments of the present disclosure will be described in detail so that those skilled in the art can easily carry out the present disclosure. However, the present disclosure may be implemented in many different forms and is not limited to the embodiments described herein.

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

1 shows an electronic device according to embodiments.

The electronic device 100 includes a processor 110 , a transceiver 120 and a storage unit 130 . In the electronic device 100 shown in FIG. 1 , only elements related to the present embodiments are shown. Accordingly, it is apparent to those skilled in the art that the electronic device 100 may further include other general-purpose components in addition to the components shown in FIG. 1 .

The network function may mean, for example, a service of a network function through which data traffic goes to a destination on a network. For example, a virtual network function may include a firewall that verifies traffic when it reaches its destination, a Network Address Translator (NAT) that finds an IP address to forward to the correct address, and the like. On the other hand, the physical network function provides a specific function to a large-capacity server, but when multiple network traffic flows into the network function to receive service at the same time, the traffic that cannot be serviced immediately is made to wait, thereby reducing the delay requirements (QoS, etc.) of that traffic. ) may not be satisfied. Accordingly, network functions can be dynamically created in a commercialized server virtualization platform, and the dynamically created network functions can be understood as virtualized network functions (VNFs). Virtual network functions according to embodiments may increase QoS satisfaction of traffic flows by providing services according to characteristics of network traffic.

A plurality of virtual network functions may exist in one server in the form of a node, or may exist distributed in external device(s) located at physically separated locations. The electronic device 100 according to embodiments receives a plurality of network flows from external device(s) located at physically separated locations. That is, the plurality of network flows can be received by the external device(s), and the plurality of network flows can be received by the electronic device according to the embodiments via the virtual network function node(s) included in each external device. there is. In this case, the electronic device 100 according to embodiments maps the received plurality of network flows to a plurality of virtual network function nodes of the external device(s), and determines which virtual network function nodes each network flow passes through. can

Meanwhile, image information, which is real-time data in a monitoring system that receives monitoring information in real time and provides monitoring information to a supervisor, may be generated from monitoring devices (eg, CCTVs) physically present in various locations. That is, the data flow may be image data generated by monitoring devices existing in various locations. Such image data may vary in location of monitoring device, transmission environment, importance and urgency of monitoring data, and transmission speed and delay requirements. Furthermore, virtual network function nodes through which all monitoring data passes to the destination for transmitting monitoring information in the monitoring system may also be physically separated. For example, the monitoring information may have a delay required to arrive at its destination, a delay based on urgency, and QoS requirements depending on which virtual network function node the service is received from. This satisfied image information transmission amount may vary. Therefore, by analyzing the time required for video information to move from the CCTV location to the VNF, from the VNF to the destination, and the time to receive service from the VNF, the total time delay of each flow is adjusted so that the service is received by the VNF that satisfies the time delay requirements. it is necessary to do In addition, when the entire flow satisfies 100% QoS in the process of dynamically generating VNFs, it is necessary to prevent additional VNFs from being created in order to prevent resource waste.

Accordingly, the electronic device 100 may coordinate virtual network function nodes. Specifically, the electronic device 100 maps a plurality of virtual network functions (VNFs) through which a server according to embodiments receives network flows received from a data source can do. The electronic device 100 may perform a mapping algorithm for mapping network flows to a plurality of virtual network functions. The electronic device 100 may transfer mapping information between network flows and a plurality of virtual network functions to each virtual network function by a mapping algorithm.

The electronic device 100 according to embodiments may be a server that receives a plurality of network flows, and in this case, the electronic device 100 may include a plurality of virtual network function nodes. That is, the electronic device 100 may directly receive a plurality of network flows, map the received plurality of network flows to a plurality of virtual network function nodes, and determine which virtual network functions each network flow passes through. .

The processor 110 may serve to perform a mapping algorithm for mapping network flows to a plurality of virtual network functions. For example, the processor 110 generally controls the electronic device 100 by executing algorithm-related programs stored in the memory 130 of the electronic device 100 . The processor 110 may be implemented as a central processing unit (CPU), graphics processing unit (GPU), or application processor (AP) included in the electronic device 100, but is not limited thereto.

According to embodiments, the processor 110 may include receiving network flows; checking transmission rate and delay requirements of the network flows; sorting the network flows based on transmission rate and delay requirements of the network flows; and mapping the network flows to a plurality of virtualized network function (Virtualized Network Function, VNF) nodes based on delay requirements of the network flows; At least one of these may be performed.

The transceiver 120 may receive a plurality of network flows according to embodiments.

The storage unit 130 is hardware that stores various types of data processed in the electronic device 100, and the storage unit 130 may store data processed in the electronic device 100 and data to be processed. Also, the storage unit 130 may store applications and drivers to be driven by the electronic device 100 . The storage unit 130 may include random access memory (RAM) such as dynamic random access memory (DRAM) and static random access memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), CD -ROM, Blu-ray or other optical disk storage, hard disk drive (HDD), solid state drive (SSD), or flash memory.

The electronic device 100 according to embodiments may perform a mapping algorithm for mapping a plurality of network flows to a plurality of virtual network function nodes. The electronic device 100 provides data traffic rates, data traffic service requirements (eg, QoS, delay, etc.) for each network flow, and unique information (eg, QoS) for each network flow. , departure IP address, etc.). The electronic device 100 may check the transmission rate (rate) and the required delay time (delay) for each of the identified network flows. The electronic device 100 calculates an optimal coordination method for mapping each network flow to a plurality of virtual network function nodes based on the transmission rate and the required delay time for each network flow.

The electronic device 100 according to embodiments may receive network flows, arrange the network flows based on transmission speed and delay requirements of the network flows, and delay the network flows. Based on requirements, the network flows may be mapped to a plurality of virtualized network function (VNF) nodes.

2 illustrates a method for an electronic device to coordinate a virtual network function according to embodiments.

Some or all of the operations according to the embodiments shown in FIG. 2 may be performed in the electronic device 100 of FIG. 1 .

An electronic device according to embodiments may check information on a plurality of network flows 200 . The electronic device may check transmission rate and delay requirements of each network flow. The electronic device may check transmission speed and delay requirements for each network flow and store them for each network flow.

An electronic device according to embodiments may store information about a plurality of virtual network function nodes 201 through which network flows 200 to be received by the electronic device pass through. The information on the virtual network function node may include, for example, information representing a limit of a delay requirement that the corresponding virtual network function node can accommodate or limit information on a transfer rate.

The electronic device according to the embodiments selects virtual network function nodes 201 through which each network flow 200 passes based on the mapping algorithm 202 according to the embodiments, thereby generating a plurality of network flows 200. and virtual network function nodes 201 mapping.

A virtual network function coordination method and apparatus according to embodiments efficiently map data flows received from a plurality of sources to a plurality of virtual network functions, thereby maximizing the satisfaction of the required delay time of each flow, thereby eliminating unnecessary networks. delay can be avoided.

3 illustrates a method for an electronic device to coordinate a virtual network function according to embodiments.

Some or all of the operations according to the embodiments shown in FIG. 3 may be performed in the electronic device 100 of FIGS. 1 and 2 . The method of coordinating the virtual network functions described in FIG. 3 can be performed based on the mapping algorithm 202 shown in FIG. 2, which shows the network flows 300 and the virtual network functions 301 indicates that they are mapped 300b.

Referring to FIG. 3 , a plurality of network flows 300 may be mapped to a plurality of virtual network function nodes 301 . In an electronic device according to embodiments, while data is transmitted from a plurality of network flows 300 to a destination server 302, the delay request time (delay) of each network flow 300 (eg, QoS ) needs to be maximally satisfied, and each network flow 300 needs to be properly mapped to the virtual network function nodes 301 so that the transmission rate (transmission amount) of each network flow 300 is maximized.

300 to 302 are |I| The number of network flows 300 |J| It shows that a plurality of network flows 300 and a plurality of virtual network function nodes 301 are mapped in order to be transmitted to the destination server 302 via the number of virtual network function nodes 301 .

Referring to 300 to 302, the electronic device according to the embodiments |I| number of network flows 300 and |J| A mapping algorithm for mapping 300b virtual network function nodes 301 is performed. Each network flow 300 may be mapped to one virtual network function node 301, and conversely, each network function node 301 may be mapped to one or more network flows 300.

)과 전송 속도(전송률,

)를 가질 수 있다. Each network flow 300 may be data generated from monitoring devices of different sources, and each network flow may have a different delay request time (eg, a delay request time such as QoS,

) and transmission rate (baud rate,

) can have.

Propagation delay may occur when the network flow 300 moves from the source of the network flow to the virtual network function node 301 . The propagation delay may mean the time it takes for a signal to reach a destination, and may vary in various ways depending on a network environment, a distance from a source to a location where a virtual network function node is located, and the like.

라 했을 때, J에 속하는 VNF j 에서의 시스템 내에서 발생하는 지연은 아래 수학식 1과 같이 나타낼 수 있다. 하기 수학식 1은 예를 들어, M/D/1 queueing 모델의 지연식을 사용한 수학식일 수 있다. 여기서,

는 VNF j 내 유입된 네트워크 플로우(들)의 전송 속도(전송률)를 합산한 값을 나타낼 수 있으며,

는 VNF j 의 처리율을 나타낼 수 있다.

는

보다 작아야 한다. Each virtual network function node 301 processes the received network flow and transmits the received network flow to the destination server 302, but there may be time, that is, a delay occurring within the system. A set of distributed VNFs

When , the delay occurring in the system at VNF j belonging to J can be expressed as Equation 1 below. Equation 1 below may be, for example, an equation using a delay equation of the M/D/1 queuing model. here,

May represent the sum of transmission rates (transmission rates) of network flow(s) introduced into VNF j ,

May represent the throughput of VNF j .

Is

should be smaller than

라 했을 때, 하기 수학식 2는 집합 I에 속하는 플로우 i가 VNFj 에 매핑되었을 경우 전체 시스템 내의 지연 시간을 나타낸다. 즉, 전체 시스템 내의 지연 시간은 네트워크 플로우 i 가 플로우의 출처 i 에서 VNF j까지 이동하는데 소요되는 전파지연

, VNF j 에서의 시스템 내에서 발생하는 지연

, VNF j 에서 도착 서버(302)까지 네트워크 플로우가 이동하는데 소요되는 전파지연

(301a) 의 합으로 구성될 수 있다.Therefore, the delay time in the entire system is the time 300b for the network flow 300 to travel from the source to the mapped virtual network function 301, and the mapped virtual network function 301 to process the corresponding network flow 300. It can be calculated by summing the time taken to do this and the time 301a for the network flow 300 to travel from the mapped virtual network function 301 to the arrival server 302. That is, a set of network flows 300

, Equation 2 below represents the delay time in the entire system when flow i belonging to set I is mapped to VNF j . In other words, the delay time within the entire system is the propagation delay required for network flow i to travel from source i to VNF j .

, the delay that occurs within the system at VNF j

, Propagation delay required for the network flow to travel from VNF j to the destination server 302

(301a).

The electronic device according to the embodiments calculates the delay time in the entire system calculated by [Equation 1] and [Equation 2], thereby satisfying the required delay time (delay) of each network flow and at the same time providing services of each VNF. The network flows 300 and the virtual network function nodes 301 may be mapped so that the sum of the total transmission rates of network flows receiving . For example, an electronic device according to embodiments may map network flows 300 and virtual network function nodes 301 using Equation 3 shown below.

는 1의 값을 가지며, 매핑되지 않은 경우 0의 값을 가진다. 또한, 예를 들어 한 플로우는 1개의 VNF를 통해서만 서비스 받을 수 있고, 시간지연 요구사항을 만족시키는 VNF가 없을 경우, VNF의 서비스를 받을 수 없다. 이를

과 같이 나타낼 수 있다.Here, when network flow i is received from VNF j and receives the service of the corresponding virtual network function, that is, when network flow i is mapped to VNF j

has a value of 1, and has a value of 0 if not mapped. Also, for example, one flow can be serviced through only one VNF, and if there is no VNF that satisfies the time delay requirement, the VNF service cannot be received. this

can be expressed as

An electronic device according to embodiments may map network flows 300 and virtual network function nodes 301 using [Equation 1] to [Equation 3], and may perform a mapping algorithm. there is.

For example, referring to 303a to 303b, when the electronic device according to the embodiments maps the network flows 300 and the virtual network function nodes 301 as in 303a or 303b, the entire system is mapped based on each mapping. Latency can be calculated. The electronic device according to the embodiments may calculate the delay time in the entire system of numbers in each mapping case, and select a mapping method having the smallest delay time in the entire system among them. In addition, when the sum of delay request times of network flows received by each virtual network function node is greater than the delay request time of a specific flow received by the corresponding virtual network function node (for example, in case of 303a), the corresponding network flow It can be mapped to other virtual network function nodes (eg, in the case of 303b).

Meanwhile, when the number of network flows and the number of virtual network function nodes increases, the computational throughput of the electronic device according to the embodiments may rapidly increase, causing unnecessary processing delay, which is not efficient. Therefore, the present invention is a greedy method (eg, Martello & Toth Heuristic Method (MTHM) for solving the Multiple Knapsack Problem (MKP) in order for an electronic device to efficiently map network flows and virtual network function nodes) ), etc.) will be described in detail in FIGS. 4 to 6 .

4 illustrates a method of mapping network flows to a plurality of virtual network function (VNF) nodes by an electronic device according to embodiments.

Specifically, FIG. 4 shows an example of a mapping algorithm for an electronic device to efficiently map network flows and virtual network function nodes. The mapping algorithm may align 400 the plurality of network flows 400a according to the example operation shown at 40, for example.

First, an electronic device according to embodiments may check information on a plurality of network flows 400a. Information on the network flow 400a may include, for example, transmission rate (or transmission rate) for corresponding network flows, service requirements of data traffic (eg, delay required time such as QoS, etc.) can include

Meanwhile, a plurality of network flows need to be mapped to a plurality of virtual network functions in consideration of both an acceptable degree and transmission rate of the plurality of virtual network functions. That is, since network flows should not be mapped by focusing on a specific virtual network function node, the electronic device according to the embodiments needs to comprehensively consider the transmission speed and satisfaction of the delay required for each network flow.

Therefore, referring to 40, the electronic device according to the embodiments checks transmission rate (rate) information and delay request time (delay) information of each network flow, calculates a result of multiplying them (rate X delay), and calculates Based on the result, a plurality of network flows 400a may be ordered. The electronic device sorts the network flows 400a in descending or ascending order of the calculated results. In FIG. 4, the network flows 400a arranged in descending order are sequentially flow_1, flow_2, ???? , denoted as flow_|I|, and the transmission rate and delay required time (delay) of flow_|I| are respectively rate_|I| and delay_|I|^req.

Virtual network function coordination method and apparatus according to embodiments arrange network flows based on a result of multiplying a transmission rate and a delay required time (delay) to map a plurality of network flows to a plurality of virtual network functions By doing so, it is possible to propose a mapping method that can optimize both the delay and the transmission rate of the network.

Next, the electronic device according to the embodiments performs an initial mapping step (401) of the aligned plurality of network flows (400a) and a plurality of virtual network function (VNF) nodes according to the exemplary operation shown in 41 based on the mapping algorithm. ), at least one of the rearrangement step 402, the first complement step 403, and the second supplement step 404 may be performed.

The initial mapping step 401 may be a step of initially mapping at least one network flow to at least one VNF node by searching delay requirements of the aligned network flows. That is, in the initial mapping step 401, the aligned plurality of network flows 400a and the plurality of virtual network function (VNF) nodes are first mapped. In the initial mapping step 401, each virtual network function (VNF) node is sequentially checked, and a plurality of aligned network flows 400a are sequentially checked to transmit at least one network flow to each virtual network function (VNF) node. map In the initial mapping step 401, when the network flow to be identified can be mapped to a specific virtual network function node (eg, the delay request time that the virtual network function node can accommodate depends on the delay request time of the corresponding network flow, etc.) If it can match), it is mapped greedily.

For example, in the initial mapping step 401, first, at least one network flow is transferred to each virtual network while sequentially checking the sorted network flows (in the order in which the result of rate X delay is greater) based on the first VNF node. Map greedily to map to functional (VNF) nodes. When the mapping of the first VNF is completed, the initial mapping step 401 sequentially checks unmapped flows among the network flows rearranged for the second VNF and assigns them to each virtual network function (VNF) node. Map greedily. By repeating this, the initial mapping step 401 identifies and maps network flows for all VNF nodes. That is, in the initial mapping step, each VNF node is mapped by sequentially searching the sorted network flows in the sorted order.

As a result of the initial mapping step 401, some of the plurality of virtual network functions may be mapped with at least one network flow, and some may not be mapped with any network flow. Conversely, some of the plurality of network flows may be mapped with at least one virtual network function, but some may not be mapped.

The rearrangement step 402 may refer to a step of rearranging the initially mapped at least one network flow by searching for a plurality of VNF nodes. That is, the rearrangement step 402 extracts the network flows mapped by the initial mapping step 401, and maps the extracted network flows to a plurality of virtual network function nodes again. For example, if the first network flow, the second network flow, and the fourth network flow are mapped to virtual network function nodes in the initial mapping step 401, the first network flow, the second network flow, and the fourth network flow Again, it is mapped to a plurality of virtual network function nodes.

Specifically, in the rearrangement step 402 , network flows may be mapped to virtual network function nodes by checking network flows in the reverse order of the order arranged by 40 (ie, in the order in which the result of rate X delay is small). Each network flow may be mapped with virtual network function nodes by sequentially discovering virtual network functions. For example, in the rearrangement step 402, first, based on the last network flow among the extracted network flows (ie, the network flow with the smallest rate X delay result), the first VNF to the last VNF node is searched mapping can be performed. After that, in the rearrangement step 402, mapping may be performed by searching for VNF nodes based on the second-to-last network flow. When the second network flow is mapped to a VNF node, the first VNF node to be checked during mapping may be a VNF node following the last mapped VNF node of the previous network flow.

That is, the rearranging step rearranges each network flow in the reverse order of the initially mapped at least one network flow, and the rearranging step sequentially searches for the plurality of VNF nodes.

The first supplementing step 403 means replacing two or more flows among a first flow mapped to a first VNF node among a plurality of VNF nodes and flows mapped to a second VNF node among a plurality of VNF nodes. can do. In the first supplementary step 403, it is possible to check whether or not exchange conditions between flows mapped to VNF nodes can be exchanged while sequentially searching for aligned network flows. In the first supplementary step 403, for example, when a new flow is additionally mappable to a VNF in which a flow having a relatively lower time delay requirement is exchanged, a new flow may be mapped.

For example, in the first supplementary step 403, a first VNF in which a processing time (eg, a total sum of processing times of network flows) as a result of mapping network flow(s) among a plurality of VNF nodes is greater than a specific time node can be selected. In the first supplementing step 403, at least one network flow having a large processing time (or delay request time) may be identified within the selected first VNF node. In the first supplementary step 403, a second VNF having a low processing time (eg, a total sum of network flow processing times) of a plurality of VNF nodes mapped to a network flow (eg, lower than a specific criterion) node can be selected. In the first supplementing step 403, at least one network flow having a low processing time (or delay required time) may be identified within the selected first VNF node. The first supplement step 403 may replace the first flow mapped to the first VNF node and the second flow mapped to the second VNF node. In the process of replacement, an additional third flow is mapped to the first VNF node.

The second supplementing step 404 may mean replacing the first flow mapped to the first VNF node with one or more flows among flows not mapped to the first VNF. For example, in the second supplementary step 404, when a specific network flow mapped to a specific VNF is excluded, if the sum of other network flows that can be mapped instead is greater than before, releasing the existing mapped flow from the mapping and can map other network flows.

For example, in the second supplementary step 404, a first VNF in which a processing time (eg, a total sum of processing times of network flows) as a result of mapping network flow(s) among a plurality of VNF nodes is greater than a specific time node can be selected. In the second supplementary step (404), a flow set having a large sum of cumulative transmission rates may be selected instead of flows having a small transmission rate value of the selected first VNF node or requiring processing within a short time. The second supplementing step 404 may check one or more network flows (a second set of network flows or one network flow) having a low processing time (or delay required time) within the selected first VNF node. In the first supplementing step 404, at least one network flow selected in the first VNF node may be replaced with at least one network flow selected in the second VNF node (or one or more flows among flows not mapped to the first VNF). .

The virtual network function coordination method and apparatus according to the embodiments perform the first supplementary step and the second supplementary step, thereby preventing network flows from being mapped due to bias in a specific VNF node, and helping to balance the mapping. An effect capable of promoting efficient traffic management can be provided.

A virtual network function coordination method and apparatus according to embodiments efficiently map data flows received from a plurality of sources to a plurality of virtual network functions, thereby maximizing the satisfaction of the required delay time of each flow, thereby eliminating unnecessary networks. delay can be avoided.

A virtual network function tuning method and apparatus according to embodiments provide an optimized mapping method using an algorithm based on a greedy method, thereby satisfying delay requirements of network flows and differentially receiving or responding to each network flow phenomenon can be prevented.

A virtual network function tuning method and apparatus according to embodiments provide an effect of providing quick and effective mapping in preparation for an algorithm for mapping network flows and VNF nodes by checking the number of all cases.

5 is a flowchart illustrating another example of a method of mapping network flows to a plurality of virtual network function nodes by an electronic device according to embodiments.

Some or all of the operations according to the embodiments shown in FIG. 5 may be performed by the electronic device or the virtual network function coordination device shown in FIGS. 1 to 4 . 5 shows an example of a mapping algorithm for an electronic device to efficiently map network flows and virtual network function nodes. Specifically, FIG. 5 analyzes the time delay of data transmission of virtual network function nodes and each network flow according to the result of performing the mapping algorithm according to the embodiments, and compares it with the delay required time (delay) of each network flow. Indicates how to map VNFs and flows.

An electronic device according to embodiments may perform at least one of steps 500 to 507 shown in FIG. 5 .

Referring to step 500, the electronic device according to embodiments may arrange received network flows. The electronic device may check transmission rate (rate) information and delay request time (delay) information of each network flow, and sort received network flows in ascending or descending order according to a result obtained by multiplying them (rate X delay). Step 500 may mean part or all of the operation shown in step 40, for example.

Referring to step 501, the electronic device according to embodiments may refer to a step of setting variables to perform steps 502 to 507 as many as all VNF nodes at most. The electronic device may set a variable representing a VNF node to be searched to 1 in order to search based on the corresponding repetitive operation.

Referring to step 502, after mapping network flows and VNFs, the electronic device according to embodiments may start time measurement to measure delay time in the entire system.

Referring to step 503, the electronic device according to embodiments may map network flows and VNFs based on a mapping algorithm. In step 503, the electronic device according to embodiments may perform some or all of the operations described in step 41. Step 503 may include at least one of an initial mapping step 401 , a rearrangement step 402 , a first supplementation step 403 , and a second supplementation step 404 shown in 41 .

Referring to step 504, after mapping network flows and VNFs, the electronic device according to embodiments may terminate time measurement to measure delay time in the entire system.

Referring to step 505, the electronic device according to the embodiments checks a result of mapping a plurality of network flows and a plurality of VNF nodes, and as a result of each network flow arriving at the arrival server, all delays match. That is, whether the satisfaction rate of QoS is 100% can be confirmed. If they match, the electronic device according to the embodiments provides the optimal mapping method, and thus the virtual network function coordination method may be terminated.

If, as a result of each network flow arriving at the arrival server, there is a network flow that does not match among the delays (i.e., QoS does not satisfy 100%), the electronic device according to the embodiments performs step 506 Referring to , it can be checked whether the value of the variable set in step 501 has reached the maximum available number of VNFs. If the value of the variable set in step 501 does not reach the maximum available number of VNFs, refer to step 507 to increase the value of the variable by 1, and if the value of the variable reaches the maximum available number of VNFs, virtual network function End the tuning method.

A virtual network function coordination method and apparatus according to embodiments efficiently map data flows received from a plurality of sources to a plurality of virtual network functions, thereby maximizing the satisfaction of delays of each flow, thereby eliminating unnecessary networks. delay can be avoided.

A virtual network function tuning method and apparatus according to embodiments provide an optimized mapping method using an algorithm based on a greedy method, thereby satisfying delay requirements of network flows and differentially receiving or responding to each network flow phenomenon can be prevented.

6 shows an analysis result of a virtual network function tuning method according to embodiments.

6 illustrates a result of performing a mapping operation based on the mapping algorithm of FIG. 5 by an electronic device according to embodiments. The results shown in FIG. 6 represent time delay (time complexity) and transmission rate (transmission rate) in a process in which the electronic device according to the embodiments performs a mapping algorithm to perform a mapping operation.

Specifically, 600 and 601 of FIG. 6 represent average aggregate rates of mapped flows for each number of virtual network functions to be mapped.

Referring to 600, a result of mapping a VNF and a network flow using a mapping algorithm according to embodiments is shown. Specifically, 600 is an average cumulative transmission rate when mapping based on a brute force method, an average cumulative transmission rate when mapping based on a randomization method, and a mapping algorithm (Greed Virtualized Each represents an average cumulative transmission rate when mapping based on Network Functions Coordination algorithm (GVNFCA). The brute force method is a method in which the number of all mapping cases of VNFs and network flows is searched and a corresponding case is selected. Although it takes time to perform mapping, the most optimal mapping method is searched. The randomization method represents a method of randomly mapping VNFs and network flows. Referring to 600, it can be seen that the mapping algorithm (GVNFCA) according to the embodiments shows an improvement in transmission speed at a level comparable to the optimal mapping method according to the brute force method.

Referring to 601, an average cumulative transmission rate that changes as the number of VNFs increases is shown by comparing the randomization method and the mapping algorithm (GVNFCA) according to the embodiments. Referring to 601, it can be confirmed that the mapping algorithm (GVNFCA) according to the embodiments shows superior performance to the mapping method according to the randomization method.

Meanwhile, numerals 602 to 604 in FIG. 6 indicate the time (time complexity) required to perform each mapping algorithm for each number of virtual network functions to be mapped.

Referring to 602, the brute force method searches the number of all cases for mapping VNFs and network flows and selects a corresponding case. The most optimal mapping method is searched, but as the number of VNFs increases, the mapping The time to do so increases exponentially. On the other hand, it can be confirmed that the execution time of the mapping method according to the randomization method and the mapping algorithm (GVNFCA) according to the embodiments is significantly shorter than that of the brute force method. In particular, compared to the brute force method, which takes more than 5 and a half hours when the number of VNFs is 3, the mapping algorithm (GVNFCA) shows a much shorter execution time close to 0 hours (within 1 second), showing a remarkable effect.

603 indicates a mapping method according to a randomization method for each number of VNFs and an execution time of the mapping algorithm (GVNFCA) according to embodiments. Referring to step 603, since the mapping method according to the randomization method maps in a random order, execution time is constant as the number of VNFs increases. On the other hand, the mapping algorithm (GVNFCA) according to the embodiments increases the execution time linearly as the number of VNFs increases, but when the number of VNFs is 10, both the randomization method and the mapping algorithm (GVNFCA) according to the embodiments are 0.05 It can be confirmed that it can be performed within seconds.

604 shows an improvement in transmission speed for each delay and the number of VNFs as a result of performing the mapping algorithm according to the embodiments. It can be seen that the average cumulative transmission rate is improved as the number of VNFs increases even when the required delay time (delay) is high.

Therefore, the electronic device that performs the mapping algorithm according to the embodiments provides an effect of providing an optimal mapping method even with an execution time of a level of random mapping.

7 shows an example of a virtual network function orchestration method according to embodiments.

Some or all of the operations according to the embodiments shown in FIG. 7 may be performed by the electronic device or the virtual network function coordination device shown in FIGS. 1 to 6 .

Referring to FIG. 7 , an electronic device according to embodiments receives network flows (step 700), checks transmission speed and delay requirements of network flows (step 701), transmits the network flows at least of: sorting the network flows based on speed and delay requirements (701); and mapping the network flows to a plurality of virtual network function nodes (703) based on the delay requirements of the network flows. may contain one.

In the sorting step 701 according to embodiments, the network flows may be sorted based on a result of multiplying the transmission rate and the delay requirement of each network flow.

The mapping step 703 may perform some or all of the operations shown in FIGS. 2 to 4 .

A virtual network function coordination method and apparatus according to embodiments satisfy the delay required time (delay) of each flow by efficiently mapping data flows (network flows) received from a plurality of sources to a plurality of virtual network functions. By maximizing it, unnecessary network delay can be prevented.

Virtual network function coordination method and apparatus according to embodiments arrange network flows based on a result of multiplying a transmission rate and a delay required time (delay) to map a plurality of network flows to a plurality of virtual network functions By doing so, it is possible to propose a mapping method that can optimize both the delay and the transmission rate of the network.

8 shows an example of a virtual network function orchestration method according to embodiments.

Some or all of the operations according to the embodiments shown in FIG. 8 may be performed in step 702 of mapping to the virtual network function nodes of FIG. 7 .

Referring to FIG. 8 , the mapping step 702 according to embodiments includes searching delay requirements of the aligned network flows and initially mapping at least one network flow to at least one VNF node (800); Searching for the plurality of VNF nodes and rearranging the initially mapped at least one network flow (801), replacing the first flow mapped to the first VNF node and the second flow mapped to the second VNF node It may include at least one of step 802 and step 803 of replacing the first flow mapped to the first VNF node with one or more of flows not mapped to the first VNF.

In the rearranging step 801 according to embodiments, each network flow may be rearranged in the reverse order of the initially mapped at least one network flow. In the rearrangement step 801 according to the embodiments, the plurality of VNF nodes may be sequentially searched.

A virtual network function coordination method and apparatus according to embodiments efficiently map data flows received from a plurality of sources to a plurality of virtual network functions, thereby maximizing the satisfaction of the required delay time of each flow, thereby eliminating unnecessary networks. delay can be avoided.

A virtual network function tuning method and apparatus according to embodiments provide an optimized mapping method using an algorithm based on a greedy method, thereby satisfying delay requirements of network flows and differentially receiving or responding to each network flow phenomenon can be prevented.

An electronic device according to the above-described embodiments includes a processor, a memory for storing and executing program data, a permanent storage unit such as a disk drive, a communication port for communicating with an external device, a touch panel, a key, a button, and the like. The same user interface device and the like may be included. Methods implemented as software modules or algorithms may be stored on a computer-readable recording medium as computer-readable codes or program instructions executable on the processor. Here, the computer-readable recording medium includes magnetic storage media (e.g., read-only memory (ROM), random-access memory (RAM), floppy disk, hard disk, etc.) and optical reading media (e.g., CD-ROM) ), and DVD (Digital Versatile Disc). A computer-readable recording medium may be distributed among computer systems connected through a network, and computer-readable codes may be stored and executed in a distributed manner. The medium may be readable by a computer, stored in a memory, and executed by a processor.

This embodiment can be presented as functional block structures and various processing steps. These functional blocks may be implemented with any number of hardware or/and software components that perform specific functions. For example, an embodiment is an integrated circuit configuration such as memory, processing, logic, look-up table, etc., which can execute various functions by control of one or more microprocessors or other control devices. can employ them. Similar to components that can be implemented as software programming or software elements, the present embodiments include data structures, processes, routines, or various algorithms implemented as combinations of other programming constructs, such as C, C++, Java ( It can be implemented in a programming or scripting language such as Java), assembler, or the like. Functional aspects may be implemented in an algorithm running on one or more processors. In addition, this embodiment may employ conventional techniques for electronic environment setting, signal processing, and/or data processing. Terms such as "mechanism", "element", "means", and "composition" may be used broadly and are not limited to mechanical and physical components. The term may include a meaning of a series of software routines in association with a processor or the like.

The foregoing embodiments are just examples, and other embodiments may be implemented within the scope of the claims described below.

Claims (10)

receiving network flows;
checking transmission rate and delay requirements of the network flows;
sorting the network flows based on transmission rate and delay requirements of the network flows; and
mapping the network flows to a plurality of virtualized network function (VNF) nodes based on delay requirements of the network flows; including,
How to orchestrate virtual network functions. The method of claim 1, wherein the sorting step sorts the network flows based on a result of multiplying the transmission rate and the delay requirement of each network flow.
How to orchestrate virtual network functions. The method of claim 2, wherein the mapping step
initially mapping at least one network flow to at least one VNF node by searching delay requirements of the aligned network flows; and
searching for the plurality of VNF nodes and rearranging the initially mapped at least one network flow; including,
How to orchestrate virtual network functions. The method of claim 3, wherein the initial mapping step sequentially searches the sorted network flows in a sorted order to map each VNF node.
How to orchestrate virtual network functions. 4. The method of claim 3 , wherein the rearranging comprises rearranging each network flow in reverse order of the order in which the initially mapped at least one network flow is sorted.
How to orchestrate virtual network functions. The method of claim 3, wherein the mapping step comprises a first complementing step of replacing a first flow mapped to a first VNF node and a second flow mapped to a second VNF node.
How to orchestrate virtual network functions. The method of claim 3, wherein the mapping step comprises a second supplementary step of replacing a first flow mapped to a first VNF node with one or more of flows not mapped to the first VNF.
How to orchestrate virtual network functions. According to claim 5,
The rearranging step is to sequentially search the plurality of VNF nodes,
How to orchestrate virtual network functions. An electronic device for coordinating virtual network functions,
a memory in which at least one program is stored; and
Receiving network flows by executing the at least one program, checking transmission speed and delay requirements of the network flows, and sorting the network flows based on the transmission speed and delay requirements of the network flows and a processor for mapping the network flows to a plurality of Virtualized Network Function (VNF) nodes based on delay requirements of the network flows.
electronic device. receiving network flows; checking transmission rate and delay requirements of the network flows; sorting the network flows based on transmission rate and delay requirements of the network flows; and mapping the network flows to a plurality of virtualized network function (VNF) nodes based on delay requirements of the network flows. A computer-readable non-transitory recording medium recording a program for executing a virtual network function coordination method on a computer.

Images