Evidence map›Paper›PMID 40989849›Full record

ArticleMethodsX2025

ML-driven latency optimization for mobile edge computing in fiber-wireless access networks.

Antimbala Marmat, Dolly Thankachan

Abstract read
In one paragraph

Article in MethodsX, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Antimbala MarmatDepartment of Electronics and Communication Engineering, Oriental University, Indore, MP, India.
Dolly ThankachanDepartment of Electronics and Communication Engineering, Oriental University, Indore, MP, India.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The increasing quest for ultra-low latency in mobile edge computing (MEC) over fiber-wireless networks pose challenges in adapting to real-time demands under resource constraints. Congestion-prone methods of centralized learning and static routing waste resources. A machine learning-based latency optimization framework is proposed that integrates multiple advanced paradigms for proactive traffic management, intelligent routing, and efficient task offloading while ensuring data privacy. The framework encompasses self-supervised learning, federated learning, spatiotemporal graph neural networks (GNN), adaptive multi-agent reinforcement learning, and hypergraph transformers. These tools are useful for dynamic congestion-aware routing, accurate spatiotemporal traffic prediction, and optimal resource slicing for latency-sensitive applications. Hypergraph transformers enable dynamic allocation of resources across network slices. The experiments shows significant performance improvements, 34-42 % reduction in end-to-end latency, 29-35 % faster task execution, 50 % less training time, better traffic prediction accuracy, and lower slice switching delays. This framework can underpin some of the most crucial low-latency applications like augmented reality and autonomous driving, providing a powerful solution for the next generation of MEC networks working under stringent performance and privacy constraints.•Dynamic congestion-aware routing using adaptive multi-agent reinforcement learning•Proactive traffic prediction using spatiotemporal GNN•Federated, self-supervised learning to maximize resource slicing and delay-aware task offloading.

Indexed as

Fiber-wireless networksLatency optimizationMachine learningMobile edge computingProcessReinforcement Learning

Identifiers

PMID40989849
PMCPMC12450723

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.