SearcharxivSearch

arXiv · 2608.30019

Predictive Traffic Shaping as a UE Network Control Loop in Wireless Systems

Abstract

Wireless systems usually react to current channel conditions, queue state, and policy. Yet service conditions can often be anticipated seconds ahead. This paper studies predictive traffic shaping, a slower user-equipment (UE) control loop that changes when flexible demand reaches the radio access network (RAN). The UE estimates useful pre-event demand and releases it across a lookahead window. Cooperative deployments may also send a compact future-risk descriptor to the network. The trigger uses prediction confidence. Predictive service is confined to available surplus, while a debt account preserves long-term fairness after temporary pre-event preference. A bandwidth-time model captures efficiency gains and load smoothing. It also accounts for prediction waste and shared-resource cost. In a stylized shared- cell simulation, paced demand release substantially expands the stable-feasible region. A safe service cap and admission control provide further gains at longer windows. PRISM, an application-owned middleware prototype, implements the local control policy using ordinary mobile transfer mechanisms.

Explore related subjects

Keep this discovery

BibTeXRIS

Shriram Vasudevan, Subramanian Vasudevan. 2026-08-30. Predictive Traffic Shaping as a UE Network Control Loop in Wireless Systems. https://arxiv.org/abs/2608.30019

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

Enhancing Network Resilience via Graph-Based Anomaly Detection in Sovereign Functions

Sovereign network functions, e.g., routing protocols, are becoming increasingly complex and susceptible to failures arising from protocol configuration anomalies and anomalous configurations. This paper interprets the protocol configuration anomaly detection problem as detection of structural inconsistencies of connected nodes and edges in a bipartite graph that captures both physical network entities and logical protocol states. This graph structural inconsistency detector (GSID) model is proposed to solve the problem efficiently. To handle the heterogeneous nature of protocol configuration parameters, GSID employs an adaptive configuration encoder (ACE) that dynamically selects encoding strategies per parameter to preserve fine-grained numerical discrepancies. To expose the subtle inconsistencies of connected nodes and edges in the bipartite graph, GSID uses an inconsistency dynamic attention (IDA) mechanism that scores edges by drawing asymmetric attentions from both ends, rule compliance from one end and route connectivity from the other. It is demonstrated experimentally that GSID outperforms state-of-the-art baselines by threefold in F1 score and by 23.2% in accuracy. Ablation studies validate the effectiveness of both the ACE and IDA modules. Tests on unseen network scales and real-world network topologies show the superior adaptability of our GSID, compared to the baselines.

cs.NI

AgenticNet: Utilizing AI Coding Agents To Create Hybrid Network Experiments

Traditional network experiments focus on validation through either simulation or emulation. Each approach has its own advantages and limitations. In this work, we present a new tool for next-generation network experiments created through Artificial Intelligence (AI) coding agents. This tool facilitates hybrid network experimentation through simulation and emulation capabilities. The tool supports three main operation modes: pure simulation, pure emulation, and hybrid mode. AgenticNet provides a more flexible approach to creating experiments for cases that may require a combination of simulation and emulation. In addition, AgenticNet supports rapid development through AI agents. We experimentally evaluate the tool and present an approach to verify the generated code.

cs.NI