1 Introduction
The introduction of edge computing [34]
brings opportunities to improve the performance of the emerging useroriented applications by pushing computation and intelligence to endusers, including Vehicle to Cloud (V2C), Vehicle to Vehicle (V2V), Virtual Reality (VR), Augmented Reality (AR), Artificial Intelligent (AI), or Internet of Things (IoT) applications and so forth. Driven by container virtualization, microservices are more suitable for dynamic deployment on edge computing
[19, 9] due to smaller memory footprint and faster startup. By allocating the containerized services in the Edge Data Centers (EDCs) or Mobile Edge Clouds (MECs) [14], strict endtoend (E2E) communication delays between endusers and services can be guaranteed.From the centralized cloud computing framework to decentralized edge computing, surveys [46, 29] investigated the challenges faced by the infrastructure and service providers regarding dynamic resource management and user mobility. By providing nonapplicationspecific compute and memory state management, live migration is the solution to these challenges. Live migration of VM [6] and container [23]
through the opensource Checkpoint/Restore in Userspace (CRIU) software
[8], which had kernel support since Linux 3.11, aims to provide little or no disruption to the running service during migrating in the edge computing. It iteratively copies unfinished computation tasks with intermediate computation states in the memory from source to destination until the memory difference between two synchronizing instances is small enough for the stopandcopy phase. In addition, for the container image, if the image does not exist in the destination, it can be transferred from the previous EDC or remote clouds or accessed through shared storage. Thus, live migration performance highly relies on the available bandwidth of the network routing connecting source to destination.Industrial infrastructure and service providers, such as IBM, RedHat, Google, etc, have been integrating live container migration into their productions [7, 20]. Google has adopted live VM and container migration with CRIU into Borg cluster manager [42, 32, 20] for reasons, such as, higher priority task preemption, software updates, such as kernel and firmware, or reallocating for availability or performance. It manages all compute tasks and runs on numerous container clusters each with up to tens of thousands of machines. A lower bound of 1,000,000 migrations monthly in the production fleet have been performed with 50ms median blackout [32]. Live container migration provides technical simplicity without handling state management and applicationspecific evictions. However, it is also identified that writing and reading to remote storage through network dominates the checkpoint/restore process and the scheduling delay is the large source of delay regarding the performance of multiple live migrations.
Recently, some works have focused on user or service mobility in mobile edge computing through live container migration [47, 18, 17, 46, 29, 48, 45]. With the limited coverage range of each EDC, when a user moves from one base station to another, the network latency could deteriorate after the network handover. To guarantee the Quality of Service (QoS), the service may need to be migrated from the previous EDC to the proximal one through live container migration. Figure 1 illustrates an example scenario where an autonomous vehicle sends workload to the corresponding stateful service in the EDC for realtime object detection. There is a total of 9 base stations assigned to 3 different EDCs. Two autonomous vehicles move to a new position from time to . For vehicle user1, when leaving the range of base station and entering the range of base station at time , there is a live container migration from to induced by the user1’s movement. Meanwhile, as user2 crosses the range boundary of the base station to , since the two base stations both belong to the same edge data center , the E2E delays of the service can be guaranteed. Therefore, there is no live migration induced by user2’s movement.
In cloud computing environments, dynamic resource management policies triggers live migration requests periodically to optimize the resource usage or to maintain QoS of applications [2]. However, in the edge environment, service migration/mobility is highly relative to user mobility [47, 18, 48, 45, 29]. Migration requests of containers or VMs from services and users may share and compete for the computing and network resources, such as migration source, destination, and network routings [12]. It brings more challenges for the multiple live migration planning and scheduling. However, most research on live service migration in edge and cloud computing neglects the actual live migration cost regarding the iterative dirty memory transmission [6] and resource competition among migrations in both computing and network resources. As a result, performing multiple live migrations in arbitrary order can lead to service degradation [1, 44].
Few works focus on multiple VM migration planning and scheduling in cloud data centers [1, 44]. The framework of migration scheduling periodically triggered by resource management policies with a long time interval is not suitable for stochastic scenarios of mobilityinduced migration in edge computing. Furthermore, the network scale, the numbers of endusers and live container migration requests increase ten thousand times in edge environments. Without proper modeling, the problem complexity will increase dramatically as the number of migration requests and network scale increase. As a result, the complexity and processing time of current algorithms do not meet the realtime requirement of the live migration at scale in edge environments.
Moreover, to manage a highly distributed and dynamic network environment, SoftwareDefined Networking (SDN) [35] is introduced in edge computing, which allows dynamic configuration and operations of computer networks through centralized software controllers. Facilitated by OpenFlow protocol [21] and Open vSwitch (OVS) [28], network manager based on SDN controllers can perform network slicing or create a separate network [27] to minimize the influence of migration flows on other edge services. As a result, the migration planning and scheduling algorithm can finegrained control the network resources for the migration competition, including the network routing and available bandwidth.
Therefore, in this paper, we propose efficient largescale live container migration planning and scheduling algorithms focusing on mobilityinduced migrations in edge computing environments. It can still apply to multiple migration scheduling for the general dynamic resource management at scale. The contributions of this paper are summarized as follows:

We introduce the resource dependency graph of the sourcedestination pair for resource competition among migration requests to reduce the problem complexity.

We model the problem as finding the Maximum Independent Set of the Dependency Graph iteratively.

We propose iterativeMaximal Independent Set (MIS)based algorithms for efficient largescale migration scheduling and prove the corresponding Thermos.

We implement an eventdriven simulator to evaluate the user mobility and live container migrations. The experiments are conducted with realworld dataset and traces.
The rest paper is organized as follows. We review the related work in Section 2 and define the system architecture in Section 3. In Section 4, we analyze and model the problem of multiple container migration scheduling. Then we propose two main methods of largescale migration scheduling in Section 5. Section 6 shows the performance analysis of proposed algorithms and Section 7 shows the experimental design and evaluation with realworld dataset. Finally, we conclude the paper in Section 8.
2 Related Work
research  realtime planning  largescale  service correlations  usermobility  deadline  SDNenabled  Cloud DC  Edge computing 

