2024

Guo, Binquan; Chang, Zheng; Han, Zhu; Yang, Wanting; Xiong, Zehui

In this letter, we investigate network slicing strategy for real-time applications over large-scale satellite networks (SNs) with heterogeneous transceivers. We identify that the slicing problem over the time-varying SNs with heterogeneous transceivers can be formulated as an integer linear programming problem. A branch and bound method for solving it incurs O(|L-tau| . (2| V-tau| + |L-tau|)(|L tau|)) time complexity, where| V-tau| is the number of nodes, and |L-tau| is the number of links in the snapshot graph within the time interval (tau) . To solve the problem in an efficient manner, we propose a graph-based scheme by converting node attributes into link attributes, such that the original problem can be equivalently reduced and solved optimally by the shortest path algorithm with overall time complexity of O(2|L-tau|+| V-tau| log | V-tau| . Simulations conducted on the Starlink constellation with thousands of satellites demonstrate the effectiveness of the proposed scheme.