Performance comparison of static routing and dynamic routing in low-Earth orbit satellite networks

Abstract

We compare the performance of two routing schemes for LEO satellite networks through simulation. The two routing schemes represent static and dynamic routing for the case where the LEO satellite network is modeled as a finite state automaton (FSA). Each state in this FSA modeling corresponds to an equal-length interval within the period of the LEO satellite network. Modeling the LEO satellite network in this way allows us to consider the LEO satellite network as if it is a fixed topology network within each state. The routing table for the static routing is fixed within each state whereas that for the dynamic routing is updated continuously according to the shortest-path algorithm. The simulation results show that the static routing performs better in terms of newly initiated call blocking than the dynamic one. The results also show that the static routing gives lower ongoing call blocking probabilities than the dynamic counterpart since the former's pre-computed routing table is less susceptible to the abrupt topological change during a state transition.