CQNCR [1]  
FPTAS [44]  
Our work 
The live VM migration realization [22] and its application in cloud data centers, such as dynamic resource management [24, 50], have been matured last few years. The research on live container migration in edge computing is an active field [46, 29]. Clark et al. [6] proposed the live VM migrations and discussed the details of precopy or iterative live migration. He et al. [13] evaluated the performance of live VM migrations and its overheads on the migration services in SDNenabled cloud data centers. On the other hand, the research on live container migration is trending and becomes more mature in recent years. Mirkin et al. [23] represented the checkpointing and restart features for the OpenVZ container. The checkpointing function is also used for live migration. Checkpoint/Restore In Userspace (CRIU) [8] is a Linux software to migrate container’s inmemory state in userspace. It is currently integrated with LXC, Docker (runC), and OpenVZ to achieve the live container migration. Nadgowda et al. also proposed [26] a CRIUbased memory migration together with the data federation capabilities of union mounts to minimize migration downtime. Similarly, Ma et al. [18, 17] utilized the layered storage feature based on AUFS storage drive and implemented a prototype system to improve the performance of docker container migration. Furthermore, several works studied the performance difference between container and VM live migration [19, 9]. Results show that the live container migration is much faster than the live VM migration due to its much smaller memory footprint and fast startup features.
More research recently focuses on dynamic resource scheduling in fog and edge computing environments based on the live container migration (details in survey [46, 29]). In [47, 48]
, the authors modeled the sequential decision making problem of generating service migration requests using the distancebased Markov Decision Process (MDP) framework. By reducing the state space, they proposed a distancebased MDP to get the approximated results. The research
[45]also investigated the same problem by using the MDP framework. The authors proposed a reinforcement learningbased online microservice coordination algorithm to learn the optimal strategy for live migration requests to maintain the QoS in endtoend delay.
Few studies focus on the optimization of the multiple live VM migration planning in cloud data centers [1, 44]. Bari et al. [1]
investigated the multiple VM migration planning in one data center environment by considering the available bandwidth and the migration effects on network traffic reallocation. The authors proposed a heuristic migration grouping algorithm (CQNCR) by setting the group start time only based on the prediction model. Without an online scheduler, the estimated start time of a live migration can lead to an unacceptable migration performance and QoS degradations. Moreover, the work neglects the cost of the individual migration by only comparing the migration group cost. Without considering the connectivity between VMs and the change of bandwidth, Wang et al.
[44] simplified the problem by maximizing the net transmission rate rather than minimizing the total migration time and proposed a polynomialtime approximation algorithm by omitting certain variables. However, the solution (FPTAS) can create migration competing on the same network path which degrades the migration performance in both average individual migration time and the total migration time.However, as shown in Table I, current algorithms can not meet the requirement of live container migrations in edge computing. The framework of migration scheduling [1] which are periodically triggered by resource management policies with a long time interval is not suitable for the mobilityinduced migration scenario. Furthermore, by modeling and calculating every resource competition of migration directly, the problem complexity [1, 44] increases along with the migration request number which is not suitable for largescale situation. The running time of migration planning is also too large to schedule timecritical live container migrations. The algorithms [1, 44] do not consider the deadline or urgency (priority) of migration. In addition, without an online scheduler, the start time of a migration schedule is only based on the estimated migration time which can lead to migration performance and QoS degradation.
3 System Architecture
In the edge computing, there is no dedicated network for the live migration to support the user mobility compared with the traditional setups in cloud data centers [41]. By integrating the SoftwareDefined Networking (SDN) into edge computing, the centralized SDN controller can dynamically separate network resources from the service network [35] to build a virtual WAN network for live migrations. The available bandwidth and network routing are dynamically allocated based on the reserved bandwidth of the service network. This solution alleviates the overheads of live migration on other services and guarantees the performance of multiple live migrations. To achieve a finegrained live migration scheduling, the migration scheduling service is integrated with the SDN controller [13], such as OpenDayLight (ODL), Open Network Operating System (ONOS) and Ryu, and container management and orchestration module, such as Kubernetes and Docker Swarm, to control both network and computing resources during each migration lifecycle.
3.1 Migration Lifecycle
In this section, we introduce the framework of migration scheduling in edge computing. Compared with periodically arrived multiple live migrations in cloud data centers, the arrival of live container migration induced by user mobility is stochastic. Therefore, we design the scheduling framework for the planning and scheduling of live container migration in edge computing with stochastic environments. As shown in Fig. 2, when a migration request arrives, it enters the WAITING state if it is feasible for scheduling, which means the container is not in migration. Otherwise, it will enter into the FAILED waiting migration list of the corresponding container. The migration planning event is triggered periodically within a short interval (such as every 1 second). It will generate the migration scheduling plan according to both waiting and running migrations. Based on the migration plan, the SDNenabled online scheduler starts the migration with the allocated bandwidth and routing. Then, the live container migration will start the premigration phase to extract the container procedure tree. This will trace the dirty memory in the userspace of the source server and create an empty container instance in the destination for state synchronization [8]. In MEM_COPY, the dirty memory is transferred iteratively to the synchronizing instance in the destination. In the postmigration phase, the network communication of the migrated service will be redirected to the new instance in the destination. Then, the migrated container will recover at the destination. It will also trigger the start of subsequent resourcedependent migrations in the plan and change the feasibility flag of the first migration request of the same container in the FAILED migration waiting list.
4 Motivations and Problem Formulation
In this section, we first present the performance model of single live migration. Then, we analyze the challenges faced by multiple live container migrations scheduling in edge computing: resource competition or dependency and realtime planning and scheduling. Finally, we model the problem as iteratively generating the Maximal Independent Set (MIS) based on the resource dependency graph.
4.1 Single Migration Model
The performance of single live migration can be categorized into three parts: premigration computing, memorycopy networking, and postmigration computing overheads, i.e., . Due to the smaller footprint and fast start up of containers compared to VMs, the premigration and postmigration is much shorter [26]. Based on the iterative precopy container migration implemented in CRIU [8], the migration performance in terms of memorycopy can be represented as [13]:
(1) 
where the ratio , is the data compression rate of dirty memory, is amount of kernel memory the container uses, is allocated available bandwidth, is dirty page rate which is the memory difference in pagemap per second compared to the previous copy iteration, is the total migration round.
We consider three conditions to enter the stopandcopy phase: (1) reach the threshold of memory copy iteration; (2) the transmission time of remained memory difference is less than the downtime threshold; and (3) the allocated bandwidth is less than the dirty page rate. The overhead of disk transmission for the container data and image can be ignored when shared network storage is available. The total iteration rounds of memory copy can be represented as:
(2) 
where denotes the maximum allowed number of iteration rounds. The when the dirty page rate is larger than the allocated bandwidth at the start of migration. is the remaining dirty pages need to be transferred in the stopandcopy phase, and is the configured downtime threshold.
4.2 Resource Competition
We first explain the network sharing competition overheads in multiple migration scheduling. Two migrations may share the same source, destination, or part of network routings. Therefore, performing multiple live migrations in arbitrary order can lead to service degradation and unacceptable migration performance [1, 44]. A smaller bandwidth during the live migration means a longer migration time and more dirty pages need to transfer in order to limit the state difference between two instances for the last stopandcopy phases which contributes as the downtime. Thus, the sum of the individual migration time of several live migrations is less than the total live migration time [13]. For example, based on the live migration model, Fig. 2(a) and 2(b) show the situation when several identical migrations sharing the same network path. The container’s initial memory size is 1 GB with a 20 MB/s dirty page rate. The downtime and iteration threshold is configured at 0.5 seconds and 30 times, respectively. In this example, for the sake of a clear comparison between the sum of individual migration time and the total migration time, we start all migrations at the same time. In this case, the average migration time as shown also equals the total migration time.
The average execution time of live migrations scheduled sequentially with 10 Gbps and 1 Gbps is 0.8482 and 7.5241 seconds. The average downtime is 0.0082 and 0.1048 seconds. The iteration rounds are 3 and 4, respectively. However, the average migration time or total multiple migration time of 5 live migrations sharing 10 Gbps and 1 Gbps is 3.604 and 88.43 seconds. The average downtime is 0.2048 and 0.3689 seconds with 3 and 12 iterations, respectively. As the number of migrations increases (Fig. 2(a)), the allocated bandwidth decreases linearly. However, to achieve the required migration downtime, the average migration time will increase exponentially. At 7 and 80 migrations sharing of 1 Gbps and 10 Gbps respectively, the iteration rounds reach the threshold as 30 (Fig. 2(b)). Then, with more bandwidthsharing migrations, the dirty page rate is larger than the allocated migration bandwidth. The downtime exceeds the 0.5 seconds threshold and increases significantly from 0.78 to 64.0 seconds and from 1.85 to 640 seconds. For the timecritical live migrations, a longer migration time will increase the possibility of migration deadline violation and QoS degradation. Therefore, it is optimal to sequentially schedule the resourcedependent migrations while concurrently schedule the independent ones. If there is a set of independent migrations and no other resourcedependent migrations are running, we can start all migration in such a concurrent scheduling group. The objective of migration scheduling is to maximize the number of migrations that can be scheduled concurrently.
Figure 4 shows an illustrative example with twelve live migrations requests on the edge network topology of 5 total EDCs. Let denote the migration request that migrating container from EDC to EDC . For the sake of a concise example, we limit the network interfaces used by the migration traffic. In other words, migration traffics share the same interfaces when the source or the destination is the same. It can be easily extended to the set of network interfaces in source and destination servers and the corresponding network paths . The network routing policy considers the shortest network path with the minimal number of migration flows. For example, there are two network routes between EDC1 and EDC3. As there is one migration from EDC2 to EDC3, it chooses network path in this case.
Resourceindependent migrations from one concurrent scheduling group can be scheduled at the same time. The planning algorithm needs to generate a scheduling plan consists of several concurrent migration groups that each group size is as large as possible. A larger concurrent scheduling group indicates that there are more migrations could be performed at the same time. As a result, the better performance of multiple migrations in total migration time and the QoS of migrating service can be guaranteed. Note that two migrations from different migration groups are not necessarily resourcedependent. As shown in Fig. 5, based on the network topology provided by the SDN controller, we create an undirected graph of resource dependency among migrations based on the source, destination, and network routing of migration requests. Each node represents a list of migrations sharing the same source , destination , and network path . In other words, migrations in one node list form a complete graph as all migrations are resourcedependent to all others in the list. For example, the migration list of node is . It significantly limits the problem complexity as the number of migration requests increases. The edge of the dependency graph indicates resource competition (network interfaces at source or destination, or bandwidth sharing along network routes) between migrations. A concurrent group equals to an independent set of the resource dependency graph. A maximal concurrent scheduling group is a set of resourceindependent migrations that is not a subnet of any other concurrent group. In other words, there is no other migration outside the concurrent group can be added to it so that all migrations can be performed at the same time. Therefore, it equals a maximal independent set (MIS). The largest size MIS is a maximum independent set. As shown in Fig. 5, there are several combinations of migrations for a maximal concurrent scheduling group. In the first iteration, one of the maximum group is and one of the maximal group is . Thus, the maximum group is a better choice. After selecting the migrations from the nodes of the maximal independent set, we delete these migrations and update the dependency graph. One node is deleted from the graph when there is no migrations left in its migration list. For example, after the first iteration, we only delete nodes , because there is still one migration left in node list. Thus, it is essential to select migrations carefully to achieve the maximum size of the concurrent groups. At the end, the online scheduler schedules all migration in the first group. Then, when there is one migration finishes, the scheduler starts all migrations blocked by the finished migration following the order of migration groups.
Before discussing how to get the Maximum Independent Set, the largest Maximal Independent Set (MIS), of the resource dependency graph, we first review some basic graph concepts [4], such as clique and independent set . A clique is a subset of vertices of an undirected graph G such that every two distinct vertices in the subset are adjacent. The maximal clique is a clique that cannot be extended by including one more adjacent vertex. On the other hand, an independent set of a graph G is the opposite of a clique that no two nodes in the set are adjacent. The maximum clique or independent set is the maximal clique or independent set with the largest size. denotes the size of the largest MIS of graph . Therefore, an independent set of the resource dependency graph equals a concurrent migration group. The migrations from the nodes in an independent set can be scheduled concurrently. Meanwhile, migrations from the nodes in a clique are resourcedependent which need to be scheduled sequentially.
4.3 RealTime Planning
There are few multiple migration planning and scheduling algorithms for live VM migration in cloud data centers [1, 44]. However, the processing time of the scheduling sequence of multiple live migrations based on the algorithms in cloud data centers is not suitable for the realtime requirement of mobilityinduced migrations in edge computing. For example, the processing time of FPTAS [44] and CQNCR [1] for migration planning is about 5 and 10 seconds for 100 migrations. The processing time increases to 44.56 and 968.46 seconds for FPTAS and CQNCR to generate the scheduling plan of 500 migrations. For traditional dynamic resource management, the algorithm triggered every 10 minutes or 30 minutes. This leaves enough time budget for algorithms to generate the optimal scheduling sequence. However, in the edge computing environment for mobilityinduce live migrations, the live migration requests arrive at any time stochastically. Most of the migration requests are also timecritical. Thus, the processing time of the planning and scheduling algorithm for mobilityinduced migrations should be adapted to suit the realtime scenario.
4.4 Problem Modeling
The planning and scheduling algorithm is triggered periodically after every time interval . We let denote the set of arrival migration requests at planning time . is the set of migration requests waiting for planning at time . is the set of infeasible migrations, such as its requested container is in migration. is the set of migrations that have been planned but not finished at time , and is the set of finished migrations at time .
The input of migration requests at every migration planning time is . For each live container migration , we have source and destination edge data center and allocated network routing, , available bandwidth , arrival time , estimated migration time , relative deadline , start time , and finish time . Therefore, the response time can be represented as . The slack time of migration scheduling, the remaining scheduling window that one migration will not miss its deadline, is . The objective of live container migration planning and scheduling is to maximize the number of running resourceindependent live migrations until the next planning time .
At every planning and scheduling time , the resource dependency graph denotes the acyclic undirected graph where . Each node represents the list of migrations where migration shares the same source , destination , and network routing . By sharing the same source and destination and network routing, migrations in the list of a node are all resourcedependent. Let denote the edge between node and . It indicates the resource dependency between migrations from both nodes. denotes the set of nodes of graph .
We model the multiple migration planning problem as generating the maximal independent set of the dependency graph iteratively. In other words, in each iteration, we get the maximal independent set of the remaining graph, then update the graph by deleting corresponding migrations. Let represent the remained graph by directly deleting vertex from set of nodes . Let denote the maximal independent set of graph . Then, the remained graph in each iteration can be represented as:
(3) 
by deleting set of nodes , where the migration list of the deleted node is empty. Therefore, for each migration planning, the objective is to generate the iterative maximum independent set of dependency graph:
(4) 
where is the total K iterative independent sets and there is no vertices left in the remaining graph as . In other words, each iterative independent set size equals the size of maximum independent set of remaining graph .
We extend the model to generate the iterative maximum weighted independent set for migration with different priorities, such as migration deadline. The weight of an independent set is . The largest weight of migration in the node migration list is the weight of its corresponding node in the dependency graph that
(5) 
Then, the objective of multiple migration planning can be represented as:
(6) 
The weight of node when there is no need to differentiate migrations in different nodes. Generating the maximum (weighted) independent set of an undirected acyclic graph is a well known NPhard problem [16, 5]. Therefore, generating the iterative maximum independent set as the subset is also NPhard.
4.5 Complexity Analysis
Because an independent set of is a clique in the complement graph of G and vice versa, the independent set problem and the clique problem are complementary [4, 16, 40]. In other words, listing all maximal independent sets or finding the maximum independent set of a graph equals listing all maximal cliques or finding the maximum clique of its complement graph. Thus, in each iteration, we can equivalently find the maximum independent set by getting the maximum clique of the complement graph .
It is known that all maximal cliques can be calculated in a total time proportional to the maximum number of cliques in an nvertex graph [40]. In other words, each clique is generated in a polynomial time in all maximal cliques listing [16]. When we only consider vertex, the maximal cliques listing algorithm (CLIQUES) [40, 5] based on BronKerbosch [4] is the optimal algorithm. The worstcase running time of CLIQUES is . The upper bound of all maximal cliques or independent sets of a graph is [25]. For the problem of finding one maximum independent set, the time complexity is improved from in [39] to [30]. Based on the work [30], the bestknown time complexity is [31]. Therefore, it is computationally impossible to solve the exact problem of listing all maximal cliques (maximum clique) of its complement graph or all maximal independent sets (maximum independent set) of for the realtime live container migration scheduling in edge computing which exhibits an exponential time complexity.
5 Migration Planning and Scheduling
In this section, we present the proposed planning and scheduling algorithms for largescale live container migrations in edge computing. With the waiting live container migration requests and planned unfinished live migrations as the input, the migration planner needs to efficiently schedule arriving migrations while maintaining the QoS. Based on the problem modeling in Section 4.4, this problem is reduced to finding an MIS of the migration dependency graph iteratively. Therefore, we propose two major approaches to generate the iterative MISs of the dependency graph: (1) Direct iterative MIS generation and (2) Maximum Cliques (MCs)based MIS generation.
5.1 Direct iterativeMaximal Independent Sets
For the direct iterative MIS generation, we follow the rationals based on the planning model as follows: (1) Create dependency graph based on the source, destination, and network routing of the input migrations and the network topology; (2) Generate the Maximum Independent Set (MIS) of ; (3) Delete the nodes from if its migration list is empty; and (4) Repeat the procedure 2 and 3 until there is no vertices left .
5.1.1 The Approximation
For the approximation algorithm (approx) of creating the iterative maximum independent set, the procedure is as follows: In the approximation algorithm (Algorithm 1), we use the approximating maximum independent sets algorithm by excluding subgraph [3] to generate MIS in each iteration. Note that we skip the MIS generation and remove the migrations directly if the node size of is unchanged in the current iteration. In other words, if we need to recalculate the MIS of the remaining graph, there is at least one node removed from the graph . Given total live container migrations, we create the corresponding dependency graph with vertices. Therefore, regardless of the total number of migration requests, the upper bound of the complexity of planning multiple migrations scheduling is limited by the involved source, destination, and network routing. In the worst case, the planning algorithm only needs at most iteration rounds to calculate the concurrent migration group. In each iteration, it guarantees approximate maximum independent set in polynomial time [3].
Based on the newly generated scheduling plan , the SDNenabled online migration scheduler will start all feasible migrations in the first group , considering the resource dependency with current running migrations. Then, whenever a migration finishes, the scheduler starts all remaining feasible migrations in each concurrent migration group followed by the scheduling plan order.
5.1.2 Greedy MIS Algorithm
The greedy algorithm (iterGWIN) generates the concurrent groups (MIS) of live migration iteratively. A greedy maximal independent set algorithm (GWIN) [33] based on the weight and the degree of a node is adapted to directly generate the MIS in each iteration. Let denote the maximum degree and is the average degree of . The degree of node in is . is the set of neighbor nodes of vertex and .
As shown in Algorithm 2, from line 38, it selects the node with largest score regarding the minimal degree and maximal weight:
(7) 
It removes the selected node and its neighbors from the graph and repeats the procedure until there is no vertices left.
As mentioned in the problem modeling, the weighted node equals the maximum weight of migrations from its list. The migration weight could be arrival time, estimated migration time, or correlation network influence [1] after migration for nontimecritical migrations and the deadline or slack time for realtime migrations scheduling. In this paper, we consider the weight function regarding the slack time as follows:
(8) 
where is the slack time threshold. We set in this paper. The weight of node is , where is the coefficient regulator for the urgency of the scheduling migration. We set . Moreover, in the situation that the priorities of all migrations are the same, we only need to consider the size of MIS. The node weight is set to 1 . In each iteration, the lowerbound of the maximum (weighted) independent set is [33]. As iteration is in the worst case, the time complexity of iterGWIN is for weighted graph and for unweighted graph.
5.2 The Maximum Cliquesbased Heuristics
In this section, based on the observation of the density property of migration resource dependency graph, we propose the iterative Maximum Cliques (MCs)based algorithm. We first discuss the rationals of the proposed algorithm.
The degeneracy of a graph G is the smallest number d such that every subgraph of G contains a vertex of degree at most d. It is a measure for the graph spareness. For an nvertex graph with degeneracy , by introducing the sequence ordering based on degeneracy, BronKerbosch Degeneracy algorithm [10] can list all maximal cliques in time . With a spare graph that , the upper bound of all maximal cliques number is . Figure 6 illustrates the nodes and the density (degeneracy) of the resource dependency graph of WAN network topologies [15] and its complement. It shows that the degeneracy of the complement graph is 4.34 times that of . For and its complement graph, the average ratio of dependency to the total number of nodes is 0.153 and 0.714, respectively. The resource dependency graph is considerably more sparse than its complement graph. Therefore, for , there are much fewer maximal cliques than the total MIS. As a result, according to the theoretical time complexity, the running time of listing all maximal cliques or maximum clique of is much smaller than that of listing all maximal independent sets or maximum independent set of . Therefore, the iterative Maximum Cliques (MCs)based heuristics algorithm has two steps: (1) calculate the list of iterative maximum cliques and (2) generate the iterative maximal independent set based on the list. As nodes from one maximal clique can not be included into the same independent set, the iterative maximum cliques serve as a heuristic pruning decider to speed up the algorithm.
5.2.1 Iterativerounds MCs algorithm
Let denote the maximum clique and denote the maximal cliques list of round graph. The iterativerounds Maximum Cliques (MCs)based heuristic algorithm (Algorithm 3) follows two steps: (1) generating the maximum clique iteratively and (2) obtaining the MIS from the iterative maximum cliques.
As shown in Algorithm 3, we first create dependency graph as the input based on the sourcedestination of the given migrations and the network topology. From line 16, the algorithm calculates the iterative maximum cliques of the dependency graph until there is no vertices left. In each iteration, it generates the maximum clique (BronKerbosch Degeneracy algorithm) [10] of the remaining graph. It is proved that the algorithm is highly efficient in a sparse graph, such as the resource dependency graph [10]. Then, it updates the remaining graph by deleting the nodes of the maximum clique from . Let denote the degree of node to the remaining graph which excludes all nodes in the clique. The node score can be represented as:
(9) 
In the second step (line 712), it generates maximal independent sets based on the iterative maximum cliques. In each round (line 911), it selects the feasible node with maximum score of each maximum clique and adds largestweight migration from its list into the independent set. A node is feasible when it can be included in the current independent set. If there is no migrations left in the migration list of the selected node , the selected node is removed from the clique. As the largest possible number of maximal cliques in an nvertex graph with degeneracy d is . Therefore, according the iterMCs algorithm, the upper bound of the size of the iterative maximum independent set of each iteration is also . In the worst case, the time complexity of iterMCs is .
Theorem 1 (Correctness of MIS from Maximal Cliques).
The Independent Sets generated from maximal cliques are the maximal independent sets of the graph.
Proof.
is one of the independent sets generated from the maximal cliques of , where one vertex comes from only one maximal clique . Assume, for the sake of contradiction, there is at least one vertex , exists, that is also an independent set. That is, there is no edge between and any other vertex , . Based on the definition of the heuristic algorithm, we can get , , that , where . Thus, , where , that and , which is impossible. Since, we have a contradiction, it must be that is a maximal independent set. ∎
5.2.2 SingleRound MCs Algorithm
Furthermore, we propose a singleround MCsbased algorithm (singleMCs). It generates the optimal iterative maximum cliques only based on the all maximal cliques of the initial dependency graph . The maximum clique size of each iteration is the same as the iterMCs. We also prove the correctness of the proposed singleround iterative maximum cliques algorithm.
The first step of the iterMCs algorithm is replaced by Algorithm 4. The algorithm only generates the list of all maximal cliques once by using the BronKerbosch Degeneracy algorithm. Until there is no vertices left in the clique list, it selects the maximum clique (largest maximal clique) from the list and deletes the nodes of the selected maximum clique from all maximal cliques.
Theorem 2 (Correctness of the algorithm singleMCs).
Given a graph , the single iteration algorithm SINGLEMCs generates all and only iteration maximum cliques.
Proof.
It is proven that the BronKerbosch Degeneracy algorithm generates all and only maximal cliques without duplications [10]. Then, we only need to prove the results of iterative maximum cliques are the same in iterMCs and singleMCs, i.e., one can get all the iterative maximum cliques based on the maximal cliques of the original graph by deleting the vertices from the maximum clique in the last round.
Let denote all maximal cliques of the original graph , where . , that . The next iteration graph is . Then, . The output of first round of singleMCs is .
Assume, for the sake of contradiction, there is one maximal clique , , which and . Based on the algorithm singleMCs and definition of maximal clique, due to , is also a maximal clique that . However, as is the maximum clique of , it is impossible that . Since, we have a contradiction, the is not exist. Therefore, .
∎
6 Graph Algorithm Performance and Analysis
In this section, we evaluate proposed migration planning algorithms for the problem of iterative MIS generation: (1) iterMCs (2) singleMCs; (3) approximation; and (4) iterGWIN, in processing time, maximal independent set size, and iteration rounds. Based on more than two hundred real network WAN topologies [15], we consider a set of live migration requests with each source and destination combination. Each migration request corresponds to one combination with the network routing of the shortest path. We run the computational experiments in Python 3.6.3 and NetworkX package [11] version 2.4 as the graph library with source code.
algorithm  proc. time (s)  total sets  max()  mean()  95%()  99%() 

