pith. sign in

arxiv: 2509.09957 · v3 · pith:EU7FG3MXnew · submitted 2025-09-12 · 🧮 math.OC

Spare Strategy Analysis and Design for Mega Satellite Constellations Using Markov Chain

Seungyeop Han , Zachary Grieser , Shoji Yoshikawa , Takumi Noro , Takumi Suda , Koki Ho This is my paper

Pith reviewed 2026-05-21 21:59 UTC · model grok-4.3

classification 🧮 math.OC
keywords Markov chainsatellite constellationspare strategymulti-echelon inventoryreorder policygenetic algorithmorbital mechanicsstationary distribution
0
0 comments X

The pith

Markov chain models with fixed-point iteration accurately analyze spare strategies for mega satellite constellations

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a Markov-chain-based method for analyzing spare-management strategies in large satellite constellations. Satellite failure and replenishment are modeled as Markov chains for both constellation and parking orbits, with a fixed-point iteration finding a consistent joint stationary solution. This captures the stochastic interplay in a multi-echelon system driven by orbital mechanics more precisely than prior aggregation-based approaches. The method is then used to optimize policies via a genetic algorithm and demonstrated on a real mega-constellation. A sympathetic reader would care because it provides a fast way to assess long-run viability of spare concepts of operations in early design stages for maintaining constellation performance.

Core claim

This paper presents a Markov-chain-based method for the early-phase analysis and design of spare-management architectures for large-scale satellite constellations. Satellite failure and replenishment processes are modeled as Markov chains and analyzed through their stationary solution. An indirect spare strategy is reinvestigated, modeled as a multi-echelon periodic-review reorder-point/order-quantity policy, in which spares are first delivered to parking orbits and then transferred to constellation planes. The stock levels in constellation and parking orbits are each modeled as independent Markov chains, and a fixed-point iteration yields a consistent joint stationary solution that describe

What carries the argument

Independent Markov chains for stock levels in constellation and parking orbits combined by fixed-point iteration to obtain a joint stationary solution for the multi-echelon spare policy

Load-bearing premise

The stock levels in the constellation orbits and the parking orbits behave as independent Markov chains that can be reconciled into a joint stationary solution through fixed-point iteration

What would settle it

Perform a Monte Carlo simulation of the complete multi-echelon spare system for a small number of satellites and compare the long-run average stock levels and replenishment frequencies against the predictions from the independent-chain fixed-point method

read the original abstract

This paper presents a Markov-chain-based method for the early-phase analysis and design of spare-management architectures for large-scale satellite constellations. To assess the long-run viability of such concepts of operations, satellite failure and replenishment processes are modeled as Markov chains and analyzed through their stationary solution. We reinvestigate an indirect spare strategy, modeled as a multi-echelon periodic-review reorder-point/order-quantity policy, in which spares are first delivered to parking orbits and then transferred to constellation planes. The stock levels in constellation and parking orbits are each modeled as independent Markov chains, and a fixed-point iteration yields a consistent joint stationary solution that describes the strategy's average behavior. This approach accurately captures the stochastic interplay within a multi-echelon model driven by orbital mechanics, avoiding the aggregation assumptions of prior works and remaining valid across a wider operating domain. Building on this fast, accurate analysis, we formulate an optimization problem and solve it via a genetic algorithm. Finally, we demonstrate the practical value of both the analysis method and the optimization framework in a real-world mega-constellation case study.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper develops a Markov-chain method for analyzing spare-management strategies in mega satellite constellations. Constellation and parking-orbit stock levels are modeled as independent Markov chains whose transition matrices depend on each other's stationary distributions; a fixed-point iteration is used to obtain a consistent joint stationary solution. This analysis underpins an optimization problem solved by genetic algorithm and is demonstrated on a real-world mega-constellation case study. The central claim is that the approach accurately captures multi-echelon stochastic dynamics driven by orbital mechanics without aggregation assumptions and remains valid over a wider domain.

Significance. If the fixed-point construction recovers the correct joint stationary behavior, the method would offer a computationally efficient tool for early-phase spare-strategy design that avoids the aggregation simplifications of earlier work and supports optimization across broader operating regimes. The combination of stationary analysis with genetic-algorithm optimization is a practical strength for constellation operators.

