Search arXivSearch

arXiv · 2608.02095

Emulation vs Simulation: A Case Study from Congestion Control Algorithms in Low Earth Orbit Satellite Networks

Abstract

Evaluating congestion control is inherently challenging because performance depends on the interaction between the congestion-control algorithm, transport stack, application behaviour, measurement process, and network dynamics. This challenge is growing as state-of-the-art protocols incorporate pacing, selective loss recovery, model-based control, and, more recently, reinforcement learning. Low Earth Orbit (LEO) satellite networks are a particularly demanding setting: rapidly changing paths, handovers, non-congestive loss, RTT variation, and transient hotspots all affect transport behaviour. This paper reports the lessons learned from an extensive evaluation campaign across both simulation and emulation for LEO satellite congestion control. We compare multiple classes of congestion-control algorithms, including Cubic, BBR variants, LEO-specific protocols, and reinforcement-learning-based control, using comparable implementations across OMNeT++/INET simulation and Mininet-based emulation with the Linux transport stack. This gives us a rare opportunity to examine not only protocol performance, but also the methodological strengths and limitations of each experimental environment. Our findings show that simulation is indispensable for constellation-scale exploration, controlled parameter sweeps, and future deployment studies, but can miss behaviours caused by production transport-stack mechanisms such as pacing, SACK, RACK, kernel timing, and rate sampling. Emulation exposes these implementation-dependent effects and provides a necessary validation step, but is harder to scale and less exactly repeatable. We distil these experiences into practical lessons for combining simulation and emulation to obtain results that are scalable, reproducible, and deployment-relevant.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aiden Valentine, Mihai Mazilu, James Knowles, Ian Wakeman, George Parisis. 2026-08-03. Emulation vs Simulation: A Case Study from Congestion Control Algorithms in Low Earth Orbit Satellite Networks. https://arxiv.org/abs/2608.02095

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

KEEP EXPLORING

Related papers

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI

Pattern-Aware Virtual Network Embedding Optimization for Cloud Data Centers

The network virtualization (NV) technology has enabled the sharing of multiple resources among virtual networks (VNs) in cloud data centers. One of the key challenges is to allocate resources in real-time for virtual network request (VNR), which is known as online virtual network embedding (VNE). However, the existing online VNE methods do not exploit the multi-dimensional complementary relationship among diverse VNRs, resulting in the fragmentation and waste of substrate resources. In this paper, we propose the pattern matching based online VNE approach by constructing appropriate matching rules among observed patterns to maximize resources utilization. We devise the clustering based VNRs quantization method and conduct rigorous study on the pattern combination filtering problem. Then, we utilize the column generation to solve it and construct the pattern matching rules. Based on the rules, we propose an online pattern matching VNE algorithm with linear worst-case complexity. Evaluation on a 106-server testbed using Alibaba production cluster trace dataset shows that our algorithm achieves close-to-offline performance and more accepted workloads that outperforms traditional designs by 25%-30%.

cs.NI