Pith. sign in

REVIEW 4 major objections 5 minor 12 references

Optimizing Edge Gaming Slices through an Enhanced User Plane Function and Analytics in Beyond-5G Networks

T0 review · 4 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper claims a 5G core can estimate player latency from packet timestamps and classify the game being played from that signal.

desk verdict The paper's control-loop claim collapses on its own metric: L = tout − tin at the UPF is packet residence time, not UE-perceived latency, so the R² = 0.980 result does not support the architecture. read the letter →

arxiv 2507.17843 v1 pith:EK5P35N3 submitted 2025-07-23 cs.DC

Bruno Marques da Silva , Larissa Ferreira Rodrigues Moreira , Flávio de Oliveira Silva , Rodrigo Moreira This is my paper · ORCID
classification cs.DC
keywords 5Gcoreuserplanefunctionnetworkdataanalyticstime-shiftlatencyestimationedgegamingslicinggameclassificationTEID
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proposes making the 5G control plane latency-aware for mobile edge gaming by instrumenting the User Plane Function (UPF) with a user-space packet filter. The filter reads timestamps of GTP packets crossing the N3 interface, computes per-flow latency as $L = t_{\mathrm{out}} - t_{\mathrm{in}}$, and labels each measurement with the Tunnel Endpoint Identifier (TEID) of the user session. These per-TEID latency values go to the Network Data Analytics Function (NWDAF), where pretrained machine-learning models classify the game being played and can notify the Session Management Function (SMF) to adjust resources. In experiments the estimate reaches normalized MSE 0.019 and $R^2$ 0.980 against a synthetic load, and a CatBoost classifier trained on the dataset distinguishes League of Legends, Teamfight Tactics, and Valorant with 0.9483 accuracy. If correct, operators get a non-intrusive closed loop for SLA enforcement and QoE protection in gaming slices.

What carries the argument

The load-bearing object is the time-shift latency monitor: a user-space filter on the UPF N3 interface that captures GTP packets, extracts the 32-bit TEID, and computes per-tunnel latency from $L = t_{\mathrm{out}} - t_{\mathrm{in}}$, with a bidirectional variant $L_{\mathrm{total}} = (t^{\mathrm{request}}_{\mathrm{out}} - t^{\mathrm{request}}_{\mathrm{in}}) + (t^{\mathrm{response}}_{\mathrm{out}} - t^{\mathrm{response}}_{\mathrm{in}})$. It converts raw packet timestamps into a per-UE signal without injecting probe traffic. The second piece is the analytics stage inside NWDAF: pretrained ML models, of which CatBoost, a gradient-boosted decision-tree model, performs best, mapping monitored traffic features to a game class so the SMF can decide whether an intervention is needed.

What would settle it

Run the proposed N3 time-shift monitor on live LOL, TFT, and Valorant sessions, feed NWDAF only the per-TEID latency values, and retrain and evaluate CatBoost on that single signal; if accuracy falls well below the reported 0.9483, the closed loop as described cannot perform the claimed classification.

Watch

Extended reading notes

Core claim

The central claim is that a closed loop between an instrumented UPF and NWDAF can turn passive packet observation into actionable user-latency awareness. The paper argues that the time-shift between a packet's arrival at and departure from the N3 interface, accumulated per TEID, is a faithful proxy for UE-perceived latency, with normalized MSE 0.019, MAE 0.085, and $R^2$ 0.980 on a synthetic sinusoidal load of 1–600 ms. It further claims that an ML model embedded in NWDAF can classify the active game class from traffic features, with CatBoost reaching 0.9483 accuracy and per-class AUC above 0.99 for LOL, TFT, and Valorant. On that basis the paper asserts that SMF can react to degradation by reallocating resources, adjusting routing policy, or adapting network parameters, making the control plane latency-aware for edge gaming.

Load-bearing premise

