Given an existing Mobile Edge Cloud (MEC) network including virtualization facilities of limited capacity, and a set of mobile Access Points (AP) whose data traffic demand changes over time, we aim at finding plans for assigning APs traffic to MEC facilities so that the demand of each AP is satisfied and MEC facility capacities are not exceeded, yielding high level of service to the users. Since demands are dynamic we allow each AP to be assigned to different MEC facilities at different points in time, accounting for suitable switching costs. We propose a general data-driven framework for our application including an optimization core, a data pre-processing module, and a validation module to test plans accuracy. Our optimization core entails a combinatorial problem that is a multi-period variant of the Generalized Assignment Problem: we design a Branch-and-Price algorithm that, although exact in nature,. performs well also as a matheuristics when combined with early stopping. Extensive experiments on both synthetic and real-world datasets demonstrate that our approach is both computationally effective and accurate when employed for prescriptive analytics. (C) 2018 Elsevier Ltd. All rights reserved.
Optimized assignment patterns in Mobile Edge Cloud networks
Fiore Marco;
2019
Abstract
Given an existing Mobile Edge Cloud (MEC) network including virtualization facilities of limited capacity, and a set of mobile Access Points (AP) whose data traffic demand changes over time, we aim at finding plans for assigning APs traffic to MEC facilities so that the demand of each AP is satisfied and MEC facility capacities are not exceeded, yielding high level of service to the users. Since demands are dynamic we allow each AP to be assigned to different MEC facilities at different points in time, accounting for suitable switching costs. We propose a general data-driven framework for our application including an optimization core, a data pre-processing module, and a validation module to test plans accuracy. Our optimization core entails a combinatorial problem that is a multi-period variant of the Generalized Assignment Problem: we design a Branch-and-Price algorithm that, although exact in nature,. performs well also as a matheuristics when combined with early stopping. Extensive experiments on both synthetic and real-world datasets demonstrate that our approach is both computationally effective and accurate when employed for prescriptive analytics. (C) 2018 Elsevier Ltd. All rights reserved.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
