.png){kind=icon}
.png){kind=icon}
Return
Computation Offloading for Mobile-Edge Computing with Maximum Flow Minimum Cut
.png){kind=icon}
PRE
AI
DOI：10.1145/3207677.3277943.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Due(1) to the constraints of size and weight, mobile terminals are limited by processing power, memory capacity, network connectivity and battery capacity. Therefore, how to expand the resources of mobile terminals has become an urgent problem. The mobile-edge computation offloading is an effective way to extend the battery life of mobile intelligent terminals by performing some application calculations on remote servers. However, the segmentation of computing programs is a precondition for mobile-edge computation offloading. In this paper, we discuss the segmentation problem of computation offloading based on maximum flow minimum cut and propose an optimal segmentation algorithm for mobile applications. First, the network flow graph model of application is defined. Based on the label propagation theory, the sub-graphs are divided and the network graph is simplified by compression and merge. Finally, the optimal solution is obtained according to the maximum flow algorithm. Experiments show that the algorithm have a better effect on programs with high degree of function coupling.
Keywords:
Computation Offloading
Maximum Flow Minimum Cut
Mobile-Edge Computing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
P
IF:
0
Papers:
1.8K
Citations:
0