singleMCs  8.8115 1.0047 0.1554  164.5 75.0 30.0  88.0 54.0 36.0  8.1594 6.1667 5.0  23.05 16.8 12.825  45.9 25.8 17.7 
iterMCs  49.1566 4.5807 0.4723  165.0 75.0 30.0  88.0 54.0 36.0  8.1594 6.2124 5.0  23.0 16.8 12.65  45.6 26.0 17.7 
iterGWIN  14.2786 1.4916 0.1610  159.5 76.0 31.0  88.0 54.0 36.0  8.2844 6.3448 5.1909  24.8 18.0 13.15  48.9 27.0 18.6 
approx  1115.2929 57.2547 5.5257  171.5 84.0 32.0  59.0 36.0 25.0  7.7568 5.9492 4.6946  21.6 15.85 12.0  36.8 23.2 15.8 
Performance comparison with first, second, and third quartile of processing time, total MIS number (iteration), maximum, mean, 95th, and 99th quartile of the independent set size in each result of the total 202 WAN topologies
The iterative maximum clique generation of migration dependency graph is faster than that of iterative MIS in three aspects: (1) As the analysis of dependency graph in section 5.2, dependency graph is more sparse than its complement . Therefore, getting the maximum clique of in one iteration is faster than that of ; (2) The maximum clique can reduce the complexity of the graph much more efficiently in each iteration; and (3) There are fewer iterative maximum cliques of than the iterative independent sets. In other words, the number of iteration rounds of the iterative maximum clique is smaller.
Figure 7 demonstrates an illustrative result of one of the network topology (Australia’s Academic and Research Network, AARNet). The dependency graph consists of a total of 342 nodes and 11754 edges. It shows the degree of the maximum clique and independent set in each iteration to the remaining nodes. In other words, it is the edges of the removed nodes in each iteration excluding the edges between nodes from the maximum clique. Note that there is no edges (degree is zero) between nodes in one independent set. With the degree in the maximum clique and the degree to the remaining graph, the complexity of is dropped dramatically in the first three iterations. On contrary, by removing the maximum independent set, the complexity of the graph remains at a high level and declines steadily. Furthermore, the number of total iterative maximum cliques and iterative MISs is 47 and 70, respectively. Comparing the result of the approximation (indep_approx) with iterMCs (indep_heu), the heuristic iterative MCsbased algorithm achieves better performance in the size of the maximum clique in each iteration and the total iteration rounds.
Since the processing time varies greatly, we use two separated figures to represent the results of processing time. Figure 8 shows the performance comparison between the approximation (approx) and iterMCs in processing time. Figure 9 shows the comparison between iterMCs, singleMCs and iterGWIN. The results of computational experiments indicate that the approximation algorithm has the worst performance in processing time. From approx to iterMCs (Fig. 8), the average processing time of all topologies decreases by . From iterMCs to iterGWIN and iterGWIN to singleMCs, the average processing time decreases by and . Table II also illustrates the third (Q3), second (mean), and first quartile (Q1) of the average processing time. For the dependency graph with every source and destination combinations of a relative small size network, the singleMCs and iterGWIN can both generate the scheduling plan in around 0.15 seconds. However, the performance difference in processing time increases with the size of the network topology. For mean and the Q3 of all processing time results, the average processing time of singleMCs decreased by and from iterGWIN, respectively. In summary, the singleMCs algorithm has the best performance in processing time.
We also evaluate the size of the result list or iteration rounds . It is the number of sets the algorithm divides into different concurrent groups for the given migrations. For the approx algorithm, from Q3 to Q1, it generates 171.5, 84.0, and 32.0 many of iterative MIS in one planning result. From approx to iterMCs, the iteration number decreases by , , and , respectively.
For the performance in iterative MISs of each graph, we examine the size of the largest iterative MIS (max()) and the mean size (mean()). As the first several rounds of the result are the most essential factors on scheduling performance, we also evaluate the algorithm in the 95quartile and 99quartile of the iterative MISs size. The algorithm iterGWIN has the best performance in the large network topology. The total number of iterative MIS is reduced by compared to the results of singleMCs. Although the mean results of the set size mean() of approx algorithm is close to other three algorithms, its performance in the first several iterations is the worst. As a result, the total set of approx algorithm is significantly larger than other algorithms. For the maximum set size, singleMCs, iterMCs and iterGWIN has the identical performance in Q1, mean, and Q3 from all results of network topologies. For the 95th and 99th quartile iterGWIN for directly calculate the maximum clique has a slightly better performance over the iterative MCsbased heuristic algorithms even though the processing time is higher.
7 Simulation and Performance Evaluation
In this section, we evaluate proposed solutions using realworld traces on an event driven simulator. We first describe the realworld telecom base station dataset and taxi GPS traces used in the experiments. We explain the placement of edge data centers and the network topology and region coverage of each EDC. The eventdriven simulator for softwaredefined networkenabled edgecloud computing CloudSimSDN [36] is extended to emulate the the user movement and the live container migration in edge computing. It provides a network operating system based on the softwaredefined networking for dynamic service and network resource monitoring and allocation. Compared to the simulation results driven by mathematical models, this can generate more realistic results without following the strong assumption encoded in the proposed mathematical modeling.
We compare and evaluate the performance of live container migration planning and scheduling algorithm (iterGWIN and singleMCs) against a policy with no planning scheduling and the stateofart live VM migration cloud algorithm FPTAS [44] in processing time, migration time, downtime, transferred data, deadline violations, and network transmission time.
7.1 Experimental Data
In this section, we describe the base stations coordinates provided by Shanghai Telecom dataset^{1}^{1}1http://sguangwang.com/TelecomDataset.html and Shanghai Qiangsheng taxi GPS trace dataset (April 1, 2018)^{2}^{2}2http://soda.shdataic.org.cn/download/31 used in our experiments. The given data is preprocessed by limiting the range of the longitude and latitude from N to N and E to E as there are some taxis travel to nearby cities. The Shanghai Telecom dataset contains the longitude and latitude coordinates of a total of 3233 base stations as shown in Fig. 9(a)
. We use Kmeans algorithms
[51] to generate the location of a total of 200 Edge Data Centers (EDCs) based on the longitude and latitude of the given base stations. Figure 9(b) illustrate the taxi GPS trace in the first hour. Besides the GPS coordinates and timestamp, each data record of the taxi dataset also includes the taxi id, service status, such as alarm, occupation, taxi light, road type, and breaking, as well as vehicle speed, direction, and the number of connected satellites.Figure 9(c) illustrates base stations are clustered and connected to one of the regional Edge Data Centers. There is no information on the physical network topology and connectivity between EDCs. As shown in Fig. 9(c), for the geometric spanner, we choose Delaunay Triangulation [43] to generate links between the gateway of each EDC. For the network routing within the generated network topology, we consider the shortest path, which is no longer than times the Euclidean distance between source and destination. As a result, the boundary of EDC regions (Fig. 9(d)) is a Voronoi diagram [43] where the Euclidean distance of any point to its corresponding EDC region is less than or equal to its distance to any other EDC.
Similar to other research regarding the generation of mobilityinduced live migrations in edge computing [48, 45], we combine these two datasets to simulate the scenarios where the user needs to connect to the services and maintains the low endtoend latency through live container migration in edge computing environments. Figure 11 demonstrates an example that the request of live container migration is induced when a taxi moves across the boundary between two clusters of EDCs. The deadline of each live container migration is generated based on the average mobility speed of users in the last 3 GPS records, travel direction, and the signal strength of base stations.
7.2 Experimental Setup
Scenario  S1  S2  S3 

