Multi-objective optimization of task-to-node assignment in opportunistic fog RAN

by
by Jijin, J, Seet, B-C and Chong, P
Abstract:
The opportunistic fog radio access network (OF-RAN) is a promising RAN architecture proposed for next-generation cellular networks. OF-RAN extends the current fog RAN (F-RAN) architecture by introducing virtual fog access points (v-FAPs) that can be formed on-demand by a set of resourceful end-user devices available in an opportunistic manner. These devices in the v-FAP collaboratively serve as the service nodes to a resource-limited local client by performing resource-demanding processing tasks on its behalf. Hence, appropriately assigning the client task to the service nodes of the v-FAP, i.e., task-to-node assignment (TNA), is a fundamental problem in OF-RAN. This paper formulates and solves the TNA as a multi-objective optimization problem, with the goals of minimizing energy and latency of the v-FAP, while maximizing fairness (or load balancing) amongst its service nodes by minimizing their maximum load.
View PDF
Reference:
Multi-objective optimization of task-to-node assignment in opportunistic fog RAN (Jijin, J, Seet, B-C and Chong, P), In Electronics, MDPI AG, volume 9, 2020.
Bibtex Entry:
@article{jijin2020multiobjectiveran,
author = {Jijin, J and Seet, B-C and Chong, P},
journal = {Electronics},
number = {3},
publisher = {MDPI AG},
title = {Multi-objective optimization of task-to-node assignment in opportunistic fog RAN},
url = {https://www.mdpi.com/2079-9292/9/3/474},
volume = {9},
year = {2020},
abstract = {<jats:p>The opportunistic fog radio access network (OF-RAN) is a promising RAN architecture proposed for next-generation cellular networks. OF-RAN extends the current fog RAN (F-RAN) architecture by introducing virtual fog access points (v-FAPs) that can be formed on-demand by a set of resourceful end-user devices available in an opportunistic manner. These devices in the v-FAP collaboratively serve as the service nodes to a resource-limited local client by performing resource-demanding processing tasks on its behalf. Hence, appropriately assigning the client task to the service nodes of the v-FAP, i.e., task-to-node assignment (TNA), is a fundamental problem in OF-RAN. This paper formulates and solves the TNA as a multi-objective optimization problem, with the goals of minimizing energy and latency of the v-FAP, while maximizing fairness (or load balancing) amongst its service nodes by minimizing their maximum load.</jats:p>},
doi = {10.3390/electronics9030474},
issn = {2079-9292},
language = {en},
}