Papers for

telecom operations teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Metamodel improves confidence in predicting next mobile location

Selective Next-Location Prediction with MetaModelSelect: A Lightweight Post-Hoc Confidence Metamodel

Abstract: Next-location prediction can support proactive mobile-network decisions, but acting on unreliable predictions can waste resources. We apply MetaModelSelect, a lightweight post-hoc confidence metamodel, to selective cellular next-location prediction. The mobility-specific model combines a learned embedding of the predicted location with the four largest softmax probabilities and Softmax Concentration. It learns whether a frozen recurrent neural network's top-1 prediction is correct, using only its outputs and without retraining the backbone. On path-balanced Changchun cellular mobility trajectories, we evaluate backbones trained with cross-entropy (CE) and self-adaptive training plus entropy minimization (SAT+EM), comparing against eight scalar confidence scores, two location-aware lookup methods, and a raw-logit multilayer perceptron. Relative to maximum softmax probability, MetaModelSelect achieves mean per-run reductions in area under the risk--coverage curve (AURC), excess AURC (E-AURC), and area under the generalized risk--coverage curve (AUGRC) of 2.6%, 4.2%, and 3.0% for CE, and 2.0%, 3.3%, and 1.9% for SAT+EM. It also achieves the lowest reported mean risk at every evaluated partial coverage. The results show that MetaModelSelect improves confidence ranking in this mobility setting while leaving the underlying location predictor unchanged.

Wed 14 OctMachine LearningNetworking and Internet Architecture
The gist
Mobile networks try to guess where a phone will be next to make better decisions, but wrong guesses waste resources. The authors created a small extra model called MetaModelSelect to check if a phone location prediction is likely right, without changing the original prediction method. They tested it on real cellular data and found it ranks prediction confidence better than other ways. This means networks can trust the predictions more and avoid acting on poor guesses.
Open → 2610.19394v1

Dynamic fault recovery improves 5g core network uptime and resilience

A Dynamic UPF Fault Recovery Mechanism for Enhanced Resilience in 5G Core Networks

Abstract: Ensuring fault tolerance in the User Plane Function is essential to maintain service continuity in 5G networks, particularly as latency-sensitive applications become more prevalent. This paper presents a novel mechanism for dynamic UPF failure detection and recovery within an OpenAirInterface-based 5G core environment. The approach introduces an application-layer session restoration mechanism to ensure service continuity and minimize disruptions during UPF failures. Experimental results demonstrate that the proposed mechanism reduces UPF downtime while maintaining low packet loss and enabling rapid service recovery. In tests with TCP and UDP traffic, connectivity was restored within a few seconds, minimizing service degradation. Furthermore, our failure-aware UPF selection mechanism improves long-term system resilience by considering recent failure history. The results highlight the effectiveness of our lightweight framework in improving the overall reliability of 5G networks, making it a valuable contribution to network robustness.

Fri 2 OctNetworking and Internet Architecture
The gist
5G networks need to quickly fix problems when parts fail to keep apps running smoothly. The authors developed a way to detect and fix failures in a key 5G component called the User Plane Function (UPF) that moves data. Their method quickly restores connections and keeps packet loss low, helping reduce interruptions for users. They also use failure history to choose more reliable UPFs over time, making the network more dependable.
Open → 2610.03245v1

Routing tables in satellite networks can be periodic or not depending on speeds

On the Lack of Periodicity of Walker Satellite Constellation Routing Tables

Abstract: In a referential that rotates with Earth, the dynamics of the configurations of satellites in a Delta Walker constellation can be analyzed as a dynamical system as a function of a translation on the torus. This paper extends this type of analysis to routing over a Walker constellation, leveraging fixed ground relays. It considers any deterministic, time-invariant routing rule on such a collection of satellites and relays. The main object of interest is the routing table associated with this rule, which specifies, for all source-destination pairs, a route made of satellites and relays between them, for instance the shortest, together with angular information on next hop at each step of the route, which is essential for beamforming in this context. The main result is that, for each such routing rule, the routing table inherits the dichotomy of the torus flow: when the ratio of the Earth-spin and satellite angular speeds is rational, the routing table process is periodic with the same period as the constellation. When it is irrational, the table is non periodic but admits ergodic long-run averages which can be computed as ensemble averages w.r.t. an explicit invariant measure. Simulations with mixed satellite--gateway greedy routing illustrate these findings in terms of both temporal and spectral properties of the Walker routing table time series. The paper also discusses how to define metrics that cope with such non periodic fluctuations when present. This is illustrated by a comparison of the round-trip times between two far away cities as offered by a Walker constellation using greedy routing on one side, and by the currently available terrestrial fiber on the other side. It is shown how ergodicity can be used to make this comparison between the time varying instantaneous round trip times of the constellation and the constant round trip time of the fiber network meaningful.

Tue 29 SeptInformation TheoryNetworking and Internet Architecture
The gist
Computers in satellites communicate by following pre-set routes that tell messages where to go next. This paper shows that these routes repeat regularly when satellite and Earth rotation speeds match up just right, but when they don't, the routes never repeat exactly. Instead, in the non-repeating case, the routes follow stable long-term averages that can be calculated mathematically. The researchers also explain how to compare the time it takes for data to travel through satellite networks versus fiber optic cables using these properties.
Open → 2609.36566v1