An edge server placement based on graph clustering in mobile edge computing
Shanshan Zhang, Jiong Yu, Mingjian Hu · 2024
Read An edge server placement based on graph clustering in mobile edge computing by Shanshan Zhang, Jiong Yu, Mingjian Hu (2024) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-11612183.txt.
Description
Shanshan Zhang, Jiong Yu, and Mingjian Hu tackle where to place edge servers for mobile users, in a 2024 paper. Edge computing puts servers near users to cut delay. Poor placement means slow replies or lopsided loads. The team frames base stations as a graph and lets a learning model group them into server zones.
Their model pairs a graph network with a soft grouping step. Distance, reach, and channel counts for each station shape the groups. Training aims at low average delay with even loads. Tests on a Shanghai telecom data set showed the method cut delay and balanced load well. The output gives both server spots and which users each server serves.
Catalog record
| CREATOR | Shanshan Zhang, Jiong Yu, Mingjian Hu |
|---|---|
| YEAR | 2024 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 58 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |