Services provided by mobile edge clouds offer low-latency responses for large-scale and real-time applications. Dynamic service management algorithms generate live service migration requests to support user mobility and ensure service latency in mobile edge clouds. To handle these migration requests, multiple migration planning and scheduling algorithms are necessary to calculate the migration order and optimize the performance and overhead of multiple migrations. However, current planning and scheduling algorithms in cloud data centers are not suitable for dynamic and large-scale scenarios in edge computing, as the network topology expands and the number of migration requests increases. Edge computing requires near real-time scheduling to handle user mobility-induced live migrations. To address this issue, this paper presents an efficient multiple migration planning and scheduling framework for edge computing. The framework includes a lifecycle management framework and innovative iterative Maximal Independent Set-based scheduling algorithms based on the resource dependency graph of multiple migrations. Our solution is shown to efficiently schedule live migrations at scale using real-world taxi traces and telecom base station coordinates. It can achieve significant processing speedups over existing migration planning algorithms in clouds, up to 3000 times, while ensuring multiple and individual migration performance for time-critical services.

The rapid development of emerging vehicular edge computing (VEC) brings new opportunities and challenges for dynamic resource management. The increasing number of edge data centers, roadside units (RSUs), and network devices, how-ever, makes resource management a complex task in VEC. On the other hand, the exponential growth of service applications and end-users makes corresponding QoS hard to maintain. Intent-Based Networking (IBN), based on Software-Defined Networking, was introduced to provide the ability to automatically handle and manage the networking requirements of different applications. Motivated by the IBN concept, in this paper, we propose a novel approach to jointly orchestrate networking and computing resources based on user requirements. The proposed solution constantly monitors user requirements and dynamically re-configures the system to satisfy desired states of the application. We compared our proposed solution with the state-of-the-art networking embedding algorithms using real-world taxi GPS traces. Results show that our proposed method is significantly faster (up to 95%) and can improve resource utilization (up to 76%) and the acceptance ratio of computing and networking requests with various priorities (up to 71%). We also present a small-scale prototype of the proposed intent management framework to validate our solution.

By integrating Software-Defined Networking and cloud computing, virtualized networking and computing resources can be dynamically reallocated through live migration of Virtual Machines (VMs). Dynamic resource management such as load balancing and energy-saving policies can request multiple migrations when the algorithms are triggered periodically. There exist notable research efforts in dynamic resource management that alleviate single migration overheads, such as single migration time and co-location interference while selecting the potential VMs and migration destinations. However, by neglecting the resource dependency among potential migration requests, the existing solutions of dynamic resource management can result in the Quality of Service (QoS) degradation and Service Level Agreement (SLA) violations during the migration schedule. Therefore, it is essential to integrate both single and multiple migration overheads into VM reallocation planning. In this paper, we propose a concurrency-aware multiple migration selector that operates based on the maximal cliques and independent sets of the resource dependency graph of multiple migration requests. Our proposed method can be integrated with existing dynamic resource management policies. The experimental results demonstrate that our solution efficiently minimizes migration interference and shortens the convergence time of reallocation by maximizing the multiple migration performance while achieving the objective of dynamic resource management.

Summary Software‐defined networking (SDN) has evolved and brought an innovative paradigm shift in computer networks by utilizing a programmable software controller with open protocols. Network functions, previously served on dedicated hardware, have shifted to network function virtualization (NFV) that enabled functions to be virtualized and provisioned dynamically upon generic hardware. In addition to NFV, edge computing utilizes the edge resources close to end‐users, which can reduce the end‐to‐end service delay and the network traffic volume. Although these innovative technologies gained significant attention from both academia and industry, there are limited tools and simulation frameworks for the effectiveness evaluation in a repeatable and controllable manner. Furthermore, large‐scale experimental infrastructures are expensive to setup and difficult to maintain. Even if they are created, they are not available or accessible for the majority of researchers throughout the world. In this paper, we propose a framework for simulating NFV functionalities in both edge and cloud computing environments. In addition to the basic network functionalities supported by SDN in CloudSimSDN, we added new NFV features, such as virtualized network functions allocation, migration, and autoscaling with the support of corresponding network functionalities, such as flow load balancing, rerouting, and service function chaining (SFC) maintenance. We evaluated our simulation framework with autoscaling and placement policies for SFC in the integrated edge and cloud computing environments. The results demonstrate its effectiveness in measuring and evaluating the end‐to‐end delay, response time, resource utilization, network traffic, and power consumption with different algorithms in each scenario.

Real-time systems are shifting from single-core to multi-core processors. Software must be parallelized to fully utilize the computation power of multi-core architecture. OpenMP is a popular parallel programming framework in general and high-performance computing, and recently has drawn a lot of interests in embedded and real-time computing. Much recent work has been done on real-time scheduling of OpenMP-based parallel workload. However, these studies conduct evaluations with randomly generated task systems, which cannot well represent the structure features of OpenMP workload. This paper presents a benchmark suite, ompTGB, to support research on real-time scheduling of OpenMP-based parallel tasks. ompTGB does not only collect realistic OpenMP programs, but also models them into task graphs so that the real-time scheduling researchers can easily understand and use them. We also present a new response time bound for a subset of OpenMP programs and use it to demonstrate the usage of ompTGB.