Platform Profit Maximization on Service Provisioning in Mobile Edge Computing

Mobile edge computing has been an important supplement for traditional cloud computing architecture to offer low-delay computing services to mobile users. However, it is in general impossible for edge service providers to overdeploy so much edge resources to satisfy the rapidly increasing while dive...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on vehicular technology Jg. 70; H. 12; S. 13364 - 13376
Hauptverfasser: Huang, Xiaoyao, Zhang, Baoxian, Li, Cheng
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.12.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
and resource management
Benders decomposition
Cloud computing
Edge computing
Greedy algorithms
Integer programming
Machine learning
Mixed integer
Mobile computing
Mobile edge computing
profit maximization
Provisioning
Resource management
Task analysis
task assignment
Task scheduling
ISSN:0018-9545, 1939-9359
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Mobile edge computing has been an important supplement for traditional cloud computing architecture to offer low-delay computing services to mobile users. However, it is in general impossible for edge service providers to overdeploy so much edge resources to satisfy the rapidly increasing while diverse user demands. In this paper, we study a mobile edge computing system consisting of a service platform, cloudlets joining the system, and mobile users. In this study, we focus on a profit-driven perspective such that the service platform purchases computation resource from the resource-rich cloudlets and makes profit by processing tasks from user side. The design objective is to maximize the platform profit subject to budget constraint and stringent delay requirements for task processing. We formulate this problem as a mixed integer programming problem. Due to the NP-hardness of the problem, we design a logic based Benders decomposition algorithm as the offline solution. We further study the scenario where the task arrivals from user side and resource availability at the cloudlets are both stochastic and unknown in advance. We accordingly propose a Multi-Armed Bandit learning based resource purchasing and greedy task scheduling algorithm for the online scenario. Simulations results show the high performance of our proposed algorithms.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2021.3124483