Fictitious Play Game Theory for Server Deployment Optimization in Edge–Fog Environments

Reducing latency in the Internet of Things (IoT) remains a critical challenge. While cloud computing supports data processing, it often fails to meet real-time demands due to its distance from end users. Edge and fog computing address this issue by positioning processing resources closer to devices, reducing latency, and enhancing performance. In this letter, we propose a node placement strategy using a fictitious play game theory approach, where each node iteratively adjusts its placement based on interactions with neighboring nodes to minimize latency and cost. Our method assigns tasks by selecting the nearest available node with adequate processing resources, allowing for dynamic task handling across the network. Simulation results demonstrate that the proposed fictitious play approach effectively reduces latency and cost, achieving an average improvement of 32.5% in a combined penalty that considers both average latency and total cost, compared to state-of-the-art methods.

Authors

Institutions

Publication Details

Journal
IEEE Embedded Systems Letters
Published
2025-02-20
DOI
https://doi.org/10.1109/les.2025.3544121
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fictitious Play Game Theory for Server Deployment Optimization in Edge–Fog Environments

Mohsen Ansari, Elyas Oustad, Soheil Mahdizadeh
IEEE Embedded Systems Letters
Distributed and Parallel Computing Systems
article

Fictitious Play Game Theory for Server Deployment Optimization in Edge–Fog Environments

Mohsen Ansari, Elyas Oustad, Soheil Mahdizadeh
article en

Abstract

Reducing latency in the Internet of Things (IoT) remains a critical challenge. While cloud computing supports data processing, it often fails to meet real-time demands due to its distance from end users. Edge and fog computing address this issue by positioning processing resources closer to devices, reducing latency, and enhancing performance. In this letter, we propose a node placement strategy using a fictitious play game theory approach, where each node iteratively adjusts its placement based on interactions with neighboring nodes to minimize latency and cost. Our method assigns tasks by selecting the nearest available node with adequate processing resources, allowing for dynamic task handling across the network. Simulation results demonstrate that the proposed fictitious play approach effectively reduces latency and cost, achieving an average improvement of 32.5% in a combined penalty that considers both average latency and total cost, compared to state-of-the-art methods.

IEEE Embedded Systems LettersVol. 17(4)
Sharif University of Technology (IR)
Climate action
Openalex Percentile: Top 97%
Distributed and Parallel Computing Systems
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.

Fictitious Play Game Theory for Server Deployment Optimization in Edge–Fog Environments — Mohsen Ansari, Elyas Oustad, et al. · IEEE Embedded Systems Letters (2025) | TGRS Research Map | TGRS