Year: 2025
Type: article
Abstract: Edge computing, characterized by its proximity to users and fast response times, is considered one of the key technologies for addressing low-latency demands in the future. An appropriate edge server deployment strategy can reduce costs for service providers and improve the quality of service for users. However, most previous studies have focused on server coverage or deployment solution consumption time, often neglecting the most critical aspect: minimizing user-request response latency. To address this, we propose an edge deployment strategy based on the queuing search algorithm (QSA), which models the edge deployment problem as a multi-constrained nonlinear optimization problem. The QSA mimics the logic of human queuing behavior and has the ability to perform faster global searches while avoiding local optima. Experimental results show that, compared to the genetic algorithm, simulated annealing algorithm, particle swarm optimization, and other recent algorithms, the average number of “hopping” iterations in QSA is 0.1 to 0.6 times fewer than in the other algorithms. Additionally, QSA is particularly suitable for edge computing environments with a large number of users and devices.
Source: Algorithms
DOI: 10.3390/a18040200
Authors: Bo Wang, Xinyu Sun, Ying Song
Language: English
Topic: IoT and Edge/Fog Computing
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $1,930
Awards: G2683075391, G6196846692
OpenAlex ID: W4409116994