2019
DOI: 10.1109/jiot.2019.2935056
|View full text |Cite
|
Sign up to set email alerts
|

Joint Container Placement and Task Provisioning in Dynamic Fog Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 60 publications
(26 citation statements)
references
References 35 publications
0
26
0
Order By: Relevance
“…(4) Using real-life data (daily call arrivals in 6 months of 2020) and synthetic data (capabilities of devices), we experimentally verify the effectiveness and efficiency of our proposed method. Compared with five stateof-the-art methods for task scheduling, i.e., linear programming (LP [21]), integer programming (IP [22]), MIP [16]), improved particle swarm optimization (IPSO [23]), and multiobjective evolutionary algorithm-based decomposition (MOEAD [24]), we find that PACAM is at least two orders of magnitude faster than the above methods.…”
Section: Motivation Example (Internet Of Vehicle)mentioning
confidence: 95%
“…(4) Using real-life data (daily call arrivals in 6 months of 2020) and synthetic data (capabilities of devices), we experimentally verify the effectiveness and efficiency of our proposed method. Compared with five stateof-the-art methods for task scheduling, i.e., linear programming (LP [21]), integer programming (IP [22]), MIP [16]), improved particle swarm optimization (IPSO [23]), and multiobjective evolutionary algorithm-based decomposition (MOEAD [24]), we find that PACAM is at least two orders of magnitude faster than the above methods.…”
Section: Motivation Example (Internet Of Vehicle)mentioning
confidence: 95%
“…Unlike traditional 5G telco data centers, these are characterized by sporadic resources availability, mobility, and increased flexibility. Proposals made on distributed redundant placement frameworks, resource management algorithms and server selection algorithm [21] and [22] are primarily done to bring microservice applications on cloud closer to the devices i.e. network edge.…”
Section: Related Workmentioning
confidence: 99%
“…The aforementioned algorithms and design are most suitable with fog/edge computing especially when combined with Internet of Things type of data. These proposals [20], [21] and [22] focus on enabling ability to have stateless services deployed on the fly but do not share light on how heavy stateful services can be managed on a containerization and micro-service 5G telco cloud environment.…”
Section: Related Workmentioning
confidence: 99%
“…We also introduce different placement mechanisms to account for device discovery, failures and overloads. Mseddi et al (2019) introduce service placement implemented by the means of particleswarm optimization, a greedy algorithm, and an exact optimization. The goal of their placement is to maximize the number of executed applications adhering to their time constraints.…”
Section: Service Placementmentioning
confidence: 99%