Routing and Spectrum Allocation in Dynamic Optical Satellite Networks

Abstract

Due to the advantages of global coverage and large capacity, satellite optical networks (OSNs) have been widely used in military and commercial applications. However, time-varying topology and coarse-grained resource partitioning pose a challenge on routing and spectrum allocation. This paper proposes a resource space-time evolving graph (RSTEG) to achieve fine-grained resource representation. Based on RSTEG, the problem of routing and spectrum allocation in dynamic OSN can be transformed into the problem of maximizing the amount of transferred data under limited resources, which is an integer programming problem. For reducing complexity, a two-stage path determination and resource allocation (TPDRA) algorithm is proposed to solve the problem. Results demonstrate that TPDRA can significantly improve transferred data compared with other alternative algorithms.