All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Dynamic Allocation of Computing and Communication Resources in Multi-Access Edge Computing for Mobile Users

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Dynamic Allocation of Computing and Communication Resources in Multi-Access Edge Computing for Mobile Users

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20202 - Communication engineering and systems

Result continuities

  • Project

    <a href="/en/project/LTT18007" target="_blank" >LTT18007: Cooperation with the International Research Centre in Area of Communication Systems</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2021

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    IEEE Transactions on Network and Service Management

  • ISSN

    1932-4537

  • e-ISSN

    1932-4537

  • Volume of the periodical

    2021

  • Issue of the periodical within the volume

    18

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    18

  • Pages from-to

    2089-2106

  • UT code for WoS article

    000660636700069

  • EID of the result in the Scopus database

    2-s2.0-85104234818