A Distributed Computing Framework for Satellite Swarms

arXiv:2609.18839 · cs.DC, cs.NI · Submitted 2026-09-16 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Computer Science. The day in computer science: software, systems and theory on arXiv.

Tom: We're looking at the paper: "A Distributed Computing Framework for Satellite Swarms".

Paper summary: Tom: So we're looking at "A Distributed Computing Framework for Satellite Swarms" here. Basically these authors are proposing a blueprint for how to make space applications work without relying on one giant control center on Earth.

Jane: Right, so they're building this framework in three layers: the distributed state at the bottom, then command and control on top, and finally the actual science missions you want to run. It’s about making things resilient because you can't just have one central brain for hundreds of satellites out there.

Lu: They used Conflict-free Replicated Data Types, or CRDTs, as the core mechanism for that state service. This lets them achieve strong eventual consistency across all the satellites even when they lose connection with each other for a bit.

Meng: What this means practically is that instead of every satellite constantly talking to a ground station to get an update, they can share information locally and it will eventually sync up correctly later, which cuts down on those expensive ground links.

Tom: Exactly. They validated this by testing it with a catalog dissemination system for sixty-six satellites in simulation. The key result is that this CRDT approach reduces the number of messages sent from the ground station for a single update >

Jane: And they showed that whether they use flooding or tree traversal to spread that data across the network, the CRDT part still handles it well, though different spreading methods change how many satellite-to-satellite messages you need. It’s a trade-off between traffic and consistency >

Lu: For concurrent updates, they found a graph with sublinear growth as the number of updates increases because nodes just drop old messages when they see a newer version already exists. That shows decent scaling under load >

Meng: But I still have to ask what it costs to run all those CRDT states on actual hardware at scale, you know? And how much real-world traffic does this simulation actually capture compared to what breaks in the field >

Tom: That’s the next big hurdle, Meng. The paper lays out a path forward, though. They aren't done yet with this specific model because they need to look at distributed consensus for cases where you need perfect sequential consistency across all nodes simultaneously >

Jane: So, the main thing to get from this paper is that a CRDT-based distributed state is a solid starting block for building autonomous space applications that are fault-tolerant by design. But moving from simulation to real orbital environments and handling those stricter consistency requirements is where the work really needs to go next >

Paper summary: Lu: It lays out a clear path: start with this state service, then build on it with command and control, and finally design the science missions considering all those constraints. It’s a very structured way to approach complex distributed systems in space >

Meng: I still think we need to see some real-world traffic data before we start deploying this kind of thing, especially concerning those concurrent updates where the graph growth is sublinear >

Tom: Well, the paper is laying out the necessary groundwork for that real-world testing with its validation methodology being quite thorough. It gives us a solid starting point for what's possible in distributed space applications >

Jane: So, the main thing to remember from "A Distributed Computing Framework for Satellite Swarms" is that reliable state management using CRDTs can significantly reduce communication overhead and ground station messages in satellite swarms >

Lu: It provides a characterization of the system, which is valuable for anyone trying to understand the requirements for designing these complex systems. It's about understanding what kind of distributed state you need before you start writing the code >

Meng: For me, the implication is that this moves us closer to having swarms that can operate more independently without constant ground intervention for every small update. That autonomy is what we're looking for in production systems >

Tom: So, to summarize the paper, it proposes a framework where the distributed state layer is the key building block that enables fault-tolerant control and planning for satellite swarms >

Jane: And the big picture is that this moves us toward a future where space applications can be designed around distributed computing principles rather than just relying on centralized control. It’s about building systems that are inherently resilient to the unpredictable nature of space communication >

Lu: The authors are essentially saying that distributed computing solves problems where each distributed entity only has a partial knowledge of the many parameters required to solve a problem. This framework is one way to manage that partial knowledge efficiently >

Meng: I think the authors are pushing us toward a future where space operations become less about sending constant commands and more about letting the swarm figure out the best way to accomplish tasks based on its current state. That shift in operational philosophy is significant >

Tom: So, we've seen how they use CRDTs for strong eventual consistency and how that reduces ground contact while allowing for flexible dissemination methods like flooding or tree traversal. It’s a solid piece of engineering applied to a hard problem >

Jane: And the next challenge, as the paper suggests for future work, is moving toward distributed consensus for cases that require linearizable sequential consistency. That’s where things get much harder than just eventual consistency >

Lu: Yes, achieving linearizable sequential consistency is a much

Conclusion: Tom: So we've been looking at "A Distributed Computing Framework for Satellite Swarms," and what this paper really is, it's proposing a blueprint for building space applications that don't rely on one central computer on Earth.

Jane: Right, so they take this big idea and structure it into three layers: the distributed state at the bottom, then command and control above that, and finally the actual science missions you want to run. It’s all about making sure things keep working even when parts of the system get cut off from each other.

Lu: They use something called Conflict-free Replicated Data Types or CRDTs as the engine for that state service, which lets every satellite stay in sync with everything else, even if they lose contact temporarily.

