Stable Service Caching in MECs of Hierarchical Service Markets With Uncertain Request Rates
IEEE Transactions on Mobile Computing · 01.07.2023 · 22 (7) · 4279-4296
DOI: 10.1109/tmc.2022.3149870 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Mobile Computing, erschienen am 01.07.2023. Verfasst von Zichuan Xu und 7 weiteren Autor:innen. Die Arbeit wurde bisher 21-mal zitiert (Crossref) und nennt 58 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Xinghai scholar, City University of Hong Kong.
Abstract (Originalsprache)
Multi-access edge computing (MEC) enables extreme low-latency AI services, such as Augmented Reality (AR) and Virtual Reality (VR), by deploying cloudlets in locations close to users. Meanwhile, a 5G hierarchical service market is emerging with both large-scale and small-scale network service providers competing for both computing and network bandwidth resources of an infrastructure provider. In this paper, we investigate the problem of caching services originally deployed in remote clouds to cloudlets in an MEC network in a hierarchical service market. For the service caching problem, we first propose a novel approximation-restricted framework that guarantees the stability of the 5G service market. Under the proposed framework, we first propose an approximation algorithm with a provable approximation ratio for the problem with non-selfish network service providers. We then design an efficient Stackelberg congestion game with selfish network service providers, and analyze the Price of Anarchy (PoA) of the proposed Stackelberg congestion game to measure the efficiency loss of the game due to selfishness of network service providers. Considering that the request rate of each service may not be given in advance, we study the service caching problem with the uncertainlity of request rates, and propose an approximation algorithm and a Stackelberg game via leveraging the randomized rounding technique. We finally evaluate the performance of the proposed algorithms and mechanisms by both simulations and implementations in a real test-bed. Results show that the performance of our proposed mechanisms achieve around 9.2% less cost than those of existing approaches.
Förderung
- National Natural Science Foundation of China
- Xinghai scholar
- City University of Hong Kong
Zitieren
APA
Xu, Z., Xia, Q., Wang, L., Zhou, P., Lui, J. C. S., Liang, W., Xu, W., & Wu, G. (2023). Stable Service Caching in MECs of Hierarchical Service Markets With Uncertain Request Rates. IEEE Transactions on Mobile Computing, 22(7), 4279-4296. https://doi.org/10.1109/tmc.2022.3149870
Vancouver
Xu Z, Xia Q, Wang L, Zhou P, Lui JCS, Liang W, et al. Stable Service Caching in MECs of Hierarchical Service Markets With Uncertain Request Rates. IEEE Transactions on Mobile Computing. 2023;22(7):4279-4296. doi:10.1109/tmc.2022.3149870
BibTeX
@article{Xu2023,
author = {Xu, Zichuan and Xia, Qiufen and Wang, Lin and Zhou, Pan and Lui, John C. S. and Liang, Weifa and Xu, Wenzheng and Wu, Guowei},
title = {Stable Service Caching in MECs of Hierarchical Service Markets With Uncertain Request Rates},
journal = {IEEE Transactions on Mobile Computing},
year = {2023},
volume = {22},
number = {7},
pages = {4279--4296},
doi = {10.1109/tmc.2022.3149870}
}
EUVIMED