major comments (2)
  1. [Modeling of the multi-echelon policy and fixed-point iteration] The modeling section (description of the multi-echelon periodic-review reorder-point policy): the claim that independent Markov chains plus fixed-point iteration yield the true joint stationary distribution is load-bearing for the central assertion of accurate capture without aggregation. The reorder policy triggers transfers only when both states simultaneously satisfy the reorder condition, inducing policy-driven coupling between the chains. No argument is supplied showing that the fixed-point marginals coincide with the marginals of the joint process, nor is convergence or uniqueness of the iteration established. This gap is most relevant precisely in the high-failure or low-stock regimes where the paper claims wider validity.
  2. [Numerical results and case study] Results and validation sections: the abstract asserts accuracy and wider validity, yet the manuscript supplies no numerical error metrics, convergence diagnostics for the fixed-point iteration, or direct comparisons against the stationary distribution of the fully coupled joint chain. Without such checks, it is impossible to assess whether the approximation supports the stated claims.
minor comments (2)
  1. [Notation and definitions] Notation for the transition probabilities and stationary vectors should be introduced with explicit dependence on the policy parameters (reorder point, order quantity) to improve readability.
  2. [Optimization framework] The genetic-algorithm implementation details (population size, crossover/mutation rates, termination criteria) are only sketched; a short table or pseudocode would clarify reproducibility.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for the careful reading and valuable comments on our manuscript. We address each of the major comments below and indicate the revisions we plan to make.

read point-by-point responses

  1. Referee: [Modeling of the multi-echelon policy and fixed-point iteration] The modeling section (description of the multi-echelon periodic-review reorder-point policy): the claim that independent Markov chains plus fixed-point iteration yield the true joint stationary distribution is load-bearing for the central assertion of accurate capture without aggregation. The reorder policy triggers transfers only when both states simultaneously satisfy the reorder condition, inducing policy-driven coupling between the chains. No argument is supplied showing that the fixed-point marginals coincide with the marginals of the joint process, nor is convergence or uniqueness of the iteration established. This gap is most relevant precisely in the high-failure or low-stock regimes where the paper claims wider validity.

    Authors: The fixed-point iteration is constructed so that each chain's transition matrix is parameterized by the stationary distribution of the other, ensuring consistency in the long-run average behavior. While we do not claim that this exactly reproduces the marginals of the joint process under all conditions, it provides a tractable way to capture the policy-induced coupling without full state aggregation. We recognize that a formal proof of equivalence to the joint stationary distribution and analysis of convergence/uniqueness are not included in the current manuscript. We will add a subsection discussing the theoretical basis for the iteration, including empirical evidence of convergence from multiple starting points, and note the regimes where the approximation is expected to be accurate. This addresses the concern for high-failure and low-stock cases by including sensitivity analysis in the revised version. revision: partial

  2. Referee: [Numerical results and case study] Results and validation sections: the abstract asserts accuracy and wider validity, yet the manuscript supplies no numerical error metrics, convergence diagnostics for the fixed-point iteration, or direct comparisons against the stationary distribution of the fully coupled joint chain. Without such checks, it is impossible to assess whether the approximation supports the stated claims.

    Authors: We agree that additional validation metrics are necessary to support the claims of accuracy. In the revised manuscript, we will include convergence diagnostics such as the L2 norm of the difference between successive stationary distributions in the fixed-point iteration, as well as the number of iterations required for convergence across different parameter settings. For error metrics, we will report the maximum deviation in key performance indicators (e.g., stockout probability) when compared to Monte Carlo simulations of the system. Direct comparison to the fully coupled chain is challenging for large state spaces, but we will provide such comparisons for smaller instances to illustrate the approximation quality. revision: yes

standing simulated objections not resolved
  • Direct computation or comparison against the exact stationary distribution of the fully coupled joint Markov chain for the full-scale mega-constellation case study is computationally prohibitive due to the very large state space.

Circularity Check

0 steps flagged

Markov chain stationary analysis is self-contained without circular reduction

full rationale

