Mobile edge computing has been an important computing paradigm for providing delay-sensitive and computation-intensive services to mobile users. In this paper, we study the problem of the joint optimization of task assignment and energy management in a mobile-server-assisted edge computing network, where mobile servers can provide assisted task offloading services on behalf of the fixed servers at the network edge. The design objective is to minimize the system delay. As far as we know, our paper presents the first work that improves the quality of service of the whole system from a long-term aspect by prolonging the operational time of assisted mobile servers. We formulate the system delay minimization problem as a mixed-integer programming (MIP) problem. Due to the NP-hardness of this problem, we propose a dynamic energy criticality avoidance-based delay minimization ant colony algorithm (EACO), which strives for a balance between delay minimization for offloaded tasks and operational time maximization for mobile servers. We present a detailed algorithm design and deduce its computational complexity. We conduct extensive simulations, and the results demonstrate the high performance of the proposed algorithm compared to the benchmark algorithms.
This paper presents a novel routing planning method based on multi-objective optimization to tackle the routing problem in computing power networks. The proposed method aims to improve the performance and efficiency of routing by considering multiple objectives. In this study, we first model the computing power network and formulate the routing problem as a multi-objective optimization problem. To address this problem, we introduce a non-dominated sorting genetic algorithm incorporating a ratio parameter adjustment strategy based on reinforcement learning. Extensive simulations are conducted to evaluate the performance of the proposed routing algorithm. The results demonstrate significant client latency and cost reductions, highlighting the algorithm’s effectiveness. By providing a comprehensive solution to the routing problem in computing power networks, this work contributes to the field by offering improved performance and efficiency. The proposed method’s ability to optimize multiple objectives sets it apart from existing approaches, making it a valuable contribution to the research community.
27 November 2023 in IEEE Transactions on Vehicular Technology
Mobile edge computing (MEC) has been a promising architecture for providing delay-sensitive computing services to mobile users. In the provisioning of MEC services, one big issue is the potential mismatching between dynamic task arrivals and resources allocated for different types of applications at edge servers, which can cause degraded system performance. In this paper, we study the joint optimization of application deployment and task assignment at different time scales in a MEC system constituent of multiple cloudlet service providers. The design objective is to maximize the system profit while meeting the task delay requirements of different applications. We formulate this problem as a mixed integer linear programming (MILP) problem. For the online scenario where future task arrival information is unknown in advance, we propose a multi-armed bandit based application deployment and maximum flow matching based service coalition algorithm. We deduce the complexity of the proposed algorithm and prove that it satisfies individual rationality and coalition rationality. Extensive simulations are carried out and the results show that the proposed algorithm can effectively improve the system profit while satisfying the task delay requirements.
Mobile edge computing is an important computing paradigm for delay-sensitive and computation-intensive tasks, which are growing explosively. In this paper, we study the joint optimization of task assignment and energy management in the mobile servers assisted edge computing network in order to minimize the system task delay. Considering the constraints of computing capacity of heterogeneous servers and energy capacity of mobile servers, this paper introduces the energy protection threshold to dynamically determine the energy-critical mobile servers and prevents them from participating in task processing, so as to effectively extend the overall service time of mobile computing resources, and thus finally minimize the average overall system delay. The system delay minimization problem is first formulated as a Mixed Integer Programming (MIP) problem, and we design a heuristic algorithm--dynamic Energy protection based delayed minimization Ant Colony algorithm (EACO) to solve the problem. In addition, the transition probability function is constructed according to the optimization objective and the characteristics of the ant colony algorithm. We conduct extensive simulations and the results demonstrate the high performance of the proposed algorithms compared to the benchmark algorithms.