mlsanityData to 14 Oct 2026

A learning-based solution approach to the application placement problem in mobile edge computing under uncertainty

arXiv 2403.11259 ↗First posted 17 Mar 2024cs.LG cs.AI cs.DCcited by 0

Not on the map. Why?

Abstract (arXiv)

Placing applications in mobile edge computing servers presents a complex challenge involving many servers, users, and their requests. Existing algorithms take a long time to solve high-dimensional problems with significant uncertainty scenarios. Therefore, an efficient approach is required to maximize the quality of service while considering all technical constraints. One of these approaches is machine learning, which emulates optimal solutions for application placement in edge servers. Machine learning models are expected to learn how to allocate user requests to servers based on the spatial positions of users and servers. In this study, the problem is formulated as a two-stage stochastic programming. A sufficient amount of training records is generated by varying parameters such as user locations, their request rates, and solving the optimization model. Then, based on the distance features of each user from the available servers and their request rates, machine learning models generate decision variables for the first stage of the stochastic optimization model, which is the user-to-server request allocation, and are employed as independent decision agents that reliably mimic the optimization model. Support Vector Machines (SVM) and Multi-layer Perceptron (MLP) are used in this research to achieve practical decisions from the stochastic optimization models. The performance of each model has shown an execution effectiveness of over 80%. This research aims to provide a more efficient approach for tackling high-dimensional problems and scenarios with uncertainties in mobile edge computing by leveraging machine learning models for optimal decision-making in request allocation to edge servers. These results suggest that machine-learning models can significantly improve solution times compared to conventional approaches.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 27 references that are in the map. First posted on arXiv 17 Mar 2024.

Builds on

6 of 27 references.

References · 6

  1. 2015Pointer Networkscited by 895
  2. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 623
  3. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 608
  4. 2018Predicting Tactical Solutions to Operational Planning Problems under Imperfect Informationcited by 11
  5. 2020Boosting Ant Colony Optimization via Solution Prediction and Machine Learningcited by 7
  6. 2019Learning to Handle Parameter Perturbations in Combinatorial Optimization: an Application to Facility Locationcited by 5

Built on by

Not cited yet.