Capacity bound analysis of networked TT&C architecture based on stochastic geometry and queuing theory✩
Xiaoran Jiang , Yafeng Zhan , Jianhua Lu
›› 2026, Vol. 12 ›› Issue (5) : 855 -868.
As commercial mega-constellations such as SpaceX’s Starlink and Amazon’s Kuiper system rapidly expand, traditional Tracking, Telemetry, and Command (TT&C) architectures encounter unprecedented scalability challenges. Thus, a novel scheme design and capacity analysis framework is proposed for networked TT&C system serving large-scale Low Earth Orbit (LEO) satellite constellations. The networked TT&C architecture is designed to leverage Medium Earth Orbit (MEO) satellites to monitor LEO constellations, providing TT&C service for both normal and anomalous LEO satellites through inter-satellite links. A capacity decomposition framework is introduced, dividing system capacity into access capacity and anomaly-handling capacity. Through stochastic geometry and queuing theory models, the maximum number of LEO satellites that can be supported under various operational constraints is quantified. It is demonstrated by simulation results that for Starlink Phase 1, if the second-generation O3b mPower system is utilized for TT&C, the system can support up to 59,497 LEO satellites under a 30-second threshold of polling waiting time, and up to 50,761 satellites under a 10-minute threshold of anomaly-handling time in the steady state. The analysis provides critical design guidelines for the deployment and management of large-scale LEO constellations, highlighting the trade-offs between system capacity and operational constraints such as polling waiting time and anomaly-handling waiting time.
Networked TT&C systems / Capacity analysis / Queuing theory / Satellite communications / Constellation design / Anomaly handling / Space networking / Mega-constellations
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
/
| 〈 |
|
〉 |