With the popularity of cloud native and DevOps, container technology is widely used and combined with microservices. The deployment of container-based microservices in distributed cloud-edge infrastructure requires suitable strategies to ensure the quality of service for users. However, the existing container orchestration tools cannot flexibly select the best deployment location according to the user’s cost budget, and are insufficient in personalized deployment solutions. From the perspective of application providers, this paper considers the location distribution of users, application dependencies, and server price differences, and proposes a genetic algorithm-based Internet-of-Things (IoT) application deployment strategy for personalized cost budgets. The application deployment problem is defined as an optimization problem that minimizes user service latency under cost constraints. This problem is an NP-hard problem, and genetic algorithm is introduced to solve the optimization problem effectively and improve the deployment efficiency. The proposed algorithm is compared with four baseline algorithms, Time-Greedy, Cost-Greedy, Random and PSO, using real datasets and some synthetic datasets. The results show that the proposed algorithm outperforms other competing baseline algorithms.

In Mobile Edge Computing (MEC) environment, service deployment for IoT application is a key issue that needs to be solved. Considering the knowledge of mobile users’ service requests and edge server’s processing capacity, the problem of microservice deployment in MEC environment is modelled as a non-linear optimization problem. An adaptive dynamic deployment optimization method called Adapt-SD has been proposed, which is based on Adam and weighted round-robin scheduling algorithm to solve this microservice deployment problem. In Adapt-SD, considering the hardware resource-constrained MEC environment, different numbers of microservice instances are deployed on different edge servers, and then microservice instances are invoked to achieve the minimum resource consumption cost while meeting user’s service access delay constraints. At the same time, Adapt-SD also ensures the work balance of edge servers. In this paper, real datasets from EUA in Australia and some synthetic datasets are utilized to measure the performance of Adapt-SD, which is compared with the existing microservice deployment algorithms. Experimental results show that Adapt-SD is superior to other representative deployment algorithms.

Mobile edge computing (MEC) has become an extremely hot topic in recent years. Mobile edge cloud relies on storage and computing resources on network edge to provide users with delay-sensitive services. However, the transmission delay among microservices and the load of the servers tend to increase due to improper service placement and unreasonable resource allocation under MEC. In this paper, an edge service placement strategy based on an improved fast non-domination sorted genetic algorithm is proposed. First, a microservice placement optimization model is built with the goal of minimizing the average transmission delay and the load balance degree. Then, a genetic algorithm-based microservice placement approach called GA-MSP using improved NSGA-II is studied under the premise that a single service instance is deployed only on one container. The experiments show that the proposed GA-MSP approach is able to achieve low delay and load balance effectively, and ultimately deploy services based on the resulting sets after convergence, which outperforms several other existing representative methods.

Fog computing is a decentralized computing infrastructure in which data, compute, storage and applications are located somewhere between the data source and the cloud. It usually adopts convenient and flexible distributed services, which can realize low-cost and real-time data analysis and intelligent control. Efficient communication and fog/edge collaboration have become popular research issues. In this paper, the offloading problem of dependent tasks in fog/edge collaborative environment is studied. Dependent task is modeled as a directed acyclic graph (DAG), and the scenario that fog nodes are configured with heterogeneous multi-core servers is considered. According to task dependencies and energy consumption requirements, all subtasks executed on different edge devices are prioritized, and the Priority and Dependency-based DAG Tasks Offloading Algorithm (PDAGTO) is proposed. Simulation results have shown that, compared with the existing work, the proposed algorithm can effectively reduce the average delay and the total energy consumption of during the procedure of task offloading.