Resource-constrained maximum network throughput on space networks

This paper investigates the maximum network throughput for resource-constrained space networks based on the delay and disruption-tolerant networking (DTN) architecture. Specifically, this paper proposes a methodology for calculating the maximum network throughput of multiple transmission tasks under storage and delay constraints over a space network. A mixed-integer linear programming (MILP) is formulated to solve this problem.

Simulations results show that the proposed methodology can successfully calculate the optimal throughput of a space network under storage and delay constraints, as well as a clear, monotonic relationship between end-to-end delay and the maximum network throughput under storage constraints. At the same time, the optimization results shine light on the routing and transport protocol design in space communication, which can be used to obtain the optimal network throughput.