Meng: What this means for us on the ground is that instead of needing constant updates from a central station to know where things are, satellites can share information among themselves locally and it will eventually all line up correctly.

Tom: They proved this works by testing it with a catalog system for sixty-six simulated satellites, and the main win there is that this CRDT method cuts down on how many messages you need from the ground station for each update.

Jane: And they showed that whether they use flooding or tree traversal to spread that information around the network, the CRDT part still keeps things consistent, though different methods change how much traffic you generate between satellites.

Lu: Plus, for when a lot of updates happen at once, the system handles it pretty well because nodes just ignore old messages if they see a newer version already exists.

Meng: But we have to keep thinking about the real world here. The simulation uses GoNetEm to test this, and I'm still asking what it actually costs to run all those CRDT states on actual hardware in space when you're dealing with real traffic instead of simulated data.

Tom: That’s the next big hurdle for this framework, Meng. The paper itself points out that they aren't done yet because they need to look into distributed consensus for cases where you need perfect sequential order across all nodes at the same time.

Jane: So what this paper gives us is a really solid starting point—a foundation—for designing space applications that are inherently fault-tolerant by default. It moves us away from relying on one big control center and toward systems that manage their own state better in the harsh, disconnected environment of space.

CNES Toulouse INP IRIT Toulouse France Fed´ eration ENAC ISAE-SUPAERO ONERA Universit ´ e de Toulouse France

cs.DC, cs.NI

Submitted: 2026-09-16

Updated: 2026-09-16

Journal ref: 2026 22nd International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), Avignon, France, 2026, pp. 98-103

DOI: 10.1109/WiMob70978.2026.11777913

Code: https://github.com/mroy31/gonetem

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 65/100

The gist: The paper introduces a conceptual distributed computing framework for satellite swarms to enable fault-tolerant, autonomous distributed space applications.

Key concepts

Distributed State
This is the foundational layer where all necessary information and data are reliably shared and replicated across multiple satellites. It is crucial for reliable control and planning, ensuring that every part of the swarm has access to the correct, consistent data needed to operate autonomously.
Strong Eventual Consistency (SEC)
This consistency model ensures that although updates might take time to propagate across all nodes, they will eventually reach a consistent state. This is chosen for space applications because satellite networks often experience partitions where communication is intermittent; SEC allows the system to remain resilient during these periods.
Conflict-free Replicated Data Types (CRDT)
CRDTs are special data structures designed specifically for distributed systems to guarantee SEC. They allow different nodes to update data independently without conflicts, using mechanisms like Last-Write-Wins Registers with timestamps to resolve differences automatically and ensure all replicas converge correctly.
Last-Write-Wins Register (LWW-Register)
This is a specific type of CRDT that uses timestamps to manage updates. When multiple nodes receive conflicting updates for the same piece of data, the one with the most recent timestamp is chosen as the authoritative version. This provides a total order for assignments, preventing non-commutative issues in distributed updates.

Terminology

Summary

The paper introduces a conceptual distributed computing framework for satellite swarms to enable fault-tolerant, autonomous distributed space applications. p. 5 A strongly eventually consistent distributed state service based on Conflict-free Replicated Data Types (CRDT) was implemented and validated in the context of Space Situational Awareness catalog dissemination. p. 0

Framework Conceptualization

The conceptual framework for distributed space applications is condensed into three layers built upon a foundation of communication. At the base of this framework lies the distributed state, which is essential for reliable control and planning because information and data must be reliably shared and replicated. p. 2 Building on top of this is command and control, which allows a swarm to be controlled as a single entity by determining the best way to accomplish tasks based on its current state. p. 2 Once these two foundations are in place, missions can be designed and science can be completed while considering the constraints imposed by the DSS itself. p. 2

Distributed State Mechanism

The first step in creating fault-tolerant and scalable distributed applications is the implementation of a reliable distributed state mechanism. The choice of strong eventual consistency (SEC) was made with the constraints of satellite swarms in mind because the space environment requires services resilient to partitions. p. 2 Conflict-free Replicated Data Types (CRDT) is a family of distributed data types that ensures SEC across all nodes in a system. p. 2 Specifically, the Last-Write-Wins Register (LWW-Register) associates timestamps with each update to create a total order of assignments, providing safeguards to non-commutativity. p. 2

Validation Methodology

To validate the use of CRDT to create a reliable distributed state, a LWW-Register-based key-value store was implemented to distribute an SSA catalog across a swarm of satellites. The tests were performed on a simulated 66-satellite constellation emulated with GoNetEm, where inter-satellite links (ISL) were configured with specific latency and jitter parameters. p. 3 Three test scenarios were used to compare performance:

  1. Direct Uplink (No ISL): This case acts as the baseline comparison modeled after the ”bent-pipe” architecture seen in current satellite constellations. p. 3

  2. CRDT + Flooding: An update is first sent from the ground to a single satellite and then disseminated via a flooding mechanism across the ISL network. p. 3

  3. CRDT + Tree Traversal: An update is first sent from the ground to a single satellite and then disseminated via a tree traversal mechanism. p. 4

