MA3C: A Multi-Agent A2C Scheduling Approach for Real-Time Heterogeneous Serverless Edge-Fog Continuum

As the integration of serverless architecture and the edge-fog continuum continues to evolve, the need for efficient and effective scheduling methods becomes increasingly critical. Traditional scheduling approaches often struggle to meet the unique challenges posed by these dynamic and heterogeneous environments. Deep Reinforcement Learning (DRL), particularly the Asynchronous Actor-Critic (A2C) algorithm, offers a promising solution to these challenges. Our proposed method, MA3C (Multi-Agent Actor-Critic Continuum), utilizes a centralized value network (critic) in the fog node, while equipping each edge node with a decentralized policy network (actor). This design enables agents to optimize their scheduling decisions not only based on their own experiences but also by learning from the experiences of others. Simulation results demonstrate the effectiveness of MA3C, consistently outperforming alternative methods in terms of response time, failure rates, and overall reward, even as the complexity increases with higher node counts and request arrival rates. Specifically, MA3C achieves a 14% improvement in total performance and a 10% enhancement in response time compared to other policies. This study paves the way for new advancements in scheduling methodologies for the serverless edge-fog continuum, providing a robust and scalable solution for future research.

Authors

Institutions

Publication Details

Published
2025-04-16
DOI
https://doi.org/10.1109/icwr65219.2025.11006260
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

MA3C: A Multi-Agent A2C Scheduling Approach for Real-Time Heterogeneous Serverless Edge-Fog Continuum

Armin Mohammadi Ghaleh
Distributed and Parallel Computing Systems
article

MA3C: A Multi-Agent A2C Scheduling Approach for Real-Time Heterogeneous Serverless Edge-Fog Continuum

Armin Mohammadi Ghaleh
article en

Abstract

As the integration of serverless architecture and the edge-fog continuum continues to evolve, the need for efficient and effective scheduling methods becomes increasingly critical. Traditional scheduling approaches often struggle to meet the unique challenges posed by these dynamic and heterogeneous environments. Deep Reinforcement Learning (DRL), particularly the Asynchronous Actor-Critic (A2C) algorithm, offers a promising solution to these challenges. Our proposed method, MA3C (Multi-Agent Actor-Critic Continuum), utilizes a centralized value network (critic) in the fog node, while equipping each edge node with a decentralized policy network (actor). This design enables agents to optimize their scheduling decisions not only based on their own experiences but also by learning from the experiences of others. Simulation results demonstrate the effectiveness of MA3C, consistently outperforming alternative methods in terms of response time, failure rates, and overall reward, even as the complexity increases with higher node counts and request arrival rates. Specifically, MA3C achieves a 14% improvement in total performance and a 10% enhancement in response time compared to other policies. This study paves the way for new advancements in scheduling methodologies for the serverless edge-fog continuum, providing a robust and scalable solution for future research.

K. N. Toosi University of Technology (IR)
Openalex Percentile: Top 88%
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.