The load-bearing premise is that the per-TEID time-shift latency delivered by the UPF monitor carries enough information for the game classifier, yet the classifier is trained and evaluated on a 16-feature dataset whose source, destination, latitude, longitude, and RTT features are never shown to be available in the proposed live UPF-to-NWDAF path.

Editorial extensions

If this is right

  • An operator can estimate UE-perceived latency from passive UPF observations with normalized MSE 0.019 and $R^2$ 0.980, so no client-side probes or game-specific instrumentation are required.
  • NWDAF can distinguish LOL, TFT, and Valorant with 0.9483 accuracy and per-class AUC above 0.99, making game class a usable input for slice policy decisions.
  • The SMF gains a trigger for corrective actions such as resource reallocation, routing-policy changes, or dynamic parameter adaptation when a gaming session degrades.
  • The same architecture connects non-intrusive latency measurement to SLA compliance monitoring for gaming slices in beyond-5G networks.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • This paper's own text leaves a gap between the Section 4 classifier, trained on 16 features, and the Section 3 runtime, which feeds NWDAF only per-TEID latency; a reader should treat the 0.9483 accuracy as an upper-bound demonstration, not as proof of the closed loop in its described form.
  • A direct test would retrain CatBoost on the UPF-derived latency signal alone; if the accuracy drop is small, the loop becomes credible without relying on unevaluated features.
  • The same per-TEID time-shift monitor could transfer to other latency-sensitive GTP services, such as AR/VR streaming or industrial remote control, with the game-class label replaced by a service-class label.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper proposes a closed-loop 5G edge-gaming architecture in which a user-space filter at the UPF N3 interface computes per-TEID "latency" from packet timestamps (L = tout - tin), reports the values to NWDAF, and NWDAF uses ML models to classify games (League of Legends, Teamfight Tactics, Valorant). Reported results include normalized MSE 0.019, MAE 0.085, and R² 0.980 for the latency estimate, and CatBoost accuracy 0.9483 with F1-score 0.9477 for game classification. The authors conclude that the scheme enables latency-aware SMF interventions and SLA management in beyond-5G edge gaming slices.

Significance. If the proposed metric genuinely captured UE-perceived latency and the classifier could operate on features measurable in the live UPF/NWDAF path, the architecture would be a practical, non-intrusive addition to 5G core analytics for edge gaming. The paper has some worthwhile components: it uses a public dataset, compares five ML algorithms with standard metrics, and the UPF filter concept is simple to replicate. However, the significance is conditional on two preconditions that the manuscript does not establish: that the UPF time-shift measurement is a valid proxy for UE-perceived RTT, and that the offline-trained classifier can run in the proposed runtime. The current validation addresses neither precondition end-to-end.

major comments (4)
  1. [Section 3, Eq. (1)-(2); Section 5, Table 1] The load-bearing equation L = tout - tin is the residence time of a packet inside the UPF, not the UE-perceived RTT. It excludes RAN scheduling, air-interface transmission, core transport, and server processing. In Section 5, the baseline is "UE-perceived RTT" generated by a sinusoidal synthetic load applied to the packet recipient, but nothing in the method ties the recipient-side delay to the UPF timestamps. Because the injected load and the measured series share the same sinusoidal period, the reported R² = 0.980 could simply reflect that both follow the injected signal rather than that the filter measures user latency. An independent ground-truth E2E latency measurement at the UE, or a decomposition showing which components of E2E latency the UPF transit time captures, is required before the latency-aware control-loop claim is supported.
  2. [Section 4 vs. Section 3] The game classifier is trained on a public dataset with 16 features, including source, destination, latitude, longitude, and RTT, but the runtime architecture in Section 3 supplies NWDAF only with per-TEID time-shift latency from the UPF. The paper never demonstrates that the other dataset features are available or measurable in the live free5GC/NWDAF path. Consequently, the high accuracy in Table 2 and the ROC/PR curves in Figures 6 and 7 are offline benchmarks on dataset features, not evidence that the proposed NWDAF classifier can classify games from the UPF-provided latency feature in the intended closed loop.
  3. [Section 5] No integrated closed-loop experiment is reported. The latency estimation is evaluated against a synthetic load, and the classifier is evaluated offline on a public dataset, but the two components are never connected: no experiment feeds actual UPF-generated per-TEID latency into the classifier, and no demonstration shows that NWDAF analytics reach the SMF or that any resulting intervention improves SLA compliance or QoE. The concluding claim of a latency-aware 5G control plane is therefore unsupported by the presented measurements.
  4. [Table 2] The Random Forest row is internally inconsistent: it reports Recall 0.0981 alongside Precision 0.9478 and F1-Score 0.9479, which is arithmetically impossible (the harmonic mean of 0.9478 and 0.0981 is about 0.178). Since the text states that Random Forest performed similarly to CatBoost, this inconsistency directly affects the stated model-comparison conclusion and requires correction or verification.
