Dynamic Allocation of Computing and Communication Resources in Multi-Access Edge Computing for Mobile Users
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F21%3A00350152" target="_blank" >RIV/68407700:21230/21:00350152 - isvavai.cz</a>
Výsledek na webu
<a href="https://doi.org/10.1109/TNSM.2021.3072433" target="_blank" >https://doi.org/10.1109/TNSM.2021.3072433</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TNSM.2021.3072433" target="_blank" >10.1109/TNSM.2021.3072433</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Dynamic Allocation of Computing and Communication Resources in Multi-Access Edge Computing for Mobile Users
Popis výsledku v původním jazyce
The Multi-Access Edge Computing (MEC) constitutes computing over virtualized resources distributed at the edge of mobile network. For mobile users, an optimal allocation of communication and computing resources changes over time and space, and the resource allocation becomes a complex problem. Moreover, for delay constrained applications, the resource allocation to mobile users cannot be solved by approaches designed for static users, as a solution would not be obtained within a desired time. Thus, in this paper, we propose a low-complexity computing and communication resource allocation for offloading of real-time computing tasks generated with a high arrival rate by the mobile users. We exploit probabilistic modeling of the users’ movement to pre-allocate the computing resources at base stations and to select suitable communication paths between the users and the base station with the pre-allocated computing resources. The simulations show that the proposed algorithm keeps the offloading delay below 100 ms for the small tasks even with the arrival rate of five tasks per second per user, while the state-of-the-art algorithms can handle only up to 0.5 tasks per second per user. Thus, the proposal enables an exploitation of the MEC for various real-time applications even if the users are moving.
Název v anglickém jazyce
Dynamic Allocation of Computing and Communication Resources in Multi-Access Edge Computing for Mobile Users
Popis výsledku anglicky
The Multi-Access Edge Computing (MEC) constitutes computing over virtualized resources distributed at the edge of mobile network. For mobile users, an optimal allocation of communication and computing resources changes over time and space, and the resource allocation becomes a complex problem. Moreover, for delay constrained applications, the resource allocation to mobile users cannot be solved by approaches designed for static users, as a solution would not be obtained within a desired time. Thus, in this paper, we propose a low-complexity computing and communication resource allocation for offloading of real-time computing tasks generated with a high arrival rate by the mobile users. We exploit probabilistic modeling of the users’ movement to pre-allocate the computing resources at base stations and to select suitable communication paths between the users and the base station with the pre-allocated computing resources. The simulations show that the proposed algorithm keeps the offloading delay below 100 ms for the small tasks even with the arrival rate of five tasks per second per user, while the state-of-the-art algorithms can handle only up to 0.5 tasks per second per user. Thus, the proposal enables an exploitation of the MEC for various real-time applications even if the users are moving.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
20202 - Communication engineering and systems
Návaznosti výsledku
Projekt
<a href="/cs/project/LTT18007" target="_blank" >LTT18007: Spolupráce s mezinárodním výzkumným centrem v oblasti komunikačních systémů</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2021
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
IEEE Transactions on Network and Service Management
ISSN
1932-4537
e-ISSN
1932-4537
Svazek periodika
2021
Číslo periodika v rámci svazku
18
Stát vydavatele periodika
US - Spojené státy americké
Počet stran výsledku
18
Strana od-do
2089-2106
Kód UT WoS článku
000660636700069
EID výsledku v databázi Scopus
2-s2.0-85104234818