Performance Results

The results show that a CRDT approach is effective in reducing the number of ground station messages required for a single catalog update. The results demonstrate that the CRDT-based distributed state is effective regardless of the dissemination mechanism used, and this mechanism determines the number of ISL messages needed to complete an update. p. 4 For concurrent updates, a graph exhibits sublinear growth as the number of updates increases because nodes already holding a newer version will drop outdated update messages upon reception. p. 4 The distributed approach completes dissemination significantly faster compared to direct ground uplinks, even accounting for propagation delay within the satellite network. p. 5

Conclusion and Future Work

The paper concludes that a CRDT-based distributed state is a viable approach to mission data dissemination in satellite swarms, offering meaningful reductions in both ground contact requirements and ISL traffic. The framework provides a foundation for building fault-tolerant distributed space applications with the distributed state layer serving as a building block. p. 5 Future work should focus on implementing and testing distributed consensus for cases requiring linearizable sequential consistency. p. 5 An important avenue for validation is testing on real satellite software and eventually hardware in a dynamic orbital environment. p. 5 The comparison to existing swarm approaches, such as those found in NASA’s Starling mission, should be performed to evaluate the full benefit of a distributed computing approach. p. 5

REFERENCES

B 1 Direct Uplink (No ISL) 66 0 66

B 2 CRDT + Flooding 1 177 178

B 3 CRDT + Tree Traversal 1 65 66

B A The conceptual framework for distributed space applications is condensed into three layers built upon a foundation of communication.

B B At the base of this framework lies the distributed state, which is essential for reliable control and planning because information and data must be reliably shared and replicated. p. 2

B C Building on top of this is command and control, which allows a swarm to be controlled as a single entity by determining the best way to accomplish tasks based on its current state. p. 2

B D The choice of strong eventual consistency (SEC) was made with the constraints of satellite swarms in mind because the space environment requires services resilient to partitions. p. 2

B E Conflict-free Replicated Data Types (CRDT) is a family of distributed data types that ensures SEC across all nodes in a system. p. 2

B F Specifically, the Last-Write-Wins Register (LWW-Register) associates timestamps with each update to create a total order of assignments, providing safeguards to non-commutativity. p. 2

B G To validate the use of CRDT to create a reliable distributed state, a LWW-Register-based key-value store was implemented to distribute an SSA catalog across a swarm of satellites. p. 2

B H The tests were performed on a simulated 66-satellite constellation emulated with GoNetEm, where inter-satellite links (ISL) were configured with specific latency and jitter parameters. p. 3

B I Three test scenarios were used to compare performance:

B J Direct Uplink (No ISL): This case acts as the baseline comparison modeled after the ”bent-pipe” architecture seen in current satellite constellations.

B K CRDT + Flooding: An update is first sent from the ground to a single satellite and then disseminated via a flooding mechanism across the ISL network. p. 3

B L CRDT + Tree Traversal: An update is first sent from the ground to a single satellite and then disseminated via a tree traversal mechanism. p. 4

B M The results show that a CRDT approach is effective in reducing the number of ground station messages required for a single catalog update. p. 4

B N The results demonstrate that the CRDT-based distributed state is effective regardless of the dissemination mechanism used, and this mechanism determines the number of ISL messages needed to complete an update. p. 4

B O For concurrent updates, a graph exhibits sublinear growth as the number of updates increases because nodes already holding a newer version will drop outdated update messages upon reception. p. 4

B P The paper concludes that a CRDT-based distributed state is a viable approach to mission data dissemination in satellite swarms, offering meaningful reductions in both ground contact requirements and ISL traffic. p. 5

B Q The framework provides a foundation for building fault-tolerant distributed space applications with the distributed state layer serving as a building block. p. 5

B R Future work should focus on implementing and testing distributed consensus for cases requiring linearizable sequential consistency. p. 5

B S An important avenue for validation is testing on real satellite software and eventually hardware in a dynamic orbital environment. p. 5

B T The comparison to existing swarm approaches, such as those found in NASA’s Starling mission, should be performed to evaluate the full benefit of a distributed computing approach. p. 5

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Strong eventual consistency can be implemented using Conflict-free Replicated Data Types (CRDT) such as a Last-Write-Wins Register-based key-value store to ensure fault tolerance against network partitions.

  2. The improved AI system can manage distributed state in satellite swarms by reducing ground to satellite communication from 66 messages to a single uplink per update, as shown in the validation results.

  3. The system will exhibit sublinear inter-satellite message growth under concurrent updates because nodes discard outdated versions, leading to reduced network overhead when nodes receive older data.

  4. By utilizing CRDTs and a LWW-Register, the distributed state service becomes self-healing and can recover from failures and partitions within the swarm because the latest update overrides any earlier update for the same tracked object.

  5. The AI system can achieve significant real-world time savings by requiring only a single up-link per update instead of direct ground uplinks, completing dissemination in seconds rather than hundreds of seconds.

Related papers