NL2031440A - Method and system for selecting task offloading node - Google Patents

Method and system for selecting task offloading node Download PDF

Info

Publication number
NL2031440A
NL2031440A NL2031440A NL2031440A NL2031440A NL 2031440 A NL2031440 A NL 2031440A NL 2031440 A NL2031440 A NL 2031440A NL 2031440 A NL2031440 A NL 2031440A NL 2031440 A NL2031440 A NL 2031440A
Authority
NL
Netherlands
Prior art keywords
node
edge computing
access edge
computing node
service
Prior art date
Application number
NL2031440A
Other languages
Dutch (nl)
Other versions
NL2031440B1 (en
Inventor
Sun Jiande
Liu Ke
Feng Chuanfen
Original Assignee
Univ Shandong
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Univ Shandong filed Critical Univ Shandong
Publication of NL2031440A publication Critical patent/NL2031440A/en
Application granted granted Critical
Publication of NL2031440B1 publication Critical patent/NL2031440B1/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources
    • G06F9/5072—Grid computing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/505—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/12—Computing arrangements based on biological models using genetic models
    • G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/50—Indexing scheme relating to G06F9/50
    • G06F2209/502—Proximity
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/50—Indexing scheme relating to G06F9/50
    • G06F2209/508—Monitor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/50—Indexing scheme relating to G06F9/50
    • G06F2209/509—Offload
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biophysics (AREA)
  • Mathematical Physics (AREA)
  • Computing Systems (AREA)
  • Artificial Intelligence (AREA)
  • General Health & Medical Sciences (AREA)
  • Evolutionary Computation (AREA)
  • Data Mining & Analysis (AREA)
  • Computational Linguistics (AREA)
  • Biomedical Technology (AREA)
  • Molecular Biology (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Evolutionary Biology (AREA)
  • Physiology (AREA)
  • Genetics & Genomics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present disclosure discloses a method and system for selecting a task offloading node, comprising: acquiring a terminal service, and judging whether the terminal service is initiated initially; if the terminal service is initiated initially, selecting an optimal multi—access edge computing node according to a time delay, a load of the multi—access edge computing node and a service processing benefit, making a node identifier for the multi—access edge computing node, and storing the node identifier of the multi—access edge computing node; and if the terminal service is initiated non—initially, offloading the terminal service 11) a corresponding Hmlti—access edge computing node for processing according to a stored node identifier.

Description

METHOD AND SYSTEM FOR SELECTING TASK OFFLOADING NODE
TECHNICAL FIELD The present disclosure relates to the field of mobile commu- nications, and more particularly, to a method and a system for se- lecting a task offloading node.
BACKGROUND ART The statements in this section merely provide background in- formation related to the present disclosure and may not necessari- ly constitute prior art. As application requirements increase, the gap between the limited capabilities of a terminal and the application require- ments is growing. Multi-access edge computing (MEC) is an effec- tive technique to solve the above-mentioned problems. In MEC sys- tems, MEC nodes with certain computational and communication re- sources are placed near the edge of the network for users. When a user initiates a service, through some algorithm or policy (e.g., the service delay is the lowest, the energy consumption is the lowest, etc.), the optimal MEC node is selected. The user offloads the service (or task) to this MEC node for processing, greatly re- ducing service processing delay or energy consumption, etc. Howev- er, the inventors have found at least the following problems in the prior art: each time a user initiates a service and offloads a task, the MEC node selection algorithm needs to be executed first, consuming the computing resources of the terminal or network node and increasing the task delay.
SUMMARY In order to solve the above-mentioned problem, the present disclosure proposes a method and a system for selecting a task of- floading node. By means of a node identifier of a multi-access edge computing node, the service is directly offloaded to the mul- ti-access edge computing node corresponding to the node identifier for execution when the service is initiated non-initially. The multi-access edge computing node selection algorithm is not exe- cuted, which saves computing resources and effectively reducing system delay.
In order to achieve the above-mentioned object, the present disclosure adopts the following technical solutions.
In a first aspect, the present disclosure provides a method for selecting a task offlcading node, comprising: acquiring a terminal service, and judging whether the termi- nal service is initiated initially; if the terminal service is initiated initially, selecting an optimal multi-access edge computing node according to a time de- lay, a load of the multi-access edge computing node and a service processing benefit, making a node identifier for the multi-access edge computing node, and storing the node identifier of the multi- access edge computing node; and if the terminal service is initiated non-initially, unloading the terminal service to a corresponding multi-access edge compu- ting node for processing according to a stored node identifier.
As an alternative implementation, the node identifier is 32 bits in total, respectively representing reserved bit, state of the multi-access edge computing node, type of the multi-access edge computing node, MEC shared area, multi-access edge computing node in the MEC shared area, and user under the multi-access edge computing node.
As an alternative implementation, the state of the multi- access edge computing node includes an abnormal offloading state and a normal service state, represented by 0 and 1, respectively.
As an alternative implementation, the type of the multi- access edge computing node comprises a generic multi-access edge computing node and a dedicated multi-access edge computing node, represented by 0 and 1, respectively.
As an alternative implementation, the node identifier is 32 bits in total, bits 1-2 serving as reserved bits, bit 3 represent- ing the state of the multi-access edge computing node, and bit 4 representing the type of the multi-access edge computing node; bits 5-7 representing different MEC shared areas; bits 8-12 repre- senting different multi-access edge computing nodes within the MEC shared area, and bits 13-32 representing different users under the multi-access edge computing node.
As an alternative implementation, the method for selecting a task offloading node further comprises: if the terminal service is initiated non-initially, determining a corresponding target multi- access edge computing node according to the stored node identifi- er, and judging whether the target multi-access edge computing node satisfies a service requirement, if not, triggering a re- selection of the multi-access edge computing node, and offloading the terminal service to a re-selected multi-access edge computing node for processing, while saving the node identifier of the re- selected multi-access edge computing node.
As an alternative implementation, the time delay comprises a time delay of uplink and downlink transmission of task offloading, a time delay of a computing task of the multi-access edge compu- ting node and a time delay of task migration due to a terminal movement; the service processing benefit comprises the service charge from an operator and the service cost; and the cost comprises a computation cost of the multi-access edge computing node and a network transmission cost.
In a second aspect, the present disclosure provides a system for selecting a task offloading node, comprising: a receiving module configured to acquire a terminal service and judge whether the terminal service is initiated initially; an initial service node selection module configured to select an optimal multi-access edge computing node according to a time delay, a load of the multi-access edge computing node and a ser- vice processing benefit if the terminal service is initiated ini- tially, and make a node identifier for the multi-access edge com- puting node and store the node identifier of the multi-access edge computing node; and a non-initial service node selection module configured to of- fload the terminal service to a corresponding multi-access edge computing node for processing according to a stored node identifi- er if the terminal service is initiated non-initially.
In a third aspect, the present disclosure provides an elec-
tronic device comprising a memory and a processor and computer in- structions stored on the memory and operated on the processor, the computer instructions when operated by the processor performing the method of the first aspect.
In a fourth aspect, the present disclosure provides a comput- er readable storage medium for storing computer instructions which, when executed by a processor, perform the method of the first aspect.
Compared to the prior art, the advantageous effects of the present disclosure are as follows.
The present disclosure provides a method for selecting a task offloading node, wherein when a user initiates a service initial- ly, an optimal MEC node is selected according to the time delay, the load of the MEC node and the service processing benefit, and the MEC node identifier thereof is sent to the user. When the user initiates the service again, according to the saved MEC node iden- tifier, the task is directly offloaded to the target MEC for pro- cessing, So as to save computing resources, and there is no need to execute a node selection algorithm to select a serving MEC node each time.
The present disclosure assists the task offloading of a user via an MEC node identifier, each MEC node is allocated with an MEC node identifier, and when the user initiates a service again, the task is directly offloaded onto the MEC corresponding to the MEC node identifier for processing, so as to reduce time delay.
The present disclosure judges a target MEC, and when the tar- get MEC does not satisfy a service requirement, a re-selection of an MEC node is triggered, and the task is offloaded to the re- selected MEC node for processing. When the task processing is com- pleted, the re-selected MEC also sends its own MEC node identifier to the user, that is to say, only when the stored target MEC node does not satisfy the service requirement, a node selection algo- rithm is executed, and the time delay can be effectively reduced from the perspective of the whole system.
Additional aspects and advantages of the disclosure will be set forth in part in the description which follows and, in part, will be obvious from the description which follows, or may be learned by practice of the disclosure.
BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings of the description, which consti- 5 tute a part of the present disclosure, are included to provide a further understanding of the present disclosure. The exemplary em- bodiments of the present disclosure, together with the description therein, serve to explain the present disclosure and do not con- stitute any improper limitation on the present disclosure.
FIG. 1 is a schematic diagram of a networking of MEC nodes provided in embodiment 1 of the present disclosure; FIG. 2 is a flow chart for selecting a task offloading node when a user initially initiates a service provided in embodiment 1 of the present disclosure; FIG. 3 is a schematic diagram of a node identifier of a mul- ti-access edge computing node provided in embodiment 1 of the pre- sent disclosure; and FIG. 4 is a flow chart for selecting a task offloading node when a user non-initially initiates a service provided in embodi- ment 1 of the present disclosure.
DETAILED DESCRIPTION OF THE EMBODIMENTS The disclosure will now be further described with reference to the accompanying drawings and embodiments.
It should be noted that the following detailed description is exemplary and is intended to provide further explanation of the disclosure. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs.
It is noted that the terminology used herein is for the pur- pose of describing particular embodiments only and is not intended to be limiting of exemplary embodiments in accordance with the present disclosure. As used herein, the singular forms are intend- ed to include the plural forms as well, unless the context clearly indicates otherwise, and it is to be understood that the terms "comprising" and "having", and any variations thereof, are intend- ed to cover a non-exclusive inclusion, such that a process, meth-
od, system, article, or device that comprises a list of steps or units is not necessarily limited to those steps or units expressly listed, but may include other steps or units not expressly listed or inherent to such process, method, article, or device. The embodiments of the disclosure and the features in the em- bodiments may be combined with each other without conflict.
Embodiment 1.
As shown in FIG. 1, the MEC system constructed in the present embodiment is composed of a two-layer architecture. A lowest layer is an access point and is responsible for accessing UE, for exam- ple, a base station. An upper layer is a multi-access edge compu- ting node, namely, an MEC node, and a plurality of MEC nodes con- stitute an MEC shared area and are responsible for processing a UE offloading task. The access point is fully interconnected with each MEC node in the MEC shared area, and the MEC nodes are fully interconnected.
On the basis of the above-mentioned proposed networking structure of MEC nodes, when a user initiates a service initially, the present embodiment proposes a method for selecting a multi- access edge computing node when a task is offloaded, as shown in FIG. 2, and the method specifically comprises the following steps: (1) acquiring a terminal service, wherein the terminal ser- vice is initiated initially; (2) selecting an optimal multi-access edge computing node ac- cording to a time delay, a load of the multi-access edge computing node and a service processing benefit; (3) processing a terminal service with the optimal multi- access edge computing node, making a node identifier for the mul- ti-access edge computing node, and sending the node identifier of the multi-access edge computing node executing the terminal ser- vice to the terminal for storage.
In the present embodiment, the MEC node identifier made is as shown in FIG. 3, which is 32 bits in total, specifically as fol- lows.
Bits 1-2 are reserved for subsequent use.
Bit 3 represents a state of the MEC node, including an abnor- mal "offloading" state and a normal "service" state.
"Or" indicates that the MEC node is in an abnormal "offload- ing" state. For example, the MEC node will perform maintenance, retreat, etc. and no longer receives a task initiated by a user. "1" indicates that the MEC node is in a normal "service" state, i.e., normal receiving and processing a service initiated by a us- er.
Bit 4 indicates whether the MEC node is a dedicated MEC node.
"0" indicates that the MEC node is a general MEC node, and "1" indicates that the MEC node is a dedicated MEC node. For exam- ple, for some important campuses, under data security considera- tions, dedicated MEC nodes need to be configured to serve only this campus.
Bits 5-7 are used to distinguish different MEC shared areas. Normally, 2 bits can be used for distinguishing according to the four-color principle, but this embodiment uses three bits to dis- tinguish different MEC shared areas considering the irregular ser- vice range of the MEC shared areas.
Bits 8-12 are used to distinguish among different MEC nodes within the MEC shared area, while at most 32 MEC nodes can be dis- tinguished.
Bits 13-32 are used to distinguish among different users served under the MEC, while at most 1 million users can be distin- guished.
In the present embodiment, the delay includes but is not lim- ited to a time delay of uplink and downlink transmission of task offloading, a time delay of a computing task of the multi-access edge computing node, a time delay of additional task migration due to user movement, etc.
The service processing benefit includes but is not limited to the service charge from an operator and the service cost.
The cost includes, but is not limited to, a computation cost of the multi-access edge computing node and a network transmission cost etc.
In this embodiment, selecting an optimal multi-access edge computing node may be, but is not limited to, selecting by the following manners.
(2-1) According to a relevant strategy, different weights are given to the time delay, the load of the multi-access edge compu- ting node and the service processing benefit.
In the present embodiment, the operator makes a weight as- signment strategy according to the degree of importance attached to the index, wherein the weight of each part is between 0-1, and the sum of the weights of each part is 1.
For example, the more important the part is, the higher the weight is given. If the load of the multi-access edge computing node is important, the weight of this part is set to 0. 3, but if the service processing benefit is relatively unimportant, the weight of this part may be set to 0. 05.
{2-2} The values of the above-mentioned indexes are evaluated for different MEC nodes in the MEC shared area, and it can be un- derstood that the values are between 0-1.
Specifically, when the time delay satisfies the requirement, the lower the time delay, the higher the value. For the service processing benefit, the higher the service processing benefit, the higher the value. For the load of the multi-access edge computing node, the lower the load, the higher the value.
(2-3) A comprehensive value of each MEC node in the MEC shared area is calculated according to the above-mentioned three index weights and relevant values.
Specifically, the comprehensive value=SUM (weight of each in- dex * value of each index).
(2-4) The MEC node with the highest comprehensive value is selected as the serving MEC node.
In the present embodiment, selecting the optimal MEC node can also be performed using a genetic algorithm or a relevant neural network algorithm to obtain the MEC node with the highest compre- hensive value as the serving MEC node.
In the present embodiment, when a user initiates a service initially, the optimal multi-access edge computing node is select- ed for a service thereof according to the time delay, the load of the multi-access edge computing node and the service processing benefit, and after the service is completed, the node identifier of the optimal multi-access edge computing node thereof is sent to the user, and the user can save the target MEC node identifier.
Then, when the user initiates a service later, there is no need to select an optimal MEC node, and a task can be directly offloaded to a stored target MEC node for processing according to the saved MEC node identifier.
In addition, when the stored target MEC node does not satisfy the service requirement, the re-selection of the MEC node trig- gered, and the task is offloaded to the re-selected MEC node for processing. Likewise, after task processing is completed, the re- selected MEC node sends its node identifier to the user, and the user saves the node identifier.
On such basis, when a user initiates a service non-initially, the present embodiment proposes a method for selecting a multi- access edge computing node when a task is offloaded, which, as shown in FIG. 4, specifically comprises the following steps: (1) acquiring a terminal service, wherein the terminal ser- vice is initiated non-initially; (2) offloading a terminal service to a corresponding multi- access edge computing node according to the saved MEC node identi- fier; (3) judging whether the offloaded target multi-access edge computing node satisfies a service requirement, if so, turning to step (4); if not, turning to step (5); (4) the target multi-access edge computing node processing the terminal service; (5) selecting an optimal migration multi-access edge compu- ting node according to a time delay, a load of the multi-access edge computing node and a service processing benefit; (6) the target multi-access edge computing node offloading the terminal service to the migration multi-access edge computing node, wherein the terminal service is processed by the migration multi-access edge computing node; and (7) after the terminal service is completed with processing, the migration multi-access edge computing node sending a node identifier thereof to the user, and the user saving the node iden- tifier as a subsequent target multi-access edge computing node.
This embodiment proposes assisting user task offloading via a node identifier of a multi-access edge computing node, wherein each multi-access edge computing node is allocated with a node identifier.
When a terminal user initiates a service non- initially, the task can be directly offloaded to the multi-access edge computing node corresponding to the node identifier for pro- cessing via the stored node identifier, so as to save computing resources and reduce time delay.
Embodiment 2 The present embodiment provides a system for selecting a task offloading node, comprising: a receiving module configured to acquire a terminal service and judge whether the terminal service is initiated initially; an initial service node selection module configured to select an optimal multi-access edge computing node according to a time delay, a load of the multi-access edge computing node and a ser- vice processing benefit if the terminal service is initiated ini- tially, and make a node identifier for the multi-access edge com- puting node and store the node identifier of the multi-access edge computing node; and a non-initial service node selection module configured to of- fload the terminal service to a corresponding multi-access edge computing node for processing according to a stored node identifi- er if the terminal service is initiated non-initially.
In the present embodiment, the system further comprises a storage module configured to store received relevant information such as service requirements, user mobility, channel quality, the load of the multi-access edge computing node, etc., and stores unit costs of computation unit, unit communication costs, service charges from an operator, relevant evaluation strategies or neural network algorithms.
In this embodiment, the system further comprises an update unit configured to update the information in the storage module.
It should be noted herein that the above-mentioned modules correspond to the steps described in embodiment 1, and the above- mentioned modules have the same examples and application scenarios as the corresponding steps, but are not limited to the contents disclosed in embodiment 1 above.
It is noted that the modules de- scribed above may be implemented as part of a system in a computer system such as a set of computer-executable instructions.
In further embodiments, there is also provided: an electronic device comprising a memory, a processor and computer instructions stored on the memory and operated on the processor, the computer instructions when operated by the proces- sor performing the method described in embodiment 1. In the inter- est of brevity, this will not be repeated here.
It will be appreciated that in the present embodiment, the processor may be a central processing unit CPU, but the processor may also be another general purpose processor, a digital signal processor DSP, an application specific integrated circuit ASIC, a field programmable gate array FPGA or other programmable logic de- vice, a discrete gate or transistor logic device, a discrete hard- ware component, etc. The general purpose processor may be a micro- processor, but in the alternative, the processor may be any con- ventional processor, etc.
The memory may include read-only memory and random access memory, and may provide instructions and data to the processor. A portion of the memory may also include non-volatile random access memory. For example, the memory may also store information about device type.
A computer-readable storage medium for storing computer in- structions which, when executed by a processor, perform the method described in embodiment 1.
The method of embodiment 1 may be performed and completed di- rectly by a hardware processor or by a combination of hardware and software modules in a processor. A software module may be located in a storage medium well known in the art, such as a random access memory, a flash memory, a read-only memory, a programmable read- only memory, or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads information in the memory, and in combination with hardware thereof, completes the steps of the above-mentioned method. To avoid repetition, it will not be described in detail here.
Those of ordinary skill in the art will appreciate that the units, or algorithm steps, of respective examples described in combination with the present embodiment may be implemented with electronic hardware or combinations of computer software and elec- tronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the technical solution. Skilled ar- tisans may implement the described functionality in varying ways for each particular application, but such implementations should not be interpreted as causing a departure from the scope of the present application.
Although the particular implementations of the present dis- closure have been described above with reference to the accompany- ing drawings, it is not intended to limit the scope of protection of the present disclosure. It will be apparent to those skilled in the art that various modifications and variations, which can be made by a person skilled in the art on the basis of the technical solution of the present disclosure without any inventive effort, fall within the scope of protection of the present disclosure.

Claims (8)

CONCLUSIESCONCLUSIONS 1. Systeem voor het selecteren van een taakontladend knooppunt, met het kenmerk, dat het omvat: een ontvangstmodule die is geconfigureerd om een terminaldienst te verwerven en te beoordelen of de terminaldienst initieel is geïni- tieerd; een selectiemodule voor initiële serviceknooppunten die is gecon- figureerd voor het selecteren van een optimaal multi-access edge computing-knooppunt op basis van een tijdsvertraging, een belas- ting van het multi-access edge computing-knooppunt en een service- verwerkingsvoordeel als de terminalservice initieel wordt gestart, en het maken van een knooppunt identificator voor het multi-access edge computing-knooppunt en het opslaan van de knooppunt identifi- cator van het multi-access edge computing-knooppunt; en een selectiemodule voor een niet-initiële serviceknooppunt die is geconfigureerd om de terminalservice te ontladen naar een corres- ponderend multi-access edge computing-knooppunt voor verwerking volgens een opgeslagen knooppunt identificator als de terminalser- vice niet-initieel wordt geïnitieerd.A system for selecting a task offloading node, characterized in that it comprises: a receiving module configured to acquire a terminal service and judge whether the terminal service has been initially initiated; an initial service node selection module configured to select an optimal multi-access edge computing node based on a time lag, a load on the multi-access edge computing node, and a service processing advantage as the terminal service is initially started, and creating a node identifier for the multi-access edge computing node and storing the node identifier of the multi-access edge computing node; and a non-initial service node selection module configured to offload the terminal service to a corresponding multi-access edge computing node for processing according to a stored node identifier when the terminal service is non-initialized. 2. Werkwijze voor het selecteren van een taakontladend knooppunt uitgevoerd door gebruik te maken van het systeem voor het selecte- ren van een taakontladend knooppunt volgens conclusie 1, geken- merkt doordat het omvat: het verwerven van de terminaldienst, en het beoordelen of de ter- minaldienst initieel geïnitieerd is; als de terminalservice initieel is gestart, het selecteren van het optimale multi-access edge computing-knooppunt op basis van de tijdvertraging, de belasting van het multi-access edge computing- knooppunt en het serviceverwerkingsvoordeel, het maken van de knooppuntidentificator voor het multi-access edge computing- knooppunt, en het opslaan van de knooppuntidentificator van het multi-access edge computing-knooppunt; en indien de terminalservice niet-initieel is geïnitieerd, het ontla- den van de terminalservice naar het corresponderende multi-access edge computing-knooppunt voor verwerking volgens de opgeslagen knooppuntidentificator.The task offloading node selection method performed by using the load offload node selection system according to claim 1, characterized in that it comprises: acquiring the terminal service, and judging whether the terminating - minal service is initially initiated; if the terminal service is initially started, selecting the optimal multi-access edge computing node based on the time delay, the load on the multi-access edge computing node, and the service processing advantage, creating the node identifier for the multi-access edge computing node, and storing the node identifier of the multi-access edge computing node; and if the terminal service is not initially initiated, offloading the terminal service to the corresponding multi-access edge computing node for processing according to the stored node identifier. 3. Werkwijze voor het selecteren van een taakontladend knooppunt volgens conclusie 2, met het kenmerk, dat de knooppuntidentifica- tor in totaal 32 bits is, respectievelijk staat voor een gereser- veerde bit, een toestand van het multi-access edge computing- knooppunt, een type van het multi- access edge computing- knooppunt, verschillende MEC gedeelde gebieden, verschillende mul- ti-access edge computing-knooppunten in het MEC gedeelde gebied, en verschillende gebruikers onder het multi-access edge computing- knooppunt.A method for selecting a task offloading node according to claim 2, characterized in that the node identifier is 32 bits in total, respectively represents a reserved bit, a state of the multi-access edge computing node, one type of the multi-access edge computing node, several MEC shared areas, several multi-access edge computing nodes in the MEC shared area, and several users under the multi-access edge computing node. 4. Werkwijze voor het selecteren van een taakontladend knooppunt volgens conclusie 3, met het kenmerk, dat de toestand van het mul- ti-access edge computing-knooppunt een abnormale ontlaadstatus en een normale servicestatus omvat, weergegeven door respectievelijk 0 en 1.A method for selecting a load offloading node according to claim 3, characterized in that the state of the multi-access edge computing node includes an abnormal offload state and a normal service state represented by 0 and 1, respectively. 5. Werkwijze voor het selecteren van een taakontladend knooppunt volgens conclusie 4, met het kenmerk, dat het type van het multi- access edge computing-knooppunt een generiek multi-access edge computing-knooppunt en een speciaal multi-access edge computing- knooppunt omvat, weergegeven door respectievelijk 0 en 1.A method for selecting a task offloading node according to claim 4, characterized in that the type of the multi-access edge computing node includes a generic multi-access edge computing node and a dedicated multi-access edge computing node , represented by 0 and 1, respectively. 6. Werkwijze voor het selecteren van een taakontladend knooppunt volgens conclusie 5, met het kenmerk, dat de knooppuntidentifica- tor in totaal 32 bits is, waarbij bits 1-2 dienen als gereserveer- de bits, bit 3 de toestand van het multi-access edge computing- knooppunt vertegenwoordigt, en bit 4 het type vertegenwoordigt van het multi-access edge computing-kncoppunt; bits 5-7 de ver- schillende MEC gedeelde gebieden vertegenwoordigen; bits 8-12 ver- schillende multi-access edge computing-knooppunten binnen het MEC gedeelde gebied vertegenwoordigen, en bits 13-32 verschillende ge- bruikers onder het multi-access edge computing-knooppunt vertegen- woordigen.A method for selecting a task offloading node according to claim 5, characterized in that the node identifier is 32 bits in total, bits 1-2 serving as reserved bits, bit 3 being the state of the multi-access edge computing node, and bit 4 represents the type of the multi-access edge computing node; bits 5-7 represent the different MEC shared areas; bits 8-12 represent different multi-access edge computing nodes within the MEC shared area, and bits 13-32 represent different users among the multi-access edge computing node. 7. Werkwijze voor het selecteren van een taakontladend knooppunt volgens conclusie 2, met het kenmerk, dat het verder omvat: als de terminalservice niet-initieel wordt geinitieerd, het bepalen van een corresponderend doelknooppunt voor multi-access edge com- puting volgens de opgeslagen knooppuntidentificator, en het beoor- delen of het doelknooppunt voor multi-access edge computing vol- doet aan een servicevereiste, zo niet, dan wordt een herselectie van het multi-access edge computing-knooppunt gestart, en het ont- laden van de terminalservice naar een opnieuw geselecteerd multi- access edge computing-knooppunt voor verwerking, terwijl de knoop- punt-identificator van het opnieuw geselecteerde multi-access edge computing-knooppunt wordt opgeslagen.A method for selecting a task offloading node according to claim 2, characterized by further comprising: if the terminal service is initiated non-initially, determining a corresponding target node for multi-access edge computing according to the stored node identifier , and assessing whether the target multi-access edge computing node meets a service requirement, if not, a reselection of the multi-access edge computing node is initiated, and offloading the terminal service to a reselected multi-access edge computing node for processing, while storing the node identifier of the reselected multi-access edge computing node. 8. Werkwijze voor het selecteren van een taakontladend knooppunt volgens conclusie 2, met het kenmerk, dat de tijdvertraging omvat een tijdvertraging van uplink- en downlink transmissie van taak- ontlading, een tijdvertraging van een rekentaak van het multi- access edge computing-knooppunt en een tijdsvertraging van taakmi- gratie van een terminalbeweging; waarbij het serviceverwerkings- voordeel omvat servicekosten van een operator en servicekosten; en de kosten omvatten berekeningskosten van het multi-access edge computing-knooppunt en netwerktransmissiekosten.A method for selecting a task offloading node according to claim 2, characterized in that the time delay comprises a time delay of uplink and downlink transmission of task offload, a time delay of a calculation task of the multi-access edge computing node and a time delay of task migration of a terminal movement; wherein the service processing benefit includes an operator service fee and service fee; and the costs include computation costs of the multi-access edge computing node and network transmission costs.
NL2031440A 2021-07-02 2022-03-29 Method and system for selecting task offloading node NL2031440B1 (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110752636.1A CN113641485A (en) 2021-07-02 2021-07-02 Task unloading node selection method and system

Publications (2)

Publication Number Publication Date
NL2031440A true NL2031440A (en) 2023-01-09
NL2031440B1 NL2031440B1 (en) 2023-06-16

Family

ID=78416567

Family Applications (1)

Application Number Title Priority Date Filing Date
NL2031440A NL2031440B1 (en) 2021-07-02 2022-03-29 Method and system for selecting task offloading node

Country Status (2)

Country Link
CN (1) CN113641485A (en)
NL (1) NL2031440B1 (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6275867B1 (en) * 1995-09-12 2001-08-14 International Business Machines Corporation Operation-partitioned off-loading of operations in a distributed environment
US20200076875A1 (en) * 2016-12-28 2020-03-05 Intel IP Corporation Application computation offloading for mobile edge computing
CN111866950A (en) * 2020-06-16 2020-10-30 华为技术有限公司 Method and communication device for data transmission in MEC
WO2020228469A1 (en) * 2019-05-10 2020-11-19 腾讯科技（深圳）有限公司 Method, apparatus and system for selecting mobile edge computing node

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6275867B1 (en) * 1995-09-12 2001-08-14 International Business Machines Corporation Operation-partitioned off-loading of operations in a distributed environment
US20200076875A1 (en) * 2016-12-28 2020-03-05 Intel IP Corporation Application computation offloading for mobile edge computing
WO2020228469A1 (en) * 2019-05-10 2020-11-19 腾讯科技（深圳）有限公司 Method, apparatus and system for selecting mobile edge computing node
CN111866950A (en) * 2020-06-16 2020-10-30 华为技术有限公司 Method and communication device for data transmission in MEC

Also Published As

Publication number Publication date
NL2031440B1 (en) 2023-06-16
CN113641485A (en) 2021-11-12

Similar Documents

Publication Publication Date Title
US8391224B2 (en) Proactive load distribution for 802.111-based wireless LANs
JP5772345B2 (en) Parameter setting apparatus, computer program, and parameter setting method
CN109286959B (en) Vertical switching method of heterogeneous wireless network based on analytic hierarchy process
CN105188091B (en) Based on the load-balancing method for forcing switching in heterogeneous wireless network system
US20110058473A1 (en) Practical measurement-based session admission control for wi-fi lan systems
US20110131307A1 (en) Method and node for applying a policy to a session based on a previously predicted session state
KR20060058734A (en) Wireless local area network future service quality determination method
EP2850879A1 (en) Method and apparatus for network traffic offloading
US7916695B2 (en) Smart buffering for policy enforcement
CN108055677B (en) Load balancing method based on software defined wireless network
CN111083733B (en) Congestion control method and system for wireless sensor network
He A novel vertical handoff decision algorithm in heterogeneous wireless networks
CN104469861B (en) Cell selection method, device and terminal
NL2031440B1 (en) Method and system for selecting task offloading node
CN112532743B (en) Intelligent load balancing method and device and storage medium
CN106102099A (en) A kind of isomery car networking changing method based on residence time
CN105491611A (en) Wireless network switching method and system
Murray et al. Intelligent access and mobility management in heterogeneous wireless networks using policy
CN113660303A (en) Task unloading method and system based on end side network cloud cooperation
WO2021136100A1 (en) Cdn scheduling method and system, and device and storage medium
Zhang et al. Fuzzy logic based vertical handover algorithm for trunking system
CN110535705B (en) Service function chain construction method capable of adapting to user time delay requirement
CN105246124B (en) A kind of heterogeneous wireless network Joint admission control method
CN113572821A (en) Edge cloud node task cooperative processing method and system
Murray et al. Network access and handover control in heterogeneous wireless networks for smart space environments