FSA-based link assignment and routing in low-earth orbit satellitenetworks

摘要

We propose a new framework for the link assignment (i.e.,ntopological design) problem that arises from the use of intersatellitenlinks (ISL's) in low-earth orbit (LEO) satellite networks. In thenproposed framework, we model an LEO satellite network as a finite statenautomaton (FSA), where each state corresponds to an equal-lengthninterval in the system period of the LEO satellite network. ThisnFSA-based framework allows the link assignment problem in LEO satellitennetworks to be treated as a set of link assignment problems in fixedntopology networks. Within this framework, we study various linknassignment and routing schemes. In particular, both regular linknassignment and link assignment optimized by simulated annealing arenconsidered. For each link assignment, both static and dynamic routingnschemes are considered. Our simulation results show that the optimizednlink assignment combined with static routing achieves the bestnperformance in terms of both newly initiated call blocking probabilitynand ongoing call blocking probability. The results also show that whennthe link assignment is the same, static routing gives better performancenthan dynamic routing since the latter requires a substantial amount ofntime to stabilize its routing table after a state transition