The paper defines Markov chains for stock levels in constellation and parking orbits, models transitions based on failure, replenishment, and transfer policies, and uses fixed-point iteration to achieve consistency in the joint stationary solution. This process derives the average behavior from the defined transition probabilities rather than presupposing the result. No step reduces a prediction to a fitted input or self-citation by construction. The approach is an approximation method whose validity can be checked against simulations or exact joint chain analysis, making it non-circular.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard Markov chain theory plus the modeling choice that separate chains for parking and constellation orbits can be coupled through fixed-point iteration without explicit orbital-mechanics dynamics inside the chains.

axioms (2)
  • domain assumption Satellite failure and replenishment processes can be represented as discrete-time Markov chains possessing unique stationary distributions.
    Invoked when stock levels are modeled as independent Markov chains whose stationary solutions are computed.
  • ad hoc to paper A fixed-point iteration on the two independent stationary distributions produces a consistent joint description of the multi-echelon system.
    Central to obtaining the average behavior of the indirect spare strategy.

pith-pipeline@v0.9.0 · 5734 in / 1407 out tokens · 31737 ms · 2026-05-21T21:59:20.303813+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Spare Strategy for Large-Scale Satellite Constellations Under Dual Resupply Channels Using Markov Chain

    math.OC 2026-05 unverdicted novelty 5.0

    A Markov-chain framework with periodic-review and standard (s,Q) policies models coupled indirect and direct resupply channels for satellite constellations, yielding stationary cost and resilience metrics via fixed-po...

  2. Analysis and Design of Spare Strategy for Large-Scale Satellite Constellation Using Direct Insertion under (r,q) Policy

    eess.SY 2025-09 unverdicted novelty 4.0

    A Markov chain framework models satellite failures and launch delays to optimize the (r,q) spare policy and minimize costs, shown on a real mega-constellation case study.

Reference graph

Works this paper leans on

