TY - JOUR
T1 - Optimized Controller Provisioning in Software-Defined LEO Satellite Networks
AU - Li, Xu
AU - Tang, Feilong
AU - Fu, Luoyi
AU - Yu, Jiadi
AU - Chen, Long
AU - Liu, Jiacheng
AU - Zhu, Yanmin
AU - Yang, Laurence T.
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2023/8/1
Y1 - 2023/8/1
N2 - 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 first 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.
AB - 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 first 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.
KW - Controller provisioning
KW - LEO satellite network
KW - SDN
UR - https://www.scopus.com/pages/publications/85125753605
U2 - 10.1109/TMC.2022.3155657
DO - 10.1109/TMC.2022.3155657
M3 - 文章
AN - SCOPUS:85125753605
SN - 1536-1233
VL - 22
SP - 4850
EP - 4864
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 8
ER -