Bandwidth and Task Flow Control in Stochastic Relay-Assisted MEC

This letter studies stochastic Multi-hop Mobile Edge Computing (MMEC), where a Relay Node (RN) receives tasks from the users and randomly decides to assign them to its own computing server or to offload them to one of the multiple Higher-level computing Nodes (HNs). We take into account the waiting times in the computation and transmission queues and present the system Average Response Time (ART) in terms of offloading probabilities and links’ bandwidths. Based on that, we aim at minimizing the system ART by joint optimization of the task flow distribution among the RN/HNs and the bandwidth allocation among the links. We analyze the formulated problem and prove it is multi-convex. Moreover, we derive the closed-form expressions for the links’ bandwidths when the offloading probabilities are fixed, and based on the presented analysis and insights, we propose effective solution methods. Numerical results reveal the promising performance of the proposed methods in efficient use of the resources and reduction of the ART.

Authors

Institutions

Publication Details

Journal
IEEE Wireless Communications Letters
Published
2024-09-23
DOI
https://doi.org/10.1109/lwc.2024.3466246
Primary Topic
Advancements in Semiconductor Devices and Circuit Design
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bandwidth and Task Flow Control in Stochastic Relay-Assisted MEC

Javad Hajipour, Victor C. M. Leung, Amin Mohajer
IEEE Wireless Communications Letters
Advancements in Semiconductor Devices and Circuit Design
article

Bandwidth and Task Flow Control in Stochastic Relay-Assisted MEC

Javad Hajipour, Victor C. M. Leung, Amin Mohajer
article en

Abstract

This letter studies stochastic Multi-hop Mobile Edge Computing (MMEC), where a Relay Node (RN) receives tasks from the users and randomly decides to assign them to its own computing server or to offload them to one of the multiple Higher-level computing Nodes (HNs). We take into account the waiting times in the computation and transmission queues and present the system Average Response Time (ART) in terms of offloading probabilities and links’ bandwidths. Based on that, we aim at minimizing the system ART by joint optimization of the task flow distribution among the RN/HNs and the bandwidth allocation among the links. We analyze the formulated problem and prove it is multi-convex. Moreover, we derive the closed-form expressions for the links’ bandwidths when the offloading probabilities are fixed, and based on the presented analysis and insights, we propose effective solution methods. Numerical results reveal the promising performance of the proposed methods in efficient use of the resources and reduction of the ART.

IEEE Wireless Communications LettersVol. 13(12)
University of British Columbia (CA), University of Tabriz (IR)
University of Tabriz, Science and Engineering Research Council
Openalex Percentile: Top 87%
Advancements in Semiconductor Devices and Circuit Design
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Bandwidth and Task Flow Control in Stochastic Relay-Assisted MEC — Javad Hajipour, Victor C. M. Leung, et al. · IEEE Wireless Communications Letters (2024) | TGRS Research Map | TGRS