vehicles  1000  2000  4000 
migrations  9933  19522  37822 
In this section, we describe details of the experiment setup. The endtoend delay between the user and the service is the time interval from the user (taxi) sent workload to the container assigned in the EDC to the result is received by the user. To generalize computer vision use case workloads, the service task generated during the experiments follows the Poisson distribution with a mean of 24 per second (24 FPS). In each task, the network packet size sent from a user is 16384 bytes (
bytes). The processing workloads in the container are randomly generated from 500 to 1000 cycles per bit [45]. The result packet sent back from the container to the user is 128 bytes. The sum CPU power frequency for each EDC with multiple CPUs is 25 GHz [37, 49]. To simulate the limited network resources for migrations in the edge, we consider that the reserved network bandwidth between a container and its user is 3 Mbps. The physical network bandwidth is 1 Gbps. The network delay between any based station to its regional EDC is 5 ms and the delay between two EDCs is randomly generated in the range 5 to 50 ms [45].According to the evaluation results of container memory and dirty memory size during live container migrations [17], we generate the container memory from 100 MB to 400 MB. The dirty page rate for each dirty memory transmission is from 2MB/s to 8MB/s and the data compression rate is 0.8 [38]. We configure the downtime threshold and the maximum iterations for live container migration at 0.5 seconds and 30 times [13], respectively. Based on the SDN controller, the remaining network bandwidth between the source and destination EDC which is not utilized by services is allocated to the live container migration traffic. If several live migrations are sharing part of their routings, the bandwidth will be allocated evenly to each of the network flows.
From the experimental scenario S1 to S3 (Table III), 1000, 2000 and 4000 vehicles are selected randomly. We consider the GPS trace of selected vehicles within 1 hour. For the initial placement at the start of the experiment, we allocate corresponding containers for each vehicle at the same edge data center according to its GPS coordinates. The nearest edge data center first policy is considered for our experiment to generate the live container migration requests. According to the user mobility, one live container migration will be triggered when one vehicle exits the coverage area of its current edge data center. There are 9933, 19522, and 37822 migration requests induced by these vehicles’ movement, respectively. During the live container migration, the dirty memory of migrating container will be copied iteratively from the source edge data center to the nearest edge data center through the shortest network path. For the evaluation sensitivity, the results of each scenario are an average of 10 individual experiments. In this experiment, we consider that the container image as a universal service is already available in all edge data centers or shared by the network storage between EDCs. CloudSimSDNNFV [36], an eventdriven simulator, is extended with corresponding components to support the live container migration and user mobility in edge computing environments.
7.3 Experimental Results and Analysis
algorithm  S1  S2  S3 

