Adaptive Relaxation Approach for End-to-End Latency Constraints in Complex Communication Networks

In System of Systems (SoS) applications leveraging 5G communications, maintaining end-to-end (E2E) latency constraints is critical for performance and reliability. However, enforcing strict latency constraints at all times can lead to inefficient resource utilization, network congestion, and increased operational costs. This paper proposes a Dynamic Relaxation Approach using Deep Reinforcement Learning (DRL), where each autonomous subsystem dynamically adjusts its latency relaxation factor based on network conditions, task criticality, and system load. The proposed framework is evaluated under three congestion scenarios using metrics of reward convergence and relaxation state dynamics, demonstrating rapid adaptation and significant improvements in balancing performance with resource consumption. Additionally, despite employing reinforcement learning, our approach remains lightweight due to its binary, threshold-based decision-making process, which determines whether to relax constraints based solely on network parameters.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/sose66311.2025.11083842
Citations
2
Primary Topic
Embedded Systems Design Techniques
Type
article
Field-Weighted Citation Impact
4.54
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaptive Relaxation Approach for End-to-End Latency Constraints in Complex Communication Networks

Mounir Kellil, Abdelmadjid Bouabdallah, Christina Alhachem
2 citations
Embedded Systems Design Techniques
4.54
article

Adaptive Relaxation Approach for End-to-End Latency Constraints in Complex Communication Networks

Mounir Kellil, Abdelmadjid Bouabdallah, Christina Alhachem
article en
2 citations

Abstract

In System of Systems (SoS) applications leveraging 5G communications, maintaining end-to-end (E2E) latency constraints is critical for performance and reliability. However, enforcing strict latency constraints at all times can lead to inefficient resource utilization, network congestion, and increased operational costs. This paper proposes a Dynamic Relaxation Approach using Deep Reinforcement Learning (DRL), where each autonomous subsystem dynamically adjusts its latency relaxation factor based on network conditions, task criticality, and system load. The proposed framework is evaluated under three congestion scenarios using metrics of reward convergence and relaxation state dynamics, demonstrating rapid adaptation and significant improvements in balancing performance with resource consumption. Additionally, despite employing reinforcement learning, our approach remains lightweight due to its binary, threshold-based decision-making process, which determines whether to relax constraints based solely on network parameters.

Université de Technologie de Compiègne (FR), Commissariat à l'Énergie Atomique et aux Énergies Alternatives (FR), Laboratoire d'Intégration des Systèmes et des Technologies (FR), Heuristics and Diagnostics for Complex Systems (FR)
Openalex Percentile: Top 6%
Embedded Systems Design Techniques
4.54
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.