English

Capacity Scalability of LEO Constellations With Dynamic Link Failures

Information Theory 2026-05-13 v1 Distributed, Parallel, and Cluster Computing Networking and Internet Architecture math.IT

Abstract

Dynamic link failures disrupt the connectivity and geometric symmetry of the constellation structure, thereby increasing protocol overhead and degrading the effective capacity for traffic transport. The fundamental relationship between constellation size and effective capacity under protocol overhead constraints remains unclear. To this end, we define capacity scalability as the ratio of constellation capacity under non-failure conditions to protocol overhead. Specifically, if ISL states follow a two-state discrete Markov chain and the maintenance period is k1k \geq 1, the upper bound of capacity scalability under the uniform traffic pattern is O(1/n)O(1/n), where nn is the number of satellites. With perfect information about the constellation topology, the upper bound can be achieved via shortest-path routing. For any given protocol, there exists an optimal constellation deployment scale in terms of capacity scalability. When the constellation size is below this optimum scale, capacity scalability increases with constellation size, thereby improving effective capacity. Increasing the maintenance period kk can improve capacity scalability, but it does not change the fact that the capacity scalability converges to zero when the constellation size exceeds the optimal scale.

Keywords

Cite

@article{arxiv.2605.12146,
  title  = {Capacity Scalability of LEO Constellations With Dynamic Link Failures},
  author = {Wei Li and Min Sheng},
  journal= {arXiv preprint arXiv:2605.12146},
  year   = {2026}
}
R2 v1 2026-07-22T07:07:45.376Z