minor comments (5)
  1. [Section 5, Figures 6-7] The sentence beginning "The curves in Figure 7 exhibit strong class distinction..." refers to AUC values, but Figure 7 shows precision-recall curves; the ROC AUC values appear in Figure 6, so the figure references need to be corrected.
  2. [Figure 4 caption] "Games Distribuition by Class" contains a typo; it should read "Distribution."
  3. [Section 5, Table 1] The difference between normalized and original MAPE is not explained; please define the normalization applied to MSE, MAE, and MAPE, and state the units of the original metrics.
  4. [Section 4] The experimental section does not describe the train/test split or cross-validation scheme used for the classification experiments, so it is unclear whether the 10-run averages in Table 2 are over the same test folds or different random splits.
  5. [References] The Hassanein et al. dataset reference is incomplete (no publication venue, URL, or version), which makes it difficult for readers to reproduce the classification experiments.

Circularity Check

1 steps flagged · score 6.0 of 10

Latency validation is self-referential: the 'true' UE latency is the injected sinusoidal load, and the filter estimate is collected from the same packets under the same load, so the reported R²=0.980 does not independently validate UE-perceived latency.

  1. other [Section 5 (Table 1 and Figure 3) and Section 3 (Eq. 1-2)]
    "Baseline latency, defined as the UE-perceived RTT when transmitting data, was measured while inducing a sinusoidal synthetic load (1 ms to 600 ms over a 30-second cycle) on the packet recipient. Simultaneously, our filter captured timestamps of packets transiting the N3 interface with a specific TEID to estimate intermediate latency."

    The paper's estimator is L = tout − tin, a packet residence time at the UPF, while the validation's 'true' value is the same sinusoidal load imposed on the packet stream. Both the ground-truth series and the estimated series are produced in the same experiment, and the paper provides no independent end-to-end RTT measurement and no mechanism connecting the recipient-side delay to the UPF timestamps. The high R² (0.980) can therefore reflect that both series follow the shared 30-second injected sinusoid, not that the filter measures UE-perceived latency. The prediction reduces to reproducing the experimental stimulus rather than an independently verified user latency.

full rationale

The UPF latency estimator itself is a direct definition (L = tout − tin) rather than a fitted model, and the game classifier is trained and tested on an external public dataset with standard train/test separation, so those aspects are not self-referential. However, the load-bearing validation in Section 5 is self-referential: the baseline 'true' latency is the sinusoidal load applied to the packet recipient, while the filter output is collected simultaneously from the same packets. No independent ground-truth RTT is used, and no path is shown from the recipient-side delay to the UPF timestamps; therefore the reported R² (0.980) does not support the claim that the UPF filter measures UE-perceived latency. The self-citations (Moreira et al. 2023; Rodrigues Moreira et al. 2024) are background statements and are not load-bearing. Because the classification evaluation has independent external grounding but the core latency validation reduces to the experimental stimulus, the circularity is partial rather than total.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The central claim rests on three ad hoc assumptions: that UPF transit time equals user latency, that offline dataset features are available in the runtime, and that the synthetic load approximates real conditions. These are unverified modeling choices, not derived results, and they account for the gap between the measured components and the claimed closed loop.

