Abstract

The problem of task offloading in mobile edge computing is recently known to be NP-hard. We identify in this paper several practical assumptions, for reducing the problem into its restricted variants. We however find that task offloading remains to be intractable (NP-complete) even in the context where the number of mobile users for a given channel is fixed, and vice versa. Accordingly in this paper we position several approaches (e.g., SAT/SMT encodings, task offloading as stable matching, deep reinforcement learning, and general machine learning approaches) as means to tackle the problem.

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.