Dynamic Clustering for Low-Delay Delivery of Video Content Cached in MEC Servers

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F23%3A00373609" target="_blank" >RIV/68407700:21230/23:00373609 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1109/JSYST.2023.3283965" target="_blank" >https://doi.org/10.1109/JSYST.2023.3283965</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/JSYST.2023.3283965" target="_blank" >10.1109/JSYST.2023.3283965</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Dynamic Clustering for Low-Delay Delivery of Video Content Cached in MEC Servers

Popis výsledku v původním jazyce

For the purpose of video caching and low-delay video delivery to the end-users, multiaccess edge computing (MEC) servers are commonly grouped into clusters to efficiently exploit the limited storage resources of the MEC servers. In this article, we first introduce a methodology for analysis of the video delivery delay using the queuing theory. Our analysis shows that the video delivery delay is mainly affected by the arrival rate of the video requests. Furthermore, we show a tradeoff between the ratio of videos found in the MEC servers within the same cluster and the transmission delay of video contents. To reduce the video delivery delay, we propose a dynamic MEC server clustering (DyMECC) algorithm that determines the cluster size at each time interval by solving analytically derived equations considering the actual arrival rate of video requests. It also acts as a congestion avoidance mechanism for the communication interfaces among the MEC servers. Via simulations, we show that the DyMECC reduces the video delivery delay about 15% in light load conditions and by more than five times in heavy load conditions compared to state-of-the-art works while also reduces the load of the communication interfaces among the MEC servers by more than 45%.

Název v anglickém jazyce

Dynamic Clustering for Low-Delay Delivery of Video Content Cached in MEC Servers

Popis výsledku anglicky

For the purpose of video caching and low-delay video delivery to the end-users, multiaccess edge computing (MEC) servers are commonly grouped into clusters to efficiently exploit the limited storage resources of the MEC servers. In this article, we first introduce a methodology for analysis of the video delivery delay using the queuing theory. Our analysis shows that the video delivery delay is mainly affected by the arrival rate of the video requests. Furthermore, we show a tradeoff between the ratio of videos found in the MEC servers within the same cluster and the transmission delay of video contents. To reduce the video delivery delay, we propose a dynamic MEC server clustering (DyMECC) algorithm that determines the cluster size at each time interval by solving analytically derived equations considering the actual arrival rate of video requests. It also acts as a congestion avoidance mechanism for the communication interfaces among the MEC servers. Via simulations, we show that the DyMECC reduces the video delivery delay about 15% in light load conditions and by more than five times in heavy load conditions compared to state-of-the-art works while also reduces the load of the communication interfaces among the MEC servers by more than 45%.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20203 - Telecommunications

Projekt

<a href="/cs/project/LTT20004" target="_blank" >LTT20004: Spolupráce s mezinárodním výzkumným centrem v oblasti digitálních 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

Rok uplatnění

2023

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ů

Název periodika

IEEE Systems Journal

ISSN

1932-8184

e-ISSN

1937-9234

Svazek periodika

17

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

12

Strana od-do

5842-5853

Kód UT WoS článku

001141900100085

EID výsledku v databázi Scopus

2-s2.0-85163468811