Edge Server Placement and Task Allocation for Maximum Delay Reduction

When edge computing is deployed for delay-sensitive applications such as autonomous driving systems and online gaming, it is important to reduce the maximum delay because real-time performance for all users must be ensured from Quality-of-Service (QoS) perspective. The primary delays in edge computing include network delay during data transmission and waiting time at the edge server. Since the waiting time at edge servers depends on server utilization, an increase in utilization bias leads to an increase in maximum delay. If a user is extremely far from the edge server, the network delay for that user will also increase. Conventional edge computing methods focus on reducing the average propagation delay of user-processing requests (tasks). However, these methods increase the utilization variance of each edge server, thus increasing the maximum delay. In this paper, we propose a method for determining both edge server placement and task allocation to reduce the maximum delay. Our method uses a genetic algorithm to optimize server utilization and the distance between users and servers. The maximum delay has been successfully reduced compared with that using conventional methods by simultaneously optimizing the server utilization and distance between users and servers.

Authors

Institutions

Publication Details

Journal
IEEE Open Journal of the Communications Society
Published
2025-01-01
DOI
https://doi.org/10.1109/ojcoms.2025.3593641
Citations
3
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
4.46

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Edge Server Placement and Task Allocation for Maximum Delay Reduction

Sumiko Miyata, Koki Shibata
3 citations
IEEE Open Journal of the Communications Society
IoT and Edge/Fog Computing
4.46
article

Edge Server Placement and Task Allocation for Maximum Delay Reduction

Sumiko Miyata, Koki Shibata
article en
3 citations

Abstract

When edge computing is deployed for delay-sensitive applications such as autonomous driving systems and online gaming, it is important to reduce the maximum delay because real-time performance for all users must be ensured from Quality-of-Service (QoS) perspective. The primary delays in edge computing include network delay during data transmission and waiting time at the edge server. Since the waiting time at edge servers depends on server utilization, an increase in utilization bias leads to an increase in maximum delay. If a user is extremely far from the edge server, the network delay for that user will also increase. Conventional edge computing methods focus on reducing the average propagation delay of user-processing requests (tasks). However, these methods increase the utilization variance of each edge server, thus increasing the maximum delay. In this paper, we propose a method for determining both edge server placement and task allocation to reduce the maximum delay. Our method uses a genetic algorithm to optimize server utilization and the distance between users and servers. The maximum delay has been successfully reduced compared with that using conventional methods by simultaneously optimizing the server utilization and distance between users and servers.

IEEE Open Journal of the Communications SocietyVol. 6
Tokyo Institute of Technology (JP), Tokyo University of Science (JP), Shibaura Institute of Technology (JP), Institute of Science Tokyo (JP)
Micron Foundation, Telecommunications Advancement Foundation, Japan Society for the Promotion of Science, National Institute of Information and Communications Technology
Openalex Percentile: Top 5%
IoT and Edge/Fog Computing
4.46
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.