assumptions (4)
  • ad hoc to paper UE-perceived latency equals packet residence time at the UPF N3 interface (L = tout - tin).
    Section 3 defines user latency as a single UPF timestamp difference; no derivation or reference connects this to end-to-end RTT.
  • ad hoc to paper The 16 features of the Hassanein et al. dataset are available in the proposed runtime path.
    Section 4 trains on source, destination, latitude, longitude, and RTT; Section 3 only describes per-TEID latency sent to NWDAF.
  • ad hoc to paper The sinusoidal synthetic load on the packet recipient reproduces realistic UE latency conditions.
    Section 5 uses a 1 ms to 600 ms sinusoidal load as the baseline for UE-perceived RTT without evidence that this matches real gaming traffic.
  • domain assumption free5GC on Kubernetes provides complete 3GPP NWDAF, UPF, and SMF semantics for the proposed closed loop.
    Section 4 describes the testbed but reports no conformance testing or verification of NWDAF analytics and SMF policy control behavior.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Optimizing Edge Gaming Slices through an Enhanced User Plane Function and Analytics in Beyond-5G Networks." pith.science (2026). https://pith.science/paper/EK5P35N3

@misc{pith2026250717843,
  author       = {Pith},
  title        = {Pith review of: Optimizing Edge Gaming Slices through an Enhanced User Plane Function and Analytics in Beyond-5G Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/EK5P35N3}},
  note         = {Machine review of arXiv:2507.17843}
}
read the original abstract

The latest generation of games and pervasive communication technologies poses challenges in service management and Service-Level Agreement compliance for mobile users. State-of-the-art edge-gaming techniques enhance throughput, reduce latency, and leverage cloud computing. However, further development of core functions such as the User Plane Function (UPF) is needed for non-intrusive user latency measurement. This paper proposes a closed-loop architecture integrating the Network Data Analytics Function (NWDAF) and UPF to estimate user latency and enhance the 5G control plane by making it latency-aware. The results show that embedding an artificial intelligence model within NWDAF enables game classification and opens new avenues for mobile edge gaming research.

Figures

Figures reproduced from arXiv: 2507.17843 by the authors.

