2022
DOI: 10.1109/tmc.2021.3061602
|View full text |Cite
|
Sign up to set email alerts
|

Cooperative Service Placement and Scheduling in Edge Clouds: A Deadline-Driven Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
4
1
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 28 publications
(17 citation statements)
references
References 40 publications
0
17
0
Order By: Relevance
“…In addition, this model closely considers the scaling of VM's (e.g., number and type: small, medium and large) during the deployment period at every time step. In the same fashion, Li et al [24] proposed a heuristic approach to resolve the cooperative service placement and scheduling framework for cost optimization under varying user demands by considering the deadline constraint. Similarly, Yu et al [25] derived a novel strategy that used a centralized approach to address the joint task unloading and resource scheduling problem in the Mobile Edge Cloud paradigm.…”
Section: Scheduling Problems In the Edge Cloudmentioning
confidence: 99%
See 2 more Smart Citations
“…In addition, this model closely considers the scaling of VM's (e.g., number and type: small, medium and large) during the deployment period at every time step. In the same fashion, Li et al [24] proposed a heuristic approach to resolve the cooperative service placement and scheduling framework for cost optimization under varying user demands by considering the deadline constraint. Similarly, Yu et al [25] derived a novel strategy that used a centralized approach to address the joint task unloading and resource scheduling problem in the Mobile Edge Cloud paradigm.…”
Section: Scheduling Problems In the Edge Cloudmentioning
confidence: 99%
“…We have segregated the heuristic algorithms based on multiple factors by analyzing the keywords from the article title and abstract. As a result, the categories in our taxonomy includes Adaptive and Dynamic Approach [14,16,22,27,28,[32][33][34]36], Greedy Approach [37,41], QoS Parameters Based Approach [15,[23][24][25]42,44,[46][47][48][49], Machine Learning Based Approach [18,29,[53][54][55][56][57][58], Distributed Approach [17,30,43,45,50,51,60,61], Incentive Based Approach [62], Prediction Based Approach [19,35] and Others [20,21,26,38,39,59]. Review of different heuristic scheduling techniques together with dominance and drawbacks depicted in Table 4,5 and 6.…”
Section: Heuristic Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…In addition, this model closely considers the scaling of VM's (e.g., number and type: small, medium and large) during the deployment period at every time step. In the same fashion, Li et al [23] proposed a heuristic approach to resolve the cooperative service placement and scheduling framework for cost optimization under varying user demands by considering the deadline constraint. Similarly, Yu et al [24] derived a novel strategy that used a centralized approach to address the joint task unloading and resource scheduling problem in the Mobile Edge Cloud paradigm.…”
Section: Scheduling Problems In the Edge Cloudmentioning
confidence: 99%
“…Consequently, finding valid deployment options becomes exponentially harder with each added component and is infeasible for larger deployments. Tong et al 38 and, to some extent Heintz et al 36 take a similar approach to FogTorch, while 4‐7,35,39‐55 employ a more efficient heuristics approach to solve the formalized optimization problem. Naas et al 56 offer a heuristics‐based solution as well, but place data replicas rather than services, a challenge that is also addressed in References 57,58.…”
Section: Related Workmentioning
confidence: 99%