SearcharxivSearch

arXiv subjects

Aiden Valentine

Publications and source records attributed to Aiden Valentine.

4 recordsLinked to original sources

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

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.

cs.NI

Evaluating Learning Congestion control Schemes for LEO Constellations

Low Earth Orbit (LEO) satellite networks introduce unique congestion control (CC) challenges due to frequent handovers, rapidly changing round-trip times (RTTs), and non-congestive loss. This paper presents the first comprehensive, emulation-driven evaluation of CC schemes in LEO networks, combining realistic orbital dynamics via the LeoEM framework with targeted Mininet micro-benchmarks. We evaluated representative CC algorithms from three classes, loss-based (Cubic, SaTCP), model-based (BBRv3), and learning-based (Vivace, Sage, Astraea), across diverse single-flow and multi-flow scenarios, including interactions with active queue management (AQM). Our findings reveal that: (1) handover-aware loss-based schemes can reclaim bandwidth but at the cost of increased latency; (2) BBRv3 sustains high throughput with modest delay penalties, yet reacts slowly to abrupt RTT changes; (3) RL-based schemes severely underperform under dynamic conditions, despite being notably resistant to non-congestive loss; (4) fairness degrades significantly with RTT asymmetry and multiple bottlenecks, especially in human-designed CC schemes; and (5) AQM at bottlenecks can restore fairness and boost efficiency. These results expose critical limitations in current CC schemes and provide insight for designing LEO-specific data transport protocols.

cs.NI

OrbCC: High-Throughput and Low-Latency Data Transport for LEO Satellite Networks

The highly dynamic nature of Low-Earth Orbit (LEO) satellite networks introduces challenges that existing transport protocols fail to address, including non-congestive latency variation and loss, transient congestion hotspots, and frequent handovers that cause temporary disconnections and route changes with unknown congestion and delay characteristics. Our contention is that with this increase in complexity, there is insufficient information being returned from the network for existing congestion control algorithms to minimise latency while maintaining high throughput and minimising retransmissions. Our approach, OrbCC, leverages in-network support to collect per-hop congestion information and uses it to (1) minimise buffer occupancy and end-user latency, (2) maximise application throughput and network utilisation, and (3) rapidly respond to congestion hotspots. We evaluate OrbCC against state-of-the-art transport protocols using OMNeT++/INET-based LEO satellite simulations and targeted micro-benchmarks. The simulations capture RTT dynamics in a LEO constellation, while the micro-benchmarks isolate key characteristics such as non-congestive latency variation and loss, path changes, and congestion hotspots. Results show that OrbCC significantly improves goodput while simultaneously reducing latency and retransmissions compared to existing approaches.

cs.NI

Developing and experimenting with LEO satellite constellations in OMNeT++

In this paper, we present our work in designing and implementing a LEO satellite constellation simulation model1 within OMNeT++ and INET, which is validated by comparing the results with existing work. Our model builds upon the fundamentals of the Open Source Satellite Simulator (OS$^3$), which was ported to INET 4.3. We describe how the model was integrated on top of the INET and ported OS$^3$ Framework. We then experiment with the simulation model to demonstrate its viability in simulating LEO satellite constellations. This involved simulating both outdated and more recent satellite constellations, using FCC filing information, to validate latency results.

cs.NI