Profit Maximization of Delay-Sensitive, Differential Accuracy Inference Services in Mobile Edge Computing

The integration of Artificial Itelligence (AI) and edge computing has sparked significant interest in edge inference services. In this paper, we consider delay-sensitive, differential accuracy inference services in a Mobile Edge Computing (MEC) network while meeting user stringent delay and accuracy requirements. We formulate two novel profit maximization problems under static and dynamic settings of service request arrivals, with the aim of maximizing the accumulative profit of admitted requests. We assign differential accuracy service requests to the corresponding resolution instances of their requested service models, assuming that each resolution instance can serve up to <inline-formula><tex-math notation="LaTeX">$L\geq 1$</tex-math></inline-formula> the same type of service requests. Since the profit maximization problem is NP-hard, we first formulate an Integer Linear Program (ILP) solution if the problem size is small or medium; otherwise, we devise a constant randomized algorithm with high probability. Then, we consider dynamic service request admissions without the knowledge of future request arrivals for a given finite time horizon, for which we develop a simple yet effective prediction mechanism to accurately predict the number of different resolution instances of each model needed, and pre-deploy the predicted number of resolution instances into cloudlets to reduce instantiating delays. We then devise an online algorithm with a provable competitive ratio for the dynamic profit maximization problem by leveraging the primal-dual dynamic updating technique. Finally, we evaluate the performance of the proposed algorithms by simulations. The simulation results demonstrate that the proposed algorithms are promising.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Mobile Computing
Published
2025-02-07
DOI
https://doi.org/10.1109/tmc.2025.3540017
Citations
6
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
8.92
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Profit Maximization of Delay-Sensitive, Differential Accuracy Inference Services in Mobile Edge Computing

Xiaohua Jia, Zichuan Xu, Weifa Liang, Yuncan Zhang et al.
6 citations
IEEE Transactions on Mobile Computing
IoT and Edge/Fog Computing
8.92
article

Profit Maximization of Delay-Sensitive, Differential Accuracy Inference Services in Mobile Edge Computing

Xiaohua Jia, Zichuan Xu, Weifa Liang, Yuncan Zhang, Yuanyuan Yang
article en
6 citations

Abstract

The integration of Artificial Itelligence (AI) and edge computing has sparked significant interest in edge inference services. In this paper, we consider delay-sensitive, differential accuracy inference services in a Mobile Edge Computing (MEC) network while meeting user stringent delay and accuracy requirements. We formulate two novel profit maximization problems under static and dynamic settings of service request arrivals, with the aim of maximizing the accumulative profit of admitted requests. We assign differential accuracy service requests to the corresponding resolution instances of their requested service models, assuming that each resolution instance can serve up to <inline-formula><tex-math notation="LaTeX">$L\geq 1$</tex-math></inline-formula> the same type of service requests. Since the profit maximization problem is NP-hard, we first formulate an Integer Linear Program (ILP) solution if the problem size is small or medium; otherwise, we devise a constant randomized algorithm with high probability. Then, we consider dynamic service request admissions without the knowledge of future request arrivals for a given finite time horizon, for which we develop a simple yet effective prediction mechanism to accurately predict the number of different resolution instances of each model needed, and pre-deploy the predicted number of resolution instances into cloudlets to reduce instantiating delays. We then devise an online algorithm with a provable competitive ratio for the dynamic profit maximization problem by leveraging the primal-dual dynamic updating technique. Finally, we evaluate the performance of the proposed algorithms by simulations. The simulation results demonstrate that the proposed algorithms are promising.

IEEE Transactions on Mobile ComputingVol. 24(7)
City University of Hong Kong (HK), Dalian University of Technology (CN), Stony Brook University (US)
Openalex Percentile: Top 3%
IoT and Edge/Fog Computing
8.92
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.