Nathalie Romo Moreno

dblp:296/1619 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Cellular and mobile networks · 77% Network measurement and analytics · 12% Network management and operations · 12%

Topics — the 1 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
5g
2.022026
QoE Assurance Agents for Encrypted 5G Traffic · INFOCOM 2026
Real-Time Quality Scoring of Telemetry Data in 5G · INFOCOM 2026

Methods — techniques the papers use, named apart from their topics

quality scoring · 1.0
YearPublicationVenuePosition
2026 Real-Time Quality Scoring of Telemetry Data in 5G
Khalid Ali, Pranjal Vaste, Bestoun S. Ahmed, Andreas Kassler, Stephan Scheuerer, Felix Dsouza, Nathalie Romo Moreno
INFOCOM7
2026 QoE Assurance Agents for Encrypted 5G Traffic
Athanasios Karapantelakis, Maxim Teslenko, Nathalie Romo Moreno, Felix Dsouza, Steffen Drüsedow, Changsoon Choi, Selome Kostentinos Tesfatsion, Dariusz Antoniewicz, Alexandros Nikou, Mukesh Thakur, Wolfgang John
INFOCOM3
2025 QoS and Capacity Prediction for 5G Network Slicing
Nathalie Romo Moreno, Felix Dsouza, Andreas Kassler, Florian Pullem, Bangnan Xu, Markus Amend, Changsoon Choi
CNSM1
2025 AI Assisted Consumer Slicing
abstract
As Fifth Generation Networks (5G) networks evolve, operators have an opportunity to create high-quality customer experiences by ensuring seamless and personalized connectivity through consumer-oriented network slicing. However, effectively managing consumer slices remains a challenge due to dynamic user demands, mobility patterns, and the need for real-time Quality of Service (QoS) assurance. This paper presents an Artificial Intelligence (AI)-driven framework for intelligent service feasibility, qualification, and provisioning in 5G networks, to automate consumer slicing. By leveraging real-time data from the Radio Access Network (RAN) and Core Network (CN), along with Service Quality Indicator (SQI), the framework enables dynamic resource allocation, predictive service qualification, and proactive slice optimization. Key innovations of the frame-work include the coherent integration of AI-driven slice load prediction, mobility-aware service provisioning, and automated QoS assurance via Application Programming Interfaces (APIs), ensuring optimal performance for consumer applications while maintaining compliance with Service Level Agreement (SLA). Experimental results demonstrate the framework’s capabilities in enhancing user experiences by enabling personalized slice selection, reducing service disruptions, and optimizing network resource utilization.
Felix Dsouza, Nathalie Romo Moreno, Andreas Roos, Piotr Karas, Andreas Kassler, Nico Bayer, Changsoon Choi
PIMRC2
2022 In-network Support for Packet Reordering for Multiaccess Transport Layer Tunneling
abstract
Networked systems have recently aimed to use multiple access networks in parallel to increase resiliency, availability and capacity. However, different paths may have different latency characteristics, which may lead to out-of-order packet delivery. This may severely impact both the end-to-end application performance and the capacity utilisation of multiaccess systems. In this paper, we show that in-network support for packet reordering for multiaccess systems that are based on multiple transport layer tunnels is beneficial for several application types. Our findings are applicable to TCP and QUIC traffic in the 3GPP ATSSS context, where we use the MP-DCCP tunneling framework with a buffer-based packet reordering approach that uses a dynamic timing threshold to cope with variation of path delays over time. We demonstrate achievable performance gains for a wide range of path latency differences and end-to-end round trip times when using different in-network reordering algorithms.
Markus Amend, Nathalie Romo Moreno, Marcus Pieskä, Andreas Kassler, Anna Brunström, Veselin Rakocevic
PEMWN2