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

Shriram Vasudevan; Subramanian Vasudevan

Home/Archive/arXiv

arXiv · 2608.30019

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

Shriram Vasudevan·Subramanian Vasudevan

View original source ↗Read source document ↗Export metadata ↓

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

cs.NI

Keep this discovery

BibTeX RIS

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

cs.NI subject

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

KEEP EXPLORING

Related papers

arXiv2026

AEGIS: Risk-Budgeted Online Scheduling for Resilient Continuous Edge Inference

Continuous edge inference requires sustained wireless and computing support across successive service instances. Under recurring channel degradation, transient edge overload, and multi-user contention, isolated deadline misses may accumulate into persistent service degradation. Existing schedulers mainly optimize instantaneous latency or per-timeslot utility and provide limited control over such cross-time effects. To address this issue, we propose AEGIS (Adaptive Exposure-Governed Inference Scheduling), a risk-budgeted online framework for service-level operational resilience. AEGIS regulates predicted deadline-risk exposure through dynamically replenished per-user risk budgets and establishes an explicit finite-horizon bound on cumulative admitted-risk exposure. One-step state estimation supports anticipatory delay and risk assessment, while the centralized bandwidth--computing allocation is transformed into an exact-potential formulation and solved through asynchronous coordinate updates. Simulation results demonstrate that AEGIS enhances timely-service continuity, contains persistent deadline violations, and improves post-stress recovery through adaptive cross-time risk regulation. Meanwhile, it effectively controls predicted-risk exposure while preserving competitive service performance, achieving a favorable balance between service resilience and risk control.

cs.NI↗

arXiv2026

Sensitivity Comparison of Microwave-Frequency and Optical Fibre Interferometry Based on State-of-the-Art Components

We compare the sensitivity of fibre interferometers to vibrations using microwave oscillators and state of the art lasers over distances up to 70 km. High spectral purity lasers outperform only above 10 Hz, highlighting microwave advantages at low frequencies and the potential of hybrid microwave optical interferometry systems

physics.optics↗

arXiv2026

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↗