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

A Bifactor Approximation Algorithm for Cloudlet Placement in Edge Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(6 citation statements)
references
References 37 publications
0
4
0
Order By: Relevance
“…Comparisons were made between meta-heuristic and heuristic algorithms, meta-heuristic and greedy algorithms, reinforcement learning and mathematical programming. In addition, research studies such as [44] have compared metaheuristic and unsupervised learning algorithms, while [65] has compared meta-heuristic and mathematical programming, with results consistently demonstrating the superiority of meta-heuristic algorithms.…”
Section: ) Cloudlet Mobilitymentioning
confidence: 99%
“…Comparisons were made between meta-heuristic and heuristic algorithms, meta-heuristic and greedy algorithms, reinforcement learning and mathematical programming. In addition, research studies such as [44] have compared metaheuristic and unsupervised learning algorithms, while [65] has compared meta-heuristic and mathematical programming, with results consistently demonstrating the superiority of meta-heuristic algorithms.…”
Section: ) Cloudlet Mobilitymentioning
confidence: 99%
“…In addition to the aforementioned studies, recent papers have made significant contributions to the field of edge-server placement. For instance, [27] proposed novel approaches for addressing the challenges in deploying edge servers. Their work focused on optimising the placement of edge servers in order to minimise latency and enhance network performance.…”
Section: Edge-servers Placement Approachmentioning
confidence: 99%
“…Unlike previous approaches, such as refs. [27][28][29], that rely on network size for edge server selection, it offers a more robust and tailored solution. In addition, one significant advantage of this study is the careful selection of sites, ensuring that they are located within one hop from the connected sites.…”
Section: -Scenarios 2 and 3 (20 And 30 Points Respectively)mentioning
confidence: 99%
“…The authors reassigned the mobile users to complete the cloudlet placement to balance the workload of each cloudlet, thus minimizing the response time of the system. Bhatta et al [24] formulated the cloudlet placement problem as a multi-objective integer programming model and showed that it is a computationally NP-hard problem. The authors then proposed a bifactor approximate cloudlet placement (ACP) to tackle its intractability.…”
Section: Related Workmentioning
confidence: 99%