Abstract

Mobile edge computation partitioning is an effective technique to improve the applications performance on the mobile devices by selectively offloading some computations from the devices to the nearby edge cloud. Most previous works focus on the computation partitioning for a single user. Recent works begin to study the computation partitioning in a multiple user environment in which a number of users compete for the constrained computation resources on the edge cloud. However, these works neglect the fact that the users normally also share the network resources to access the edge cloud, and thus the allocation of bandwidth to the users significantly affects the overall performance of the users. In this paper, we study network aware mobile edge computation partitioning in multi-user environments , i.e., to decide for each user which parts of the application should be offloaded onto the edge cloud, and which others should be executed locally, and meanwhile to allocate the access bandwidth among the users, such that the average application performance of the users is maximized. This problem is new in that we consider the competition among users for the network bandwidth as well as the computation resources in a multi-user environment. With a set of novel models and formulations, we transform the problem into the classic Multi-class Multi-dimensional Knapsack Problem, and develop an effective algorithm, namely Performance Function Matrix based Heuristic (PFM-H), to solve it. We further consider the user mobility and design effective online algorithms that could be easily deployed in practical systems. Comprehensive trace driven simulations show that our proposed algorithm outperforms the benchmark algorithms significantly in the average application performance.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.