Reliability-Aware Offloading and Allocation in Multilevel Edge Computing System

Mobile edge computing system provides cloud computing capabilities at the edge of wireless mobile networks, ensuring low latency, highly efficient computing, and improved user experience. At the same time, computationally intensive components are offloaded from mobile devices to edge servers and dis...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on reliability Ročník 70; číslo 1; s. 200 - 211
Hlavní autori: Dong, Luobing, Wu, Weili, Guo, Qiumin, Satpute, Meghana N., Znati, Taieb, Du, Ding Zhu
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.03.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
ISSN:0018-9529, 1558-1721
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Mobile edge computing system provides cloud computing capabilities at the edge of wireless mobile networks, ensuring low latency, highly efficient computing, and improved user experience. At the same time, computationally intensive components are offloaded from mobile devices to edge servers and distributed among the servers. Due to the special constraints (mobile devices' battery capacities, limited computing resources of one single edge server, inevitable edge server failure, etc.), there emerges a following problem. 1) How to guarantee the reliability of the offloaded computing? This problem brings in the following two other problems. 2) How to find the appropriate offloading point in the mobile program such that the computing tasks offloaded to cloud can be maximized, while the transmission energy consumption is minimized? 3) What is the achievable minimum latency tasks allocation strategy among multiple users' mobile devices and multiple edge servers? In this paper, we try to address the aforementioned problems. First, for the appropriate offloading point problem, we consider the offloading valuable basic constraint and propose a task merging strategy based on mobile program component call graphs to minimize the computational complexity of the program partition. Second, we formulate the second problem as a combinatorial optimization problem and transform it into an n-fold integer programming problem by mapping the remaining computing resources to a virtual component. Third, we design a reliable shadow component scheme between multilevel severs for the reliability problem. Finally, we develop a fast algorithm for the mix problem and analyze its performance and conduct experiments to prove the accuracy of our theoretical results.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
SC0014376
USDOE Office of Science (SC)
ISSN:0018-9529
1558-1721
DOI:10.1109/TR.2019.2909279