Design of Optimal Topology of Satellite-Based Terrestrial Communication Networks

TL;DR

This paper presents a quantitative model and algorithms for designing the optimal topology of satellite-based terrestrial communication networks, focusing on minimizing total transmission and switching costs.

Contribution

It introduces new algorithms based on binary partitioning, minimax parametric search, and dynamic programming for optimal topology design.

Findings

Algorithms effectively solve the combinatorial topology problem.

The minimax parametric search algorithm's complexity is analyzed.

Numerical example demonstrates the algorithms' applicability.

Abstract

Topological design of terrestrial networks for communication via satellites is studied in the paper. Quantitative model of the network cost-analysis minimizing the total transmission and switching cost is described. Several algorithms solving combinatorial problem of the optimal topology design based on binary partitioning, a minimax parametric search and dynamic programming are developed by the author and demonstrated with a numeric example. Analysis of average complexity of the minimax parametric search algorithm is also provided.