Parked vehicle-assisted multi-access edge computing (PVMEC) is a paradigm that exploits the under-utilized resources of parked vehicles (PVs) to assist MEC servers for offloaded task execution. This article investigates a partial offloading strategy for multi-user PVMEC, where each mobile device (MD)’s task can be partially offloaded to the MEC server or a nearby PV. We formulate the system utility maximization problem with joint consideration of offloading decisions, offloading ratio, and resource allocation. Considering the complexity and privacy issues of centralized scheme as well as the inherent resource contention among MDs, we adopt game-theoretic approach to devise a low-complexity distributed offloading scheme, in which the offloading decision-making problem is modeled as an exact potential game, and the optimal offloading ratio and resource allocation are determined using a subgradient method. Finally, simulation results show that our proposed approach can significantly improve the system utility over traditional baselines.
In recent years, multi-access edge computing (MEC) has become a promising technology used in 5G networks based on its ability to offload computational tasks from mobile devices (MDs) to edge servers in order to address MD-specific limitations. Despite considerable research on computation offloading in 5G networks, this activity in multi-tier multi-MEC server systems continues to attract attention. Here, we investigated a two-tier computation-offloading strategy for multi-user multi-MEC servers in heterogeneous networks. For this scenario, we formulated a joint resource-allocation and computation-offloading decision strategy to minimize the total computing overhead of MDs, including completion time and energy consumption. The optimization problem was formulated as a mixed-integer nonlinear program problem of NP-hard complexity. Under complex optimization and various application constraints, we divided the original problem into two subproblems: decisions of resource allocation and computation offloading. We developed an efficient, low-complexity algorithm using particle swarm optimization capable of high-quality solutions and guaranteed convergence, with a high-level heuristic (i.e., meta-heuristic) that performed well at solving a challenging optimization problem. Simulation results indicated that the proposed algorithm significantly reduced the total computing overhead of MDs relative to several baseline methods while guaranteeing to converge to stable solutions.
In multi-access edge computing (MEC), computation tasks offloaded from users are usually associated with specific services that need to be cached in MEC nodes to enable task execution. The decisions as to which services to cache and which tasks to execute on each resource-limited MEC node are critical to maximizing the offloading efficiency. Moreover, quality of experience (QoE) is a key factor driving offloading decisions, so that limited computing resources can be effectively utilized to keep users satisfied. Therefore, in this letter, we introduce a new QoE-based utility optimization approach to address the problem of joint service caching and task offloading in MEC systems. Our utility model reflects the trade-off between the user’s perception of service latency and the cost the user pays for the allocated computing resources. We formulate total utility maximization as an integer nonlinear programming problem and propose a genetic-based algorithm to solve it efficiently. Finally, evaluation results show that our proposal can significantly improve total user utility over traditional baselines.
The resource limitation of multi-access edge computing (MEC) is one of the major issues in order to provide low-latency high-reliability computing services for Internet of Things (IoT) devices. Moreover, with the steep rise of task requests from IoT devices, the requirement of computation tasks needs dynamic scalability while using the potential of offloading tasks to mobile volunteer nodes (MVNs). We, therefore, propose a scalable vehicle-assisted MEC (SVMEC) paradigm, which cannot only relieve the resource limitation of MEC but also enhance the scalability of computing services for IoT devices and reduce the cost of using computing resources. In the SVMEC paradigm, a MEC provider can execute its users’ tasks by choosing one of three ways: (i) Do itself on local MEC, (ii) offload to the remote cloud, and (iii) offload to the MVNs. We formulate the problem of joint node selection and resource allocation as a Mixed Integer Nonlinear Programming (MINLP) problem, whose major objective is to minimize the total computation overhead in terms of the weighted-sum of task completion time and monetary cost for using computing resources. In order to solve it, we adopt alternative optimization techniques by decomposing the original problem into two sub-problems: Resource allocation sub-problem and node selection sub-problem. Simulation results demonstrate that our proposed scheme outperforms the existing schemes in terms of the total computation overhead.
19 July 2022 in IEEE Consumer Electronics Magazine
Conventional cloud computing, where compute, storage, and networking resources reside in one or a few centralized data centers, has become unable to meet the stringent latency requirements of new applications. Along with that, the rapid development of 5 G network introduces the trend of network cloudification and network service provisioning according to cloud service models. Therefore, the emerging distributed cloud model represents an evolution from conventional centralized cloud into geographically dispersed cloud computing services located as per application needs. In this article, we attempt to sketch a big picture of distributed cloud. We first interpret the concept of distributed cloud computing. Then, we describe an architecture of the distributed cloud along with the enabling technologies. We also carry out a case study on service deployment and discovery in a 3-layer distributed cloud prototype and provide a preliminary assessment of service discovery time. Finally, we discuss open research challenges towards distributed cloud.