iterGWIN  306.9607  762.3356  3997.8309 
singleMCs  332.5682  583.3951  1544.6291 
FPTAS[44]  903597.39  1923036.81  4677990.57 
In Section 6, we compare the algorithm performance in terms of the size of iterative MISs and processing time. Thus, we only evaluate the two best algorithms in this section. We compare the experimental results between no migration scheduler, iterGWIN, singleMCs, and the current stateoftheart migration planning and scheduling in clouds FPTAS [44]. In FPTAS, to maximize the total bandwidth utilized by migrations, one migration can be started even there is considerably limited bandwidth which is much lower than the dirty page rate per second. The solution can cause devastating migration performance. Thus, we improve FPTAS by adding a bandwidth threshold (FPTASBW) that the available bandwidth must larger than the dirty page rate as the migration start condition. As the vehicle number increases from scenario 1 (S1) to scenario 3 (S3), the density of live migration requests in certain areas increases dramatically. The resource competition or resource dependency among live container migration requests will also increase. As a result, the complexity of the dependency graph may also increase. When the requirements of live container migration requests exceed the resource capacity provided by the edge computing, it is inevitable that some of the deadlines of some migration requests can not be satisfied.
Table IV shows the total processing time of migration planning and scheduling algorithms within 1 hour in milliseconds. From S1 to S3, the average processing time of singleMCs for each migration planning is 0.1175, 0.1936, and 0.4904 milliseconds. Compared to iterGWIN, the processing time of singleMCs decreased by in scenario S3. The results are consistent with the algorithm evaluation in Section 6. Furthermore, compared to FPTAS [44], the performance of our solution in terms of processing time has been improved by more than 3000 times. In S3, the processing time of FPTAS is about 78 minutes. As a result, even with any weight modification in the algorithm, the migration deadline in seconds will be missed. Therefore, as the results of FPTASBW in deadline violation are off the limit of chart comparison, we only compare it in the migration performance.
From S1 to S3, without migration planning and scheduling, more live migrations compete with each other on the network routing and the available bandwidth. As a result, the average migration time increases dramatically from 2.25 and 4.59 seconds to 299.89 seconds (Fig. 11(a)). Particularly, in S3, the allocated bandwidth may either be smaller than the dirty page rate and cause a large downtime for some migrations. Or, it causes a much longer migration time due to a large number of memorycopying iterations. As a result, the migrating service suffers a devastating consequence. Furthermore, for FPTASBW, by maximizing the total migration bandwidth rather than the resource competitions, it suffers smaller average bandwidth per migration. Thus, as shown in Fig. 12 the performance of our purposed solution in terms of average migration time, average downtime, and total transferred data are increased by up to , , and , respectively. Meanwhile, for the proposed planning and scheduling algorithms iterGWIN and singleMCs, the performance of live migration can be guaranteed even with severe resource competitions. Results (Fig. 11(a), 11(b)) show that the average migration time and downtime are optimal at 1.9 sand 0.13 seconds as there is no bandwidth sharing between resourcedependent migrations. Furthermore, for all the migrations that arrive within the 3600 seconds time interval in S3, iterGWIN and singleMCs can finish the scheduling of all migrations in 3603.91 and 3601.43 seconds. However, the total migration time of no scheduler is 3603.43 seconds in S2 and 48878.65 seconds in S3. A shorter average migration means less possibility of QoS degradation and less occupation time on the network resource. A smaller downtime equals fewer disruptions on the migrating services.
Another critical migration performance is the transferred data of the live migration. It is also highly related to network energy efficiency. In S1 and S2, although average migration time and downtime increase due to less allocated bandwidth, there is no surge in the transferred data for the no migration scheduling situation (Fig. 11(c)). Because of the container’s small memory footprint, the shared bandwidth can still satisfy the downtime threshold with relatively small memorycopying iterations. However, when the bandwidth becomes the bottleneck, a large number of memorycopying iteration needed to meet the downtime threshold. Therefore, the total transferred data in S3 increase by compared with the optimal result from singleMCs.
The deadline of a live migration request is highly related to the QoS and SLA requirement of the realtime migrating service. For iterGWIN and singleMCs, the ratio of migration violation numbers to the total migration number is and in S2 and and in S3 (Fig. 11(d)). However, the ratio for no migration scheduler is 3.07 times in S2 and 8.46 times compared to the best result from iterGWIN. The ratio of total violation time to the service time of all containers in one hour is and in S2 and and in S3, respectively (Fig. 11(e)). In S3, although migration performance in terms of migration time and downtime is optimized by the migration scheduler, the network resource is insufficient to schedule all 37822 migration requests on time with the live migration competitions. It is inevitable to violate the deadline of certain migrations with lower priority to satisfy the deadline for others. As a solution, one needs to increase the network resource by providing duplicate EDCs and additional network routing or available bandwidth in the hot spot to alleviate the deadline violation of realtime migrations.
The endtoend delay for the migrating edge service is affected by the migration downtime and the duration of deadline violation. For the network transmission time, we compare the results of no user movement and no migration, no migration requests with user movement, no scheduler, iterGWIN and singleMCs (Fig. 11(f)). In the scenario that all vehicles stay at the s and do not move during the experiment time (nomov), the average network transmission time to the service or the enduser is from 17.4 to 19.9 milliseconds from S3 to S1. Without the live migration requests (nomig), the endtoend delay can be not guaranteed due to the network delay between the EDC and the enduser. Specifically, the average network transmission time is around 56 milliseconds. The live migration planning and scheduling algorithm (iterGWIN and singleMCs) can guarantee the average service network transmission time. In S3, without a migration scheduler, the downtime and deadline violation have a considerable impact on the service network delay. The network delay increases by 6.62 times compared to the result of iterGWIN.
In summary, our proposed algorithms can efficiently plan and schedule largescale mobilityinduced live container migrations in edge computing. Even in the case of a migration request surge, it guarantees the performance of live container migrations and maintains the QoS of migrating services. It significantly reduces average migration time (up to ), average down time (up to ), total deadline violations (up to ) and violation time (up to ).
8 Conclusions and Future Work
In this paper, we investigated the challenges of live container migration scheduling in edge computing environments including (1) resource competition or dependency among live migrations and (2) realtime migration planning and scheduling. We modeled the relationship of resource dependency among migrations as an undirected graph. and the scheduling problem as generating the maximum independent set of the dependency graph iteratively. We proposed a framework for usertriggered or mobilityinduced migration scheduling which is different from the traditional scheduling for live VM migrations in cloud data centers. The SDN is introduced to separate the computer network to minimize the impact of migration flows on other edge services. Based on the dynamic computing resources, network resources and topology provided by the container/VM orchestration engine and SDN controllers, the migration management service can plan and schedule multiple migration requests in a finegrained manner. We proposed two methods for largescale migration planning and scheduling algorithms based on iterative Maximal Independent Sets. Computational experiments were conducted to evaluate the algorithms’ performance. Furthermore, the results of experiments based on realworld data indicate that proposed algorithms can efficiently plan and schedule largescale mobilityinduced live container migrations in a complex network environment in a timely manner, while maintaining the QoS of migrating services. It can optimize the live migration performance and minimize the deadline violation in migration scheduling. As part of the future work, we intend to investigate base station clustering for EDC placement based on user mobility information to reduce the number of live migrations.
Acknowledgment
The authors thank Shashikant Ilager and Mohammad Goudarzi for their valuable comments and suggestions.
References
 [1] (2014) CQNCR: optimal vm migration planning in cloud data centers. In Proceedings of the Networking Conference, 2014 IFIP, pp. 1–9. Cited by: §1, §1, TABLE I, §2, §2, §4.2, §4.3, §5.1.2.
 [2] (2012) Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in cloud data centers. Concurrency and Computation: Practice and Experience 24 (13), pp. 1397–1420. Cited by: §1.
 [3] (1992) Approximating maximum independent sets by excluding subgraphs. BIT Numerical Mathematics 32 (2), pp. 180–196. Cited by: §5.1.1.
 [4] (1973) Algorithm 457: finding all cliques of an undirected graph. Communications of the ACM 16 (9), pp. 575–577. Cited by: §4.2, §4.5, §4.5.
 [5] (2008) A note on the problem of reporting maximal cliques. Theoretical Computer Science 407 (13), pp. 564–568. Cited by: §4.4, §4.5.
 [6] (2005) Live migration of virtual machines. In Proceedings of the 2nd conference on Symposium on Networked Systems Design & ImplementationVolume 2, pp. 273–286. Cited by: §1, §1, §2.
 [7] (accessed 22 Jan 2020) Container migration with Podman on RHEL. External Links: Link Cited by: §1.
 [8] (2019) Live migration. External Links: Link Cited by: §1, §2, §3.1, §4.1.
 [9] (2019) Containers vs virtual machines: choosing the right virtualization technology for mobile edge cloud. In 2019 IEEE 2nd 5G World Forum (5GWF), pp. 46–52. Cited by: §1, §2.
 [10] (2010) Listing all maximal cliques in sparse graphs in nearoptimal time. In International Symposium on Algorithms and Computation, pp. 403–414. Cited by: §5.2.1, §5.2.2, §5.2.
 [11] (2008) Exploring network structure, dynamics, and function using networkx. Technical report Los Alamos National Lab.(LANL), Los Alamos, NM (United States). Cited by: §6.
 [12] (2021) SLAaware multiple migration planning and scheduling in sdnnfvenabled clouds. Journal of Systems and Software 176, pp. 110943. Cited by: §1.
 [13] (2019) Performance evaluation of live virtual machine migration in sdnenabled cloud data centers. Journal of Parallel and Distributed Computing 131 (), pp. 55–68. External Links: ISSN 07437315 Cited by: §2, §3, §4.1, §4.2, §7.2.
 [14] (2015) Mobile edge computing—a key technology towards 5g. ETSI white paper 11 (11), pp. 1–16. Cited by: §1.
 [15] (2011) The internet topology zoo. IEEE Journal on Selected Areas in Communications 29 (9), pp. 1765–1775. Cited by: Fig. 6, §5.2, §6.
 [16] (1980) Generating all maximal independent sets: nphardness and polynomialtime algorithms. SIAM Journal on Computing 9 (3), pp. 558–565. Cited by: §4.4, §4.5, §4.5.
 [17] (2018) Efficient live migration of edge services leveraging container layered storage. IEEE Transactions on Mobile Computing 18 (9), pp. 2020–2033. Cited by: §1, §2, §7.2.
 [18] (2017) Efficient service handoff across edge servers via docker container migration. In Proceedings of the Second ACM/IEEE Symposium on Edge Computing, pp. 1–13. Cited by: §1, §1, §2.
 [19] (2017) Live service migration in mobile edge clouds. IEEE Wireless Communications 25 (1), pp. 140–147. Cited by: §1, §2.
 [20] (2018) Task migration at scale using criu. In Linux Plumbers Conference, Cited by: §1.
 [21] (2008) OpenFlow: enabling innovation in campus networks. ACM SIGCOMM computer communication review 38 (2), pp. 69–74. Cited by: §1.
 [22] (2014) A survey of migration mechanisms of virtual machines. ACM Computing Surveys (CSUR) 46 (3), pp. 1–33. Cited by: §2.
 [23] (2008) Containers checkpointing and live migration. In Proceedings of the Linux Symposium, Vol. 2, pp. 85–90. Cited by: §1, §2.
 [24] (2012) Dynamic resource management using virtual machine migrations. IEEE Communications Magazine 50 (9), pp. 34–40. Cited by: §2.
 [25] (1965) On cliques in graphs. Israel journal of Mathematics 3 (1), pp. 23–28. Cited by: §4.5.
 [26] (2017) Voyager: complete container state migration. In 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), pp. 2137–2142. Cited by: §2, §4.1.
 [27] (2017) Network slicing for 5g with sdn/nfv: concepts, architectures, and challenges. IEEE Communications Magazine 55 (5), pp. 80–87. Cited by: §1.
 [28] (2015) The design and implementation of open vswitch. In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15), pp. 117–130. Cited by: §1.
 [29] (2019) A survey on mobilityinduced service migration in the fog, edge, and related computing paradigms. ACM Computing Surveys (CSUR) 52 (5), pp. 1–33. Cited by: §1, §1, §1, §2, §2.
 [30] (1986) Algorithms for maximum independent sets. Journal of Algorithms 7 (3), pp. 425–440. Cited by: §4.5.
 [31] (2001) Finding a maximum independent set in time o (2n/4). Technical report Technical Report 125101, LaBRI, Université Bordeaux I. Cited by: §4.5.
 [32] (2018) Vm live migration at scale. ACM SIGPLAN Notices 53 (3), pp. 45–56. Cited by: §1.
 [33] (2003) A note on greedy algorithms for the maximum weighted independent set problem. Discrete applied mathematics 126 (23), pp. 313–322. Cited by: §5.1.2, §5.1.2.
 [34] (2017) The emergence of edge computing. Computer 50 (1), pp. 30–39. Cited by: §1.
 [35] (201805) A taxonomy of softwaredefined networking (sdn)enabled cloud computing. ACM Comput. Surv. 51 (3), pp. 59:1–59:36. External Links: ISSN 03600300 Cited by: §1, §3.
 [36] (2019) CloudSimSDNnfv: modeling and simulation of network function virtualization and service function chaining in edge computing environments. Software: Practice and Experience 49 (12), pp. 1748–1764. Cited by: §7.2, §7.
 [37] (2017) EMM: energyaware mobility management for mobile edge computing in ultra dense networks. IEEE Journal on Selected Areas in Communications 35 (11), pp. 2637–2646. Cited by: §7.2.
 [38] (2011) Evaluation of delta compression techniques for efficient live migration of large virtual machines. ACM Sigplan Notices 46 (7), pp. 111–120. Cited by: §7.2.
 [39] (1977) Finding a maximum independent set. SIAM Journal on Computing 6 (3), pp. 537–546. Cited by: §4.5.
 [40] (2006) The worstcase time complexity for generating all maximal cliques and computational experiments. Theoretical computer science 363 (1), pp. 28–42. Cited by: §4.5, §4.5.
 [41] (2017) Live vm migration under timeconstraints in sharenothing iaasclouds. IEEE Transactions on Parallel and Distributed Systems 28 (8), pp. 2285–2298. Cited by: §3.
 [42] (2015) Largescale cluster management at google with borg. In Proceedings of the Tenth European Conference on Computer Systems, pp. 1–17. Cited by: §1.
 [43] (2020) SciPy 1.0: fundamental algorithms for scientific computing in python. Nature methods 17 (3), pp. 261–272. Cited by: §7.1.
 [44] (2017) Virtual machine migration planning in softwaredefined networks. IEEE Transactions on Cloud Computing. External Links: ISSN 21687161 Cited by: §1, §1, TABLE I, §2, §2, §4.2, §4.3, §7.3, §7.3, TABLE IV, §7.
 [45] (2019) Delayaware microservice coordination in mobile edge computing: a reinforcement learning approach. IEEE Transactions on Mobile Computing. Cited by: §1, §1, §2, §7.1, §7.2.
 [46] (2018) A survey on service migration in mobile edge computing. IEEE Access 6, pp. 23511–23528. Cited by: §1, §1, §2, §2.
 [47] (2015) Dynamic service migration in mobile edgeclouds. In 2015 IFIP Networking Conference (IFIP Networking), pp. 1–9. Cited by: §1, §1, §2.
 [48] (2019) Dynamic service migration in mobile edge computing based on markov decision process. IEEE/ACM Transactions on Networking 27 (3), pp. 1272–1288. Cited by: §1, §1, §2, §7.1.
 [49] (2017) QoE and power efficiency tradeoff for fog computing networks with fog node cooperation. In IEEE INFOCOM 2017IEEE Conference on Computer Communications, pp. 1–9. Cited by: §7.2.
 [50] (2017) A survey on load balancing algorithms for virtual machines placement in cloud computing. Concurrency and Computation: Practice and Experience 29 (12), pp. e4123. Cited by: §2.
 [51] (2015) Efficient algorithms for capacitated cloudlet placements. IEEE Transactions on Parallel and Distributed Systems 27 (10), pp. 2866–2880. Cited by: §7.1.
Comments
There are no comments yet.