Abstract
The controller provisioning, which adjusts the number, locations, and members of satellite controllers adaptive to the dynamic network load and topology, fundamentally impacts the performance of software-defined satellite networks (SDSNs). An ideal provisioning strategy should achieve a low total control overhead throughout the entire satellite operation period, which is extremely challenging since the network load can only be predicted in a short time scale. Existing methods can hardly achieve this goal for they greedily configure controllers in each time slot, where switches have to frequently migrate from one controller to another. In this paper, we focus on achieving globally optimized strategies with only current network load information. We firstly propose a comprehensive control overhead model and formulate the Controller Provisioning Problem (CPP) in SDSNs as a non-convex integer programming problem. To solve the problem, we propose an approximate algorithm named AROA by introducing a regularization framework and based on randomized rounding. We theoretically derive its competitive ratio. To produce strategies in time for future large satellite constellations, we further propose a more efficient heuristic algorithm HROA. Evaluations on our built simulation system show that our proposed methods significantly outperform related schemes in control overhead, latency, and scalability.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.