TY - GEN
T1 - PASE
T2 - 43rd IEEE International Conference on Distributed Computing Systems, ICDCS 2023
AU - Kolosov, Oleg
AU - Yadgar, Gala
AU - Breitgand, David
AU - Lorenz, Dean H.
N1 - Publisher Copyright: © 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Mobile edge computing offers ultra-low latency, high bandwidth, and high reliability. Thus, it can support a plethora of emerging services that can be placed in close proximity to the user. One of the fundamental problems in this context is maximizing the benefit from the placement of networked services, while meeting bandwidth and latency constraints. In this study, we propose an adaptive and predictive resource allocation strategy for virtual-network function placement comprising services at the mobile edge. Our study focuses on maximizing the service provider's benefit under user mobility, i.e., uncertainty. This problem is NP-hard, and thus we propose a heuristic solution: we exploit local knowledge about the likely movements of users to speculatively allocate service functions. We allow the service functions to be allocated at different edge nodes, as long as latency and bandwidth constraints are met. We evaluate our proposal against a theoretically optimal algorithm as well as against recent previous work, using widely used simulation tools. We demonstrate that under realistic scenarios, an adaptive and proactive strategy coupled with flexible placement can achieve close-To-optimal benefit.
AB - Mobile edge computing offers ultra-low latency, high bandwidth, and high reliability. Thus, it can support a plethora of emerging services that can be placed in close proximity to the user. One of the fundamental problems in this context is maximizing the benefit from the placement of networked services, while meeting bandwidth and latency constraints. In this study, we propose an adaptive and predictive resource allocation strategy for virtual-network function placement comprising services at the mobile edge. Our study focuses on maximizing the service provider's benefit under user mobility, i.e., uncertainty. This problem is NP-hard, and thus we propose a heuristic solution: we exploit local knowledge about the likely movements of users to speculatively allocate service functions. We allow the service functions to be allocated at different edge nodes, as long as latency and bandwidth constraints are met. We evaluate our proposal against a theoretically optimal algorithm as well as against recent previous work, using widely used simulation tools. We demonstrate that under realistic scenarios, an adaptive and proactive strategy coupled with flexible placement can achieve close-To-optimal benefit.
KW - 5G mobile communication
KW - Connected vehicles
KW - Multi access edge computing
KW - Service function chaining
KW - edge computing
KW - virtual network embedding
UR - http://www.scopus.com/inward/record.url?scp=85175068720&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/ICDCS57875.2023.00046
DO - https://doi.org/10.1109/ICDCS57875.2023.00046
M3 - منشور من مؤتمر
T3 - Proceedings - International Conference on Distributed Computing Systems
SP - 738
EP - 748
BT - Proceedings - 2023 IEEE 43rd International Conference on Distributed Computing Systems, ICDCS 2023
Y2 - 18 July 2023 through 21 July 2023
ER -