SearcharxivSearch

arXiv subjects

Ian Wakeman

Publications and source records attributed to Ian Wakeman.

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

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

Constraints and Entropy in a Model of Network Evolution

Barabási-Albert's `Scale Free' model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however, indicates that the model is in some cases, only a rough approximation to the dynamical evolution of real networks. In particular, the exponent $γ$ of the power law distribution of degree is predicted by the model to be exactly 3, whereas in a number of real world networks it has values between 1.2 and 2.9. In addition, the degree distributions of real networks exhibit cut offs at high node degree, which indicates the existence of maximal node degrees for these networks. In this paper we propose a simple extension to the `Scale Free' model, which offers better agreement with the experimental data. This improvement is satisfying, but the model still does not explain \emph{why} the attachment probabilities should favor high degree nodes, or indeed how constraints arrive in non-physical networks. Using recent advances in the analysis of the entropy of graphs at the node level we propose a first principles derivation for the `Scale Free' and `constraints' model from thermodynamic principles, and demonstrate that both preferential attachment and constraints could arise as a natural consequence of the second law of thermodynamics.

physics.soc-ph

Multipath-TCP in ns-3

In this paper we present our work on designing and implementing an ns-3 model for MultiPath TCP (MPTCP). Our MPTCP model closely follows MPTCP specifications, as described in RFC 6824, and supports TCP NewReno loss recovery on a per subflow basis. Subflow management is based on MPTCP's kernel implementation. We briefly describe how we integrate our MPTCP model with ns-3 and present example simulation results to showcase its working state.

cs.NI