Figure 1
Figure 1. Proposed B5G Architecture for Enhanced Edge Gaming. [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Time-Shift Latency Estimation for Edge Gaming. [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. a depicts a 10-minute time series sample comparing the latency experi￾enced by the UE with the estimated latency in the cluster where the UPF was deployed. This reinforces the approach’s promise and accuracy, as Figure 3b highlights a significant accumulation of estimation errors near zero. 0 5 10 15 20 25 30 1.0 0.5 0.0 0.5 1.0 1.5 2.0 2.5 Normalized Latency True Latency Estimated Latency 100 50 0 50 100 0 200 400 … view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: Comparison of game distribution and RTT distribution. [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 5
Figure 5. Figure 5: Accuracy Confidence Interval [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]
Figure 6
Figure 6. Figure 6: ROC Curve of CatBoost 0.0 0.2 0.4 0.6 0.8 1.0 Recall 0.6 0.7 0.8 0.9 1.0 Precision Precision-Recall Curve - Classe 0 Precision-Recall Curve 0.0 0.2 0.4 0.6 0.8 1.0 Recall 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1.0 Precision Precision-Recall Curve - Classe 1 Precision-Recall C…
Figure 7
Figure 7. Figure 7: Precision-Recall Curve of CatBoost All curves exhibited high precision across varying recall levels, reflecting the strong classification accuracy of the model. Minor drops in precision occur only at ex￾treme recall values, which is typical for highly reliable classifi…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

12 extracted references · 11 canonical work pages

  1. [1]

    S., Camacho, L., Barco, R., and Fortes, S

    Baena, C., Peñaherrera-Pulla, O. S., Camacho, L., Barco, R., and Fortes, S. (2023). Video Streaming and Cloud Gaming Services Over 4G and 5G: A Complete Network and Service Metrics Dataset . IEEE Communications Magazine , 61(9):154--160

    work page 2023

  2. [2]

    Carvalho, M., Soares, D., and Fernandes Macedo, D. (2024). QoE Estimation Across Different Cloud Gaming Services Using Transfer Learning . IEEE Transactions on Network and Service Management , 21(6):5935--5946

    work page 2024

  3. [3]

    R., and Shirmohammadi, S

    Hassanein, A., Hashemi, M. R., and Shirmohammadi, S. (2025). Gaming And Video Streaming Traffic for 5G Research

    work page 2025

  4. [4]

    K., Lazaridis, P

    Kougioumtzidis, G., Vlahov, A., Poulkov, V. K., Lazaridis, P. I., and Zaharis, Z. D. (2024). QoE Prediction for Gaming Video Streaming in O-RAN Using Convolutional Neural Networks . IEEE Open Journal of the Communications Society , 5:1167--1181

    work page 2024

  5. [5]

    Moreira, R., Martins, J. S. B., Carvalho, T. C. M. B., and Silva, F. d. O. (2023). On Enhancing Network Slicing Life-Cycle Through an AI-Native Orchestration Architecture . In Barolli, L., editor, Advanced Information Networking and Applications , pages 124--136, Cham. Springer International Publishing

    work page 2023

  6. [6]

    F., Moreira, R., Martins, E

    Rodrigues Moreira, L. F., Moreira, R., Martins, E. T., Jansen, V. F., Lima, Y. S., Rodrigues, L. G. F., Travençolo, B. A. N., and Backes, A. R. (2024). Maximizing the Power of Cognitive Services with an AI-as-a-Service Architecture for Seamless Delivery . In 2024 IEEE 13th International Conference on Cloud Networking (CloudNet) , pages 1--8

    work page 2024

  7. [7]

    S., Mitra, K., Åhlund, C., Cotanis, I., Örgen, N., and Johansson, P

    Rossi, H. S., Mitra, K., Åhlund, C., Cotanis, I., Örgen, N., and Johansson, P. (2024). Objective QoE Models for Cloud-Based First Person Shooter Game over Mobile Networks . In 2024 IEEE 21st Consumer Communications & Networking Conference (CCNC) , pages 550--553

    work page 2024

  8. [8]

    Shankar, V. (2024). Edge AI: A Comprehensive Survey of Technologies, Applications, and Challenges . In 2024 1st International Conference on Advanced Computing and Emerging Technologies (ACET) , pages 1--6

    work page 2024

Show all 12 references
  1. [9]

    Slivar, I., Skorin-Kapov, L., and Suznjevic, M. (2019). QoE-Aware Resource Allocation for Multiple Cloud Gaming Users Sharing a Bottleneck Link . In 2019 22nd Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN) , pages 118--123

    2019

  2. [10]

    Soares, D., Carvalho, M., and Macedo, D. F. (2024). Enhancing Cloud Gaming QoE Estimation by Stacking Learning . Journal of Network and Systems Management , 32(3):58

    2024

  3. [11]

    Zhang, X., Chen, H., Zhao, Y., Ma, Z., Xu, Y., Huang, H., Yin, H., and Wu, D. O. (2019). Improving Cloud Gaming Experience through Mobile Edge Computing . IEEE Wireless Communications , 26(4):178--183

    2019

  4. [12]

    write newline

    " write newline "" before.all 'output.state := FUNCTION fin.entry add.period write newline FUNCTION new.block output.state before.all = 'skip after.block 'output.state := if FUNCTION new.sentence output.state after.block = 'skip output.state before.all = 'skip after.sentence '...

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.