32 extracted references · 32 canonical work pages · cited by 2 Pith papers · 1 internal anchor

  1. [1]

    Starlink Statistics,

    McDowell, J., “Starlink Statistics,”https://planet4589.org/space/con/star/stats.html, 2025. Accessed: 2025-07- 14

    work page 2025

  2. [2]

    Starlink satellites: Facts, tracking and impact on astronomy,

    Space.com, “Starlink satellites: Facts, tracking and impact on astronomy,”https://www.space.com/spacex-starlink- satellites.html, 2025. Accessed: 2025-08-07

    work page 2025

  3. [3]

    Amazon launches second batch of Kuiper internet satellites, taking on Elon Musk’s Starlink,

    CNBC, “Amazon launches second batch of Kuiper internet satellites, taking on Elon Musk’s Starlink,”https://www.cnbc. com/2025/06/23/amazon-kuiper-satellites-musk-starlink.html, 2025. Accessed: 2025-07-14

    work page 2025

  4. [4]

    Arianespace to launch new fleet of OneWeb internet satellites tonight. Here’s how to watch

    Space.com, “Arianespace to launch new fleet of OneWeb internet satellites tonight. Here’s how to watch.”https://www. space.com/arianespace-oneweb-5-satellites-launch-webcast, 2021. Accessed: 2025-07-14

    work page 2021

  5. [5]

    China launches first satellites for GuoWang constellation,

    Telecoms Tech News, “China launches first satellites for GuoWang constellation,”https://www.telecomstechnews.com/ news/china-launches-first-satellites-guowang-constellation/, 2024. Accessed: 2025-07-14

    work page 2024

  6. [6]

    An Updated Comparison of Four Low Earth Orbit Satellite Constellation Systems to Provide Global Broadband,

    Pachler, N., del Portillo, I., Crawley, E. F., and Cameron, B. G., “An Updated Comparison of Four Low Earth Orbit Satellite Constellation Systems to Provide Global Broadband,”2021 IEEE International Conference on Communications Workshops (ICC Workshops), 2021, pp. 1–7. https://doi.org/10.1109/ICCWorkshops50388.2021.9473799. 27

    work page doi:10.1109/iccworkshops50388.2021.9473799 2021

  7. [7]

    Satellite constellation launch, deployment, replacement and end-of-life strategies,

    Cornara, S., Beech, T., Belló-Mora, M., and Martinez de Aragon, A., “Satellite constellation launch, deployment, replacement and end-of-life strategies,”13th Annual AIAA/USU Conference on Small Satellites, 1999

    work page 1999

  8. [8]

    On-orbit servicing system architectures for proliferated low-earth-orbit constellations,

    Luu, M. A., and Hastings, D. E., “On-orbit servicing system architectures for proliferated low-earth-orbit constellations,” Journal of Spacecraft and Rockets, Vol. 59, No. 6, 2022, pp. 1946–1965

    work page 2022

  9. [9]

    Moore’slawmeetsMusk’slaw: TheunderappreciatedstoryofSpaceXandthestunningdecline in launch costs,

    AmericanEnterpriseInstitute, “Moore’slawmeetsMusk’slaw: TheunderappreciatedstoryofSpaceXandthestunningdecline in launch costs,” https://www.aei.org/articles/moores-law-meet-musks-law-the-underappreciated-story-of-spacex-and-the- stunning-decline-in-launch-costs/, Accessed: 2025-07-14

    work page 2025

  10. [10]

    Reliability of Small Satellites: A Review Focused on the Brazilian Context,

    Cruz, L. A., Porto, V. F., and Nascimento, A. R., “Reliability of Small Satellites: A Review Focused on the Brazilian Context,”Journal of Aerospace Technology and Management, Vol. 13, No. Spec. Issue 1, 2021, p. e20210008. https: //doi.org/10.5028/jatm.v13.1322

    work page doi:10.5028/jatm.v13.1322 2021

  11. [11]

    A Communications Satellite Replenishment Policy,

    Dishon, M., and Weiss, G. H., “A Communications Satellite Replenishment Policy,”Technometrics, Vol. 8, No. 3, 1966, pp. 399–409

    work page 1966

  12. [12]

    Optimal Replacement Policies for Satellite Constellations,

    Sumter, B. R., “Optimal Replacement Policies for Satellite Constellations,” Master’s thesis, Air Force Institute of Technology, 2003

    work page 2003

  13. [13]

    Optimal satellite constellation spare strategy using multi-echelon inventory control,

    Jakob, P., Shimizu, S., Yoshikawa, S., and Ho, K., “Optimal satellite constellation spare strategy using multi-echelon inventory control,”Journal of Spacecraft and Rockets, Vol. 56, No. 5, 2019, pp. 1449–1461

    work page 2019

  14. [14]

    Assigning value to reliability in satellite constellations,

    Collopy, P., “Assigning value to reliability in satellite constellations,”AIAA Space 2003 Conference & Exposition, 2003, p

    work page 2003

  15. [15]

    https://doi.org/10.2514/6.2003-6214

    work page doi:10.2514/6.2003-6214 2003

  16. [16]

    Quantifying and Evaluating the Resilience of Optimized Space Constellations for Fire Detection,

    Cuhran, J. J., Jenkins, M. K., and Walters, M. J., “Quantifying and Evaluating the Resilience of Optimized Space Constellations for Fire Detection,” Tech. Rep. AD1055406, Air Force Institute of Technology, 2017

    work page 2017

  17. [17]

    Analysis of proliferated low Earth orbit constellation resilience against solar weather radiation effects,

    Novak, J., and Hastings, D., “Analysis of proliferated low Earth orbit constellation resilience against solar weather radiation effects,”Acta Astronautica, Vol. 202, 2023, pp. 292–302

    work page 2023

  18. [18]

    Analysis and Design of Satellite Constellation Spare Strategy Using Markov Chain,

    Han, S., Noro, T., and Ho, K., “Analysis and Design of Satellite Constellation Spare Strategy Using Markov Chain,”arXiv preprint arXiv:2408.09250, 2024

    work page arXiv 2024

  19. [19]

    Satellite constellations,

    Walker, J. G., “Satellite constellations,”Journal of the British Interplanetary Society, Vol. 37, 1984, p. 559

    work page 1984

  20. [20]

    E., and Conway, B

    Prussing, J. E., and Conway, B. A.,Orbital mechanics, Oxford University Press, USA, 1993

    work page 1993

  21. [21]

    S., and Lieberman, G

    Hillier, F. S., and Lieberman, G. J.,Introduction to operations research, McGraw-Hill, 2015

    work page 2015

  22. [22]

    Satellite and satellite subsystems reliability: Statistical data analysis and modeling,

    Castet, J.-F., and Saleh, J. H., “Satellite and satellite subsystems reliability: Statistical data analysis and modeling,”Reliability Engineering & System Safety, Vol. 94, No. 11, 2009, pp. 1718–1728. 28

    work page 2009

  23. [23]

    Fact Sheet: Resilience of Space Capabilities,

    U.S. Department of Defense, “Fact Sheet: Resilience of Space Capabilities,” , 2011

    work page 2011

  24. [24]

    1002--1007

    Burch,R.,“AMethodforCalculationoftheResilienceofaSpaceSystem,”MILCOM 2013 - 2013 IEEE Military Communications Conference, 2013, pp. 1002–1007. https://doi.org/10.1109/MILCOM.2013.174

    work page doi:10.1109/milcom.2013.174 2013

  25. [25]

    Analysis and Design of Spare Strategy for Large-Scale Satellite Constellation Using Direct Insertion under (r,q) Policy

    Han, S., Grieser, Z., Yoshikawa, S., Noro, T., Suda, T., and Ho, K., “Analysis and Design of Spare Strategy for Large-Scale Satellite Constellation Using Direct Insertion under(𝑟, 𝑞)policy,”arXiv preprint arXiv:2509.10585, 2025

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  26. [26]

    How Much Does It Cost to Launch a Rocket? [By Type & Size],

    SpaceInsider, “How Much Does It Cost to Launch a Rocket? [By Type & Size],” , 2025. URL https://spaceinsider.tech/2023/ 08/16/how-much-does-it-cost-to-launch-a-rocket/, accessed: 2025-07-11

    work page 2025

  27. [27]

    Smallsat Rideshare Program,

    SpaceX, “Smallsat Rideshare Program,” , 2025. URL https://www.spacex.com/rideshare, accessed: 2025-07-11

    work page 2025

  28. [28]

    Rocket Lab’s 48-Hour Launch Turnaround: A Strategic Play for Dominance in the SmallSat Launch Market,

    Ainvest, “Rocket Lab’s 48-Hour Launch Turnaround: A Strategic Play for Dominance in the SmallSat Launch Market,” , 2025. URL https://www.ainvest.com/news/rocket-lab-48-hour-launch-turnaround-strategic-play-dominance-smallsat-launch-market- 2506/, accessed: 2025-07-11

    work page 2025

  29. [29]

    Live Coverage: SpaceX to Launch 27 Starlink Satellites on Falcon 9 Rocket from Cape Canaveral,

    Spaceflight Now, “Live Coverage: SpaceX to Launch 27 Starlink Satellites on Falcon 9 Rocket from Cape Canaveral,” , 2025. URL https://spaceflightnow.com/2025/06/27/live-coverage-spacex-to-launch-27-starlink-satellites-on-falcon-9-rocket-from- cape-canaveral-4/, accessed: 2025-07-11

    work page 2025

  30. [30]

    Statistical reliability analysis of satellites by mass category: Does spacecraft size matter?

    Dubos, G. F., Castet, J.-F., and Saleh, J. H., “Statistical reliability analysis of satellites by mass category: Does spacecraft size matter?”Acta Astronautica, Vol. 67, No. 5, 2010, pp. 584–595. https://doi.org/https://doi.org/10.1016/j.actaastro.2010.04.017

    work page doi:10.1016/j.actaastro.2010.04.017 2010

  31. [31]

    Reliability assessment and reliability prediction of CubeSats through system level testing and reliability growth modelling,

    Langer, M., “Reliability assessment and reliability prediction of CubeSats through system level testing and reliability growth modelling,” Ph.D. thesis, Technische Universität München, 2018

    work page 2018

  32. [32]

    Small-Satellite Mission Failure Rates,

    Jacklin, S. A., “Small-Satellite Mission Failure Rates,” NASA Technical Memorandum NASA/TM-2018-220034, NASA Ames Research Center, Moffett Field, CA, March 2019. 29

    work page 2018